Erdős Problem #1153
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
Erdős Problem #1153. How large must interpolation amplification become on an arbitrary fixed subinterval, even if its interpolation nodes are chosen adversarially?
For n distinct nodes x_i∈[-1,1], let l_i(x) be Lagrange basis and L(x)=sum|l_i(x)|. For any FIXED nondegenerate interval [a,b]⊆[-1,1], does max_{x∈[a,b]} L(x) ≥ (2/pi)log n - O_{a,b}(1) uniformly over node choices? A fixed interval is distinct from a single fixed evaluation point as in open #1132.
A small example
Nodes -1,0,1 have L(1/2)=1/8+3/4+3/8=5/4 and max_{x∈[0,1]}L(x)=5/4. Bounded n=3 gives no sharp asymptotic theorem.
What is known
https://www.erdosproblems.com/1153 PROVED, originally Erdős–Turán [ErTu61], Bernstein 1931 global, Erdős [Er61c] global sharpened, Erdős–Szabados [ErSz78] weaker local ≫log n; Tao [Ta26b] 2026 sharp fixed-interval lower bound (2/pi)log n-O(1). Review exact dependence of the constant on fixed a,b before certifying source fidelity; original proof not independently reconstructed.
GCL's current state
Authenticated original-issue source return establishes the bounded question, relevant external results, and independently tested finite fixture. The reproducible checks are in ci/erdos_compendium_007_phase18_checks.py.
The source return disposition is PARTIAL. Neither an original-paper proof review nor any Lean kernel replay or protected editorial acceptance has been completed.
What remains
ERDOS-1153-TAO-INTERVAL-001: pin Tao 2026 original theorem, reconstruct local sharp 2/pi mechanism, check quantifiers and additive error constants, and distinguish #1132 pointwise limsup OPEN from #1153 interval result PROVED.
External 2026 theorem source proof pending independent review; no Lean kernel claim.
Sources and claim boundaries
https://www.erdosproblems.com/1153 ; [ErTu61],[ErSz78],[Ta26b]; exact finite Lagrange basis calculation.
This is a locally validated, UNACCEPTED editorial draft. Assertions beyond the exact finite checks are attributed to original external sources and remain subject to source-fidelity review.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2424 — 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.