Erdős Problem #1129

The problem

For $x_1,\ldots,x_n\in [-1,1]$ let

$$l_k(x)=\frac{\prod_{i\neq k}(x-x_i)}{\prod_{i\neq k}(x_k-x_i)},$$

which are such that $l_k(x_k)=1$ and $l_k(x_i)=0$ for $i\neq k$.

Describe which choice of $x_i$ minimise

$$\Lambda(x_1,\ldots,x_n)=\max_{x\in [-1,1]} \sum_k \lvert l_k(x)\rvert.$$

Statement quoted from erdosproblems.com/1129, maintained by Thomas Bloom. Original source: [Er47,p.1171][Er67,p.66]. Current status there: proved (Lean).

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.

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.

∎