Skip to content

Erdős Problem #1152

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 #1152. This asks whether interpolation with a degree allowance that shrinks to zero must fail almost everywhere for some continuous target function, no matter how the nodes were chosen.

\[ p_n(x_{kn})=f(x_{kn}),\quad\deg p_n<(1+\varepsilon(n))n,\quad\varepsilon(n)\to0. \]

For every array of n distinct interpolation nodes x_{1n},…,x_{nn} in [-1,1] and epsilon(n)→0, ask whether there exists continuous f such that EVERY polynomial sequence p_n satisfying interpolation p_n(x_{kn})=f(x_{kn}) and degree <(1+epsilon(n))n fails to converge to f almost everywhere. Quantifier order and whether epsilon(n)>0 matters; if overhead negative and interpolation is impossible the claim could become vacuous. Nodes need NOT form a nested sequence.

A small example

For n=3 nodes -1,0,1 and f(x)=x^3, the unique degree<3 interpolant is p(x)=x. At x=1/2 the discrepancy is exactly 3/8. One finite interpolant with a discrepancy proves nothing about all admissible sequences or convergence a.e.

What is known

https://www.erdosproblems.com/1152 OPEN, Vardi [Va99,2.42]. Erdős, Kroó and Szabados [EKS89] proved contrasting result: for FIXED epsilon>0 they could choose favorable node arrays such that every continuous f has some interpolating p_n with degree <(1+epsilon)n converging UNIFORMLY. This existence at fixed overhead is NOT a disproof of the universal near-zero-overhead question. Primary proof not independently replayed.

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-1152-INTERPOLATION-QUANTIFIERS-001: pin EKS89 theorem exact epsilon, node quantifier and degree condition; source-check whether epsilon(n) is positive, and separately test nested/non-nested node arrays with polynomial/nonpolynomial f. Any universal nonconvergence proof requires a fixed continuous f for the entire array.

OPEN, primary EKS89 theorem-source review pending. No new universal result.

Sources and claim boundaries

https://www.erdosproblems.com/1152 ; [Va99,2.42],[EKS89]. Finite 3-node example independently checked.

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: #2423 — 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