Martinet's constant for totally real number fields ()
Martinet's constant for totally real number fields: determine or improve its bounds; the repository records 60.8395 (lower) and 857.567 (upper).
Editorial MSC2020 classification. Original article codes and source evidence are recorded in the literature directory.
Problem statement
For a number field , let denote the absolute value of its discriminant and let denote its degree. The root discriminant of is
Martinet's constant for totally real number fields (also called the asymptotic root-discriminant infimum in the totally real signature) is
where the is over all totally real number fields ordered by degree. Equivalently, is the smallest constant such that there exist infinite towers of totally real number fields with from above (or ).
Upper bounds on come from explicit constructions of infinite tamely ramified towers of totally real number fields with controlled root discriminant, via the Golod–Shafarevich criterion ([GS1964]) applied to restricted-ramification pro- Galois groups; lower bounds come from the Odlyzko–Serre analysis of Weil's explicit formula, either unconditional or under GRH.
Lean 4
No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.
Background
- The nearest visible improvement, and why it is out of reach. The record above cuts by , because [HMR2019, Proposition 1.3(iii)] gives only that the generator of tame inertia has depth at least two in . [HMR2019, §3.3.4] observes that if that depth were greater than two, one could cut by itself; the Golod–Shafarevich polynomial would then be at most , which still has a root in . The same degree- field would then have an infinite -Hilbert class field tower — no ramification at needed at all — and the totally real record would fall from to , a improvement with no new field. The authors write that they “do not see how to check the depth of in ”, and the question opening [HMR2019, §5] raises the general obstruction: given with coprime to and infinite, how deep can the generator of tame inertia be? This is a hope rather than a bound, so nothing in the table above changes; but it is the cheapest known route to the next record.
- Sibling: totally complex Martinet constant. There is an entirely analogous constant defined by taking the over totally complex (a.k.a. totally imaginary) number fields. For that variant the corresponding history is: Martinet 1978 gives ; Hajir–Maire 2002 give ; and Hajir–Maire–Ramakrishna 2019 give the current record (via a -th root class-field tower, with ). The GRH lower bound in this signature is and the unconditional lower bound is ([Odl1990]). If the totally complex variant later becomes the subject of separate literature it could be split off as
87b. - Martinet's constant has geometric implications far beyond number theory. Tsfasman–Vlăduț [TV1991] used towers with bounded root discriminant to construct explicit lattice sphere packings in high dimension. More recently, the same towers underpin the large-degree number-field constructions used in the OpenAI counterexample to the Erdős unit distance conjecture ([ABGLSSTWW2026]) and in the disproof of the sum-product conjecture over the reals (84b; [BSSZ2026]). In both of these applications one needs , which is exactly the Martinet regime; the [HMR2019] bound is precisely the "Martinet's constant" quoted in [BSSZ2026, §5].
- Conditional vs. unconditional. All the upper bounds above are unconditional: they are explicit constructions of infinite towers. The two [Odl1990] lower bounds have very different status — the unconditional bound can be improved only via genuine analytic progress on zero-density estimates for Dedekind zeta functions, whereas the GRH-conditional bound would immediately follow from a proof of GRH. Closing the gap between and would in particular disprove (a strong form of) GRH.
- The problem is not known to be finite in any effective sense at present: no one has proved a subexponential-in- upper bound on the smallest root discriminant of a totally real number field of degree , only that the is at most .
References (from the repository page)
- [GS1964] Golod, E. S.; Shafarevich, I. R. On the class field tower. Izv. Akad. Nauk SSSR Ser. Mat. 28 (1964), 261–272.
- [Mar1978] Martinet, Jacques. Tours de corps de classes et estimations de discriminants. Inventiones Mathematicae 44 (1978), no. 1, 65–73. DOI: 10.1007/BF01389902.
- [Odl1990] Odlyzko, Andrew M. Bounds for discriminants and related estimates for class numbers, regulators and zeros of zeta functions: a survey of recent results. Journal de Théorie des Nombres de Bordeaux 2 (1990), no. 1, 119–141.
- [HM2002] Hajir, Farshid; Maire, Christian. Tamely ramified towers and discriminant bounds for number fields — II. Journal of Symbolic Computation 33 (2002), no. 4, 415–423. DOI: 10.1006/jsco.2001.0514.
- [Mar2006] Martin, John S. Improved root-discriminant bounds via ramification-restricted class-field towers. (2006). Cited as "Martin [25]" in [HMR2019]; specific bibliographic details should be verified.
- [HMR2019] Hajir, Farshid; Maire, Christian; Ramakrishna, Ravi. Cutting towers of number fields. arXiv:1901.04354 (2019).
- [TV1991] Tsfasman, Michael A.; Vlăduţ, Serge G. Asymptotic properties of global fields and generalized Brauer–Siegel theorem. Moscow Mathematical Journal (early 1990s work reviewed in later papers); see e.g. Tsfasman, M. A. Global fields, codes and sphere packings. Astérisque 198–200 (1991), 373–396.
- [ABGLSSTWW2026] Alon, N.; Bloom, T. F.; Gowers, W. T.; Litt, D.; Sawin, W.; Shankar, A.; Tsimerman, J.; Wang, V.; Wood, M. M. Remarks on the disproof of the unit distance conjecture. arXiv:2605.20695 (2026).
- [BSSZ2026] Bloom, T. F.; Sawin, W.; Schildkraut, C.; Zhelezov, D. The sum-product conjecture is false for real numbers. arXiv:2605.28781 (2026).
Progress & source assessment
Repository table (commit 2c1968c, 26 September 2026): best known lower bound 60.8395; best known upper bound 857.567. Values marked with an asterisk have minimal verification.
Known upper bounds
| Bound | Reference | Comments |
|---|---|---|
| [Mar1978] | Martinet's original construction of infinite -class field towers of totally real number fields. | |
| [HM2002] | Hajir–Maire, refined Golod–Shafarevich with tame ramification. | |
| [Mar2006] | Martin, further refinement of the [HM2002] construction; the degree- field of [HMR2019, §3.3.1] has discriminant and root discriminant . | |
| [HMR2019] | Hajir–Maire–Ramakrishna, "cutting towers" via the refined Golod–Shafarevich criterion. The totally real example [HMR2019, §3.3.3] is a degree- field with , cut at a single prime above of norm , giving — a saving of a factor . Current record. |
Known lower bounds
| Bound | Reference | Comments |
|---|---|---|
| Trivial | for every number field. | |
| [Odl1990] | Unconditional Odlyzko lower bound on the root discriminant of any totally real number field of large degree. | |
| [Odl1990] | GRH-conditional Odlyzko–Serre lower bound in the totally real signature. |
- [1]Davis, Damek; Ivanisvili, Paata; Tao, Terence (maintainers). Optimization Constants in Mathematics, github.com/teorth/optimizationproblems (commit 2c1968c, 26 September 2026). — Martinet's constant for totally real number fields ($C_{87}$) linkApache-2.0 (repository license); constant pages reproduced with attribution; repository references retained.
Recorded progress
Add yours →Nothing recorded yet. A pointer to a paper the entry is missing counts.
Machine attempts
0 recordedAttempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.
No machine attempts recorded.
Sign in to run an attempt. New accounts start with enough credits for ten.
Discussion
0 notesNotes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.
No notes yet.
Sign in to add a note.