WorksMathematics
The Schur-Siegel-Smyth trace problem: the lower bound 1.8022246
Abstract
We prove lambda_SSS >= 9011123/5000000 = 1.8022246 for the smallest limiting trace-to-degree ratio of totally positive algebraic integers. The previous best bound is 1.8022225 (Tomar). The certificate consists of fourteen integer polynomials with rational multipliers and a continuous piecewise-linear density with 8678 rational hat weights; its dual inequality is verified on (0,infinity) in ball arithmetic. For the same family of polynomials the value of the underlying optimisation problem is 1.8022247 to within 10^-9 (numerical), so the bound is within 1.1*10^-7 of what this family can give.
Statement
For a totally positive algebraic integer of degree write , and let .
Theorem 1 (PROVED, computer-assisted). .
Previous lower bounds: 1.80203 by Orloski, Talebizadeh Sardari and Smith [2]; 1.80220 in [1]; 1.8022225 by Tomar [4]. Several upper bounds obtained from Smith’s theorem [3] have been announced since October 2026, for instance 1.8070809 [4] and 1.80560940 [5].
The criterion
Lemma 1 ([2]; Proposition 2 of [1]; Lemma 2.1 of [4]). Let be nonzero, , and let be a bounded density with compact support and mass . Put and . If
for every that is not a root of one of the , then .
The certificate
The polynomials and multipliers are listed in Table 1; the polynomial receives multiplier 0, so fourteen polynomials are used. The set is the one of [4]. The density is
| 0.503429120622 | |
| 0.437992939258 | |
| 0.042387356574 | |
| 0.156351499433 | |
| 0.058154222706 | |
| 0.017297099538 | |
| 0.017604850341 | |
| 0.002319719944 | |
| 0.000660717275 | |
| 0.000388680112 | |
| 0 | |
| 0.002585133289 | |
| 0.000413411866 | |
| 0.000395645259 | |
| 0.000392591884 |
Table 1. Polynomials and multipliers (decimals rounded; exact rationals in the ancillary file).
where is the hat function of mass one on with peak at , for nodes that are rationals with denominator in , and are rationals with denominator . Exactly 6 067 weights are nonzero; the support of is contained in , and
The exact data are in the ancillary file cert_SSS_1802224600.json (format of [4]: keys A, lamQ, nodes, rho, lambda, x_lo = , x_hi = 8).
Verification
Since is continuous and piecewise linear, with exact rational , and
with and (). The program check_sss.py (ancillary) computes everything in arb ball arithmetic at 192 bits, starting from the exact rational data:
the roots of the polynomials are certified real by Sturm sequences and enclosed in rational intervals of width ;
is computed from the closed form above, its polynomial part exactly;
on and , is bounded below by monotonicity: the bounds are and ;
is cut at every node, at the root enclosures and into blocks; on each block the contribution of distant nodes is a Taylor polynomial of degree 24 with an explicit remainder; on each cell is bounded below by a second-order bound, and by chords or tangents for the terms singular at the cell ends; failing cells are bisected.
Result: 98 710 cell checks, all positive; total time 4.6 minutes on two cores. Verdict: on with , which proves Theorem 1.
Controls (VERIFIED).
With (two units of higher) the same program returns certified negative values, e.g. and (radii below ). The certificate therefore proves 1.8022246 and nothing above 1.80222462.
On the certificates of [4] the program reproduces the published values of to all printed digits, returns VERIFIED for his bounds 1.8021892 . . . and 1.8022225, and returns certified negative values at for his first certificate at and , the points reported by his own program.
The values of at five points of were recomputed by direct numerical integration of cell by cell (mpmath, 40 digits), without the closed forms; they agree with the ball values to twelve digits.
Remarks (numerical)
Remark. For the fourteen polynomials of Table 1, the best bound obtainable from Lemma 1 equals the value of the primal problem: minimise over probability measures on with and . On a mesh of 8 680 nodes its value is 1.8022247019, stable to under refinement. The bound of Theorem 1 is below it.
Remark. For the optimal measure of this problem, every irreducible monic with all roots in , degree at most 7 and trace at most twice the degree (883 polynomials), and every such of degree 8 with roots in (3 402 polynomials), satisfies . Outside Table 1 the smallest value is +0.0407 (degree 7) and +0.160 (degree 8). Since satisfies these constraints, adding any of these polynomials leaves the optimal value unchanged.
Acknowledgements
This work was carried out with the assistance of an AI system (Claude, Anthropic). Every claim has been checked by computation; the verification program was written from Lemma 1 and the certificate format alone.
References
- [1]D. Niedbala Giraudin, A new lower bound for the Schur–Siegel–Smyth trace problem, arXiv:2609.29298 [math.NT] (2026).arxiv.org/abs/2609.29298
- [2]B. J. Orloski, N. Talebizadeh Sardari and A. Smith, New lower bounds for the Schur–Siegel–Smyth trace problem, Math. Comp. 94 (2025), no. 354, 2005–2040, doi:10.1090/mcom/4004; arXiv:2401.03252.DOI
- [3]A. Smith, Algebraic integers with conjugates in a prescribed distribution, Ann. of Math. (2) 200 (2024), no. 1, 71–122, doi:10.4007/annals.2024.200.1.2.DOI
- [4]T. S. Tomar, Upper and lower bounds for the Schur–Siegel–Smyth trace problem, version 4, Zenodo, doi:10.5281/zenodo.23563968 (2026).DOI
- [5]R. Pinho, A trace upper-bound certificate with classical auxiliaries on an adaptive density, Hexagon 2610.00695v3 (2026).