Erdős Problem #1151
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 #1151 concerns the following mathematical question and its exact quantifiers:
Chebyshev-node Lagrange interpolation L_n f(x0) of continuous f on [-1,1], evaluated at a FIXED point x0, produces a real sequence; is every closed A⊆[-1,1] realizable as the set of FINITE cluster values of that sequence? Website formulation omits or ambiguously scopes x0 ('arbitrary fixed' versus specific cos(pπ/q) for odd p,q). Empty A requires divergent interpolation values, whereas nonempty A asks prescribed finite cluster set. Do not conflate cluster SET OF POLYNOMIAL FUNCTIONS with scalar values at x0.
A small example
For f(x)=1/2 constant and ANY choice of distinct Chebyshev nodes, the unique interpolation polynomial equals 1/2 for every n. Hence scalar interpolation at any fixed x0 has exact cluster set {1/2}. This finite/elementary example does NOT establish arbitrary closed sets nor the empty-set case or quantifier over x0.
What is known
https://www.erdosproblems.com/1151 top-level still OPEN [Va99,2.41],[Er41],[Er43], but April 2026 comment thread reports Przemysław Chojecki's primitive-row construction (Ulam.ai April 29), Nat Sothanaphan's review Apr30 and Allen Hart's May6 Lean formalization of NONEMPTY fixed-point Theorem1.1(a). Separate July 25 independent rebuild report https://erdosproblemaday.com/day/1151-chebyshev-lagrange-limit-sets says 7997 Lean jobs passed with axioms only propext,Classical.choice,Quot.sound, plus numerically reconstructed spike and source-read Erdos 1943 correction proving EMPTY case for odd p,q. This is third-party verified evidence but NOT GCL's own Lean/kernel or theorem-semantic replay. Current catalogue status likely stale; final x0 quantifier remains ambiguous. An August 2026 ProbXiv page also records pinned Lean proof and warns formal theorem equivalence to source must be checked.
GCL's current state
Authenticated original-issue source return established the bounded source and finite-evidence interface. The current OPEN badge conflicts with source-linked 2026 proofs for a specific fixed-point reading. Formal proof equivalence and the empty target must be reviewed separately.
All general results cited here remain external until primary-source review.
What remains
ERDOS-1151-CHOJECKI-HART-CRITICAL-001: source-lock Erdős 1943 correction, Chojecki 2026 note and Hart formalization exact commit; independently run Lean and #print axioms, match precise fixed x0 and nonempty A with website question, and separately proof-review empty target via 1941/1943 divergence construction. Request upstream catalogue status reconciliation only after hypothesis match.
Live site OPEN conflicts with externally confirmed 2026 solution/formalization for a SPECIFIC normalized fixed-point version. GCL has not independently run Lean or reviewed full primary proof; source-fidelity STATUS_CONFLICT, not automatic certification.
Sources and claim boundaries
https://www.erdosproblems.com/1151 ; https://erdosproblemaday.com/day/1151-chebyshev-lagrange-limit-sets ; https://probxiv.com/problems/erdos-1151 ; Chojecki/Sothanaphan/Hart 2026; [Er43] original historical note; trivial constant example.
This is a source-bound, unaccepted editorial draft. Neither protected cohort admission nor proof or Lean certification is implied.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2422 — 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.