Skip to content

Erdős Problem #1132

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

Erdős Problem #1132 asks whether polynomial interpolation must become unstable at a fixed point as more nodes are added. For an infinite sequence of distinct nodes \(x_1,x_2,\ldots\in[-1,1]\), let \(\ell_{k,n}\) be the Lagrange basis for its first \(n\) nodes and set

\[ L_n(x)=\sum_{k=1}^n|\ell_{k,n}(x)|. \]

Must some fixed \(x\in(-1,1)\) satisfy \(L_n(x)>(2/\pi)\log n-O(1)\) infinitely often? Does \(\limsup_n L_n(x)/\log n\ge2/\pi\) hold for almost every \(x\)? The order of quantifiers matters.

A small example

For nodes \(-1,0,1\), exact rational computation gives \(L_3(0)=1\) and \(L_3(1/2)=5/4\). These finite values do not establish growth for a fixed point along a nested sequence.

What is known

Erdős established a universal bound on \(\max_x L_n(x)\) for each finite \(n\), but those maximizing points may vary with \(n\). Bernstein's work gives an everywhere-dense set of points attaining the limiting logarithmic coefficient. The maintained catalogue reports that Tao (2026) obtained a dense set of points with

\[ L_n(x)\ge(2/\pi)\log n-\omega(n) \]

infinitely often for every prescribed divergent \(\omega(n)\). This weaker error does not imply bounded \(O(1)\) error, and density is not the same as full Lebesgue measure. The source also questions whether the \(O(1)\) constant may depend on \(x\). The full problem remains open.

GCL's current state

Authenticated source audit #2403 records these quantifiers and the exact finite arithmetic. No modern theorem proof has been independently replayed.

What remains

Inspect Bernstein, Erdős and Tao primary arguments, check the point-dependent constant and dense-set quantifier, and investigate actually nested interpolation nodes. A sequence of separately optimized node configurations is not interchangeable with one infinite sequence.

Sources and claim boundaries

Erdős #1132; Erdős (1967); Bernstein (1931); Tao (2026) as cited in the maintained catalogue; GCL source return. Finite example independently verified; general question open. Unaccepted draft.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2403 — 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