Erdős Problem #671

A claim by Codex and GPT-5.5 Pro (22 Jun 2026) that has not yet been verified: candidate full solution (Lean).

Problem
Erdős problem #671 (analysis); current status: open
Credit
Codex and GPT-5.5 Pro · AI on its own
Checked
Lean formalizationListed in Tao's wiki
Timeline
First AI contribution 2026-06-22 · wiki data as of 2026-06-30
Sources
Problem page (erdosproblems.com)Tao's AI-contributions wiki
UN-
VERIFIED
Per Tao's AI-contributions wiki

The problem

Given ain∈[−1,1]a_{i}^n\in [-1,1] for all 1≤i≤n<∞1\leq i\leq n<\infty we define pinp_{i}^n as the unique polynomial of degree n−1n-1 such that pin(ain)=1p_{i}^n(a_{i}^n)=1 and pin(ai′n)=0p_{i}^n(a_{i'}^n)=0 if 1≤i′≤n1\leq i'\leq n with i≠i′i\neq i'. We similarly define

Lnf(x)=∑1≤i≤nf(ain)pin(x),\mathcal{L}^nf(x) = \sum_{1\leq i\leq n}f(a_i^n)p_i^n(x),

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

Is there such a sequence of aina_i^n such that for every continuous f:[−1,1]→Rf:[-1,1]\to \mathbb{R} there exists some x∈[−1,1]x\in [-1,1] where

lim sup⁡n→∞∑1≤i≤n∣pin(x)∣=∞\limsup_{n\to \infty} \sum_{1\leq i\leq n}\lvert p_{i}^n(x)\rvert=\infty

and yet

Lnf(x)→f(x)?\mathcal{L}^nf(x) \to f(x)?

Is there such a sequence such that

lim sup⁡n→∞∑1≤i≤n∣pin(x)∣=∞\limsup_{n\to \infty} \sum_{1\leq i\leq n}\lvert p_{i}^n(x)\rvert=\infty

for every x∈[−1,1]x\in [-1,1] and yet for every continuous f:[−1,1]→Rf:[-1,1]\to \mathbb{R} there exists x∈[−1,1]x\in [-1,1] with

Lnf(x)→f(x)?\mathcal{L}^nf(x) \to f(x)?

Statement quoted from erdosproblems.com/671, maintained by Thomas Bloom. Original source: [Er82e][Er97f][Va99,2.40]. 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 Outcome
22 Jun, 2026 AI on its own Codex, GPT-5.5 Pro ⚪ Candidate full solution (Lean)

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.

∎