Skip to content

Erdős Problem #1133

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 #1133 asks for robustly difficult polynomial interpolation data. For any \(C>0\), seek \(\varepsilon>0\) such that for every sufficiently large \(n\) and every configuration \(x_1,\ldots,x_n\in[-1,1]\) there exist target values \(y_i\in[-1,1]\) forcing any polynomial \(P\) of degree

\[ \deg P<(1+\varepsilon)n \]

which matches at least \((1-\varepsilon)n\) of the indexed data to satisfy \(\max_{[-1,1]}|P|>C\).

The order of quantifiers is crucial: the data are chosen after the nodes, and the polynomial may ignore some of those values.

A small example

For nodes \(-1,0,1\), every three values \(|y_i|\le1\) have a degree-at-most-two interpolant. By the exact three-node Lebesgue constant,

\[ |P(x)|\le\sum_{i=1}^{3}|\ell_i(x)|\le\frac54. \]

For this finite \(n=3\) situation, one cannot force norm greater than \(C>5/4\) when exact interpolation with degree two is allowed. This does not refute a claim stated only for sufficiently large \(n\).

What is known

Erdős proved a weaker high-norm interpolation phenomenon involving a degree‑\(n\) polynomial bounded at about \((1+\varepsilon)n\) given nodes. The robust converse remains listed open.

An April 2026 comment reports a proposed solution via Beurling interpolation in Bernstein spaces, with an angular substitution \(x=\cos\theta\). The online comment and favorable informal review are not independent proof certification. The frozen formal-conjectures file labels the main statement open, with an unproved theorem, and a separate weaker known result. Neither a claimed AI-generated proof nor a finite calculation justifies changing the open status.

GCL's current state

Authenticated original-issue return #2404 records the universal/existential order and verifies the exact three-node bound.

What remains

Obtain and critically review the actual 2026 note, precise Beurling interpolation theorem and density conditions, the change of variables, ignored-node robustness and whether node repetitions are allowed. Compare with Erdős's original weaker result. Source-adjudicate before altering the OPEN classification.

Sources and claim boundaries

Erdős #1133; unreviewed comment and claimed solution; Erdős (1967), p.72; GCL return. Finite inequality independent; new proof claim unverified. Unaccepted draft.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2404 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: PROTECTED_READY_BACKLOG.
  • Formal-statement coverage: A provider statement was included in the pinned 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