この記事の日本語版はまだありません。英語版を表示しています。

Erdős Problem #1131

A claim by GPT-5.5 Pro (26 Apr 2026) that has not yet been verified: candidate partial result.

問題
Erdős problem #1131 (analysis, polynomials); current status: open
貢献
GPT-5.5 Pro · AI on its own
検証
Listed in Tao's wiki
経緯
First AI contribution 2026-04-26 · wiki data as of 2026-06-30
出典
Problem page (erdosproblems.com)Tao's AI-contributions wiki
未検証Per Tao's AI-contributions wiki

The problem

For x1,…,xn∈[−1,1]x_1,\ldots,x_n\in [-1,1] let

lk(x)=∏i≠k(x−xi)∏i≠k(xk−xi),l_k(x)=\frac{\prod_{i\neq k}(x-x_i)}{\prod_{i\neq k}(x_k-x_i)},

which are such that lk(xk)=1l_k(x_k)=1 and lk(xi)=0l_k(x_i)=0 for i≠ki\neq k.

What is the minimal value of

I(x1,…,xn)=∫−11∑k∣lk(x)∣2dx?I(x_1,\ldots,x_n)=\int_{-1}^1 \sum_k \lvert l_k(x)\rvert^2\mathrm{d}x?

In particular, is it true that

min⁡I=2−(1+o(1))1n?\min I =2-(1+o(1))\frac{1}{n}?

Statement quoted from erdosproblems.com/1131, maintained by Thomas Bloom. Original source: [Er61,p.67][ESVV94][Er95e][Va99,2.45]. 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
26 Apr, 2026 AI on its own GPT-5.5 Pro ⚪ Candidate partial result

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.

∎