Skip to content

Erdős Problem #1131

Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: open (not automatically the live result).
Subject areas: analysis, polynomials.

Read this status correctly

The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.

UNACCEPTED DRAFT — mathematical editorial review pending

This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.

Review the underlying draft on GitHub.

The question in plain language

Instead of measuring the largest polynomial interpolation amplification, measure the total squared amplification across the whole interval.

Erdős Problem #1131 asks which nodes \(x_1,\ldots,x_n\) minimize

\[ I(x_1,\ldots,x_n)= \int_{-1}^{1}\sum_{k=1}^{n}|\ell_k(x)|^2\,dx, \]

with the usual Lagrange basis polynomials. The specific asymptotic conjecture asks whether

\[ \min I=2-\frac{1+o(1)}n. \]

The integrand is \(\sum|\ell_k|^2\), not \((\sum|\ell_k|)^2\). Squaring the sum would introduce cross terms and change the problem.

A small example

For nodes \(-1,1\), the basis functions are \((1-x)/2\) and \((1+x)/2\), giving

\[ \sum_{k=1}^2|\ell_k(x)|^2=\frac{x^2+1}{2}. \]

Thus

\[ I(-1,1)=\int_{-1}^1\frac{x^2+1}{2}\,dx =\frac43. \]

This exact value is for one selected node pair; the finite calculation does not independently certify global minimality over all pairs or the conjectured first-order constant.

What is known

Erdős initially proposed certain nodes associated with the integrated Legendre polynomial as exact minimizers, inspired by Fejér's work on a maximal squared norm. Szabados (1966) disproved that exact minimizer proposal for every \(n>3\).

Erdős, Szabados, Varma and Vértesi (1994) established bounds of the form

\[ 2-O\!\left(\frac{(\log n)^2}{n}\right) \le\min I\le 2-\frac{2}{2n-1}. \]

As of the maintained catalogue's formal classification, the sharp first-order asymptotic remains open.

Comments posted in April 2026 contain competing claims of a disproof, a revised preprint with conditional endpoint-universality arguments, and numerical evidence. These are not independently adjudicated published theorem proofs. They must not be used to overwrite the catalogue's OPEN classification without mathematical review.

GCL's current state

Authenticated source audit #2402 reproduces the exact \(n=2\) integral and records the original bound and the unverified newer claims.

What remains

Read the 1994 source and the related Brutman–Toledano numerical work, investigate exact low-degree minimizers with certified polynomial algebra, and review the 2026 manuscripts and their hypotheses independently before changing the status.

Sources and claim boundaries

Erdős #1131; discussion of competing claims; Erdős–Szabados–Varma–Vértesi (1994), Szabados (1966); GCL source audit. Exact finite integral independently checked; open first-order problem. Unaccepted draft.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2402 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: STATEMENT_CAPTURE_REQUIRED.
  • Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
  • External mathematical status: consult current problem page and its dated bibliography.

Back to catalogue · Compendium introduction