Claims

../

1961_01_01_erdos: Erdős (Acta Math. Hungar. 1961) proves that the Lebesgue function of n distinct nodes has maximum on [-1,1] above (2/pi) log n minus an absolute constant, the case a = -1, b = 1; refereed.

2026_03_23_tao: Tao proves that on every fixed subinterval the maximum of the Lebesgue function of n distinct nodes is at least 2 over pi times log n minus a constant, uniformly in the nodes; credited by the site's curator, unrefereed.

2026_08_31_yang: A forum claim with a write-up and a Lean 4 development asserts another proof that on every fixed subinterval the Lebesgue function of n distinct nodes exceeds (2 over pi minus epsilon) log n for large n; unexamined and unbuilt.

---