Upper and lower bounds for the Schur–Siegel–Smyth trace problem
Version 1 / Nov 15, 2026 / CC BY 4.0
Abstract
The Schur–Siegel–Smyth trace constant is the lower limit of over totally positive algebraic integers . We prove . For the upper bound we exhibit a measure on that satisfies the hypotheses of Smith's theorem on limits of distributions of conjugates, which we check with the help of integer polynomials. This improves the upper bounds of Orloski and Talebizadeh Sardari and of Pinho. The lower bound comes from the method of Orloski, Talebizadeh Sardari and Smith with fifteen polynomials, three of them of degree found by McKee and Smyth. It is larger than the bound reported by Giraudin, whose verification evaluates its bounds in floating-point arithmetic with fixed safety margins; ours encloses every rounding error. For each bound, two separately written programs check the certificate in ball arithmetic. Both bounds are also proved in Lean 4, the upper bound under the assumption of Smith's theorem, also in a version in which all checks on the certificates are carried out by Lean's kernel. We also give evidence that certificates of this kind cannot lower the upper bound much further without integer polynomials of high degree.
References
- J. Aguirre and J. C. Peral, The trace problem for totally positive algebraic integers , with an appendix by J.-P. Serre, in: Number Theory and Polynomials, London Math. Soc. Lecture Note Ser. 352 , Cambridge Univ. Press, Cambridge, 2008, 1--19.
- M. Carneiro, Lean4Lean: Verifying a typechecker for Lean, in Lean , arXiv:2403.14064, 2024.arXiv
- S. Diamond and S. Boyd, CVXPY: a Python-embedded modeling language for convex optimization , J. Mach. Learn. Res. 17 (2016), no. 83, 1--5.
- The FLINT team, FLINT: Fast Library for Number Theory , version 3.6.0, https://flintlib.org.link
- D. N. Giraudin, A new lower bound for the Schur--Siegel--Smyth trace problem , arXiv:2609.29298v1, 2026.arXiv
- P. J. Goulart and Y. Chen, Clarabel: an interior-point solver for conic programs with quadratic objectives , arXiv:2405.12762, 2024.arXiv
- Q. Huangfu and J. A. J. Hall, Parallelizing the dual revised simplex method , Math. Program. Comput. 10 (2018), 119--142.
- F. Johansson, Arb: efficient arbitrary-precision midpoint-radius interval arithmetic , IEEE Trans. Comput. 66 (2017), 1281--1292.
- J. McKee and C. Smyth, Salem numbers of trace and traces of totally positive algebraic integers , in: Algorithmic Number Theory (ANTS VI), Lecture Notes in Comput. Sci. 3076 , Springer, Berlin, 2004, 327--337.
- The mathlib Community, The Lean mathematical library , in: Proc. 9th ACM SIGPLAN Int. Conf. Certified Programs and Proofs (CPP 2020), 2020, 367--381.
Show all 25 referencesShow fewer references
- L. de Moura and S. Ullrich, The Lean 4 theorem prover and programming language , in: Automated Deduction -- CADE 28, Lecture Notes in Comput. Sci. 12699 , Springer, 2021, 625--635.
- nanoda_lib , a type checker for Lean 4, https://github.com/ammkrn/nanoda_lib.link
- B. J. Orloski and N. Talebizadeh Sardari, A quantitative converse of Fekete's theorem , arXiv:2304.10021v2, 2024.arXiv
- B. J. Orloski, N. Talebizadeh Sardari and A. Smith, New lower bounds for the Schur--Siegel--Smyth trace problem , Math. Comp. 94 (2025), 2005--2040; arXiv:2401.03252.arXiv
- R. Pinho, An explicit upper-bound certificate for the Schur--Siegel--Smyth trace constant , Zenodo, doi:10.5281/zenodo.23486957, 2026; certificate and checker at https://github.com/rpinho/c86-trace-certificate, commit 116a58f.DOI
- python-flint: Python bindings for FLINT, version 0.9.0, https://github.com/flintlib/python-flint.link
- B. Qu and C. Yang, Limit distribution of algebraic integral points on curves , arXiv:2609.39505v1, 2026.arXiv
- T. Ransford, Potential theory in the complex plane , London Math. Soc. Stud. Texts 28 , Cambridge Univ. Press, Cambridge, 1995.
- E. B. Saff and V. Totik, Logarithmic potentials with external fields , Grundlehren Math. Wiss. 316 , Springer, Berlin, 1997.
- I. Schur, Über die Verteilung der Wurzeln bei gewissen algebraischen Gleichungen mit ganzzahligen Koeffizienten , Math. Z. 1 (1918), 377--402.
- C. L. Siegel, The trace of totally positive and real algebraic integers , Ann. of Math. (2) 46 (1945), 302--312.
- A. Smith, Algebraic integers with conjugates in a prescribed distribution , Ann. of Math. (2) 200 (2024), 71--122; we cite the numbering of arXiv:2111.12660v2.arXiv
- C. J. Smyth, Totally positive algebraic integers of small trace , Ann. Inst. Fourier (Grenoble) 34 (1984), no. 3, 1--28.
- T. Tao et al., Optimization constants in mathematics , online repository, https://teorth.github.io/optimizationproblems/, 2026.link
- C. Wang, J. Wu and Q. Wu, Totally positive algebraic integers with small trace , Math. Comp. 90 (2021), 2317--2332.
Version history
- v1 · 15 pagesSubmitted by Tejasvi Singh TomarPublished on Zenodo: https://doi.org/10.5281/zenodo.23563968CurrentNov 15, 2026