Erdős Problem #1151

Full solution by Przemek Chojecki with GPT-5.5 Pro (30 Apr 2026).

Problem
Erdős problem #1151 (analysis, polynomials); current status: open
Credit
Przemek Chojecki with GPT-5.5 Pro · AI working with humans
Checked
Listed in Tao's wiki
Timeline
First AI contribution 2026-04-30 · wiki data as of 2026-06-30
Sources
Problem page (erdosproblems.com)Tao's AI-contributions wiki
SOLVEDPer Tao's AI-contributions wiki

The problem

Given a1,…,an∈[−1,1]a_1,\ldots,a_n\in [-1,1] let

Lnf(x)=∑1≤i≤nf(ai)ℓi(x)\mathcal{L}^nf(x) = \sum_{1\leq i\leq n}f(a_i)\ell_i(x)

be the unique polynomial of degree n−1n-1 which agrees with ff on aia_i for 1≤i≤n1\leq i\leq n (that is, the Lagrange interpolation polynomial).

Let aia_i be the set of Chebyshev nodes. Prove that, for any closed A⊆[−1,1]A\subseteq [-1,1], there exists a continuous function ff such that AA is the set of limit points of Lnf(x)\mathcal{L}^nf(x).

Statement quoted from erdosproblems.com/1151, maintained by Thomas Bloom. Original source: [Va99,2.41]. Current status there: open.

AI contributions

As recorded in Terence Tao's wiki AI contributions to Erdős problems (data as of 30 Jun 2026). 🟢 full, 🟡 partial, ⚪ unverified, 🔴 incorrect.

Date Kind AI systems Humans Outcome
30 Apr, 2026 AI working with humans GPT-5.5 Pro Przemek Chojecki 🟢 Full solution

Caveats

The wiki's classifications are provisional and are not a benchmark. Many Erdős problems have never had a thorough literature review, so a result that looks new may later turn out to be known; some problems were also stated ambiguously or incorrectly. See the problem page for the full discussion.

∎