An exact algebraic construction for Erdős's interpolation minimum

Primarily AI-generated textHuman understanding: no partsmath.CA — Classical Analysis and ODEs

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer ↗

Version 1 / Nov 21, 2026 / CC BY 4.0

Abstract

For distinct nodes in [−1,1][-1,1], consider the integral of the sum of the squares of their Lagrange cardinal polynomials. We give a finite algebraic construction of its minimum for every positive number of nodes. For n≥2n\geq2, put k=n−1k=n-1 and d=2n(n−1)d=2n(n-1). A rational symmetric polynomial matrix of order (d+1)k(d+1)^k determines a nonzero rational polynomial of degree at most kd(d+1)kkd(d+1)^k. The minimum is a specified real root of this polynomial. Its index is obtained from signatures at rational sample points. All steps of the value rule use rational polynomial arithmetic, univariate real root isolation, and rational symmetric elimination.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000938. Pinned source and Lean proof materials: https://github.com/Ghuffy1/erdos-1131-exact-minimum/tree/85bd4c4dc7c99de780b7fc7e4a657d0e2b60c473

Provenance statement

OpenAI AI systems assisted with the mathematics, formalization, verification and exposition. The linked project preserves separate credit for seanm27lol's independently established asymptotic disproof.

References

  1. S. Basu, R. Pollack, and M.-F. Roy, Algorithms in Real Algebraic Geometry , second ed., Algorithms and Computation in Mathematics, vol. 10, Springer, Berlin, 2006. doi:10.1007/3-540-33099-2 (https://doi.org/10.1007/3-540-33099-2).DOI
  2. T. F. Bloom (ed.), Erdős Problem 1131, Erdős Problems , online problem collection, accessed November 11, 2026. erdosproblems.com/1131 (https://www.erdosproblems.com/1131).link
  3. L. Brutman and D. Toledano, An extremal problem of Erdős in interpolation theory, Computers & Mathematics with Applications 34 (1997), no. 12, 37--47. doi:10.1016/S0898-1221(97)00232-0 (https://doi.org/10.1016/S0898-1221(97)00232-0).DOI
  4. P. Erdős, J. Szabados, A. K. Varma, and P. Vértesi, On an interpolation theoretical extremal problem, Studia Scientiarum Mathematicarum Hungarica 29 (1994), 55--60.
  5. H. P. Le and M. Safey El Din, Solving parametric systems of polynomial equations over the reals through Hermite matrices, Journal of Symbolic Computation 112 (2022), 25--61. doi:10.1016/j.jsc.2021.12.002 (https://doi.org/10.1016/j.jsc.2021.12.002); arXiv:2011.14136 (https://arxiv.org/abs/2011.14136).arXivDOI
  6. P. White, Erdős #1131: the four-node minimum, exactly, Erdős Problem a Day , August 11, 2026, online article (https://erdosproblemaday.com/day/1131-exact-four-node-minimum).link

Version history

  1. v1 · 9 pagesSubmitted by Liam KruerManuscript accompanying Justin Sun Prize submission JSP-000938. Pinned source and Lean proof materials: https://github.com/Ghuffy1/erdos-1131-exact-minimum/tree/85bd4c4dc7c99de780b7fc7e4a657d0e2b60c473CurrentNov 20, 2026