Erdős Problem #1130
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: proved (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
Problem #1129 minimizes the largest value of an interpolation amplification function. Erdős Problem #1130 considers a different, somewhat reversed quantity: the smallest of its local peaks.
Let \(x_1<\cdots<x_n\) be distinct interpolation nodes in \([-1,1]\), and write \(x_0=-1\), \(x_{n+1}=1\). Let \(L(x)\) be the Lagrange Lebesgue function. Define
How large can this minimum local maximum become as we vary the nodes? In particular, is \(\Upsilon=O(\log n)\) uniformly?
A small example
For two interior nodes \(x_1=-1/2\), \(x_2=1/2\), the basis polynomials give the exact identity
The peak values in the three intervals are \(2,1,2\), so
This illustrates that the minimum of the interval maxima is not the same quantity as the global maximum.
What is known
Erdős earlier proved a uniform upper bound of order \(\sqrt n\) and predicted a sharper logarithmic result.
The maintained catalogue credits de Boor and Pinkus (1978) with the extremal characterization and, through the #1129 results, the estimate
A structural maximizer has a form of equioscillation: the local peaks are equal.
There is a source-definition subtlety. If endpoint nodes are permitted, then an outer interval can collapse to a point. Its peak is then exactly one, and the minimum is forced down. A primary source check must determine how the 1978 theorem handles endpoint or degenerate intervals before claiming an unconditional equivalence of minimizers and maximizers.
GCL's current state
Authenticated source return #2401 verifies the exact two-node function and preserves the distinction between \(\Lambda\) and \(\Upsilon\).
The primary equioscillation theorem and endpoint conventions remain to be independently reviewed.
What remains
Read de Boor–Pinkus and the Erdős 1947/1967 sources, check interval indexing and boundary degeneracy rigorously, and compute several higher-degree exact examples.
Sources and claim boundaries
Erdős #1130; catalogue history; Erdős (1947, 1967), de Boor–Pinkus (1978); GCL return. General externally proved; exact two-node example independently established. Unaccepted draft.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2401 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- 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.