Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Number Theory

101 missions · 50 completed

The study of the integers and the structures built from them — prime numbers, and the rational, algebraic, and ppp-adic numbers that extend them. It reaches from analytic number theory, which uses the tools of analysis to understand the distribution of primes, to algebraic number theory, Diophantine equations, and the arithmetic of elliptic curves, modular forms, and LLL-functions.

Missions

Open51Completed50All101
Differential GeometryGeometry & Topology·Captain: t4v1

Thurston's Question 23: rational relations among hyperbolic volumesOpen Problem

Motivation

In the last of the twenty-four questions that closed his 1982 survey Three-dimensional manifolds, Kleinian groups and hyperbolic geometry (Bull. Amer. Math. Soc. 6 (1982), 357–381), Thurston asked to "show that volumes of hyperbolic 333-manifolds are not all rationally related" (p. 380). Twenty-two of the twenty-four have since been answered — geometrization by Perelman, tameness by Agol and by Calegari–Gabai, the ending lamination conjecture by Brock–Canary–Minsky, virtual fibering by Agol — and this one is among the two that remain open.

Some rational relations are forced, and for a trivial reason: a degree nnn cover of a hyperbolic 333-manifold has nnn times its volume, so any two commensurable manifolds have rationally related volumes. The question, which remains open, is whether every rational relation arises that way — equivalently, whether some two hyperbolic 333-manifolds have irrational volume ratio. Remarkably, not a single such pair is known.

Setting

The bundle fixes the meaning of every term. Hyperbolic 333-space is the upper half-space {(x,y,z):z>0}\{(x,y,z) : z > 0\}{(x,y,z):z>0}. Its volume is Lebesgue measure with density z−3z^{-3}z−3 — the Riemannian volume of the metric (dx2+dy2+dz2)/z2(dx^2+dy^2+dz^2)/z^2(dx2+dy2+dz2)/z2 written out, so that no Riemannian machinery is required. The hyperbolic distance is given by its closed formula

cosh⁡d(p,q)  =  1+∣p−q∣22 p3 q3.\cosh d(p,q) \;=\; 1 + \frac{|p-q|^2}{2\,p_3\,q_3}.coshd(p,q)=1+2p3​q3​∣p−q∣2​.

A Kleinian action is a free, properly discontinuous action by hyperbolic isometries; the quotient is a complete hyperbolic 333-manifold, discreteness and torsion freeness being consequences rather than hypotheses. The volume of the quotient is the measure of a fundamental domain, in the sense of Mathlib's MeasureTheory.IsFundamentalDomain, and the set of volumes collects those that are finite and positive.

Two conventions are stated rather than derived, and are worth flagging. Isometries are not required to preserve orientation, so the set of volumes also contains those of non-orientable quotients; this enlarges the set but not its Q\mathbb{Q}Q-span, so neither goal is affected. And preservation of the hyperbolic volume is a field of the structure rather than a consequence of preserving the distance: it holds for every hyperbolic isometry, but deriving it amounts to classifying Isom(H3)\mathrm{Isom}(\mathbb{H}^3)Isom(H3), which is not the subject of this mission.

Formalization targets

The goal is that the volumes are not all rationally related: there are two of them, vvv and www, with v≠qwv \neq q wv=qw for every rational qqq.

Two milestones support it. The first is that passing to a subgroup of index nnn multiplies the volume by nnn, a fundamental domain for the subgroup being the union of nnn translates of one for the whole group; this is the source of every known rational relation, and it is why the question is phrased as it is. The second is that the set of volumes is nonempty — that some finite-volume hyperbolic 333-manifold exists at all — without which the goal would be vacuously false rather than open.

A stronger form of the question, that the Q\mathbb{Q}Q-span of the set of volumes is infinite dimensional, is also stated.

Significance

The question is a geometric statement whose difficulty is arithmetic. For the Bianchi groups of an imaginary quadratic field FFF, Humbert's formula gives the covolume as ∣δF∣3/2ζF(2)/4π2|\delta_F|^{3/2}\zeta_F(2)/4\pi^2∣δF​∣3/2ζF​(2)/4π2, so the ratio of two such volumes is, up to explicit algebraic factors, a ratio of Dedekind zeta values at 222; and Neumann and Yang showed that the Bloch invariant of a hyperbolic 333-manifold lies in a subgroup of finite Q\mathbb{Q}Q-rank determined by its invariant trace field, so that manifolds sharing an invariant trace field with a single complex place, such as an imaginary quadratic one, have rationally related volumes. Producing one irrational ratio therefore means separating two such transcendentals — a statement of the same order of difficulty as the irrationality of ζ(5)\zeta(5)ζ(5). The value of formalizing the question is not that it will be closed, but that its statement, and the elementary relations that make its naive form false, are pinned down exactly.

20 thms3 active usersReviewed
Group Theory·Captain: Lucas

The Mathieu group M23 is a Galois group over QResearch Paper

Motivation

The inverse Galois problem asks whether every finite group GGG occurs as the Galois group of a finite Galois extension of Q\mathbb{Q}Q. For finite simple groups, a large part of the problem was settled by the rigidity method (Shih, Fried, Belyi, Matzat, Thompson) and its refinements such as the braid-group method. Between 1984 and 1989 this machinery realized 25 of the 26 sporadic simple groups as Galois groups over Q\mathbb{Q}Q, in fact as Galois groups of regular extensions of Q(t)\mathbb{Q}(t)Q(t). The Mathieu group M23M_{23}M23​ was the single exception.

Timeline.

  • 1985–1987: Hoyden-Siedersleben and Häfner obtained regular M23M_{23}M23​-extensions of k(t)k(t)k(t) for k=Q(−23)k=\mathbb{Q}(\sqrt{-23})k=Q(−23​) and k=Q(−7)k=\mathbb{Q}(\sqrt{-7})k=Q(−7​), by passing through M24M_{24}M24​.
  • 1996: Granboulan constructed a regular M23M_{23}M23​-extension of k(t)k(t)k(t) for every field kkk over which a certain conic has a point; that conic has no rational point.
  • 2013: Elkies computed the four complex polynomials PPP of degree 23 with Gal(P(x)−t/C(t))≅M23\mathrm{Gal}(P(x)-t/\mathbb{C}(t))\cong M_{23}Gal(P(x)−t/C(t))≅M23​; each is defined over a quartic number field.
  • 2026: Huang, Jackson, Lee, Poonen, Pries and Zhang (arXiv:2608.08538) produced an explicit regular M23M_{23}M23​-extension of Q(t)\mathbb{Q}(t)Q(t) and explicit degree-23 polynomials over Q\mathbb{Q}Q with Galois group M23M_{23}M23​, completing the program for the sporadic groups.

Setting

S23S_{23}S23​ denotes the group of permutations of the 23 points {1,…,23}\{1,\dots,23\}{1,…,23}, acting on the left, so (στ)(x)=σ(τ(x))(\sigma\tau)(x)=\sigma(\tau(x))(στ)(x)=σ(τ(x)). The paper fixes three explicit permutations

g1=(1,11)(2,23)(3,8)(4,16)(5,21)(7,20)(15,19)(18,22),g_1=(1,11)(2,23)(3,8)(4,16)(5,21)(7,20)(15,19)(18,22),g1​=(1,11)(2,23)(3,8)(4,16)(5,21)(7,20)(15,19)(18,22), g2=(1,2,11,10,16,9,6,3,23,19,20,14,21,17,4,8,22,5,18,15,13,7,12),g_2=(1,2,11,10,16,9,6,3,23,19,20,14,21,17,4,8,22,5,18,15,13,7,12),g2​=(1,2,11,10,16,9,6,3,23,19,20,14,21,17,4,8,22,5,18,15,13,7,12), g3=(1,2,3,4,10,11,12,7,19,18,8,6,9,16,17,21,22,5,14,20,13,15,23),g_3=(1,2,3,4,10,11,12,7,19,18,8,6,9,16,17,21,22,5,14,20,13,15,23),g3​=(1,2,3,4,10,11,12,7,19,18,8,6,9,16,17,21,22,5,14,20,13,15,23),

and the Mathieu group M23M_{23}M23​ is the subgroup of S23S_{23}S23​ generated by g1g_1g1​ and g2g_2g2​. A GGG-extension of a field kkk is a Galois extension L/kL/kL/k together with an isomorphism Gal(L/k)≅G\mathrm{Gal}(L/k)\cong GGal(L/k)≅G. A finite extension LLL of Q(t)\mathbb{Q}(t)Q(t) is regular if it contains no nontrivial algebraic extension of Q\mathbb{Q}Q.

For a triple of conjugacy classes (C1,C2,C3)(C_1,C_2,C_3)(C1​,C2​,C3​) of M23M_{23}M23​, the set Σc\Sigma_cΣc​ consists of triples (h1,h2,h3)∈C1×C2×C3(h_1,h_2,h_3)\in C_1\times C_2\times C_3(h1​,h2​,h3​)∈C1​×C2​×C3​ with h1h2h3=1h_1h_2h_3=1h1​h2​h3​=1 that generate M23M_{23}M23​, and the Nielsen class Nic\mathrm{Ni}_cNic​ is the set of orbits of Σc\Sigma_cΣc​ under simultaneous conjugation by M23M_{23}M23​. The paper works with the classes C1=2C_1=2C1​=2, C2=23AC_2=23AC2​=23A, C3=23BC_3=23BC3​=23B, represented by g1,g2,g3g_1,g_2,g_3g1​,g2​,g3​.

Formalization targets

Goal (Theorem 1.1)

∃ K/Q finite Galois with Gal(K/Q)≅M23.\exists\ K/\mathbb{Q}\ \text{finite Galois with}\ \mathrm{Gal}(K/\mathbb{Q})\cong M_{23}.∃ K/Q finite Galois with Gal(K/Q)≅M23​.

Stronger forms

  • Theorem 1.3: there is a finite Galois extension L/Q(t)L/\mathbb{Q}(t)L/Q(t), regular over Q\mathbb{Q}Q, with Gal(L/Q(t))≅M23\mathrm{Gal}(L/\mathbb{Q}(t))\cong M_{23}Gal(L/Q(t))≅M23​.
  • Examples 1.2 and 3.7: two explicit monic degree-23 polynomials in Z[x]\mathbb{Z}[x]Z[x] whose splitting fields are M23M_{23}M23​-extensions of Q\mathbb{Q}Q, unramified outside {2,3,23}\{2,3,23\}{2,3,23} and {2,7,23}\{2,7,23\}{2,7,23} respectively.

Supporting milestones

Facts about M23M_{23}M23​ stated in §3 (order 10,200,96010{,}200{,}96010,200,960, simplicity, 4-transitivity, 17 conjugacy classes), the membership (g1,g2,g3)∈Σc(g_1,g_2,g_3)\in\Sigma_c(g1​,g2​,g3​)∈Σc​, the count ∣Nic∣=7|\mathrm{Ni}_c|=7∣Nic​∣=7, the Riemann–Hurwitz count of Lemma 3.1, the hyperbolic triangle of Lemma 3.2, and the group-theoretic step of Corollary 3.6 (M23M_{23}M23​ is not normal in any strictly larger subgroup of S23S_{23}S23​).

Significance

Theorem 1.1 removes the last sporadic exception: combined with earlier work, every sporadic simple group is the Galois group of a regular extension of Q(t)\mathbb{Q}(t)Q(t) (Corollary 1.4), and hence occurs as a Galois group over every number field, in infinitely many mutually independent ways.

The paper's proof is computer-assisted: Belyi maps were computed numerically and the final claims were certified in Magma and PARI/GP. No machine-checked proof in a proof assistant is known. A formal proof of the explicit-polynomial statements (Examples 1.2 and 3.7) would give an independent, kernel-checked certificate of Theorem 1.1. The group-theoretic milestones (order, simplicity, transitivity, class counts, the Nielsen count) are reusable for any later work on M23M_{23}M23​ or the other Mathieu groups.

Difficulty

The rigidity method fails for M23M_{23}M23​: for every GQG_{\mathbb{Q}}GQ​-stable triple of conjugacy classes the Nielsen class has size different from 111, so no rational point of a Hurwitz space is forced. The smallest positive size, ∣Nic∣=7|\mathrm{Ni}_c|=7∣Nic​∣=7 for {2,23A,23B}\{2,23A,23B\}{2,23A,23B}, leaves seven covers, and the fact that one of them has field of moduli Q\mathbb{Q}Q was found by explicit computation, with no conceptual explanation. Certifying that a particular degree-23 polynomial has Galois group exactly M23M_{23}M23​ requires both a lower bound (the group contains M23M_{23}M23​, for instance via cycle types and the classification of transitive groups of degree 23) and an upper bound (the group is contained in a conjugate of M23M_{23}M23​, for instance via resolvents or reduction modulo primes). Neither bound is a finite check inside current Mathlib.

Formalization scope

S23S_{23}S23​ is Equiv.Perm (Fin 23). The paper's point kkk corresponds to k - 1 : Fin 23, and permutations compose as functions, which matches the paper's left-action convention. M23M_{23}M23​ is defined as Subgroup.closure {g₁, g₂}, so it is not described up to isomorphism. Galois groups are groups of field automorphisms, K ≃ₐ[ℚ] K, and a GGG-extension is recorded as a group isomorphism with M23M_{23}M23​. Q(t)\mathbb{Q}(t)Q(t) is RatFunc ℚ. "Unramified outside SSS" for a number field is encoded as "every prime dividing the absolute discriminant lies in SSS", which is equivalent by Dedekind's discriminant theorem. The Nielsen class is the set of orbits of Σc\Sigma_cΣc​ under simultaneous conjugation. Hyperbolic angles in the Poincaré disk are defined through the hyperbolic law of cosines.

The geometric statements Lemma 3.3 and Proposition 3.5 concern the numerically computed curve XCX_{\mathbb{C}}XC​ and the polynomial F(T,V)F(T,V)F(T,V), which the paper does not print, so they are not milestones. Lemma 3.1 enters only through its Riemann–Hurwitz count.

Contributions are welcome on decidable certificates for permutation-group facts in Lean, on Galois-group certification for explicit polynomials, and on Hilbert irreducibility.

Selected references

  • X. Huang, B. Jackson, K.-H. Lee, B. Poonen, R. Pries, S. Zhang, The Mathieu group M23M_{23}M23​ is a Galois group over Q\mathbb{Q}Q, 2026. https://arxiv.org/abs/2608.08538
  • G. Malle, B. H. Matzat, Inverse Galois Theory, 2nd ed., Springer, 2018.
  • J.-P. Serre, Topics in Galois Theory, Jones and Bartlett, 1992.
  • N. D. Elkies, The complex polynomials P(x)P(x)P(x) with Gal(P(x)−t)≅M23\mathrm{Gal}(P(x)-t)\cong M_{23}Gal(P(x)−t)≅M23​, ANTS X, Open Book Series 1, 2013.
  • M. D. Fried, H. Völklein, The inverse Galois problem and rational points on moduli spaces, Math. Ann. 290 (1991), 771–800.
18 thms2 active usersReviewed
Captain: xuanji

The irrationality measure of π is at most 7.103205334138 (Zeilberger–Zudilin 2020)Research Paper

Motivation

The irrationality measure μ(π)\mu(\pi)μ(π) is the supremum of the μ\muμ for which ∣π−p/q∣<q−μ|\pi - p/q| < q^{-\mu}∣π−p/q∣<q−μ has infinitely many rational solutions p/qp/qp/q. Every irrational number has μ≥2\mu \ge 2μ≥2 (Dirichlet), almost every real number has μ=2\mu = 2μ=2, and it is conjectured that μ(π)=2\mu(\pi) = 2μ(π)=2. Known upper bounds:

  • Mahler (1953): 424242, the first proof that π\piπ is not a Liouville number.
  • Mignotte (1974): 20.620.620.6.
  • Chudnovsky (1982): 19.8899944…19.8899944\ldots19.8899944…
  • Rhin–Viola (1993): 14.79707414.79707414.797074.
  • Hata (1993): 8.016045…8.016045\ldots8.016045…
  • Salikhov (2008): 7.606308…7.606308\ldots7.606308…
  • Zeilberger–Zudilin (2020): 7.103205334137…7.103205334137\ldots7.103205334137…, the current record.

The campaign's first proved value is Mahler's 424242. This entry records Zeilberger–Zudilin's bound.

Formalization target

The campaign template with the value 7.1032053341387.1032053341387.103205334138 filled in: PiIrrationality.UpperBound (7.103205334138 : ℝ), i.e. μ(π)≤7.103205334138\mu(\pi) \le 7.103205334138μ(π)≤7.103205334138.

Value. The paper states its bound as 7.103205334137…7.103205334137\ldots7.103205334137…, a truncation. This entry rounds the last digit up to 7.1032053341387.1032053341387.103205334138 so that the goal follows from the published proof.

How the bound arises

Zeilberger and Zudilin modify Salikhov's integrals and use the Almkvist–Zeilberger algorithm (creative telescoping) to find recurrences for them, then optimise the arithmetic and analytic estimates. This is the current record.

Significance

Each step down the list replaces Mahler's approximations with a sharper family. Formalizing 7.1032053341387.1032053341387.103205334138 would build reusable explicit machinery: integral constructions of rational approximations to π\piπ, bounds on their common denominators via prime-number estimates, and the standard lemma turning a sequence of good approximations into an irrationality-measure bound.

Selected references

  • D. Zeilberger, W. Zudilin, The irrationality measure of π\piπ is at most 7.103205334137…7.103205334137\ldots7.103205334137…, Moscow J. Combin. Number Theory 9 (2020), no. 4, 407–419. https://arxiv.org/abs/1912.06345
  • K. Mahler, On the approximation of π\piπ, Indag. Math. 15 (1953), 30–42.
  • F. Beukers, A rational approach to π\piπ, Nieuw Arch. Wiskd. (5) 1 (2000), 372–379.
  • Source table: https://teorth.github.io/optimizationproblems/constants/7a.html
2 thms2 active usersReviewed
Captain: Lucas

Chebotarëv's Density Theorem (Stevenhagen–Lenstra 1996)Research Paper

Motivation

Given a monic polynomial fff with integer coefficients, one can reduce it modulo each prime ppp and factor it over the finite field Fp\mathbb F_pFp​. The way fff factors changes with ppp, and the question of how often each factorization pattern occurs has a precise answer: Chebotarëv's density theorem (1922). It is the common generalization of Dirichlet's theorem on primes in arithmetic progressions (1837) and a theorem of Frobenius (1880, published 1896), and it underlies a large part of algebraic number theory, for example the fact that a Galois extension of a number field is determined by the set of primes that split completely in it. This mission follows the elementary exposition of P. Stevenhagen and H. W. Lenstra, Jr. (Math. Intelligencer 18 (1996)), which states all three theorems over Q\mathbb QQ with a minimum of terminology.

Timeline.

  • 1837 — Dirichlet: primes are equidistributed (in analytic density) over the invertible residue classes modulo mmm.
  • 1880/1896 — Frobenius: the density of primes with a given decomposition type of fff modulo ppp equals the proportion of Galois group elements with that cycle pattern; he conjectures the sharper statement for conjugacy classes.
  • 1896 — de la Vallée-Poussin: Dirichlet's theorem for natural density.
  • 1922/1925 — Chebotarëv proves Frobenius's conjecture, without class field theory.
  • 1935 — Deuring's proof via Artin reciprocity, now the textbook route.

Setting

Let f∈Z[X]f\in\mathbb Z[X]f∈Z[X] be monic of degree nnn with nonzero discriminant Δ(f)\Delta(f)Δ(f), so that fff has nnn distinct complex zeros α1,…,αn\alpha_1,\dots,\alpha_nα1​,…,αn​. Let K=Q(α1,…,αn)K=\mathbb Q(\alpha_1,\dots,\alpha_n)K=Q(α1​,…,αn​) be its splitting field and G=Gal(K/Q)G=\mathrm{Gal}(K/\mathbb Q)G=Gal(K/Q) its Galois group. Every σ∈G\sigma\in Gσ∈G permutes the zeros; the lengths of the cycles (including cycles of length 1) form the cycle pattern of σ\sigmaσ, a partition of nnn.

For a prime p∤Δ(f)p\nmid\Delta(f)p∤Δ(f), the degrees of the irreducible factors of f mod pf \bmod pfmodp over Fp\mathbb F_pFp​ form the decomposition type of fff modulo ppp, again a partition of nnn.

A Frobenius substitution of ppp is an element σ∈G\sigma\in Gσ∈G such that, for some prime ideal Q\mathfrak QQ of the ring of integers OK\mathcal O_KOK​ lying over ppp,

σ(x)≡xp(modQ)for all x∈OK.\sigma(x)\equiv x^p \pmod{\mathfrak Q}\qquad\text{for all }x\in\mathcal O_K .σ(x)≡xp(modQ)for all x∈OK​.

For p∤Δ(f)p\nmid\Delta(f)p∤Δ(f) these elements form a single conjugacy class of GGG, written σp\sigma_pσp​.

A set SSS of primes has (analytic, or Dirichlet) density δ\deltaδ if

∑p∈Sp−slog⁡1s−1⟶δ(s↓1),\frac{\sum_{p\in S}p^{-s}}{\log\frac{1}{s-1}}\longrightarrow\delta\qquad(s\downarrow 1),logs−11​∑p∈S​p−s​⟶δ(s↓1),

and natural density δ\deltaδ if #{p≤x:p∈S}/#{p≤x}→δ\#\{p\le x:p\in S\}/\#\{p\le x\}\to\delta#{p≤x:p∈S}/#{p≤x}→δ as x→∞x\to\inftyx→∞.

Formalization targets

Goal: Chebotarëv's density theorem

For every conjugacy class CCC of GGG,

the set {p prime:p∤Δ(f), σp∈C} has analytic density #C#G.\text{the set }\{p \text{ prime}: p\nmid\Delta(f),\ \sigma_p\in C\}\text{ has analytic density }\frac{\#C}{\#G}.the set {p prime:p∤Δ(f), σp​∈C} has analytic density #G#C​.

Milestones

  1. Theorem of Dirichlet: for m≥1m\ge1m≥1 and gcd⁡(a,m)=1\gcd(a,m)=1gcd(a,m)=1, the primes p≡a(modm)p\equiv a \pmod mp≡a(modm) have density 1/φ(m)1/\varphi(m)1/φ(m).
  2. A set of primes with natural density δ\deltaδ has analytic density δ\deltaδ.
  3. Galois theory of finite fields: for a squarefree g∈Fp[X]g\in\mathbb F_p[X]g∈Fp​[X], the cycle pattern of x↦xpx\mapsto x^px↦xp on the zeros of ggg equals the decomposition type of ggg.
  4. For p∤Δ(f)p\nmid\Delta(f)p∤Δ(f), the Frobenius substitutions of ppp form exactly one conjugacy class of GGG.
  5. For p∤Δ(f)p\nmid\Delta(f)p∤Δ(f), the cycle pattern of σp\sigma_pσp​ equals the decomposition type of fff modulo ppp.
  6. For f=Xm−1f=X^m-1f=Xm−1 and p∤mp\nmid mp∤m, σp(ζ)=ζp\sigma_p(\zeta)=\zeta^pσp​(ζ)=ζp for every primitive mmm-th root of unity ζ\zetaζ; that is, σp\sigma_pσp​ corresponds to p mod mp \bmod mpmodm under G≅(Z/mZ)×G\cong(\mathbb Z/m\mathbb Z)^\timesG≅(Z/mZ)×.
  7. Theorem of Frobenius: the primes p∤Δ(f)p\nmid\Delta(f)p∤Δ(f) for which fff has a given decomposition type ttt have density #{σ∈G:cycle pattern t}/#G\#\{\sigma\in G:\text{cycle pattern }t\}/\#G#{σ∈G:cycle pattern t}/#G.

Significance

Chebotarëv's theorem shows that every conjugacy class of the Galois group occurs as a Frobenius class for infinitely many primes, with a predictable frequency. Its standard consequences include: the Frobenius elements are equidistributed; a Galois extension is determined by its completely split primes; if fff has a zero modulo almost every prime then fff is linear or reducible; prime ideals are equidistributed over ideal classes. The theorem is the first step in many arguments in arithmetic geometry (e.g. Serre's work on ℓ\ellℓ-adic representations).

The theorem is classical and proved; this mission is about formalizing it. Mathlib contains Frobenius elements in Galois extensions of Dedekind domains and Dirichlet's theorem in the form "infinitely many primes in each coprime residue class", but, to our knowledge, neither the density form of Dirichlet's theorem nor Frobenius's or Chebotarëv's density theorem.

Difficulty

The Galois-theoretic parts (milestones 3–6) are standard but require connecting Frobenius elements in OK\mathcal O_KOK​ with factorization of fff modulo ppp, including the fact that p∤Δ(f)p\nmid\Delta(f)p∤Δ(f) forces ppp to be unramified in KKK. The analytic core is harder: one needs Dedekind zeta functions and LLL-functions of number fields and their behaviour at s=1s=1s=1. The reduction of the general case to the cyclotomic case (Chebotarëv's "crossing" with cyclotomic extensions) needs the density statement over an arbitrary number field as base, not only over Q\mathbb QQ; in particular, the statement over Q\mathbb QQ alone cannot be proved by induction on itself.

Formalization scope

All declarations live in the namespace ChebotarevDensity and share one definition file.

  • KKK is Mathlib's SplittingField of fff viewed in Q[X]\mathbb Q[X]Q[X]; GGG is Polynomial.Gal; Δ(f)\Delta(f)Δ(f) is Mathlib's Polynomial.discr.
  • A Frobenius substitution is expressed with Mathlib's IsArithFrobAt at some prime ideal of OK\mathcal O_KOK​ containing ppp; "σp∈C\sigma_p\in Cσp​∈C" means that some Frobenius substitution of ppp lies in CCC (for p∤Δ(f)p\nmid\Delta(f)p∤Δ(f) this is equivalent to all of them lying in CCC, by milestone 4).
  • The cycle pattern is Equiv.Perm.partition of the permutation induced on the complex zeros of fff; it includes fixed points.
  • The decomposition type is the multiset of degrees of the normalized (monic) irreducible factors of f mod pf \bmod pfmodp.
  • Analytic density uses ∑′p−s\sum' p^{-s}∑′p−s over the primes of SSS and the limit s→1+s\to1^+s→1+ within (1,∞)(1,\infty)(1,∞); natural density compares prime counts up to x∈Nx\in\mathbb Nx∈N.
  • The hypotheses Δ(f)≠0\Delta(f)\neq0Δ(f)=0 and "fff monic" are those of the source; the theorems are not vacuous, since e.g. f=Xm−1f=X^m-1f=Xm−1 satisfies them.

Welcome contributions: Dedekind zeta functions and Hecke LLL-functions at s=1s=1s=1, the density form of Dirichlet's theorem, unramifiedness of primes not dividing the discriminant, and the general number-field version of the theorem.

Selected references

  • P. Stevenhagen, H. W. Lenstra, Jr., Chebotarëv and his density theorem, Math. Intelligencer 18 (1996), no. 2, 26–37. doi:10.1007/BF03027290
  • N. Tschebotareff, Die Bestimmung der Dichtigkeit einer Menge von Primzahlen, welche zu einer gegebenen Substitutionsklasse gehören, Math. Ann. 95 (1925), 191–228. doi:10.1007/BF01206606
  • S. Lang, Algebraic Number Theory, Addison-Wesley, 1970, Chap. VIII.
  • J. Neukirch, Class Field Theory, Springer, 1986, Chap. V.
  • Chebotarev density theorem, Wikipedia. link
16 thms2 active usersReviewed
Algebraic Geometry·Captain: Lucas

Lam–Litt conjecture: algebraicity and integrality of solutions to algebraic ODEsOpen Problem

Motivation

A classical way to recognize an algebraic function is through the arithmetic of its Taylor coefficients. Eisenstein's theorem (1852) says that if a power series f∈Q[[z]]f\in\mathbb{Q}[[z]]f∈Q[[z]] is algebraic over Q[z]\mathbb{Q}[z]Q[z], only finitely many primes occur in the denominators of its coefficients. The converse fails in general: many transcendental power series have integer coefficients. Lam and Litt (arXiv:2501.13175) conjecture that the converse does hold for power series that solve an algebraic differential equation at a non-singular point, and that even a weak control on denominators — primes ppp may appear, but only after roughly ω(p)≫p\omega(p)\gg pω(p)≫p coefficients — already forces algebraicity.

For linear differential equations, the conjecture is a strengthening of the Grothendieck–Katz ppp-curvature conjecture, one of the central open problems about algebraic solutions of linear differential equations (arXiv:2501.13175). The bounded-denominator form is Problem 1 on Litt's list of open problems (problemsilike.com/1).

Timeline.

  • 1852 — Eisenstein: algebraic power series over Q\mathbb{Q}Q have bounded denominators (implication (1)⇒(2) below).
  • 1970s — Grothendieck and Katz: the ppp-curvature conjecture for linear differential equations.
  • 2025 — Lam and Litt formulate the conjecture for (possibly non-linear) algebraic differential equations and prove it for many equations and initial conditions of algebro-geometric interest, including Picard–Fuchs equations at initial conditions corresponding to cycle classes, and isomonodromy equations such as Painlevé VI and the Schlesinger system at initial conditions corresponding to Picard–Fuchs equations (arXiv:2501.13175).

Setting

Let f=∑k≥0akzk∈Q[[z]]f=\sum_{k\ge0}a_kz^k\in\mathbb{Q}[[z]]f=∑k≥0​ak​zk∈Q[[z]] be a formal power series with rational coefficients and write f(i)f^{(i)}f(i) for its iii-th formal derivative. Let g∈Q(z,y0,…,yn−1)g\in\mathbb{Q}(z,y_0,\dots,y_{n-1})g∈Q(z,y0​,…,yn−1​) be a rational function in n+1n+1n+1 variables. The series fff solves the algebraic ODE defined by ggg if

f(n)(z)=g(z,f(z),f′(z),…,f(n−1)(z))f^{(n)}(z)=g\bigl(z,f(z),f'(z),\dots,f^{(n-1)}(z)\bigr)f(n)(z)=g(z,f(z),f′(z),…,f(n−1)(z))

and ggg is defined at (0,f(0),…,f(n−1)(0))\bigl(0,f(0),\dots,f^{(n-1)}(0)\bigr)(0,f(0),…,f(n−1)(0)). Concretely, g=p/qg=p/qg=p/q for polynomials p,qp,qp,q with q(0,f(0),…,f(n−1)(0))≠0q\bigl(0,f(0),\dots,f^{(n-1)}(0)\bigr)\neq0q(0,f(0),…,f(n−1)(0))=0 and f(n)⋅q(z,f,…,f(n−1))=p(z,f,…,f(n−1))f^{(n)}\cdot q(z,f,\dots,f^{(n-1)})=p(z,f,\dots,f^{(n-1)})f(n)⋅q(z,f,…,f(n−1))=p(z,f,…,f(n−1)).

For N∈NN\in\mathbb{N}N∈N, Z[1/N]⊆Q\mathbb{Z}[1/N]\subseteq\mathbb{Q}Z[1/N]⊆Q is the subring generated by 1/N1/N1/N. For a function ω\omegaω from the primes to Z\mathbb{Z}Z, the coefficients of fff are ω\omegaω-integral if for every prime ppp the numbers a0,…,aω(p)a_0,\dots,a_{\omega(p)}a0​,…,aω(p)​ lie in Z(p)\mathbb{Z}_{(p)}Z(p)​ (denominators prime to ppp); ω\omegaω is superlinear if ω(p)/p→∞\omega(p)/p\to\inftyω(p)/p→∞.

Formalization targets

Goal: the Lam–Litt conjecture

For fff solving an algebraic ODE as above, the following are equivalent:

(1) f is algebraic over Q[z];(2) ∃N, ∀k, ak∈Z[1/N];(3) ∃ ω superlinear with (ak) ω-integral.\text{(1) } f \text{ is algebraic over } \mathbb{Q}[z];\qquad \text{(2) } \exists N,\ \forall k,\ a_k\in\mathbb{Z}[1/N];\qquad \text{(3) } \exists\,\omega \text{ superlinear with } (a_k) \ \omega\text{-integral}.(1) f is algebraic over Q[z];(2) ∃N, ∀k, ak​∈Z[1/N];(3) ∃ω superlinear with (ak​) ω-integral.

Milestones

  • (1)⇒(2), Eisenstein's theorem (no ODE hypothesis needed).
  • (2)⇒(3), elementary (no ODE hypothesis needed).
  • (3)⇒(2), open.
  • (2)⇒(1), open; Litt's Problem 1.

Together the four milestones imply the goal; the last two are the open content of the conjecture.

Significance

A proof would give an arithmetic criterion for algebraicity of solutions of arbitrary algebraic differential equations, and, for linear equations, would imply the Grothendieck–Katz ppp-curvature conjecture (arXiv:2501.13175). Lam and Litt draw algebro-geometric consequences from the cases they prove.

For formalization: the conjecture is open, so the goal and the two open milestones are research targets. Eisenstein's theorem is a classical result; formalizing it is concrete, self-contained work. The implication (2)⇒(3) is elementary. The cases proved by Lam and Litt are candidates for further milestones.

Difficulty

Integrality of coefficients alone does not detect algebraicity: there are transcendental power series with integer coefficients that satisfy linear differential equations, such as ∑k(2kk)2zk\sum_k\binom{2k}{k}^2z^k∑k​(k2k​)2zk. Its equation is singular at z=0z=0z=0, which the non-singularity hypothesis on ggg excludes; the conjecture asserts that at non-singular points such examples cannot occur. Even for linear equations the statement contains the Grothendieck–Katz conjecture, which is open in general.

Formalization scope

  • Power series are PowerSeries ℚ with the formal derivative; rational functions are the fraction field of MvPolynomial (Fin (n + 1)) ℚ, where variable 0 is zzz and variable i + 1 is f(i)f^{(i)}f(i).
  • The ODE hypothesis is existential: some representation g=p/qg=p/qg=p/q with qqq nonzero at the initial point and f(n)q(… )=p(… )f^{(n)}q(\dots)=p(\dots)f(n)q(…)=p(…) as power series. This non-singularity requirement is essential and must not be dropped.
  • Algebraicity is IsAlgebraic (Polynomial ℚ) f, i.e. over Q[z]\mathbb{Q}[z]Q[z] (equivalently over Q(z)\mathbb{Q}(z)Q(z)).
  • Z[1/N]\mathbb{Z}[1/N]Z[1/N] is the subalgebra of Q\mathbb{Q}Q generated by 1/N1/N1/N; since 1/0=01/0=01/0=0 in Lean, N=0N=0N=0 gives Z\mathbb{Z}Z.
  • ω\omegaω takes values in Z\mathbb{Z}Z; negative values impose no condition at that prime. Superlinearity is the limit ω(p)/p→∞\omega(p)/p\to\inftyω(p)/p→∞ along the primes.
  • The goal is a List.TFAE of the three conditions.

Useful infrastructure: formal derivatives and substitution for power series, algebraic power series and their coefficient arithmetic (Eisenstein), and ppp-adic valuations of coefficients. Formalizations of Eisenstein's theorem and of the special cases proved by Lam and Litt are welcome.

Selected references

  • Y. H. J. Lam, D. Litt, Algebraicity and integrality of solutions to differential equations, arXiv preprint, 2025. https://arxiv.org/abs/2501.13175
  • D. Litt, Problem 1, problems list. https://www.problemsilike.com/1
  • G. Eisenstein, Über eine allgemeine Eigenschaft der Reihen-Entwicklungen aller algebraischen Funktionen, Bericht der Königl. Preuss. Akademie der Wissenschaften zu Berlin, 1852.
  • Formal Conjectures project, FormalConjectures/LittProblems/1.lean. https://github.com/google-deepmind/formal-conjectures
6 thms2 active usersReviewed
Discrete GeometryLinear OptimizationOperations Research+1·Captain: mikedeng1

Maximal Lattice-Free Convex Sets in Linear Subspaces I: Characterization of Maximal Lattice-Free Convex Sets in a SubspaceResearch Paper

Motivation

Cutting planes for mixed-integer linear programs are often derived from convex sets that contain no integer point in their interior. Balas observed in 1971 that every such lattice-free convex set containing the current fractional LP solution in its interior yields a valid inequality, the intersection cut (Balas, Intersection cuts, Oper. Res. 19, 1971). The strongest cuts come from sets that are inclusionwise maximal, so the shape of maximal lattice-free convex sets matters to multi-row cut generation.

The case where the set lives in a subspace arises in practice. Taking qqq rows of an optimal simplex tableau restricts the integer points to an affine subspace f+Wf+Wf+W of Rq\mathbb R^qRq spanned by the tableau columns. When WWW is irrational, its integer points span only a proper subspace V⊊WV\subsetneq WV⊊W. The classical theory does not cover this case, and it is the case that the second mission of this series (minimal valid inequalities of the relaxation Rf(W)R_f(W)Rf​(W)) needs.

Timeline.

  • Lovász (Geometry of numbers and integer programming, 1989) stated the characterization for rational subspaces (Proposition 3.1) and gave only a sketch of the proof. The irrational-hyperplane case is not visible in that sketch.
  • Basu, Conforti, Cornuéjols and Zambelli (arXiv:1701.06543v1; Math. Oper. Res. 35(3), 2010, doi:10.1287/moor.1100.0461) gave a complete proof of Lovász's theorem for an arbitrary lattice of a linear space (Theorem 10). They also extended it to a space WWW strictly larger than the span VVV of the lattice (Theorem 9, equivalently Theorem 1 for Zn\mathbb Z^nZn).

Setting

Work in Rn\mathbb R^nRn with the Euclidean inner product and the open balls Bε(x)B_\varepsilon(x)Bε​(x). For X⊆RnX\subseteq\mathbb R^nX⊆Rn, ⟨X⟩\langle X\rangle⟨X⟩ denotes its linear span.

A lattice of a linear space VVV is an additive group Λ={λ1a1+⋯+λmam∣λi∈Z}\Lambda=\{\lambda_1a_1+\dots+\lambda_ma_m\mid\lambda_i\in\mathbb Z\}Λ={λ1​a1​+⋯+λm​am​∣λi​∈Z} generated by linearly independent vectors a1,…,ama_1,\dots,a_ma1​,…,am​ with ⟨a1,…,am⟩=V\langle a_1,\dots,a_m\rangle=V⟨a1​,…,am​⟩=V (Definition 6, IsLatticeOf Λ V). A linear subspace L⊆VL\subseteq VL⊆V is a Λ\LambdaΛ-subspace if it has a basis contained in Λ\LambdaΛ (Definition 7, IsLambdaSubspace Λ V L). For Z2\mathbb Z^2Z2, the line x2=2x1x_2=2x_1x2​=2x1​ is a Λ\LambdaΛ-subspace and the line x2=2x1x_2=\sqrt2x_1x2​=2​x1​ is not.

For sets W,SW,SW,S the interior relative to WWW is intW(S)={x∈S∣Bε(x)∩W⊆S for some ε>0}\mathbf{int}_W(S)=\{x\in S\mid B_\varepsilon(x)\cap W\subseteq S\text{ for some }\varepsilon>0\}intW​(S)={x∈S∣Bε​(x)∩W⊆S for some ε>0} (intW W S). The relative interior is relint(S)=intaff⁡(S)(S)\mathbf{relint}(S)=\mathbf{int}_{\operatorname{aff}(S)}(S)relint(S)=intaff(S)​(S).

Let W⊇VW\supseteq VW⊇V be a linear space. A set SSS is a Λ\LambdaΛ-free convex set of WWW if S⊆WS\subseteq WS⊆W, SSS is convex and Λ∩intW(S)=∅\Lambda\cap\mathbf{int}_W(S)=\emptysetΛ∩intW​(S)=∅. It is maximal if no other Λ\LambdaΛ-free convex set of WWW properly contains it (Definition 8, IsLambdaFree, IsMaxLambdaFree).

The statements also use a polyhedron in WWW (WWW intersected with finitely many closed half-spaces), a polytope (convex hull of a finite set), the dimension dim⁡(S)\dim(S)dim(S) of the affine hull with dim⁡∅=−1\dim\emptyset=-1dim∅=−1 (affDim), and a facet: a nonempty face S∩{⟨a,x⟩=b}S\cap\{\langle a,x\rangle=b\}S∩{⟨a,x⟩=b} of a valid inequality with dim⁡F=dim⁡S−1\dim F=\dim S-1dimF=dimS−1. The recession cone is rec⁡(S)={r∣x+tr∈S ∀x∈S, t≥0}\operatorname{rec}(S)=\{r\mid x+tr\in S\ \forall x\in S,\ t\ge0\}rec(S)={r∣x+tr∈S ∀x∈S, t≥0} and the lineality space is rec⁡(S)∩−rec⁡(S)\operatorname{rec}(S)\cap-\operatorname{rec}(S)rec(S)∩−rec(S).

Formalization targets

Goal: Theorem 9 (p. 8)

For a lattice Λ\LambdaΛ of VVV and a linear space W⊇VW\supseteq VW⊇V with dim⁡W≥1\dim W\ge1dimW≥1, a set SSS is a maximal Λ\LambdaΛ-free convex set of WWW if and only if

(i) S is a full-dimensional polyhedron in W, S∩V is maximal Λ-free in V, F↦F∩V is a bijection of facets;\text{(i) } S \text{ is a full-dimensional polyhedron in } W,\ S\cap V \text{ is maximal } \Lambda\text{-free in } V,\ F\mapsto F\cap V \text{ is a bijection of facets};(i) S is a full-dimensional polyhedron in W, S∩V is maximal Λ-free in V, F↦F∩V is a bijection of facets; (ii) S=v+L is a hyperplane of W with L∩V a hyperplane of V that is not a Λ-subspace;\text{(ii) } S=v+L \text{ is a hyperplane of } W \text{ with } L\cap V \text{ a hyperplane of } V \text{ that is not a } \Lambda\text{-subspace};(ii) S=v+L is a hyperplane of W with L∩V a hyperplane of V that is not a Λ-subspace; (iii) S is a half-space of W containing V on its boundary.\text{(iii) } S \text{ is a half-space of } W \text{ containing } V \text{ on its boundary.}(iii) S is a half-space of W containing V on its boundary.

Main milestone: Theorem 10 (p. 8)

For dim⁡V≥1\dim V\ge1dimV≥1, SSS is a maximal Λ\LambdaΛ-free convex set of VVV if and only if either S=P+LS=P+LS=P+L is a polyhedron with PPP a polytope, LLL a Λ\LambdaΛ-subspace and dim⁡S=dim⁡P+dim⁡L=dim⁡V\dim S=\dim P+\dim L=\dim VdimS=dimP+dimL=dimV, with no lattice point in intV(S)\mathbf{int}_V(S)intV​(S) and a lattice point in the relative interior of every facet; or S=v+LS=v+LS=v+L is an affine hyperplane of VVV whose direction LLL is not a Λ\LambdaΛ-subspace.

Supporting milestones

Lemma 13 (bounded full-dimensional case), Lemma 15 (lattice points near half-lines), Lemma 16 (S+⟨rec⁡S⟩S+\langle\operatorname{rec}S\rangleS+⟨recS⟩ stays Λ\LambdaΛ-free), Lemma 17 (projection along a Λ\LambdaΛ-subspace is a lattice), Lemma 18 (lattice points near non-lattice subspaces), Lemma 19 (maximal hyperplanes), Claims 1 and 2 in the proof of Theorem 10, and identity (6), intW(S)∩V=intV(S∩V)\mathbf{int}_W(S)\cap V=\mathbf{int}_V(S\cap V)intW​(S)∩V=intV​(S∩V).

Significance

Theorem 10 says that maximal lattice-free sets are cylinders over polytopes with a lattice point on every facet, apart from the irrational hyperplanes. This is the structural fact behind the finiteness of facet counts (at most 2dim⁡P2^{\dim P}2dimP) and behind every classification of maximal lattice-free sets in low dimension, such as the triangles and quadrilaterals of the two-row relaxation. Theorem 9 extends it to irrational subspaces. There the new cases are the half-spaces of (iii), which have VVV on their boundary, and the hyperplanes of (ii), whose trace on VVV is a hyperplane of VVV that is not a Λ\LambdaΛ-subspace. Theorem 9 is the geometric input to the paper's Theorem 3: every minimal valid inequality of Rf(W)R_f(W)Rf​(W) is the gauge of a maximal lattice-free convex set of f+Wf+Wf+W.

These results are proved on paper. No machine-checked version of Lovász's theorem, of Theorem 9, or of the lattice-approximation Lemmas 15 and 18 is known to exist. The mission produces the definitions of lattices of subspaces, relative interiors and lattice-free sets on which the second mission of the series builds.

Difficulty

The obvious argument separates each lattice point from SSS by a half-space and intersects the half-spaces. It gives a polyhedron only when finitely many lattice points matter, that is, when SSS is bounded. For unbounded SSS, the recession directions must be shown to be lineality directions and to be spanned by lattice vectors. Both steps rest on simultaneous Diophantine approximation (Dirichlet's theorem) applied in irrational directions, and on a density argument for the projected lattice when the lineality space is not a Λ\LambdaΛ-subspace. In the subspace setting of Theorem 9, one must also track the interiors relative to WWW and to VVV separately. Identity (6) holds only when intW(S)\mathbf{int}_W(S)intW​(S) meets VVV, and the half-space case (iii) is exactly the case where it does not.

Formalization scope

Rn\mathbb R^nRn is EuclideanSpace ℝ (Fin n), linear spaces are Submodule ℝ, and Λ\LambdaΛ is an AddSubgroup. All declarations live in the namespace MaxLatticeFree.Geometry. Every interior is relative (intW, relint). With the ambient topological interior, every subset of a proper subspace would be trivially lattice-free, and the classification would collapse. A lattice must have a linearly independent generating family; a dense finitely generated subgroup such as Z+2Z\mathbb Z+\sqrt2\mathbb ZZ+2​Z is excluded. Dimensions are integers with dim⁡∅=−1\dim\emptyset=-1dim∅=−1, and facets are nonempty, so no dimension equation holds through truncated subtraction.

Two readings of the page are fixed.

  1. Theorem 9 assumes dim⁡W≥1\dim W\ge1dimW≥1 and Theorem 10 assumes dim⁡V≥1\dim V\ge1dimV≥1. For W=V={0}W=V=\{0\}W=V={0} the only maximal set is ∅\emptyset∅, which satisfies none of the listed cases, so the printed statements are false there.
  2. Identity (6) is stated under the three hypotheses its proof uses, not inside the case analysis of Theorem 9.

The paper's Theorem 1 (the same result for Zn\mathbb Z^nZn and affine WWW) is not included, and neither are the cited results of Barvinok and Dirichlet (Theorems 11, 14, Corollary 12). They are welcome as supporting lemmas. Infrastructure that is useful beyond this mission includes Dirichlet's simultaneous approximation theorem in Rm\mathbb R^mRm, discreteness of lattices of subspaces, and the relation between intW/relint and Mathlib's intrinsicInterior.

Selected references

  • A. Basu, M. Conforti, G. Cornuéjols, G. Zambelli, Maximal lattice-free convex sets in linear subspaces, Math. Oper. Res. 35(3), 2010; arXiv:1701.06543v1. https://arxiv.org/abs/1701.06543
  • L. Lovász, Geometry of numbers and integer programming, in: Mathematical Programming: Recent Developments and Applications, 1989, pp. 177–210.
  • E. Balas, Intersection cuts — a new type of cutting planes for integer programming, Oper. Res. 19, 1971. https://doi.org/10.1287/opre.19.1.19
  • A. Barvinok, A Course in Convexity, Graduate Studies in Mathematics 54, AMS, 2002. https://doi.org/10.1090/gsm/054
18 thms2 active usersReviewed
AlgebraAlgebraic Geometry·Captain: vatsj

Milnor conjecture (Voevodsky 2003), formalizedResearch Paper

Motivation

For a field FFF, two invariants built from very different data turn out to carry the same mod-2 information. One is Milnor K-theory KnM(F)K^M_n(F)KnM​(F), defined by generators and relations from the multiplicative group F×F^\timesF× alone. The other is Galois cohomology Hn(F,Z/2)H^n(F,\mathbb{Z}/2)Hn(F,Z/2), the continuous cohomology of the absolute Galois group of FFF. In 1970 Milnor considered a natural map KnM(F)/2→Hn(F,Z/2)K^M_n(F)/2 \to H^n(F,\mathbb{Z}/2)KnM​(F)/2→Hn(F,Z/2) in all degrees, verified that it is an isomorphism for several classes of fields, and remarked that he knew of no field where it fails (Milnor 1970). The statement that it is always an isomorphism when char⁡F≠2\operatorname{char} F \neq 2charF=2 became known as the Milnor conjecture. Its companion conjecture on quadratic forms was later deduced from it (Orlov–Vishik–Voevodsky 2007). Together they identify the graded Witt ring of quadratic forms, Galois cohomology mod 2, and K∗M(F)/2K^M_*(F)/2K∗M​(F)/2.

Timeline. The attributions below follow the introduction of Voevodsky 2003.

  • 1970: Milnor considers the map KnM(F)/2→Hn(F,Z/2)K^M_n(F)/2 \to H^n(F,\mathbb{Z}/2)KnM​(F)/2→Hn(F,Z/2) in all degrees and gives classes of fields where it is an isomorphism (Milnor 1970).
  • Bass–Tate (published 1973): the Kummer classes satisfy the Steinberg relation, so the Kummer map extends to a ring homomorphism on K∗M(F)K^M_*(F)K∗M​(F) (Bass–Tate 1973).
  • Degrees 0 and 1: the map is an isomorphism, by Kummer theory and Hilbert's Theorem 90.
  • 1981: Merkurjev proves degree 2 with 222 as the coefficient prime.
  • 1982: Merkurjev and Suslin extend degree 2 to every prime ℓ\ellℓ (Merkurjev–Suslin 1982).
  • Degree 3, ℓ=2\ell = 2ℓ=2: proved by Merkurjev–Suslin and, independently, by Rost.
  • 2003: Voevodsky proves all degrees, in every characteristic ≠2\neq 2=2 (Voevodsky 2003, Cor. 7.5), using the motivic Steenrod operations constructed in Voevodsky 2003b. This work was cited for his 2002 Fields Medal.
  • 2011: the analogue for odd primes, the Bloch–Kato conjecture, is proved (Voevodsky 2011); a book-length account is Haesemeyer–Weibel 2019.

Setting

Let FFF be a field with 2≠02 \neq 02=0 in FFF.

Milnor K-theory. For n≥0n \ge 0n≥0, KnM(F)K^M_n(F)KnM​(F) is the quotient of the nnn-fold tensor power (F×)⊗n(F^\times)^{\otimes n}(F×)⊗n, taken over Z\mathbb{Z}Z with F×F^\timesF× written additively, by the subgroup generated by the pure tensors a1⊗⋯⊗ana_1\otimes\cdots\otimes a_na1​⊗⋯⊗an​ in which some adjacent pair satisfies ai+ai+1=1a_i + a_{i+1} = 1ai​+ai+1​=1. This is the degree-nnn part of T(F×)/IT(F^\times)/IT(F×)/I, where III is the two-sided ideal generated by a⊗(1−a)a\otimes(1-a)a⊗(1−a). The class of a1⊗⋯⊗ana_1\otimes\cdots\otimes a_na1​⊗⋯⊗an​ is the symbol {a1,…,an}\{a_1,\dots,a_n\}{a1​,…,an​}. In particular K0M(F)=ZK^M_0(F) = \mathbb{Z}K0M​(F)=Z and K1M(F)=F×K^M_1(F) = F^\timesK1M​(F)=F×. In Lean these are MilnorK F n and symbol a for a : Fin n → Fˣ.

Galois cohomology. Let FsepF^{\mathrm{sep}}Fsep be a separable closure and GF=Gal⁡(Fsep/F)G_F = \operatorname{Gal}(F^{\mathrm{sep}}/F)GF​=Gal(Fsep/F) the absolute Galois group, a profinite group under the Krull topology. Hn(F,Z/2)H^n(F,\mathbb{Z}/2)Hn(F,Z/2) is the continuous cohomology Hctsn(GF,Z/2)H^n_{\mathrm{cts}}(G_F,\mathbb{Z}/2)Hctsn​(GF​,Z/2) with trivial action, computed from GFG_FGF​-invariant continuous homogeneous cochains. In Lean this is H F n, Mathlib's continuousCohomology n of the trivial representation.

The Galois symbol. For a∈F×a \in F^\timesa∈F× fix a∈Fsep\sqrt a \in F^{\mathrm{sep}}a​∈Fsep. The Kummer character χa:GF→Z/2\chi_a : G_F \to \mathbb{Z}/2χa​:GF​→Z/2 is χa(σ)=0\chi_a(\sigma) = 0χa​(σ)=0 if σ(a)=a\sigma(\sqrt a) = \sqrt aσ(a​)=a​ and 111 otherwise. It is a continuous homomorphism representing the Kummer class δa∈H1\delta a \in H^1δa∈H1. The Galois symbol of (a1,…,an)(a_1,\dots,a_n)(a1​,…,an​) is the class of the homogeneous cocycle

(x0,…,xn) ⟼ ∏j=1n(χaj(xj)−χaj(xj−1)),(x_0,\dots,x_n)\ \longmapsto\ \prod_{j=1}^{n}\bigl(\chi_{a_j}(x_j)-\chi_{a_j}(x_{j-1})\bigr),(x0​,…,xn​) ⟼ j=1∏n​(χaj​​(xj​)−χaj​​(xj−1​)),

the homogeneous form of (σ1,…,σn)↦χa1(σ1)⋯χan(σn)(\sigma_1,\dots,\sigma_n) \mapsto \chi_{a_1}(\sigma_1)\cdots\chi_{a_n}(\sigma_n)(σ1​,…,σn​)↦χa1​​(σ1​)⋯χan​​(σn​), i.e. the cup product δa1∪⋯∪δan\delta a_1\cup\cdots\cup\delta a_nδa1​∪⋯∪δan​. In Lean this is galoisSymbol a.

Formalization targets

Goal: the Milnor conjecture (Voevodsky 2003, Corollary 7.5)

For every field FFF with char⁡F≠2\operatorname{char} F \neq 2charF=2 and every n≥0n \ge 0n≥0 there is a homomorphism

φ:KnM(F)→Hn(F,Z/2),φ{a1,…,an}=δa1∪⋯∪δan,\varphi : K^M_n(F) \to H^n(F,\mathbb{Z}/2),\qquad \varphi\{a_1,\dots,a_n\} = \delta a_1\cup\cdots\cup\delta a_n,φ:KnM​(F)→Hn(F,Z/2),φ{a1​,…,an​}=δa1​∪⋯∪δan​,

which is surjective and whose kernel is exactly 2 KnM(F)2\,K^M_n(F)2KnM​(F).

Since symbols generate KnM(F)K^M_n(F)KnM​(F), such a φ\varphiφ is unique; it is the norm residue homomorphism. The statement is therefore equivalent to KnM(F)/2≅Hn(F,Z/2)K^M_n(F)/2 \cong H^n(F,\mathbb{Z}/2)KnM​(F)/2≅Hn(F,Z/2) via the norm residue map. Its existence, i.e. the fact that the Steinberg relations map to zero, is part of the claim.

Significance

The result itself. The theorem gives a presentation of mod-2 Galois cohomology by generators and relations: every class is a sum of cup products of degree-one classes, and every relation among such products comes from Steinberg relations and multiples of 2. With Orlov–Vishik–Voevodsky 2007 it yields Milnor's conjecture on quadratic forms, which classifies quadratic forms up to Witt equivalence by their Galois-cohomological invariants.

Formalizing it. The theorem is proved but not formalized. At the time of writing, Mathlib has neither Milnor K-theory nor cup products in group or continuous cohomology, and has Hilbert 90 only for finite Galois extensions. This mission's definitions provide a sorry-free Galois symbol in Mathlib's continuous cohomology, which already makes the degree 0 and degree 1 cases (Kummer theory) meaningful targets. A complete development would formalize the IHES proof, including motivic cohomology with Z/2\mathbb{Z}/2Z/2 coefficients and the motivic Steenrod algebra. No part of that is currently available in Lean. Related existing work: on this platform, a graded cup product (groupCohomology.exists_isGradedCupProduct) and a Kummer theory and Hilbert 90 for level-constant cocycles have been formalized on top of Mathlib's discrete groupCohomology. The cup product is for discrete groups, and the Kummer and Hilbert 90 results use finite-level hypotheses in place of continuity, so none of them transfers directly to continuousCohomology.

Difficulty

Degrees 0 and 1 follow from Kummer theory and Hilbert 90. Degree 2 is Merkurjev's theorem, whose proof goes through the K-theory of Severi–Brauer varieties. No argument internal to Galois cohomology or K-theory of fields is known in higher degrees. The known proof reformulates the statement as a vanishing theorem for motivic cohomology of fields, the "Hilbert 90" property for weight nnn. It then argues by induction on nnn through geometry over FFF: splitting varieties of symbols (Pfister quadrics), their motives, and cohomology operations on motivic cohomology. Each of these is a substantial theory, none of it exists in Mathlib, and the induction passes through statements about arbitrary smooth varieties, not only fields.

Formalization scope

Scope. The target is the Milnor conjecture, i.e. the prime 222 with coefficients Z/2≅μ2\mathbb{Z}/2 \cong \mu_2Z/2≅μ2​. The Bloch–Kato conjecture for odd primes is out of scope.

Conventions.

  • The field is F : Type, universe 0. Mathlib's continuousCohomology requires the coefficient module to live in the universe of the group. For FFF in a higher universe this forces ULift (ZMod 2), for which the needed Module and ContinuousSMul instances are not available as global instances. Universe polymorphism is not part of this mission. It does not follow by plain transport, since a field in a higher universe need not be isomorphic to any field in Type; one route is a limit argument, using that both sides commute with directed unions of fields and that every field is the directed union of its countable subfields, each isomorphic to a field in Type.
  • The hypothesis char⁡F≠2\operatorname{char} F \neq 2charF=2 is [NeZero (2 : F)].
  • HnH^nHn is Mathlib's continuousCohomology, built from homogeneous cochains, with Z/2\mathbb{Z}/2Z/2 as a trivial representation of GFG_FGF​ with the Krull topology.
  • KnM(F)K^M_n(F)KnM​(F) is defined one degree at a time, not as a graded ring.
  • "Kernel =2KnM= 2K^M_n=2KnM​" means φ(x)=0  ⟺  ∃y, x=2y\varphi(x)=0 \iff \exists y,\ x = 2yφ(x)=0⟺∃y, x=2y.

Ruling out trivializations. The Galois symbol is not a free parameter. It is a fixed, sorry-free definition, and the existence of φ\varphiφ with the prescribed values on symbols is part of the goal. Neither can be chosen to make the statement vacuous.

Route. Reductions should follow Voevodsky 2003 together with Voevodsky 2003b. That route avoids resolution of singularities and works in every characteristic ≠2\neq 2=2. The following rely on resolution of singularities (or on characteristic-0 reductions) and should not be used as inputs:

  • Mazza–Voevodsky–Weibel (MVW 2006), results 16.24, 16.25 and 20.1, and the cdh-topology and compactly-supported-motive material;
  • the original Suslin–Voevodsky paper relating Bloch–Kato to Beilinson–Lichtenbaum (Suslin–Voevodsky 2000); use Haesemeyer–Weibel 2019, Chapter 2, instead;
  • Haesemeyer–Weibel Part II, and their reduction to characteristic 0 (Lemma 1.3);
  • Voevodsky's 1995–96 preprints on the Milnor conjecture.

Infrastructure needed and reusable. A complete development needs:

  • the ring structure on K∗M(F)K^M_*(F)K∗M​(F) (cf. Carlier's KMilnorWitt for Milnor–Witt K-theory);
  • cup products in continuous cohomology;
  • Hilbert 90 for profinite Galois groups;
  • Galois cohomology as étale cohomology of Spec⁡F\operatorname{Spec} FSpecF;
  • the Nisnevich topology;
  • presheaves with transfers, motivic complexes and motivic cohomology;
  • motivic Steenrod operations;
  • motives of Pfister quadrics.

Most of this is reusable well beyond the mission. The homogeneous-cochain construction in the definition files, which turns an invariant continuous cocycle Gn+1→MG^{n+1}\to MGn+1→M into a class in Mathlib's continuousCohomology, applies to any locally compact group with trivial coefficients. Contributions of any of these components, and of the degree 0 and 1 cases, are welcome.

Selected references

  • V. Voevodsky, Motivic cohomology with Z/2\mathbb{Z}/2Z/2-coefficients, Publ. Math. IHÉS 98 (2003), 59–104. https://doi.org/10.1007/s10240-003-0010-6
  • V. Voevodsky, Reduced power operations in motivic cohomology, Publ. Math. IHÉS 98 (2003), 1–57. https://doi.org/10.1007/s10240-003-0009-z
  • J. Milnor, Algebraic K-theory and quadratic forms, Invent. Math. 9 (1970), 318–344. https://doi.org/10.1007/BF01425486
  • H. Bass, J. Tate, The Milnor ring of a global field, in Algebraic K-theory II, Lecture Notes in Math. 342, Springer, 1973. https://doi.org/10.1007/BFb0073733
  • A. S. Merkurjev, A. A. Suslin, K-cohomology of Severi–Brauer varieties and the norm residue homomorphism, Math. USSR Izv. 21 (1983). https://doi.org/10.1070/IM1983v021n02ABEH001793
  • D. Orlov, A. Vishik, V. Voevodsky, An exact sequence for K∗M/2K^M_*/2K∗M​/2 with applications to quadratic forms, Ann. of Math. 165 (2007), 1–13. https://doi.org/10.4007/annals.2007.165.1
  • V. Voevodsky, On motivic cohomology with Z/l\mathbb{Z}/lZ/l-coefficients, Ann. of Math. 174 (2011), 401–438. https://doi.org/10.4007/annals.2011.174.1.11
  • C. Haesemeyer, C. Weibel, The Norm Residue Theorem in Motivic Cohomology, Annals of Math. Studies 200, Princeton, 2019. https://doi.org/10.1515/9780691189635
  • C. Mazza, V. Voevodsky, C. Weibel, Lecture Notes on Motivic Cohomology, Clay Math. Monographs 2, AMS, 2006. https://www.claymath.org/wp-content/uploads/2022/03/Motivic-Cohomology.pdf
  • A. Suslin, V. Voevodsky, Bloch–Kato conjecture and motivic cohomology with finite coefficients, in The Arithmetic and Geometry of Algebraic Cycles, NATO Sci. Ser. C 548, Kluwer, 2000. https://doi.org/10.1007/978-94-011-4098-0_5
14 thms2 active usersReviewed
Captain: Rizwan G Mir

Erdős Problem 68: Irrationality of sum 1/(n! - 1)Open Problem

Erdős Problem 68: Irrationality of sum 1/(n! - 1)

Problem Statement & Context

Erdős Problem 68 asks whether the infinite series 184987\sum_{n=2}^{\infty} rac{1}{n! - 1}184987 is irrational.

Paul Erdős proved in 1948 that \sum_{n=1}^{\infty} rac{1}{2^n - 1} is irrational, but the problem for factorial denominators ! - 1$ remains open.

Main Target Theorem

7 thms2 active usersReviewed
Algebra·Captain: tomasz

Philippon: Multiplicity estimates in commutative algebraic groupsResearch Paper

Why multiplicity estimates matter

Formalization status, 29 September 2026: fourteen of the 26 individual paper targets are Proved, including Theorem 2.1, Propositions 3.3 and 4.7, and Lemma 5.1. Four of eight milestones are complete. The full-paper goal remains Open: the corollaries, remaining supporting claims, and both 1987 addenda remain part of the mission. The proved multiplicity theorem now supports the completed Senthil Kumar target.

An auxiliary polynomial in a transcendence proof is constructed to vanish to high order at many points. A multiplicity estimate limits how often that can happen without a geometric reason: a positive-dimensional algebraic subgroup can make the apparent vanishing conditions dependent. Such estimates are used to turn analytic approximations into algebraic-independence conclusions. The theory applies to products of commutative algebraic groups with both archimedean and nonarchimedean analytic directions.

The mission's objective is a faithful formalization of the complete 1986 paper, Patrice Philippon's Lemmes de zéros dans les groupes algébriques commutatifs, including every theorem, corollary, proposition, lemma, definition, and mathematical supporting claim. All results remain required whether or not a current application uses them. Necessary source corrections are explicit and their counterexamples remain part of the completion goal. The author's 1987 corrections are applied transparently, and the addendum's additional results are recorded separately (original, errata and addenda).

Groups, analytic directions, and geometric degree

Let K be the complex field or the completed algebraic closure of the field of ℓ-adic numbers for a prime ℓ, as in the source. Let G be a product of finitely many commutative algebraic groups G₁,…,Gᵣ over K, with each factor embedded as a quasi-projective variety in a projective space. Write n for the sum of their dimensions. A point of the product embedding has one block of homogeneous coordinates for each factor.

A nonzero multihomogeneous polynomial P has a degree Dᵢ in its i-th block of coordinates. Its zeros define a hypersurface of the ambient product of projective spaces. An analytic subgroup A is locally parametrized by an analytic homomorphism from a finite-dimensional additive K-space. The order of P along A at a group point g is the vanishing order of P after composing local projective coordinates with the translated parametrization. This definition must be independent of the choice of nonzero local coordinate representatives.

Let Σ be a finite set of group points containing the identity. Its n-fold sumset Σ(n) consists of all sums of n, not necessarily distinct, elements of Σ; Σ(0) is the singleton identity. For a connected algebraic subgroup H, the integer s is the analytic codimension of A∩H in A. The expression |(Σ+H)/H| counts distinct H-cosets meeting Σ. Codimension concerns the analytic tangent dimension; it does not assert that the point-set intersection is finite.

The source's Hilbert degree form ℋ(V;D₁,…,Dᵣ) is (dim V)! times the highest homogeneous part of the multigraded Hilbert–Samuel polynomial of the projective closure of V, evaluated at the degrees. It must be constructed from the coordinate ring, rather than supplied as an arbitrary numerical function. For one projective factor it is deg(V)D^(dim V). These definitions are fixed in §§2–3 of the original paper.

Formalization targets

The completion target is all results of the paper, with an aggregate goal that requires their individual formal statements. Theorem 2.1 is one milestone within that target. For each fixed family of embedded group factors, it chooses positive integers cᵢ, each depending only on its corresponding embedding. These constants precede the analytic subgroup, the finite sampling set, the polynomial degrees, the polynomial, and the contact parameter T. If P has order at least nT+1 along A at every point of Σ(n), there is a connected algebraic subgroup H with

(T+ss) ∣(Σ+H)/H∣ H(H;D1,…,Dr)≤H(G;c1D1,…,crDr).\binom{T+s}{s}\, |(\Sigma+H)/H|\, \mathcal H(H;D_1,\ldots,D_r) \leq \mathcal H(G;c_1D_1,\ldots,c_rD_r).(sT+s​)∣(Σ+H)/H∣H(H;D1​,…,Dr​)≤H(G;c1​D1​,…,cr​Dr​).

The same H is contained in a translate of the zero locus of P on G and is incompletely defined by equations of multidegrees at most (c₁D₁,…,cᵣDᵣ): it is an irreducible component of the common zero locus in G of equations with those degree bounds. Both geometric conclusions are part of the target. A formalization retaining only the displayed numerical inequality would omit part of the original result.

The 1986 paper has 13 numbered results. Section 2 contains Theorem 2.1 and Corollaries 2.2–2.3, including the one-dimensional analytic result and the result for disjoint group factors. Section 3 contains Lemmas 3.1–3.2, Proposition 3.3 and Lemma 3.4. Section 4 contains Propositions 4.3–4.4, Lemmas 4.5–4.6 and Proposition 4.7. Section 5 contains Lemma 5.1. Every clause of these statements belongs to the mission.

Definitions 3.5, 4.1 and 4.2, the unnumbered setup, the internal Facts A–E, the counterexample after Proposition 3.3, and the mathematical claims in remarks also require coverage. Source numbers and page references identify the correspondence between the prose and Lean declarations. The 1987 addendum adds vanishing on every sampled translate of the subgroup and a converse polynomial construction; both are tracked with their own hypotheses and constants.

Eight milestones and the completion goal

The completion goal is PhilipponMultiplicity.paper_results, a conjunction of 26 concrete propositions. This is a collection goal requiring the source statements and the additional mathematical claims in the coverage record. It is separate from the paper's original Theorem 2.1, which remains individually named and reusable.

The mission has eight milestones; four are currently Proved:

SourceMilestoneStatus
Theorem 2.1General multiplicity estimate, with every geometric and numerical conclusion.Proved
Corollary 2.2One-dimensional analytic-subgroup consequence.Open
Corollary 2.3Consequence for disjoint group factors and sampling grids.Open
Proposition 3.3Multigraded intersection bounds, including the multiplicity-sensitive bound.Proved
Proposition 4.7Binomial lower bound for contact multiplicity.Proved
Lemma 5.1Stabilizer construction and the geometric counting estimate.Proved
1987 addendum, p. 398Strengthened vanishing on every sampled subgroup translate.Open
1987 addendum, p. 398Converse polynomial construction.Open

The full statement package has 27 compiled theorem statements: all thirteen numbered results, both addenda, eleven supporting or correction targets, and the aggregate goal. Fourteen admission-free definition bundles supply their actual geometric and algebraic objects. All 41 original statement and definition items have independent blind readbacks. The eight milestones above retain their existing identities.

The supporting clauses include Hilbert-polynomial existence, primary components and Facts A–E; the geometric interpretation of mixed degree; the actual counterexample after Proposition 3.3; translation operators and their comparison with intrinsic ideals; contact invariance; translation-invariance and embedding remarks; the component/stabilizer construction; counting estimates; and the exact Masser–Wüstholz Theorem I consequence claimed on p.361. Proof-internal recursive ideals and tangent/exponential arguments belong to their corresponding theorem proofs.

Source corrections are visible for review. Lemma 3.1 and Corollary 2.2 require positive equation degrees; explicit zero-degree counterexamples are required goal clauses. Both addenda require positive ambient dimension; the goal also requires their dimension-zero counterexamples. The three-generator ideal printed on p.370 is nonradical, contrary to the printed word “prime”; its valid degree-four versus length-six counterexample is preserved, together with an explicit nilpotent witness. Connectedness is stated in the translation-invariance and Lange reembedding remarks. These are mathematical corrections documented during the source comparison, beyond the author's 1987 errata. They are not silent changes to the source.

Fourteen individual targets now have checked proofs with no Open theorem inputs. The remaining twelve individual targets and the collection goal are Open. The existing proved local-algebra references remain reusable ingredients.

What a completed formalization enables

The output is a reusable development of the paper's multigraded commutative algebra, translation and differential operators, geometric multiplicity theory, and zero estimates. All source results are required for completion. A downstream Weierstrass application can consume a specialization of Theorem 2.1; its needs do not determine the scope or completion of this mission (example application).

These are established mathematical results whose proofs are being formalized. The complete original Theorem 2.1 has an accepted proof. The selected Weierstrass application uses individually named Philippon results, with its application-specific model and subgroup bridges proved in the Senthil mission. The remaining general results stay required even though that application is complete.

The foundational difficulty

Vanishing conditions need not be independent: many can occur on the same component or on translates with a nontrivial stabilizer. Counting coefficients of P therefore does not bound their total multiplicity. The development needs geometric degree for actual components, multiplicities measured by lengths of localized quotient rings, and uniform control of translations in fixed projective embeddings.

Proposition 3.3 supplies multigraded intersection bounds, Proposition 4.7 controls contact multiplicity, and Lemma 5.1 connects the stabilizer to the geometric counting estimate. These three results and Theorem 2.1 now have checked proofs. The remaining corollaries, general geometric and analytic claims, examples and addenda are independent deliverables. Application-specific contact results do not discharge the remaining general statements.

Formalization scope

The declarations use the namespace PhilipponMultiplicity. Source statements retain their conclusions, constants, quantifier order, and complex or ℓ-adic scope, with the visible boundary and wording corrections listed above. Intermediate specializations are labelled as such and do not discharge a more general source result. Natural-number and zero-degree conventions have been compared with the original scans; the discovered failures and corrected hypotheses are recorded explicitly for human review. Corrections and inferred conventions must be documented rather than silently changing the source.

The required definitions include embedded commutative algebraic groups and their connected subgroups; products of projective spaces and multihomogeneous coordinate rings; analytic local homomorphisms and intrinsic contact order; multigraded Hilbert polynomials and their degree forms; local component lengths; and finite coset counts. No model may assume the desired multiplicity inequality, hide it as a structure field, or replace geometric degree by an unconstrained function.

All 27 theorem statements and 14 definition bundles compile in Lean 4.33.1 with Mathlib revision 0df444a360eaa60ab8c11dca51a86af692955474. Source comparisons and independent readbacks document the fixed statements and their explicit corrections. The goal remains the concrete 26-part full-paper collection. The completed proofs supply reusable Hilbert theory, primary-component multiplicities, polynomial differential operators, bounded translation atlases and the Section 5 construction. Contributions to the remaining targets, including results unused by Senthil, complete the original scope.

Selected references

  • P. Philippon, Lemmes de zéros dans les groupes algébriques commutatifs, Bulletin de la Société Mathématique de France 114 (1986), 355–383. DOI and original paper.
  • P. Philippon, Errata et addenda à « Lemmes de zéros dans les groupes algébriques commutatifs », Bulletin de la Société Mathématique de France 115 (1987), 397–398. DOI and addendum.
  • Senthil Kumar K, Algebraic independence of values of Weierstrass elliptic and zeta functions, Proceedings of the Edinburgh Mathematical Society (2026), including Robert Tubbs's appendix. DOI.
193 thms2 active usersReviewed
AlgebraArithmetic Geometry·Captain: Lucas

Lectures on Analytic Geometry I: $\mathbb{Z}((T))_{>r}$ is a principal ideal domainTextbook

Motivation

Rings of arithmetic power series — power series with integer coefficients that converge on a disc of radius close to 111 — sit between algebra and analysis: an element has both archimedean zeros, in the complex disc, and non-archimedean ones, at ppp-adic points. Harbater (Convergent arithmetic power series, Amer. J. Math. 106 (1984), 801–846, DOI 10.2307/2374325) showed that a well-chosen ring of such series is a principal ideal domain and identified its prime ideals; the same ring is the arithmetic model of the closed disc of radius rrr in the adic space Spa(Z[[T]])\mathrm{Spa}(\mathbb{Z}[[T]])Spa(Z[[T]]).

The result was put to work in Clausen–Scholze's Lectures on Analytic Geometry (Lecture VII), where Z((T))>r\mathbb{Z}((T))_{>r}Z((T))>r​ supplies a two-term presentation of the real numbers as a condensed abelian group: for 0<r′<r<10 < r' < r < 10<r′<r<1 there is an exact sequence 0→Z((T))r→fr′Z((T))r→R→00 \to \mathbb{Z}((T))_r \xrightarrow{f_{r'}} \mathbb{Z}((T))_r \to \mathbb{R} \to 00→Z((T))r​fr′​​Z((T))r​→R→0, whose existence rests on the principality of the kernel of evaluation at r′r'r′. The quantitative refinement of that sequence (Propositions 7.2 and 7.3 of the notes) is what produces the ℓp\ell^pℓp-norms in the analytic ring structure on R\mathbb{R}R.

Setting

Fix a real number rrr with 0<r<10 < r < 10<r<1. An integral Laurent series is a family of integers (an)n∈Z(a_n)_{n \in \mathbb{Z}}(an​)n∈Z​ whose support is bounded below, written f=∑n≫−∞anTnf = \sum_{n \gg -\infty} a_n T^nf=∑n≫−∞​an​Tn; these form the ring Z((T))\mathbb{Z}((T))Z((T)) under coefficientwise addition and the Cauchy product.

Define

Z((T))>r  =  { ∑n≫−∞anTn  ∣  ∃ s>r, ∣an∣ s n→n→∞0 }  ⊆  Z((T)).\mathbb{Z}((T))_{>r} \;=\; \Big\{\, \sum_{n \gg -\infty} a_n T^n \;\Big|\; \exists\, s > r,\ |a_n|\, s^{\,n} \xrightarrow[n \to \infty]{} 0 \,\Big\} \;\subseteq\; \mathbb{Z}((T)).Z((T))>r​={n≫−∞∑​an​Tn​∃s>r, ∣an​∣snn→∞​0}⊆Z((T)).

Concretely, fff lies in Z((T))>r\mathbb{Z}((T))_{>r}Z((T))>r​ when the associated Laurent expansion converges on some punctured disc {0<∣y∣<s}\{0 < |y| < s\}{0<∣y∣<s} with s>rs > rs>r strictly larger than rrr — an overconvergence condition. For xxx a real or complex number, f(x)=∑nanx nf(x) = \sum_{n} a_n x^{\,n}f(x)=∑n​an​xn denotes the evaluation, whenever the family is summable.

Two features distinguish this ring from the classical Tate algebra. The coefficients are integers, not elements of a complete field, so reduction modulo a prime ppp is available and produces Fp((T))\mathbb{F}_p((T))Fp​((T)). And the condition is an overconvergence condition: the radius sss is required to be strictly larger than rrr, which is what makes the ring behave like the ring of functions on a closed disc rather than an open one.

Formalization targets

Goal

0<r<1  ⟹  Z((T))>r is a principal ideal domain.0 < r < 1 \;\Longrightarrow\; \mathbb{Z}((T))_{>r} \text{ is a principal ideal domain.}0<r<1⟹Z((T))>r​ is a principal ideal domain.

The ring is a subring of the domain Z((T))\mathbb{Z}((T))Z((T)), so integrality is automatic and the content of the goal is that every ideal is generated by one element.

The prime ideals (context, not a formalization target here)

Theorem 7.1 of the source also classifies the nonzero primes: kernels of evaluation at a complex xxx with 0<∣x∣≤r0 < |x| \le r0<∣x∣≤r (up to conjugation); the ideals (p)(p)(p) for ppp prime; and kernels of evaluation at a topologically nilpotent unit xxx of a finite extension of Qp\mathbb{Q}_pQp​ (up to Galois conjugacy). The milestones below formalize the parts of the classification that the principality proof actually consumes — surjectivity of the three evaluation maps, and principality of the archimedean kernels — and leave the full classification statement for a later mission in this series.

Significance

The result itself. Principality gives, for each point of the closed disc, a single equation cutting it out; that is exactly what the presentation 0→Z((T))r→Z((T))r→R→00 \to \mathbb{Z}((T))_r \to \mathbb{Z}((T))_r \to \mathbb{R} \to 00→Z((T))r​→Z((T))r​→R→0 needs. Downstream, that presentation is the input to the computation of measures on R\mathbb{R}R in the analytic-ring formalism, and the reason ℓp\ell^pℓp-spaces with p<1p < 1p<1 appear there at all. Without it, one has no finite free resolution of R\mathbb{R}R by rings of arithmetic functions, and the structure results of Lectures VI–VII of the source lose their computational base.

Formalizing it. The mathematics is classical and fully proved; nothing here is open. What is missing is a machine-checked version. Mathlib has Hahn series, Laurent series, complex analysis on discs, and the ppp-adic numbers, but nothing about arithmetic overconvergent series: not the ring itself, not the greedy expansions that make real evaluation surjective, not the invertibility criterion. Each milestone below is a self-contained piece of that missing theory, reusable outside this mission.

Difficulty

The obvious approach — Weierstrass preparation, as for the Tate algebra K⟨T⟩K\langle T\rangleK⟨T⟩ over a complete field KKK — does not apply: the coefficient ring Z\mathbb{Z}Z is not a field, and no single valuation controls it. An element of Z((T))>r\mathbb{Z}((T))_{>r}Z((T))>r​ must be divided simultaneously by archimedean generators (complex zeros in the disc) and ppp-adic ones, with the quotient required to stay integral and still overconvergent. Two steps carry the weight and fail for naive reasons:

  • Producing an integral generator for the kernel of evaluation at a real or complex xxx: one first needs a real polynomial g∈1+TnR[T]g \in 1 + T^n\mathbb{R}[T]g∈1+TnR[T] with xxx as its only zero in {0<∣y∣≤r}\{0 < |y| \le r\}{0<∣y∣≤r}, then a correction series hhh with small coefficients such that ghghgh has integer coefficients. Neither factor alone is integral.
  • Showing that an element of 1+TZ[[T]]1 + T\mathbb{Z}[[T]]1+TZ[[T]] with no zero in the closed disc of radius rrr is invertible in the ring: the inverse is integral for formal reasons, but its overconvergence is an analytic statement about the absence of zeros.

Finiteness — that a nonzero element lies in only finitely many of the listed maximal ideals — mixes the identity theorem for holomorphic functions with a ppp-adic Weierstrass argument, which is why the reduction and ppp-adic surjectivity milestones are prerequisites rather than side remarks.

Formalization scope

The ambient ring is Mathlib's LaurentSeries ℤ (Hahn series over Z\mathbb{Z}Z indexed by Z\mathbb{Z}Z), and Z((T))>r\mathbb{Z}((T))_{>r}Z((T))>r​ is given as a set of such series, cut out by the decay condition ∣an∣s n→0|a_n| s^{\,n} \to 0∣an​∣sn→0 as n→+∞n \to +\inftyn→+∞ for some s>rs > rs>r. Evaluations are unordered sums over Z\mathbb{Z}Z; where a statement asserts a value of an evaluation, summability is asserted alongside it, so the junk value of a divergent sum cannot be exploited.

Because the carrier is a set, the goal theorem is stated for an arbitrary subring of Z((T))\mathbb{Z}((T))Z((T)) whose underlying set is Z((T))>r\mathbb{Z}((T))_{>r}Z((T))>r​. That form would be vacuous if no such subring existed, which is precisely why the first milestone asserts its existence; the two together carry the intended content, and the mission is not considered advanced by the goal alone.

Milestone 6 formalizes only the case K=QpK = \mathbb{Q}_pK=Qp​ of part (3) of the source theorem (topologically nilpotent units of proper finite extensions of Qp\mathbb{Q}_pQp​ are out of scope, since Mathlib lacks the ambient theory of such extensions). Milestone 3 drops the "with multiplicity one" clause of the source and asserts only that the zero set in the punctured closed disc is {x}\{x\}{x}.

A complete development will need: closure of the decay condition under the Cauchy product; summability of evaluations on the closed disc; the identity theorem for the induced holomorphic functions; greedy xxx-adic expansions of real numbers with bounded integer digits; and ppp-adic expansions in the lattice generated by a topologically nilpotent unit. Contributions of any of these, as standalone lemmas, are welcome.

Selected references

  • D. Harbater, Convergent arithmetic power series, American Journal of Mathematics 106 (1984), 801–846. DOI 10.2307/2374325
  • P. Scholze (joint with D. Clausen), Lectures on Analytic Geometry, Bonn, 2019/20; Lecture VII, Theorem 7.1. PDF
  • P. Scholze (joint with D. Clausen), Lectures on Condensed Mathematics, Bonn, 2019. PDF
9 thms2 active usersReviewed
Algebra·Captain: Lucas

Schanuel's ConjectureOpen Problem

Motivation

Almost every classical transcendence theorem is a statement about the interaction between the additive structure of C\mathbb{C}C and the exponential function. Hermite proved in 1873 that eee is transcendental, Lindemann in 1882 that eαe^{\alpha}eα is transcendental for every nonzero algebraic α\alphaα — hence that π\piπ is transcendental and the circle cannot be squared — and Weierstrass in 1885 extended this to the linear independence of eα1,…,eαne^{\alpha_1},\dots,e^{\alpha_n}eα1​,…,eαn​ over Q‾\overline{\mathbb{Q}}Q​ for distinct algebraic αi\alpha_iαi​. Gelfond and Schneider settled Hilbert's seventh problem in 1934, and Baker's 1966 theorem on linear forms in logarithms made the subject effective.

Schanuel's conjecture, formulated by Stephen Schanuel in the 1960s and first published by Lang (Introduction to Transcendental Numbers, Addison–Wesley, 1966, Chapter III), is a single statement that contains all of these as special cases, together with a large number of statements that remain open — for instance that eee and π\piπ are algebraically independent, or that e+πe + \pie+π is irrational. No case of it is known beyond those already covered by the Lindemann–Weierstrass theorem or by Baker's theorem.

Timeline, with the hypotheses each result actually assumes:

  • 1882, Lindemann: eαe^{\alpha}eα is transcendental for algebraic α≠0\alpha \neq 0α=0.
  • 1885, Weierstrass: for pairwise distinct algebraic α1,…,αn\alpha_1,\dots,\alpha_nα1​,…,αn​, the values eα1,…,eαne^{\alpha_1},\dots,e^{\alpha_n}eα1​,…,eαn​ are linearly independent over Q‾\overline{\mathbb{Q}}Q​.
  • 1934, Gelfond and Schneider, independently: if λ≠0\lambda \neq 0λ=0 is a logarithm of an algebraic number and β\betaβ is algebraic and irrational, then eβλe^{\beta\lambda}eβλ is transcendental.
  • 1960s, Siegel, Lang and Ramachandra: the six exponentials theorem, unconditional; the analogous four exponentials statement is still open.
  • 1966, Baker: if logarithms λ1,…,λn\lambda_1,\dots,\lambda_nλ1​,…,λn​ of algebraic numbers are linearly independent over Q\mathbb{Q}Q, then 1,λ1,…,λn1,\lambda_1,\dots,\lambda_n1,λ1​,…,λn​ are linearly independent over Q‾\overline{\mathbb{Q}}Q​.
  • 1971, Ax: the function-field analogue of Schanuel's conjecture, for formal power series and, more generally, differential fields of characteristic zero.

Setting

Write exp⁡\expexp for the complex exponential function. A tuple z1,…,znz_1,\dots,z_nz1​,…,zn​ of complex numbers is linearly independent over Q\mathbb{Q}Q when the only rationals q1,…,qnq_1,\dots,q_nq1​,…,qn​ with ∑iqizi=0\sum_i q_i z_i = 0∑i​qi​zi​=0 are q1=⋯=qn=0q_1 = \dots = q_n = 0q1​=⋯=qn​=0; here C\mathbb{C}C is viewed as a vector space over Q\mathbb{Q}Q.

For a subset S⊆CS \subseteq \mathbb{C}S⊆C, let Q(S)\mathbb{Q}(S)Q(S) denote the subfield of C\mathbb{C}C generated by SSS over Q\mathbb{Q}Q. The transcendence degree trdeg⁡QQ(S)\operatorname{trdeg}_{\mathbb{Q}} \mathbb{Q}(S)trdegQ​Q(S) is the cardinality of a transcendence basis of Q(S)\mathbb{Q}(S)Q(S) over Q\mathbb{Q}Q: the largest number of elements of Q(S)\mathbb{Q}(S)Q(S) that are algebraically independent over Q\mathbb{Q}Q. A number xxx is transcendental over Q\mathbb{Q}Q when no nonzero polynomial with rational coefficients vanishes at xxx, and numbers x1,…,xmx_1,\dots,x_mx1​,…,xm​ are algebraically independent over Q\mathbb{Q}Q when no nonzero polynomial in mmm variables with rational coefficients vanishes at (x1,…,xm)(x_1,\dots,x_m)(x1​,…,xm​).

Formalization targets

Goal

z1,…,zn linearly independent over Q  ⟹  trdeg⁡QQ(z1,…,zn, ez1,…,ezn)  ≥  n.z_1,\dots,z_n \text{ linearly independent over } \mathbb{Q} \;\Longrightarrow\; \operatorname{trdeg}_{\mathbb{Q}} \mathbb{Q}\bigl(z_1,\dots,z_n,\,e^{z_1},\dots,e^{z_n}\bigr) \;\ge\; n .z1​,…,zn​ linearly independent over Q⟹trdegQ​Q(z1​,…,zn​,ez1​,…,ezn​)≥n.

The goal fixes no numerical constant and no special shape for the ziz_izi​: it asserts only the inequality, for every nnn and every Q\mathbb{Q}Q-linearly independent tuple. The case n=0n = 0n=0 is vacuous and the conclusion is a bound on a cardinal, so nothing is hidden in a degenerate convention.

Milestones

The milestone list consists of the landmark unconditional theorems that Schanuel's conjecture generalizes, the known function-field analogue, and one conditional corollary that records what the conjecture buys:

  • Hermite–Lindemann (1882): α\alphaα algebraic and nonzero ⇒\Rightarrow⇒ eαe^{\alpha}eα transcendental.
  • Lindemann–Weierstrass (1885): ∑iβieαi≠0\sum_i \beta_i e^{\alpha_i} \neq 0∑i​βi​eαi​=0 for distinct algebraic αi\alpha_iαi​ and algebraic βi\beta_iβi​ not all zero.
  • Gelfond–Schneider (1934): λ≠0\lambda \neq 0λ=0 a logarithm of an algebraic number, β\betaβ algebraic irrational ⇒\Rightarrow⇒ eβλe^{\beta\lambda}eβλ transcendental.
  • Six exponentials theorem: x1,x2x_1,x_2x1​,x2​ and y1,y2,y3y_1,y_2,y_3y1​,y2​,y3​ each Q\mathbb{Q}Q-linearly independent ⇒\Rightarrow⇒ at least one of the six numbers exiyje^{x_i y_j}exi​yj​ is transcendental.
  • Baker (1966): Q\mathbb{Q}Q-linearly independent logarithms of algebraic numbers, together with 111, are linearly independent over Q‾\overline{\mathbb{Q}}Q​.
  • Ax (1971), power series form: trdeg⁡CC(f1,…,fn,g1,…,gn)≥n+1\operatorname{trdeg}_{\mathbb{C}} \mathbb{C}(f_1,\dots,f_n,g_1,\dots,g_n) \ge n+1trdegC​C(f1​,…,fn​,g1​,…,gn​)≥n+1 when gi′=fi′gig_i' = f_i' g_igi′​=fi′​gi​, the gig_igi​ are units, and no nontrivial Q\mathbb{Q}Q-linear combination of the fif_ifi​ is constant.
  • Conditional corollary: Schanuel's conjecture implies that eee and π\piπ are algebraically independent over Q\mathbb{Q}Q.

Significance

Schanuel's conjecture decides, in one stroke, a long list of questions that are individually open: the algebraic independence of eee and π\piπ, the irrationality of e+πe+\pie+π and of eπe\pieπ, the transcendence of eee^{e}ee and ππ\pi^{\pi}ππ, the four exponentials conjecture, and — combined with work of Macintyre and Wilkie — the decidability of the first-order theory of the real exponential field. Its restriction to algebraic ziz_izi​ is exactly the Lindemann–Weierstrass theorem, and its restriction to ziz_izi​ whose exponentials are algebraic is exactly Baker's theorem, so the conjecture is a common generalization of the two main unconditional pillars of the subject.

On the formalization side, the state of the art in Lean's mathematical library is modest relative to this history: the analytic core of the Lindemann–Weierstrass argument is present, but the Hermite–Lindemann theorem, the Lindemann–Weierstrass theorem, the transcendence of π\piπ, the Gelfond–Schneider theorem, the six exponentials theorem and Baker's theorem are not available as usable statements in the pinned environment. Each milestone here is therefore a genuine formalization project with a known mathematical proof, and none of them is a restatement of an existing library result. The goal theorem itself is open mathematically; the realistic contributions to it are reductions — implications between the goal and other statements — and closing the milestones that the conjecture generalizes.

Difficulty

The obvious approach to any single case — build an auxiliary function with many zeros, bound its derivatives, and derive a contradiction from an integrality argument — is the method behind every result on the milestone list, and it is exactly what fails for the conjecture in general. Those proofs need the exponentials, or the arguments, to be algebraic somewhere, so that heights and denominators can be controlled; for a general Q\mathbb{Q}Q-linearly independent tuple there is no arithmetic input at all, and no known construction produces the required auxiliary function. Ax's theorem shows that the differential-algebraic shadow of the statement is true, but its proof uses the derivation on the function field and has no arithmetic counterpart. A solver should not expect the conjecture itself to fall to a variation of the classical method.

Formalization scope

All statements are over C\mathbb{C}C, with the complex exponential. Tuples are indexed by Fin n, ℚ-linear independence is Mathlib's LinearIndependent ℚ, transcendence degree is Mathlib's Algebra.trdeg, the generated field is IntermediateField.adjoin, and the inequality is between cardinals, so the goal reads (n : Cardinal) ≤ Algebra.trdeg ℚ (adjoin ℚ (Set.range z ∪ Set.range (Complex.exp ∘ z))). Algebraicity is IsAlgebraic ℚ, transcendence is Transcendental ℚ, and algebraic independence is AlgebraicIndependent ℚ.

There is no trivializing formalization here: the hypothesis LinearIndependent ℚ z is satisfiable for every nnn, so the goal is not vacuous, and the conclusion is an inequality of cardinals rather than a statement about a definition introduced for this mission.

The Ax milestone is stated for formal power series in one variable over C\mathbb{C}C: the exponential relation is expressed as the differential equation gi′=fi′gig_i' = f_i' g_igi′​=fi′​gi​ with PowerSeries.derivative, and the conclusion bounds Algebra.trdeg ℂ of the ℂ-subalgebra generated by the fif_ifi​ and the gig_igi​. The conditional corollary takes the full statement of Schanuel's conjecture as an explicit hypothesis, so it is provable unconditionally as stated.

Infrastructure that a complete development needs, and that is reusable well beyond this mission: Siegel's lemma and height machinery for algebraic numbers, the standard auxiliary-function construction with derivative bounds, and interface lemmas relating Algebra.trdeg, AlgebraicIndependent and Transcendental. Reductions between the milestones — for example deriving Hermite–Lindemann from Lindemann–Weierstrass, or the six exponentials theorem from a general Baker-type statement — are welcome as sketches.

Selected references

  • S. Lang, Introduction to Transcendental Numbers, Addison–Wesley, 1966. (Schanuel's conjecture is stated in Chapter III.)
  • A. Baker, Linear forms in the logarithms of algebraic numbers I, Mathematika 13 (1966), 204–216. https://doi.org/10.1112/S0025579300003971
  • J. Ax, On Schanuel's conjectures, Annals of Mathematics 93 (1971), 252–268. https://doi.org/10.2307/1970774
  • A. Macintyre and A. J. Wilkie, On the decidability of the real exponential field, in Kreiseliana, A K Peters, 1996, 441–467.
  • M. Waldschmidt, Diophantine Approximation on Linear Algebraic Groups, Springer, 2000.
  • Wikipedia, Schanuel's conjecture. https://en.wikipedia.org/wiki/Schanuel%27s_conjecture
39 thms2 active usersReviewed
Algebra·Captain: Lucas

Grothendieck-Teichmüller: the graded Lie algebra grt_1 and the Deligne-Drinfeld-Ihara conjectureOpen Problem

Motivation

The Grothendieck-Teichmüller group organises a family of symmetries that act on braided monoidal categories, on quantised universal enveloping algebras, on the little-discs operad, and on the ring of periods of the projective line minus three points. Three versions exist: a profinite one GT^\widehat{GT}GT, introduced by Grothendieck and Drinfeld and containing the absolute Galois group Gal(Q‾/Q)\mathrm{Gal}(\overline{\mathbb Q}/\mathbb Q)Gal(Q​/Q); a pro-ℓ\ellℓ one; and a pro-unipotent one GTGTGT, together with its graded companion GRTGRTGRT. This mission is about the graded, pro-unipotent side, which is the version that governs the homological-algebra and deformation-quantisation applications, and which is closest to a concrete, computable object: a Lie algebra of Lie polynomials in two variables, cut out by three explicit equations.

Its Lie algebra grt1\mathfrak{grt}_1grt1​ carries a distinguished family of elements σ3,σ5,σ7,…\sigma_3, \sigma_5, \sigma_7, \dotsσ3​,σ5​,σ7​,…, one in each odd degree at least 333, produced from the Knizhnik-Zamolodchikov associator. Deligne, Drinfeld and Ihara conjectured that grt1\mathfrak{grt}_1grt1​ is the free Lie algebra on such a family. A timeline of what is actually known:

  • 1990 - V. Drinfeld, On quasitriangular quasi-Hopf algebras and a group closely connected with Gal(Q‾/Q)\mathrm{Gal}(\overline{\mathbb Q}/\mathbb Q)Gal(Q​/Q), introduces GTGTGT, GRTGRTGRT, associators, and the defining equations of grt1\mathfrak{grt}_1grt1​; the Knizhnik-Zamolodchikov associator shows the set of associators is non-empty, hence σ3,σ5,…\sigma_3, \sigma_5, \dotsσ3​,σ5​,… exist and are non-zero.
  • 2012 - F. Brown, Mixed Tate motives over Z\mathbb ZZ (Annals of Mathematics 175, 949-976, doi:10.4007/annals.2012.175.2.10), proves that the ζf(r1,…,rn)\zeta^{\mathfrak f}(r_1,\dots,r_n)ζf(r1​,…,rn​) with rj∈{2,3}r_j \in \{2,3\}rj​∈{2,3} form a basis of the algebra of motivic multiple zeta values. One half of the conjecture follows: the Lie subalgebra of grt1\mathfrak{grt}_1grt1​ generated by the σ2p+1\sigma_{2p+1}σ2p+1​ is free on them.
  • The converse half - that these elements generate all of grt1\mathfrak{grt}_1grt1​ - is open.

Setting

Let F(x,y)\mathbb{F}(x,y)F(x,y) be the free Lie algebra over Q\mathbb QQ on two generators xxx and yyy, graded by total word length. For a Lie algebra AAA over Q\mathbb QQ and a,b∈Aa, b \in Aa,b∈A, write ψ(a,b)\psi(a,b)ψ(a,b) for the image of ψ∈F(x,y)\psi \in \mathbb{F}(x,y)ψ∈F(x,y) under the unique Lie algebra morphism sending x↦ax \mapsto ax↦a and y↦by \mapsto by↦b.

For n≥1n \ge 1n≥1, the Drinfeld-Kohno Lie algebra tn\mathfrak t_ntn​ is generated over Q\mathbb QQ by symbols tijt_{ij}tij​, 1≤i,j≤n1 \le i, j \le n1≤i,j≤n, subject to

tii=0,tij=tji,[tij,tkl]=0,[tij,tik+tjk]=0,t_{ii} = 0, \qquad t_{ij} = t_{ji}, \qquad [t_{ij}, t_{kl}] = 0, \qquad [t_{ij}, t_{ik} + t_{jk}] = 0,tii​=0,tij​=tji​,[tij​,tkl​]=0,[tij​,tik​+tjk​]=0,

the third relation for i,j,k,li,j,k,li,j,k,l pairwise distinct and the fourth for i,j,ki,j,ki,j,k pairwise distinct. It is the Lie algebra of infinitesimal braid relations: the associated graded of the pure braid Lie algebra, and the coefficient algebra of the Knizhnik-Zamolodchikov connection.

The graded Grothendieck-Teichmüller Lie algebra grt1\mathfrak{grt}_1grt1​ is the set of ψ∈F(x,y)\psi \in \mathbb{F}(x,y)ψ∈F(x,y) satisfying three equations:

ψ(x,y)=−ψ(y,x),\psi(x,y) = -\psi(y,x),ψ(x,y)=−ψ(y,x), ψ(x,y)+ψ(y,z)+ψ(z,x)=0where x+y+z=0,\psi(x,y) + \psi(y,z) + \psi(z,x) = 0 \quad \text{where } x + y + z = 0,ψ(x,y)+ψ(y,z)+ψ(z,x)=0where x+y+z=0, ψ(t12,t23)−ψ(t12,t23+t24)+ψ(t12+t13,t24+t34)−ψ(t13+t23,t34)+ψ(t23,t34)=0  in t4.\psi(t_{12},t_{23}) - \psi(t_{12},t_{23}+t_{24}) + \psi(t_{12}+t_{13},t_{24}+t_{34}) - \psi(t_{13}+t_{23},t_{34}) + \psi(t_{23},t_{34}) = 0 \ \text{ in } \mathfrak t_4 .ψ(t12​,t23​)−ψ(t12​,t23​+t24​)+ψ(t12​+t13​,t24​+t34​)−ψ(t13​+t23​,t34​)+ψ(t23​,t34​)=0  in t4​.

All three are linear in ψ\psiψ and degree preserving, so grt1\mathfrak{grt}_1grt1​ is a graded Q\mathbb QQ-subspace.

grt1\mathfrak{grt}_1grt1​ is not closed under the bracket of F(x,y)\mathbb{F}(x,y)F(x,y); it is closed under the Ihara (Poisson) bracket

{f,g}=[f,g]+Dfg−Dgf,\{f,g\} = [f,g] + D_f g - D_g f,{f,g}=[f,g]+Df​g−Dg​f,

where DfD_fDf​ is the derivation of F(x,y)\mathbb{F}(x,y)F(x,y) determined by Dfx=0D_f x = 0Df​x=0 and Dfy=[y,f]D_f y = [y,f]Df​y=[y,f]. Writing Der\mathrm{Der}Der for the Lie algebra of derivations of F(x,y)\mathbb{F}(x,y)F(x,y) under the commutator, the assignment f↦Dff \mapsto D_ff↦Df​ satisfies [Df,Dg]=D{f,g}[D_f, D_g] = D_{\{f,g\}}[Df​,Dg​]=D{f,g}​, and it is injective on grt1\mathfrak{grt}_1grt1​; this is the form in which the Lie structure of grt1\mathfrak{grt}_1grt1​ is expressed in the formal statements below.

Finally, for n1≥2n_1 \ge 2n1​≥2 and n2,…,nk≥1n_2,\dots,n_k \ge 1n2​,…,nk​≥1 the multiple zeta value is

ζ(n1,…,nk)=∑j1>j2>⋯>jk≥11j1n1j2n2⋯jknk.\zeta(n_1,\dots,n_k) = \sum_{j_1 > j_2 > \cdots > j_k \ge 1} \frac{1}{j_1^{n_1} j_2^{n_2} \cdots j_k^{n_k}} .ζ(n1​,…,nk​)=j1​>j2​>⋯>jk​≥1∑​j1n1​​j2n2​​⋯jknk​​1​.

These numbers are the coefficients of the Knizhnik-Zamolodchikov associator, which is why they enter a mission about grt1\mathfrak{grt}_1grt1​; they satisfy the stuffle and shuffle relations, whose common refinement (the double shuffle relations) is the arithmetic side of the same story.

Formalization targets

Goal - Deligne-Drinfeld-Ihara

∃ σ0,σ1,σ2,⋯∈grt1,deg⁡σp=2p+3,such that grt1 is the free Lie algebra on (σp)p≥0 for { ,}.\exists\, \sigma_0, \sigma_1, \sigma_2, \dots \in \mathfrak{grt}_1, \quad \deg \sigma_p = 2p+3, \quad \text{such that } \mathfrak{grt}_1 \text{ is the free Lie algebra} \text{ on } (\sigma_p)_{p \ge 0} \text{ for } \{\,,\}.∃σ0​,σ1​,σ2​,⋯∈grt1​,degσp​=2p+3,such that grt1​ is the free Lie algebra on (σp​)p≥0​ for {,}.

Concretely: the Lie algebra morphism from the free Lie algebra on countably many generators to Der\mathrm{Der}Der sending the ppp-th generator to DσpD_{\sigma_p}Dσp​​ is injective, and its image is exactly D(grt1)D(\mathfrak{grt}_1)D(grt1​). The statement fixes the degrees of the generators but not the generators themselves, which is the weakest form that still carries the content of the conjecture.

Milestone level - Brown's half

The same family exists with the morphism merely injective: the σ2p+1\sigma_{2p+1}σ2p+1​ generate a free Lie subalgebra. This is a theorem (Brown 2012); the open part of the goal is surjectivity.

Supporting levels

The Ihara bracket is a Lie bracket; grt1\mathfrak{grt}_1grt1​ is closed under it; the degree-333 element [x+y,[x,y]][x+y,[x,y]][x+y,[x,y]] lies in grt1\mathfrak{grt}_1grt1​; every odd degree ≥3\ge 3≥3 contains a non-zero element of grt1\mathfrak{grt}_1grt1​; multiple zeta values satisfy the stuffle and shuffle relations; and ζ(2,1)=ζ(3)\zeta(2,1) = \zeta(3)ζ(2,1)=ζ(3).

Significance

A positive answer would determine grt1\mathfrak{grt}_1grt1​ completely and, through the GTGTGT-GRTGRTGRT-associator torsor, describe the pro-unipotent Grothendieck-Teichmüller group by generators without relations. Downstream it would pin down the homotopy automorphisms of the rationalised little-discs operad and the Lie algebra of the motivic Galois group of mixed Tate motives over Z\mathbb ZZ up to the same freeness statement. Without it, even the dimension of grt1\mathfrak{grt}_1grt1​ in a given degree is only known to be bounded above by the Broadhurst-Kreimer style count, with equality unproved.

Formalizing this mission produces a machine-checked definition of tn\mathfrak t_ntn​, grt1\mathfrak{grt}_1grt1​ and the Ihara bracket - objects that have no Mathlib counterpart at present - and machine-checked proofs of the Lie-theoretic facts around them. Brown's theorem itself is proved in the literature but not formalized; the goal statement is genuinely open, and no part of this mission is closed by an existing Lean development known to the proposal.

Difficulty

The obvious approach to the goal - exhibit the generators and count dimensions degree by degree - fails in both directions. Upwards, no closed formula for σ2p+1\sigma_{2p+1}σ2p+1​ is known: they are extracted from the Knizhnik-Zamolodchikov associator, whose coefficients are regularised iterated integrals, and only their leading coefficients are controlled. Downwards, freeness of the subalgebra they generate is not an algebraic manipulation of the three defining equations: Brown derives it from the motivic theory of multiple zeta values, where the missing input is a basis theorem for a period algebra, not an identity in F(x,y)\mathbb{F}(x,y)F(x,y). Even the milestone "grt1\mathfrak{grt}_1grt1​ is closed under the Ihara bracket" is not a formality: the pentagon equation lives in t4\mathfrak t_4t4​ and must be transported through substitutions into a quotient Lie algebra.

Formalization scope

The formalization commits to the following conventions, all visible in the definition files.

  1. The base field is Q\mathbb QQ. The source works over a field KKK of characteristic zero; every statement here is over Q\mathbb QQ.
  2. grt1\mathfrak{grt}_1grt1​ is modelled inside the free Lie algebra FreeLieAlgebra ℚ (Fin 2), i.e. by Lie polynomials, not the completed Lie algebra F^(x,y)\widehat{\mathbb{F}}(x,y)F(x,y) of the source. The three defining equations are homogeneous, so the graded object determines the completed one; solvers should be aware that no topology or completion appears anywhere.
  3. tn\mathfrak t_ntn​ is the quotient of the free Lie algebra on ordered pairs of indices in Fin n by the Lie ideal generated by the four relation families above, so dkGen i j is ti+1,j+1t_{i+1,j+1}ti+1,j+1​ under the shift Fin 4 = {0,1,2,3} versus indices 1,2,3,41,2,3,41,2,3,4.
  4. Homogeneity is expressed by the rescaling characterisation: ψ\psiψ has degree nnn if ψ(cx,cy)=cnψ(x,y)\psi(cx,cy) = c^n \psi(x,y)ψ(cx,cy)=cnψ(x,y) for all c∈Qc \in \mathbb Qc∈Q. Over an infinite field this is equivalent to homogeneity for the word-length grading.
  5. The Ihara derivation uses Dfx=0D_f x = 0Df​x=0. The source writes Dfx=xD_f x = xDf​x=x in Remark 4.4 and in Section 7.3, but that convention contradicts Lemma 7.2 of the same notes and the computation {x,y}=[x,y]+[y,x]=0\{x,y\} = [x,y] + [y,x] = 0{x,y}=[x,y]+[y,x]=0 in Remark 7.2; Dfx=0D_f x = 0Df​x=0 is the convention under which both hold, and is the standard one.
  6. The Lie structure on grt1\mathfrak{grt}_1grt1​ is carried by the injection f↦Dff \mapsto D_ff↦Df​ into LieDerivation ℚ (FreeLieAlgebra ℚ (Fin 2)) (FreeLieAlgebra ℚ (Fin 2)), so that freeness can be stated as injectivity of a morphism out of a free Lie algebra without first installing a new Lie algebra structure. Note f↦Dff \mapsto D_ff↦Df​ is injective on grt1\mathfrak{grt}_1grt1​ but not on all of F(x,y)\mathbb{F}(x,y)F(x,y), where Dy=0D_y = 0Dy​=0; a supporting item records the injectivity actually used.
  7. Multiple zeta values are real numbers defined by an iterated tsum; for non-admissible words the series diverges and the definition returns Mathlib's junk value. Every statement about them therefore carries an admissibility hypothesis: all letters ≥1\ge 1≥1 and first letter ≥2\ge 2≥2. The stuffle and shuffle products are multisets of words, so no free module on words is needed.
  8. Nothing here is vacuous by construction: the defining equations of grt1\mathfrak{grt}_1grt1​ are linear conditions on a non-zero graded space, t4≠0\mathfrak t_4 \ne 0t4​=0, and the milestone [x+y,[x,y]]∈grt1[x+y,[x,y]] \in \mathfrak{grt}_1[x+y,[x,y]]∈grt1​, [x+y,[x,y]]≠0[x+y,[x,y]] \ne 0[x+y,[x,y]]=0 exhibits a non-zero element.

Contributions welcome: the Lie-theoretic milestones (Lemma 7.2, Corollary 7.1, closure of grt1\mathfrak{grt}_1grt1​, the degree-333 element) are self-contained and need no motivic input; the multiple zeta milestones need summability infrastructure for iterated series; Brown's theorem and the goal need a substantial development that does not yet exist in Lean.

Selected references

  • V. G. Drinfeld, On quasitriangular quasi-Hopf algebras and a group closely connected with Gal(Q‾/Q)\mathrm{Gal}(\overline{\mathbb Q}/\mathbb Q)Gal(Q​/Q), Leningrad Math. J. 2 (1991), 829-860.
  • F. Brown, Mixed Tate motives over Z\mathbb ZZ, Annals of Mathematics 175 (2012), 949-976, doi:10.4007/annals.2012.175.2.10.
  • T. Willwacher, The Grothendieck-Teichmüller Group, ETH Zürich lecture notes, 27 February 2014 (the source text for this mission).
  • T. Willwacher, M. Kontsevich's graph complex and the Grothendieck-Teichmüller Lie algebra, Invent. Math. 200 (2015), 671-760, doi:10.1007/s00222-014-0528-x.
15 thms2 active usersReviewed
Pure Mathematics·Captain: Lucas

Schinzel's Hypothesis HOpen Problem

Motivation

Almost every classical question about prime values of polynomials is a special case of one statement. Are there infinitely many twin primes? Infinitely many primes of the form n2+1n^2+1n2+1? Infinitely many Sophie Germain primes ppp with 2p+12p+12p+1 prime? Each asks whether a fixed finite list of integer polynomials takes prime values simultaneously infinitely often. Schinzel's Hypothesis H (A. Schinzel and W. Sierpiński, 1958) is the single conjecture that predicts "yes" in all these cases, subject to the two obvious obstructions: a polynomial that factors cannot be prime infinitely often, and neither can a family whose product is always divisible by some fixed prime.

Timeline.

  • 1837 — Dirichlet proves the degree-one, single-polynomial case: if gcd⁡(a,b)=1\gcd(a,b)=1gcd(a,b)=1 and a>0a>0a>0, then an+ban+ban+b is prime for infinitely many nnn.
  • 1857 — Bunyakovsky states the single-polynomial case for arbitrary degree. It is open for every fixed polynomial of degree ≥2\ge 2≥2; not one instance, not even n2+1n^2+1n2+1, is known.
  • 1904 — Dickson states the case of arbitrarily many linear polynomials.
  • 1958 — Schinzel and Sierpiński state Hypothesis H in the generality used here (Acta Arith. 4 (1958), 185–208).
  • 1962 — Bateman and Horn give the conjectural asymptotic count of such n≤Nn \le Nn≤N, refining Hypothesis H to a quantitative form (Math. Comp. 16 (1962), 363–367).
  • 1978 — Iwaniec proves that n2+1n^2+1n2+1 has at most two prime factors infinitely often; the sieve barrier that blocks "exactly one" has not been broken.
  • 2004 — Green and Tao prove the analogous simultaneous-prime statement for systems of linear forms of finite complexity, which yields arbitrarily long arithmetic progressions of primes but does not cover Dickson's conjecture in full (the pair nnn, n+2n+2n+2 has infinite complexity).
  • 2013 — Zhang, and then Maynard and Tao, establish bounded gaps between primes, i.e. that some admissible pair {n+h1,n+h2}\{n+h_1, n+h_2\}{n+h1​,n+h2​} is simultaneously prime infinitely often — but the method does not identify which pair.

Hypothesis H itself remains open in every case that is not covered by Dirichlet's theorem.

Setting

Work in the ring Z[X]\mathbb{Z}[X]Z[X] of polynomials with integer coefficients. Fix a finite set F⊆Z[X]\mathcal{F} \subseteq \mathbb{Z}[X]F⊆Z[X] of polynomials fff, each subject to the Bunyakovsky condition:

  • deg⁡f≥1\deg f \ge 1degf≥1;
  • the leading coefficient of fff is positive;
  • fff is irreducible in Z[X]\mathbb{Z}[X]Z[X].

Irreducibility in Z[X]\mathbb{Z}[X]Z[X] is strictly stronger than irreducibility in Q[X]\mathbb{Q}[X]Q[X]: it also forces the content of fff to be 111, ruling out 2X2+22X^2+22X2+2.

Even an irreducible family can be blocked by congruences. The polynomial X2+X+2X^2+X+2X2+X+2 is irreducible with positive leading coefficient, yet n2+n+2n^2+n+2n2+n+2 is even for every integer nnn, so it is prime only when it equals 222. The family F\mathcal{F}F therefore also has to satisfy the Schinzel condition: for every prime ppp there exists an integer nnn with

p∤∏f∈Ff(n).p \nmid \prod_{f \in \mathcal{F}} f(n).p∤f∈F∏​f(n).

Equivalently, no prime is a fixed divisor of the product ∏f∈Ff\prod_{f\in\mathcal{F}} f∏f∈F​f. A family satisfying both conditions is called admissible.

Target

For an admissible family F\mathcal{F}F, write

S(F)  =  { n∈N  :  ∣f(n)∣ is prime for every f∈F }.S(\mathcal{F}) \;=\; \{\, n \in \mathbb{N} \;:\; |f(n)| \text{ is prime for every } f \in \mathcal{F} \,\}.S(F)={n∈N:∣f(n)∣ is prime for every f∈F}.

The goal of the mission is Hypothesis H:

F admissible  ⟹  S(F) is infinite.\mathcal{F} \text{ admissible} \;\Longrightarrow\; S(\mathcal{F}) \text{ is infinite.}F admissible⟹S(F) is infinite.

The milestones are, in order: the linear one-polynomial case (Dirichlet); the reduction of the Schinzel condition to the finitely many primes p≤∑f∈Fdeg⁡fp \le \sum_{f\in\mathcal F}\deg fp≤∑f∈F​degf; the necessity of the Schinzel condition; and three specializations of the goal — Bunyakovsky's conjecture, the twin prime conjecture, and Landau's problem on n2+1n^2+1n2+1 — each stated as an implication from the goal statement, so that they can be proved before the goal itself is.

Significance

The result itself. Hypothesis H implies the twin prime conjecture, the Sophie Germain prime conjecture, Landau's conjecture that n2+1n^2+1n2+1 is prime infinitely often, the infinitude of primes in every admissible constellation, and Dickson's conjecture; with Bateman–Horn it also predicts the density of such nnn. Nothing beyond the degree-one case is known, and the conjecture is the standard yardstick against which sieve-theoretic progress on prime values of polynomials is measured.

Formalizing it. The goal is open, so the mission's deliverable is not a proof of it but a formal, audited statement of it together with a supporting environment: the admissibility predicates, the classical reductions, and machine-checked derivations of the famous corollaries from the goal. Dirichlet's theorem on primes in arithmetic progressions is already formalized in Mathlib, so the linear milestone is a matter of connecting that result to this mission's formulation rather than of new mathematics. The three "H implies …" milestones are provable now, unconditionally, because they are implications; they are also the sharpest available check that the goal statement has been formalized faithfully, since a mis-stated goal will usually fail to yield twin primes.

Difficulty

The obvious first idea — sieve the values ∏ff(n)\prod_{f} f(n)∏f​f(n) for n≤Nn \le Nn≤N and count survivors — is exactly the idea that fails. Sieve methods lose a constant factor (the parity problem): they can show that ∏ff(n)\prod_f f(n)∏f​f(n) has few prime factors infinitely often, but they cannot distinguish "one prime factor" from "two", which is why Iwaniec's n2+1n^2+1n2+1 result stops at P2P_2P2​. The analytic input that works for degree one — the nonvanishing of Dirichlet LLL-functions on ℜs=1\Re s = 1ℜs=1 — has no known analogue for a polynomial of degree ≥2\ge 2≥2, because the relevant counting problem is not governed by characters of a finite abelian group. Milestones 1–3 are elementary or already available in Mathlib; the goal itself is not expected to be resolved here.

Formalization scope

Conventions fixed by the Lean development, and deliberately so:

  • The family is a finite set of polynomials, so repeated polynomials collapse, and it is allowed to be empty (the goal is then a statement about all of N\mathbb{N}N, and true).
  • Primality is asserted of the absolute value ∣f(n)∣|f(n)|∣f(n)∣ as a natural number. Since the leading coefficient is positive and deg⁡f≥1\deg f \ge 1degf≥1, the values are eventually positive, so this is equivalent to asking for a positive prime value at all large nnn.
  • The variable nnn ranges over N\mathbb{N}N, not Z\mathbb{Z}Z, and "infinitely often" means that the set of such nnn is infinite.
  • Irreducibility is irreducibility in Z[X]\mathbb{Z}[X]Z[X] (so primitivity is included), and the degree hypothesis is deg⁡f≥1\deg f \ge 1degf≥1 in the sense of the natural-number degree.
  • The Schinzel condition is stated as a condition on the product over the family, quantified over all primes ppp — not over ppp up to a bound; milestone 2 is what reduces it to a finite check.

The statement admits no trivializing reading: the hypotheses are satisfiable (for example {X,X+2}\{X, X+2\}{X,X+2} and {X2+1}\{X^2+1\}{X2+1} are admissible, as milestones 5 and 6 require one to verify), so the goal is not vacuous, and the conclusion asserts infinitude rather than the existence of a single nnn.

A complete development needs the admissibility predicates (supplied as the mission's definition bundle), Mathlib's polynomial and modular-arithmetic APIs for the fixed-divisor arguments, and Mathlib's Dirichlet theorem for milestone 1. The definition bundle and milestones 2–3 are reusable for any future mission on Bateman–Horn, Dickson's conjecture, or prime constellations. Contributions of further conditional consequences of the goal (Sophie Germain primes, prime kkk-tuples, cousin primes) are welcome as additions to the tree.

Selected references

  • A. Schinzel and W. Sierpiński, Sur certaines hypothèses concernant les nombres premiers, Acta Arithmetica 4 (1958), 185–208. DOI
  • P. T. Bateman and R. A. Horn, A heuristic asymptotic formula concerning the distribution of prime numbers, Mathematics of Computation 16 (1962), 363–367. DOI
  • H. Iwaniec, Almost-primes represented by quadratic polynomials, Inventiones Mathematicae 47 (1978), 171–188. DOI
  • B. Green and T. Tao, The primes contain arbitrarily long arithmetic progressions, Annals of Mathematics 167 (2008), 481–547. arXiv:math/0404188
  • J. Maynard, Small gaps between primes, Annals of Mathematics 181 (2015), 383–413. arXiv:1311.4600
8 thms2 active usersReviewed
Captain: alexcarter

The Erdős–Straus Conjecture (Erdős Problem 242)Open Problem

Egyptian fractions and the Erdős–Straus question

A unit fraction is the reciprocal of a positive integer. The Erdős–Straus conjecture asks whether the particularly simple rational number 4/n4/n4/n always admits an expansion with three such terms. Its difficulty lies in obtaining a fixed number of terms for every denominator: general algorithms for Egyptian fractions do not give this three-term guarantee.

The conjecture is open. This mission adopts the exact statement maintained as Erdős Problem 242. It aims to formalize established reductions and provide a precise frontier for further work; it does not present a proof of the universal conjecture.

The historical formulations vary. Erdős’s 1950 paper, pp. 193–195, discusses distinct unit fractions and attributes the conjecture jointly to himself and Straus. His 1961 problem I.32, p. 238, allows positive denominators without specifying distinctness, while the 1979 statement, problem 9, p. 70, explicitly orders distinct denominators. The earliest published discussion may be Obláth’s 1950 paper, submitted in 1948; it attributes the question to Erdős, as explained by Bloom–Elsholtz, pp. 238–239.

The main developments relevant here are:

  • 1950: Obláth’s sufficient condition using a prime divisor of n+1n+1n+1 congruent to 333 modulo 444.
  • 1965–1969: Yamamoto’s congruence analysis and Mordell’s exposition reduce the remaining prime cases to six classes modulo 840840840.
  • 1970–1971: Vaughan bounds the density of possible exceptions; Terzi develops a stronger congruence sieve modulo 120120120120120120.
  • 2013–2022: Elsholtz–Tao analyze representation counts and soluble polynomial congruences; Bloom–Elsholtz give an explicit equivalent covering formulation.
  • 2025: Computational verification is reported through 101810^{18}1018. Pomerance–Weingartner study the more general Erdős–Straus–Schinzel problem, including quantitative dependence on a variable numerator.

The exact property

For a natural number nnn, write IsErdosStraus(n)\mathrm{IsErdosStraus}(n)IsErdosStraus(n) for the following literal property:

∃x,y,z∈N,1≤x<y<z,4n=1x+1y+1z.\exists x,y,z\in\mathbb N,\qquad 1\le x<y<z,\qquad \frac4n=\frac1x+\frac1y+\frac1z.∃x,y,z∈N,1≤x<y<z,n4​=x1​+y1​+z1​.

Every fraction is evaluated in Q\mathbb QQ. The predicate contains only these witnesses, inequalities, and equality. The required range of the conjecture is n>2n>2n>2; distinctness is part of the mathematical target. In particular, the prime 222 cannot simply be imported from a formulation permitting repeated denominators. The boundary value n=3n=3n=3 is included, with denominators 1,4,121,4,121,4,12.

Formalization targets

The unresolved root goal is

∀n∈N,n>2⟹IsErdosStraus(n).\forall n\in\mathbb N,\quad n>2\Longrightarrow\mathrm{IsErdosStraus}(n).∀n∈N,n>2⟹IsErdosStraus(n).

The supporting milestones concern established mathematics. Denominator clearing relates the rational equation to 4xyz=n(yz+xz+xy)4xyz=n(yz+xz+xy)4xyz=n(yz+xz+xy) under strict positivity. Positive scaling transports a solution for nnn to one for knknkn while preserving the strict order. An explicit even-number family supplies the case needed for the prime reduction.

The elementary families cover 3∣n3\mid n3∣n, n≡2(mod3)n\equiv2\pmod3n≡2(mod3), n≡3(mod4)n\equiv3\pmod4n≡3(mod4), and n≡5(mod8)n\equiv5\pmod8n≡5(mod8), with the displayed witnesses and their integrality and strict ordering recorded in separate statements. Together with the even case, they solve every n>2n>2n>2 outside 1(mod24)1\pmod{24}1(mod24). The useful reduction is an equivalence between the root goal and its restriction to primes p≡1(mod24)p\equiv1\pmod{24}p≡1(mod24); the ordinary prime reduction is also stated separately. The classical scaling and residue observations are discussed in Bloom–Elsholtz, p. 239.

Obláth’s milestone says that IsErdosStraus(n)\mathrm{IsErdosStraus}(n)IsErdosStraus(n) holds for n>2n>2n>2 whenever n+1n+1n+1 has a prime divisor q≡3(mod4)q\equiv3\pmod4q≡3(mod4). This condition is explicitly recorded in the introduction of Pomerance–Weingartner, which identifies the original Obláth reference. The exact distinctness requirement is retained in this mission.

The Mordell–Yamamoto milestone asks for a decomposition for every prime p>2p>2p>2 satisfying

p mod 840∉{1,121,169,289,361,529}.p\bmod840\notin\{1,121,169,289,361,529\}.pmod840∈/{1,121,169,289,361,529}.

The actual existence claim is the theorem to prove. It has no hypothesis asserting that these classes are covered. Yamamoto’s original paper, §§3–4, pp. 42–46, supplies the congruence framework and prints this residual list. The same list appears in the current Erdős Problems record. The list printed on p. 239 of Bloom–Elsholtz instead contains 494949 and omits 529529529; that discrepant list is not used here. The historical papers often permit repeated denominators, so producing distinct ordered witnesses is an explicit part of the formalization obligation.

What these results provide

The elementary infrastructure gives reusable certificates and transports for exact rational decompositions. The reductions identify a mathematically meaningful remaining domain without assuming the conjecture. Completion of the modulo-840840840 milestone would leave the prime cases in its six residual classes as the classical research frontier; those classes are not asserted to consist of counterexamples.

Later targets include Terzi’s 1971 sieve, whose publisher abstract reports 198 residual classes modulo 120120120120120120, and Vaughan’s density theorem, bounding the exceptional count by Xexp⁡(−c(log⁡X)2/3)X\exp(-c(\log X)^{2/3})Xexp(−c(logX)2/3) for a positive constant ccc. Neither is a core Lean statement in this draft. No unaudited list of 198 classes is supplied.

Elsholtz–Tao provide counting results and a classification of polynomially soluble congruences. Bloom–Elsholtz, Theorem 1, pp. 239–240, characterize their conjecture by coverage of all primes by classes

−a/c(mod4acd−1)(a,c,d≥1),-a/c\pmod{4acd-1}\quad(a,c,d\ge1),−a/c(mod4acd−1)(a,c,d≥1),

or

−(4c2d+1)/k(mod4cd)(c,d,k≥1, k∣4c2d+1).-(4c^2d+1)/k\pmod{4cd}\quad(c,d,k\ge1,\ k\mid4c^2d+1).−(4c2d+1)/k(mod4cd)(c,d,k≥1, k∣4c2d+1).

Here division by ccc denotes a modular inverse; division by kkk is exact integer division. The authors are Bloom and Elsholtz, not Bradford and Elsholtz. This is a later formalization target: an initial core theorem is not included until the translation between that paper’s denominator convention and the present strict convention is separately formalized. Pomerance–Weingartner address growing numerators in the generalized problem; their exceptions are not counterexamples to the fixed numerator 444 conjecture.

The remaining difficulty

Congruence identities prove infinite families only when the identities and their arithmetic hypotheses are established for arbitrary parameters. Checking finitely many representatives with a search program does not prove that all future values in an arithmetic progression work. Density estimates also allow an exceptional set and therefore do not settle the universal statement.

The current record cites Mihnea–Bogdan (2025) for computational verification through 101810^{18}1018. This is reported computational evidence, not a Lean-certified theorem in this mission. No universal conclusion or periodicity assertion is inferred from it.

Formalization scope

The development uses natural-number denominators, exact rational arithmetic, integer polynomial identities, divisibility, primality, and natural-number remainders. Definitions are transparent. The root is not hidden in a typeclass, structure field, certificate, or extra assumption, and its quantifier is not bounded. The existing Google DeepMind transcription is a statement reference, not an imported proof.

The draft targets Mathlib 0df444a360eaa60ab8c11dca51a86af692955474 with Lean 4.33.1. Every proposed statement has been locally elaborated and supplied with an independent read-back. Statement elaboration with sorry is not proof verification. The accompanying local proof audit distinguishes the proved supporting results from the open root and the remaining modulo-840840840 formalization task.

Selected references

  • Erdős, Az … egyenlet egész számú megoldásairól, Mat. Lapok 1 (1950), 192–210; original scan.
  • Erdős–Graham, Old and New Problems and Results in Combinatorial Number Theory (1980), chapter IV; author’s institutional scan.
  • Obláth, Sur l’équation diophantienne 4/n=1/x1+1/x2+1/x34/n=1/x_1+1/x_2+1/x_34/n=1/x1​+1/x2​+1/x3​, Mathesis 59 (1950), 308–316; bibliographic record, also cited in Pomerance–Weingartner.
  • Yamamoto, On the Diophantine Equation 4/n=1/x+1/y+1/z4/n=1/x+1/y+1/z4/n=1/x+1/y+1/z, Mem. Fac. Sci. Kyushu Univ. A 19 (1965), 37–47; original paper.
  • Mordell, Diophantine Equations, Academic Press (1969), chapter 30, pp. 287–290; publisher record.
  • Terzi (1971), Vaughan (1970), Elsholtz–Tao (2013), Bloom–Elsholtz (2022), Mihnea–Bogdan (2025), and Pomerance–Weingartner (2025/2026): primary sources linked at their statements above.
15 thms2 active usersReviewed
Captain: Community (Bot)

Congruent Numbers — Tunnell's Criterion (Even Case)Open Problem

Which whole numbers are the area of a right triangle with rational sides? This is the congruent number problem, and it is astonishingly old — tabulated in tenth-century Arabic manuscripts (5 and 6 were among the first known cases), taken up by Fibonacci in the thirteenth century, and the subject of Fermat's celebrated infinite-descent proof that 1 is not congruent. The modern reformulation is a jewel of arithmetic geometry: n is congruent precisely when the elliptic curve y² = x³ − n²x has a rational point of infinite order, that is, positive rank. In 1983 Jerrold Tunnell, writing in Inventiones Mathematicae, turned this into a near-algorithm — counting integer representations of n by certain ternary quadratic forms (which arise as coefficients of weight-3/2 modular forms) yields a simple congruence criterion that settles the question by a finite computation. The catch, and the reason the problem remains officially open, is that the sufficiency of Tunnell's criterion rests on the Birch and Swinnerton-Dyer conjecture, itself a Millennium Prize Problem. This mission formalizes the converse of Tunnell's theorem in the even case: for squarefree even n, the representation-count identity 2|C_n| = |D_n| — where C_n and D_n count integer solutions of n = 8x² + 2y² + 64z² and n = 8x² + 2y² + 16z² — implies that n is a congruent number.

3 thms2 active usersReviewed
Captain: Community (Bot)

Congruent Numbers — Tunnell's Criterion (Odd Case)Open Problem

Which whole numbers are the area of a right triangle with rational sides? This is the congruent number problem, and it is astonishingly old — tabulated in tenth-century Arabic manuscripts (5 and 6 were among the first known cases), taken up by Fibonacci in the thirteenth century, and the subject of Fermat's celebrated infinite-descent proof that 1 is not congruent. The modern reformulation is a jewel of arithmetic geometry: n is congruent precisely when the elliptic curve y² = x³ − n²x has a rational point of infinite order, that is, positive rank. In 1983 Jerrold Tunnell, writing in Inventiones Mathematicae, turned this into a near-algorithm — counting integer representations of n by certain ternary quadratic forms (which arise as coefficients of weight-3/2 modular forms) yields a simple congruence criterion that settles the question by a finite computation. The catch, and the reason the problem remains officially open, is that the sufficiency of Tunnell's criterion rests on the Birch and Swinnerton-Dyer conjecture, itself a Millennium Prize Problem. This mission formalizes the converse of Tunnell's theorem in the odd case: for squarefree odd n, the representation-count identity 2|A_n| = |B_n| — where A_n and B_n count integer solutions of n = 2x² + y² + 32z² and n = 2x² + y² + 8z² — implies that n is a congruent number.

3 thms2 active usersReviewed
Captain: Community (Bot)

Beal's ConjectureOpen Problem

In 1993 the Texas banker and self-taught number theorist Andrew Beal, tinkering on his own with generalizations of Fermat's Last Theorem, noticed a striking pattern: whenever A^x + B^y = C^z holds in positive integers with every exponent exceeding two, the bases A, B, C seem forced to share a common prime factor. Fermat's Last Theorem is exactly the slice x = y = z of this statement, so Beal's conjecture sweepingly generalizes one of history's most famous theorems. Beal backed his question with money, raising the prize from 5,000in1997to5,000 in 1997 to 5,000in1997to1,000,000, now held in trust by the American Mathematical Society. The conjecture is intimately tied to the Fermat–Catalan conjecture and the theory of the generalized Fermat equation, where 1/x + 1/y + 1/z < 1 forces only finitely many primitive solutions; individual exponent families such as (2,3,n) have been settled, often with the same Frey-curve and modularity machinery behind Wiles's proof, yet the full statement remains open. A clean formal statement turns this celebrated amateur's question into a shared, verifiable goal.

3 thms2 active usersReviewed
Captain: Lucas

Brocard's Problem: n! + 1 = m²Open Problem

Motivation

Brocard's problem asks for all natural numbers nnn such that n!+1n! + 1n!+1 is a perfect square. Henri Brocard raised the question in 1876 and again in 1885, and Srinivasa Ramanujan independently posed it in 1913 in the Journal of the Indian Mathematical Society. Only three solutions are known, and the problem is listed as Erdős problem #398 (erdosproblems.com/398). It is one of the simplest-looking Diophantine equations mixing a multiplicative object (the factorial) with an additive shift, and it is a standard test case for conjectures such as the abc conjecture.

Timeline

  • 1876, 1885 — Brocard asks whether n!+1=m2n! + 1 = m^2n!+1=m2 has solutions other than n=4,5,7n = 4, 5, 7n=4,5,7.
  • 1913 — Ramanujan poses the same question (Question 469, J. Indian Math. Soc.).
  • 1993 — Overholt shows that, conditionally on (a weak form of) the abc conjecture, the equation has only finitely many solutions (Wikipedia summary).
  • 2000 — Berndt and Galway report a computer search finding no solutions other than n=4,5,7n = 4, 5, 7n=4,5,7 for n<109n < 10^9n<109.
  • Later searches — the search bound was extended further (Matson, to 101210^{12}1012; Epstein and Glickman, to 101510^{15}1015), again without new solutions.

No unconditional proof of finiteness is known.

Setting

For a natural number nnn, the factorial is n!=1⋅2⋯nn! = 1 \cdot 2 \cdots nn!=1⋅2⋯n, with 0!=10! = 10!=1. A Brown number pair is a pair (n,m)(n, m)(n,m) of natural numbers with

n!+1=m2.n! + 1 = m^2 .n!+1=m2.

The three known pairs are (4,5)(4, 5)(4,5), (5,11)(5, 11)(5,11) and (7,71)(7, 71)(7,71), since 25=5225 = 5^225=52, 121=112121 = 11^2121=112 and 5041=7125041 = 71^25041=712.

For the conditional milestone, the radical rad⁡(N)\operatorname{rad}(N)rad(N) of a natural number NNN is the product of the distinct primes dividing NNN. The abc conjecture asserts: for every ε>0\varepsilon > 0ε>0 there is Kε>0K_\varepsilon > 0Kε​>0 such that for all positive integers a,b,ca, b, ca,b,c with gcd⁡(a,b)=1\gcd(a, b) = 1gcd(a,b)=1 and a+b=ca + b = ca+b=c,

c<Kε rad⁡(abc)1+ε.c < K_\varepsilon \, \operatorname{rad}(abc)^{1+\varepsilon}.c<Kε​rad(abc)1+ε.

Formalization targets

Goal — Brocard's problem

{(n,m)∈N2:n!+1=m2}={(4,5), (5,11), (7,71)}.\{(n, m) \in \mathbb{N}^2 : n! + 1 = m^2\} = \{(4, 5),\ (5, 11),\ (7, 71)\}.{(n,m)∈N2:n!+1=m2}={(4,5), (5,11), (7,71)}.

This says both that the three known pairs are solutions and that there are no others.

Milestones

  1. Known solutions: 4!+1=524! + 1 = 5^24!+1=52, 5!+1=1125! + 1 = 11^25!+1=112, 7!+1=7127! + 1 = 71^27!+1=712.
  2. Berndt–Galway search bound: if n<109n < 10^9n<109 and n!+1=m2n! + 1 = m^2n!+1=m2, then n∈{4,5,7}n \in \{4, 5, 7\}n∈{4,5,7}.
  3. Overholt (conditional finiteness): if the abc conjecture holds, then {(n,m):n!+1=m2}\{(n, m) : n! + 1 = m^2\}{(n,m):n!+1=m2} is finite.

Significance

A resolution would settle a question open since 1876 and would be one of the rare complete solutions of a factorial Diophantine equation of this kind. The conditional finiteness result is a standard illustration of how the abc conjecture controls equations of the form n!+A=m2n! + A = m^2n!+A=m2.

For the formalization, the known-solutions milestone is a finite computation. The search-bound milestone is a large verified computation; a machine-checked certificate for it would be a reusable artifact. The conditional finiteness milestone formalizes a published argument that assumes the abc conjecture as a hypothesis. The goal itself is an open problem; none of these statements is known to have a machine-checked proof on this platform at the time of drafting.

Difficulty

Congruence obstructions cannot rule out large solutions: for every modulus MMM and every n≥Mn \ge Mn≥M one has n!≡0(modM)n! \equiv 0 \pmod Mn!≡0(modM), so n!+1≡1=12(modM)n! + 1 \equiv 1 = 1^2 \pmod Mn!+1≡1=12(modM) is a square modulo MMM. Local arguments alone therefore cannot close the problem. The known finiteness argument depends on the abc conjecture, which is itself unproved in the standard form used here. Computer searches only give lower bounds on any further solution.

Formalization scope

  • Numbers are natural numbers (ℕ); mmm ranges over N\mathbb{N}N, so the sign of mmm is not an issue. The factorial is Mathlib's Nat.factorial, with 0!=10! = 10!=1.
  • The goal is stated as an equality of sets of ordered pairs in N×N\mathbb{N} \times \mathbb{N}N×N, so it cannot be satisfied by proving only one inclusion.
  • The radical is defined as the product over the prime factors of NNN (so rad⁡(0)=rad⁡(1)=1\operatorname{rad}(0) = \operatorname{rad}(1) = 1rad(0)=rad(1)=1; the value at 000 never enters since a,b,c>0a, b, c > 0a,b,c>0).
  • The abc conjecture is a Prop-valued definition used as a hypothesis in the conditional milestone; it is not asserted anywhere. The exponent 1+ε1 + \varepsilon1+ε is a real power.
  • Overholt's published result assumes only a weak form of abc; the milestone assumes the standard form, which implies the weak form, so the milestone is a consequence of the published result.
  • All declarations live in the namespace Brocard.

Selected references

  • H. Brocard, Question 166, Nouv. Corresp. Math. 2 (1876), 287; Nouv. Ann. Math. (3) 4 (1885), 391.
  • S. Ramanujan, Question 469, J. Indian Math. Soc. 5 (1913), 59.
  • M. Overholt, The Diophantine equation n!+1=m2n! + 1 = m^2n!+1=m2, Bull. London Math. Soc. 25 (1993), 104.
  • B. C. Berndt and W. F. Galway, On the Brocard–Ramanujan Diophantine equation n!+1=m2n! + 1 = m^2n!+1=m2, Ramanujan J. 4 (2000), 41–42.
  • Erdős problem #398: https://www.erdosproblems.com/398
  • Brocard's problem, Wikipedia: https://en.wikipedia.org/wiki/Brocard%27s_problem
  • Formal Conjectures (Google DeepMind): https://github.com/google-deepmind/formal-conjectures
15 thms1 active userReviewed
Captain: Lucas

Brocard's Conjecture: Four Primes Between Consecutive Prime SquaresOpen Problem

Motivation

For n≥1n \ge 1n≥1 let pnp_npn​ denote the nnn-th prime. Brocard's conjecture, named after Henri Brocard, asserts that for every n≥2n \ge 2n≥2 there are at least four primes strictly between pn2p_n^2pn2​ and pn+12p_{n+1}^2pn+12​ (Wikipedia). It belongs to the family of "primes between consecutive squares" problems together with Legendre's conjecture, and it is a concrete, elementary-looking question about short-interval prime distribution that remains open.

Timeline

  • Early 20th century — Brocard states the conjecture.
  • 2023 — L. A. Ferreira (arXiv:2307.08725) proves that the conjecture holds for all sufficiently large nnn.

Setting

Primes are listed in increasing order. In the Lean development the list is 0-indexed: Nat.nth Nat.Prime k is the kkk-th prime counting from 000, so nth 0 = 2, nth 1 = 3, nth 2 = 5, and so on. For an index nnn write prev=\mathrm{prev} = prev= n.nth Nat.Prime and next=\mathrm{next} = next= (n+1).nth Nat.Prime, two consecutive primes. The quantity of interest is

#{ q prime:prev2<q<next2 }.\#\{\, q \text{ prime} : \mathrm{prev}^2 < q < \mathrm{next}^2 \,\}.#{q prime:prev2<q<next2}.

Target

Milestone (Ferreira): for all sufficiently large indices nnn,

4≤#{ q prime:prev2<q<next2 }.4 \le \#\{\, q \text{ prime} : \mathrm{prev}^2 < q < \mathrm{next}^2 \,\}.4≤#{q prime:prev2<q<next2}.

Goal (Brocard's conjecture): the same inequality for every 0-indexed n≥1n \ge 1n≥1, i.e. for every pair of consecutive primes starting from (3,5)(3,5)(3,5).

Significance

A proof of the goal settles Brocard's conjecture outright. Given Ferreira's asymptotic result, the remaining work splits into making the threshold effective and closing the finite range below it, both of which would be new formal content; the milestone itself (formalizing Ferreira's analytic argument) is a substantial analytic-number-theory formalization project.

Difficulty

Unconditional results on primes in short intervals [x,x+xθ][x, x + x^{\theta}][x,x+xθ] only reach exponents θ\thetaθ well above 1/21/21/2, while the interval (pn2,pn+12)(p_n^2, p_{n+1}^2)(pn2​,pn+12​) has length about 2pngn2 p_n g_n2pn​gn​ where gn=pn+1−png_n = p_{n+1} - p_ngn​=pn+1​−pn​ can be small (e.g. twin primes), i.e. length on the order of the square root of its endpoint. Standard short-interval theorems therefore do not apply uniformly, and Legendre's conjecture — which would only give two primes here — is itself open.

Formalization scope

Everything is stated with Mathlib's Nat.nth Nat.Prime, Finset.Ioo (open interval, endpoints excluded) and Finset.filter Nat.Prime, followed by Finset.card. The hypothesis 1 ≤ n in the goal is the 0-indexed form of the source's "n≥2n \ge 2n≥2"; it is necessary, since for index 000 (primes 2,32, 32,3) the interval (4,9)(4, 9)(4,9) contains only the two primes 5,75, 75,7. The milestone uses Filter.atTop ("for all sufficiently large nnn"), with no explicit threshold. No custom definitions are required.

Selected references

  • Brocard's conjecture, Wikipedia. https://en.wikipedia.org/wiki/Brocard%27s_conjecture
  • L. A. Ferreira, Real exponential sums over primes and prime gaps, arXiv:2307.08725 (2023). https://arxiv.org/abs/2307.08725
  • Statement adapted from the Formal Conjectures project (Apache-2.0), file BrocardConjecture.lean.
4 thms1 active userReviewed
Dynamical SystemsProbability·Captain: mysticflounder

Tao 2022: Almost All Collatz Orbits Attain Almost Bounded ValuesResearch Paper

Motivation

The Collatz map sends an even positive integer nnn to n/2n/2n/2 and an odd one to 3n+13n+13n+1. The Collatz conjecture asserts that every orbit of this map eventually reaches 111. It remains an open problem.

Because the conjecture is open, a large part of the literature proves weaker statements that hold for almost all starting values. These results bound how small an orbit gets, not whether it reaches 111. They are the strongest unconditional evidence for the conjecture. Terence Tao's 2022 theorem is the strongest result of this type: outside a set of logarithmic density zero, every orbit drops below any prescribed function that tends to infinity, however slowly (Tao 2022).

Timeline

Attributions follow the survey in Tao 2022, Section 1. Here Colmin⁡(N)\mathrm{Col}_{\min}(N)Colmin​(N) is the least value in the orbit of NNN.

  • 1976 to 1979, Terras and Everett. Colmin⁡(N)<N\mathrm{Col}_{\min}(N) < NColmin​(N)<N for almost all NNN, in natural density.
  • 1979, Allouche. Colmin⁡(N)<Nθ\mathrm{Col}_{\min}(N) < N^{\theta}Colmin​(N)<Nθ for almost all NNN, for every θ>0.869\theta > 0.869θ>0.869.
  • 1994, Korec. The same bound for every θ>log⁡3/log⁡4≈0.7924\theta > \log 3/\log 4 \approx 0.7924θ>log3/log4≈0.7924.
  • 2019 preprint, 2022 publication, Tao. The power NθN^{\theta}Nθ is replaced by any f(N)→∞f(N) \to \inftyf(N)→∞, in logarithmic density instead of natural density (Forum of Mathematics, Pi 10, e12).
  • 2026, ProofAtlas. A complete machine-checked proof of Tao's theorem in Lean 4 is published (formalization record).

Setting

Let collatzStep:N→N\mathrm{collatzStep} : \mathbb{N} \to \mathbb{N}collatzStep:N→N be

collatzStep(n)={n/2n even,3n+1n odd.\mathrm{collatzStep}(n) = \begin{cases} n/2 & n \text{ even},\\ 3n+1 & n \text{ odd}. \end{cases}collatzStep(n)={n/23n+1​n even,n odd.​

Write collatzStep[k]\mathrm{collatzStep}^{[k]}collatzStep[k] for the kkk-fold iterate, with collatzStep[0](n)=n\mathrm{collatzStep}^{[0]}(n) = ncollatzStep[0](n)=n. The orbit of nnn is the set of values collatzStep[k](n)\mathrm{collatzStep}^{[k]}(n)collatzStep[k](n) for k≥0k \ge 0k≥0. It includes nnn itself.

The Syracuse map acts on odd integers. It sends an odd nnn to the odd part of 3n+13n+13n+1, which is syracuseStep(n)=(3n+1)/2ν2(3n+1)\mathrm{syracuseStep}(n) = (3n+1)/2^{\nu_2(3n+1)}syracuseStep(n)=(3n+1)/2ν2​(3n+1). The Syracuse orbit minimum syracuseOrbitMin(n)\mathrm{syracuseOrbitMin}(n)syracuseOrbitMin(n) is the least value syracuseStep[k](n)\mathrm{syracuseStep}^{[k]}(n)syracuseStep[k](n) over k≥0k \ge 0k≥0.

For a set AAA of positive integers and a real cutoff x≥2x \ge 2x≥2, the logarithmic mass of AAA up to xxx is

weightedLogMassReal(x)=1log⁡x∑1≤n≤xn∈A1n.\mathrm{weightedLogMassReal}(x) = \frac{1}{\log x} \sum_{\substack{1 \le n \le x \\ n \in A}} \frac{1}{n}.weightedLogMassReal(x)=logx1​1≤n≤xn∈A​∑​n1​.

A set of positive integers has logarithmic density ddd when this quantity tends to ddd as x→∞x \to \inftyx→∞. Since ∑n≤x1/n=log⁡x+O(1)\sum_{n \le x} 1/n = \log x + O(1)∑n≤x​1/n=logx+O(1), all positive integers together have logarithmic density 111, and the odd positive integers have logarithmic density 1/21/21/2.

A function f:N→Rf : \mathbb{N} \to \mathbb{R}f:N→R tends to infinity on positive inputs when for every real MMM there is an NNN such that f(n)>Mf(n) > Mf(n)>M for all n≥Nn \ge Nn≥N with n>0n > 0n>0.

Formalization targets

Goal: Tao's Theorem 1.3

For every fff that tends to infinity on positive inputs,

lim⁡x→∞1log⁡x∑1≤n≤x∃k, collatzStep[k](n)<f(n)1n=1.\lim_{x \to \infty} \frac{1}{\log x} \sum_{\substack{1 \le n \le x \\ \exists k,\ \mathrm{collatzStep}^{[k]}(n) < f(n)}} \frac{1}{n} = 1.x→∞lim​logx1​1≤n≤x∃k, collatzStep[k](n)<f(n)​∑​n1​=1.

This is the Lean theorem collatz_almost_bounded_logarithmic. It fixes no rate and no constant, so later improvements do not invalidate it.

Syracuse form: Tao's Theorem 1.6

For every fff that tends to infinity on odd positive inputs, the odd nnn whose Syracuse orbit contains a value below f(n)f(n)f(n) have logarithmic density 1/21/21/2, which is all of the odd integers. This is syracuse_almost_bounded_logarithmic.

Quantitative form: Tao's Theorem 3.1

There are constants C,c>0C, c > 0C,c>0 such that for all real M≥2M \ge 2M≥2 and x≥2x \ge 2x≥2,

1log⁡x∑1≤n≤x, n oddsyracuseOrbitMin(n)>M1n≤C(log⁡M)c.\frac{1}{\log x} \sum_{\substack{1 \le n \le x,\ n \text{ odd} \\ \mathrm{syracuseOrbitMin}(n) > M}} \frac{1}{n} \le \frac{C}{(\log M)^{c}}.logx1​1≤n≤x, n oddsyracuseOrbitMin(n)>M​∑​n1​≤(logM)cC​.

This is syracuse_uniform_logarithmic_tail_bound. The three targets are listed from weakest to strongest. In Tao's paper, the goal and Theorem 1.6 both follow from Theorem 3.1.

Significance

The result. Theorem 1.3 improves the earlier almost-all bounds on Collatz orbit minima from a power of NNN to any function that tends to infinity. For example, Colmin⁡(N)<log⁡log⁡log⁡log⁡N\mathrm{Col}_{\min}(N) < \log\log\log\log NColmin​(N)<loglogloglogN for almost all NNN. The theorem does not settle the conjecture. A single divergent orbit or nontrivial cycle is not excluded, because its predecessors form a set with bounded orbit minima.

The formalization. The theorem is proved, and a complete formalization already exists. The ProofAtlas record Tao's Almost-Bounded Collatz Orbits proves the statement taoAlmostBoundedColMin_checked with the same step map and an orbit that includes its starting value. That package has 397 first-party Lean files and about 124,000 source lines. ProofAtlas records a passing build with no sorry and the axiom profile propext, Classical.choice, Quot.sound. The source is released under the Apache-2.0 licence at commit d53c8de00056fb05999e44589f2399d7efa026e4, with copyright held by Advameg, Inc. It was built with Lean v4.30.0-rc2.

The remaining work for this mission is therefore a port, not new mathematics. The existing Lean development must be moved to Lean v4.33.1 and Mathlib 0df444a, and then connected to the goal statement above.

Difficulty

The mathematical difficulty is already resolved in the existing proof. The classical first-descent argument shows that a typical orbit drops below its starting value. Repeating that argument fails, because after one descent the new value is no longer distributed like a random integer of its size, and the error compounds at each repetition. That is why earlier results stop at a power bound NθN^{\theta}Nθ.

The difficulty of this mission is engineering. The port moves a development of about 124,000 lines forward across three minor Lean releases and the corresponding Mathlib changes. Lemma renames, deprecations, and changes in tactic behaviour must be repaired file by file without changing any statement.

Formalization scope

  • Step map. collatzStep n = if Even n then n / 2 else 3 * n + 1, so collatzStep(0)=0\mathrm{collatzStep}(0) = 0collatzStep(0)=0. This is the same definition as in the ProofAtlas source.
  • Orbit. The witness kkk ranges over all natural numbers, including k=0k = 0k=0.
  • Density. The goal uses weightedLogMassReal: a real cutoff xxx, the natural indices 0≤n≤⌊x⌋0 \le n \le \lfloor x \rfloor0≤n≤⌊x⌋, weights 1/n1/n1/n, and normalization by log⁡x\log xlogx. The ProofAtlas statement instead uses integer cutoffs and normalization by the harmonic sum ∑n≤N1/n\sum_{n \le N} 1/n∑n≤N​1/n. A short bridge between the two normalizations is part of the required work.
  • Threshold. The hypothesis on fff constrains only positive inputs. The value f(0)f(0)f(0) is irrelevant.
  • Non-triviality. The case k=0k = 0k=0 alone covers only inputs with n<f(n)n < f(n)n<f(n). For slowly growing fff this set is finite, so the goal is not satisfied by the starting value.

The goal is already reduced, through accepted proofs, to the single open statement syracuse_uniform_logarithmic_tail_bound. Two routes therefore close the mission. The first is to port the ProofAtlas development and prove the goal directly through the density bridge. The second is to prove Theorem 3.1 in its stated form. Contributions welcome include ported modules as reusable solutions, the density bridge, and a proof of Theorem 3.1. Every ported file must keep the Apache-2.0 notice and attribution to the ProofAtlas source.

Selected references

  • Terence Tao, Almost all orbits of the Collatz map attain almost bounded values, Forum of Mathematics, Pi 10 (2022), e12. https://doi.org/10.1017/fmp.2022.8 and https://arxiv.org/abs/1909.03562
  • ProofAtlas, Tao's Almost-Bounded Collatz Orbits, Lean 4 formalization, source commit d53c8de00056fb05999e44589f2399d7efa026e4, Apache-2.0, 2026. https://proofatlas.ai/formalizations/tao-almost-bounded-orbits/
  • Jeffrey C. Lagarias (editor), The Ultimate Challenge: The 3x+1 Problem, American Mathematical Society, 2010. https://bookstore.ams.org/MBK/78
3 thms1 active userReviewed
Captain: davidloeffler

Kriz–Nordentoft: Horizontal p-adic L-functionsResearch Paper

Motivation

Central values of twists of elliptic-curve and modular-form LLL-functions govern arithmetic questions ranging from Mordell--Weil ranks to the distribution of nonvanishing twists. Classical Iwasawa theory organizes twists whose conductors grow vertically through powers of one prime. Kriz and Nordentoft introduce a horizontal analogue in which the order of the character is fixed while its conductor acquires new prime factors. Their paper Horizontal p-adic L-functions constructs measures encoding these twists and proves a structure theorem that forces quantitative nonvanishing.

The mission formalizes the paper's common mechanism behind its nonvanishing theorems: Fourier theory of horizontal measures, norm-compatible modular-symbol theta elements, interpolation of central values, and propagation from nonzero measures to logarithmic-power lower bounds. The elliptic-curve statements in Theorems 1.1 and 1.2 are obtained in the paper by specializing this mechanism to weight-two newforms and adding the stated Galois-representation hypotheses.

Setting

Fix a prime ppp. The digit group is the compact product

Gp=∏n≥0Z/pZ.G_p=\prod_{n\ge 0}\mathbf Z/p\mathbf Z.Gp​=n≥0∏​Z/pZ.

A continuous character of GpG_pGp​ has finite image and factors through a finite product. For a complete algebraically closed nonarchimedean field KKK of residue characteristic ppp, a horizontal measure is represented in Lean by a continuous KKK-linear functional on the Banach space C(Gp,K)C(G_p,K)C(Gp​,K). Its Fourier transform is

ν^(χ)=∫Gpχ dν.\widehat\nu(\chi)=\int_{G_p}\chi\,d\nu.ν(χ)=∫Gp​​χdν.

The integral measures arising from the digit Iwasawa algebra have Fourier norms in a discrete geometric lattice. This is recorded explicitly by HasDiscreteFourierNorm; it is the norm-language counterpart of the discrete valuation hypothesis used in Corollary 2.9.

On the arithmetic side, modular symbols produce theta elements at finite squarefree conductors. Their projection maps do not initially form a compatible inverse system: an Euler factor appears each time a prime is removed. At an orderly prime this factor is a unit, so normalization produces a compatible system and hence a horizontal ppp-adic LLL-function. Evaluation at a character gives the modified central LLL-value of the corresponding twist.

Formalization targets

Finite-correction structure and interpolation

For every nonzero integral horizontal measure ν\nuν, there is a finite set MνM_\nuMν​ of characters and a constant c>0c>0c>0 such that

∣ν^(χχ0)∣p=c\lvert\widehat\nu(\chi\chi_0)\rvert_p=c∣ν(χχ0​)∣p​=c

for some χ0∈Mν\chi_0\in M_\nuχ0​∈Mν​, for every continuous character χ\chiχ. If ν\nuν interpolates modified central values, these corrected values are nonzero and have optimal ppp-adic size. This is Theorem 1.6, equivalently the digit-algebra case of Corollary 2.9, combined with Corollary 5.4.

Elliptic-curve specialization

For a modular elliptic curve over Q\mathbf QQ, the normalized theta system is assembled into the horizontal ppp-adic LLL-function of Definition 5.3 and shown to satisfy Corollary 5.4. The final milestones then specialize the structure and propagation theorems to prove Theorems 1.1 and 1.2 (assuming modularity), retaining the three alternative hypotheses of Theorem 1.1 and the jointly-good hypothesis for simultaneous nonvanishing in Theorem 1.2.

Quantitative propagation

If a fixed-order family has counting function bounded below by X/(log⁡X)1−αX/(\log X)^{1-\alpha}X/(logX)1−α and every character is related to a nonvanishing one by one of finitely many conductor-bounded corrections, the same lower bound holds for the nonvanishing subfamily. This isolates the formal content of Theorem 5.9 used in the applications of Section 5.4.

Significance

The structure theorem replaces one-variable Weierstrass preparation in an infinite-dimensional, non-noetherian Iwasawa algebra. It shows that the zero set of a nonzero horizontal measure is rigid enough that finitely many translations detect an optimal Fourier value everywhere. Through interpolation, this converts a single nonzero horizontal ppp-adic LLL-function into infinitely many nonzero complex central values with a quantitative lower bound.

A formal proof will add reusable infrastructure for nonarchimedean Fourier analysis on profinite products, finite group rings, inverse systems of theta elements, and character-counting asymptotics. None of these results currently has a machine-checked proof in Mathlib. The development is arranged so the analytic structure theorem and the modular-symbol construction can be attacked independently.

Difficulty

The central obstacle is that the horizontal Iwasawa algebra is neither noetherian nor reduced. A direct compactness or finite-generation argument on its spectrum is unavailable. At finite level, Fourier inversion introduces the group order into the valuation estimates; globally, one must control compatible finite quotients while keeping the exceptional correcting set finite. The arithmetic half has a separate normalization problem: raw theta elements satisfy norm relations only up to Euler factors, and interpolation must track imprimitive characters and the removed Euler factors exactly.

Formalization scope

The first version works with the exponent-ppp digit group GpG_pGp​, which is the setting of Theorem 1.6. Characters take values in the unit group of a complete algebraically closed ultrametric field KKK. Measures are continuous linear functionals on C(Gp,K)C(G_p,K)C(Gp​,K), and discreteness of integral Fourier values is an explicit hypothesis. The definition does not assume the finite-correction conclusion.

The modular-form layer is exposed through RawThetaSystem, ThetaSystem, and InterpolationDatum. Milestones must construct these data from genuine modular symbols and prove their norm and interpolation fields; merely postulating the desired nonvanishing values does not satisfy the goal. The quantitative statement uses an explicit eventual lower bound rather than asymptotic notation hidden behind an uninterpreted predicate.

Selected references

  • Daniel Kriz and Asbjørn Christian Nordentoft, Horizontal p-adic L-functions, arXiv:2310.20678v3, 2025. https://arxiv.org/abs/2310.20678
  • Yuri Manin, Periods of parabolic forms and p-adic Hecke series, Mathematics of the USSR-Sbornik 21 (1973). https://doi.org/10.1070/SM1973v021n03ABEH002016
  • Glenn Stevens, The cuspidal group and special values of L-functions, Transactions of the AMS 291 (1985). https://doi.org/10.1090/S0002-9947-1985-0797057-3

Current proof decomposition

The new definition node isolates the horizontal Iwasawa algebra and the interpolation interface. The first new milestone constructs a nonzero horizontal 222-adic LLL-function νE\nu_EνE​. The second milestone assumes such a pair (νE,νE≠0)(\nu_E,\nu_E\ne0)(νE​,νE​=0) and combines the horizontal-measure structure theorem, the Friedberg--Hoffstein quadratic seed, Corollary 5.10, and fixed-order character counting to obtain the lower bound in Theorem 1.1(1). The mission goal then follows immediately by applying the existence milestone and passing its witness to the implication milestone.

4 thms1 active userReviewed
Pure Mathematics·Captain: xbgxjack

Erdős Problem 287: Gaps Between Unit-Fraction DenominatorsOpen Problem

Motivation

A unit fraction is the reciprocal 1/n1/n1/n of a positive integer. The number 111 can be written as a sum of distinct unit fractions in infinitely many ways — 1=12+13+161 = \tfrac12+\tfrac13+\tfrac161=21​+31​+61​, 1=12+14+16+1121 = \tfrac12+\tfrac14+\tfrac16+\tfrac1{12}1=21​+41​+61​+121​, and so on — and the combinatorics of such representations is one of the oldest recurring themes in Erdős's problem lists. Most questions in the area concern size: how many terms are needed, how small the largest denominator can be, how large the smallest one must be. Erdős Problem 287 asks instead about the shape of a representation: how tightly can the denominators be packed?

Order the denominators increasingly and look at their consecutive differences. For 1=12+13+161 = \tfrac12+\tfrac13+\tfrac161=21​+31​+61​ the differences are 111 and 333. The question is whether a difference of at least 333 must always occur, in every representation of 111, no matter how many terms it has. The problem is recorded in Erdős and Graham's 1980 problem book (ErGr80, p. 33) and was selected for the booklet of favourite problems prepared for the 1999 Budapest conference on Erdős's mathematics ([Va99, 1.15]). It remains open.

Timeline. The weaker statement that some difference must be at least 222 — equivalently, that 111 is never the sum of the reciprocals of a block of consecutive integers — is classical. Theisinger (1915) proved that the harmonic number HnH_nHn​ is not an integer for n≥2n \ge 2n≥2, using Bertrand's postulate. Kürschák (1918) introduced the 222-adic argument that proves the general block statement: for m≤n−2m \le n-2m≤n−2, the difference Hn−HmH_n - H_mHn​−Hm​ is not an integer. Erdős's 1932 paper [Er32], whose title translates as "A generalisation of an elementary number-theoretic theorem of Kürschák", extends the result from blocks of consecutive integers to arithmetic progressions; the erdosproblems.com entry for Problem 287 cites it for the difference-≥2\ge 2≥2 bound. Nothing stronger appears to be known: the passage from 222 to 333 is the open part, and no partial result is recorded in the entry beyond a conditional one, namely that the conjecture would follow for all but finitely many exceptions if it were known that for every large NNN there is a prime p∈[N,2N]p \in [N, 2N]p∈[N,2N] with (p+1)/2(p+1)/2(p+1)/2 also prime.

Setting

Fix an integer k≥2k \ge 2k≥2 and integers

1<n1<n2<⋯<nk1 < n_1 < n_2 < \cdots < n_k1<n1​<n2​<⋯<nk​

with

1  =  1n1+1n2+⋯+1nk,1 \;=\; \frac{1}{n_1} + \frac{1}{n_2} + \cdots + \frac{1}{n_k},1=n1​1​+n2​1​+⋯+nk​1​,

the sum taken in Q\mathbb{Q}Q. Call such a tuple a representation of length kkk. The denominators are strictly increasing, hence distinct, and all exceed 111: the value n1=1n_1 = 1n1​=1 is excluded because 1/11/11/1 already exhausts the total. The gaps of the representation are the k−1k-1k−1 consecutive differences ni+1−nin_{i+1} - n_ini+1​−ni​ for 1≤i≤k−11 \le i \le k-11≤i≤k−1, and its maximal gap is max⁡i(ni+1−ni)\max_i (n_{i+1} - n_i)maxi​(ni+1​−ni​).

Representations exist for every k≥3k \ge 3k≥3, and for k=1k = 1k=1 only the excluded n1=1n_1 = 1n1​=1; no representation of length 222 exists. Examples: (2,3,6)(2,3,6)(2,3,6) with gaps 1,31, 31,3; (2,4,6,12)(2,4,6,12)(2,4,6,12) with gaps 2,2,62,2,62,2,6; (3,4,6,10,12,15)(3,4,6,10,12,15)(3,4,6,10,12,15) with gaps 1,2,4,2,31,2,4,2,31,2,4,2,3.

Formalization targets

Goal — Erdős Problem 287

every representation 1<n1<⋯<nk (k≥2) of 1 satisfies max⁡1≤i<k(ni+1−ni)  ≥  3.\text{every representation } 1 < n_1 < \cdots < n_k \ (k \ge 2) \text{ of } 1 \text{ satisfies } \max_{1 \le i < k} (n_{i+1} - n_i) \;\ge\; 3.every representation 1<n1​<⋯<nk​ (k≥2) of 1 satisfies 1≤i<kmax​(ni+1​−ni​)≥3.

This is the open conjecture, stated with no bound on kkk and no restriction on the denominators beyond those in Setting. It is the weakest form that captures the question: asserting a bound for one particular kkk, or for denominators in some range, would be a different and strictly easier statement.

Milestone — the gap-two bound (Kürschák; Erdős [Er32])

every representation satisfies max⁡1≤i<k(ni+1−ni)  ≥  2.\text{every representation satisfies } \max_{1 \le i < k}(n_{i+1} - n_i) \;\ge\; 2.every representation satisfies 1≤i<kmax​(ni+1​−ni​)≥2.

Equivalently: no block of two or more consecutive integers has reciprocals summing to 111. This is closed mathematics and the natural first target.

Milestone — the classical block theorem (Kürschák)

for n≥1 and k≥2,∑i=0k−11n+i∉Z.\text{for } n \ge 1 \text{ and } k \ge 2, \qquad \sum_{i=0}^{k-1} \frac{1}{n+i} \notin \mathbb{Z}.for n≥1 and k≥2,i=0∑k−1​n+i1​∈/Z.

The gap-two bound is an immediate consequence, since a representation all of whose gaps equal 111 is exactly a block of consecutive integers.

Milestone — sharpness

1=12+13+16 is a representation all of whose gaps are at most 3.1 = \tfrac12+\tfrac13+\tfrac16 \text{ is a representation all of whose gaps are at most } 3.1=21​+31​+61​ is a representation all of whose gaps are at most 3.

So the constant 333 in the goal is optimal and cannot be replaced by 444.

Significance

The result itself. A positive answer would say that a representation of 111 by unit fractions can never have all its denominators within distance 222 of each other — a structural constraint of a kind that the size-based results in this area do not provide. The conditional route recorded on the problem page is instructive about where the difficulty sits: it reduces the conjecture, up to finitely many exceptions, to the existence of primes ppp in [N,2N][N,2N][N,2N] with (p+1)/2(p+1)/2(p+1)/2 prime, a statement of Bertrand-with-extra-structure type that is itself out of reach of current technology. A direct proof would therefore either bypass that route or resolve the conjecture for the remaining cases by different means.

Formalizing it. The gap-two bound and the block theorem behind it are closed mathematics, so the honest description of that part of this mission is formalization, not research. It is nevertheless not already available: Mathlib proves Theisinger's case harmonic_not_int, that Hn∉ZH_n \notin \mathbb{Z}Hn​∈/Z for n≥2n \ge 2n≥2, but not Kürschák's block version Hn−Hm∉ZH_n - H_m \notin \mathbb{Z}Hn​−Hm​∈/Z, which is the form Problem 287 needs. Supplying it is a genuine strengthening of the library's existing development and is reusable for any question about reciprocal sums over intervals. The goal itself is open, and this mission does not claim otherwise: it is registered with an open proof, and the milestones are what a solver can realistically close today.

Difficulty

The obvious first idea — bound the number of terms, then check finitely many cases — fails immediately, because kkk is unbounded: representations of 111 exist with arbitrarily many terms, so no finite computation can settle the conjecture. The second idea, extending the 222-adic argument that gives the gap-two bound, also fails, and instructively. That argument works because a block of consecutive integers contains exactly one element of maximal 222-adic valuation, which leaves the total with negative valuation. Once gaps of size 222 are permitted the denominators may be chosen to avoid that configuration — for instance all even, as in (2,4,6,12)(2,4,6,12)(2,4,6,12) — and the valuation obstruction disappears. There is no evident replacement prime or weighting that rules out all gap-≤2\le 2≤2 configurations simultaneously, and the conditional result quoted above suggests why: the known routes pass through the distribution of primes in short intervals with a multiplicative side condition, rather than through a congruence obstruction.

Formalization scope

A representation is encoded as a function f:N→Nf : \mathbb{N} \to \mathbb{N}f:N→N together with the hypotheses ∀ i < k, 1 < f i and ∀ i j, i < j → j < k → f i < f j, and the requirement ∑ i ∈ Finset.range k, (1 : ℚ) / f i = 1. Only the values of fff below kkk are constrained; the function is not required to be monotone or bounded elsewhere, and nothing outside the window is used. The conclusion is ∃ i, i + 1 < k ∧ 3 ≤ f (i + 1) - f i, the existential form of "the maximal gap is at least 333"; the subtraction is natural-number subtraction, which is harmless because fff is increasing on the window, so no truncation can occur. The sum is a rational equality, not an approximation.

The statement admits no trivializing reading. The hypothesis 1 < f i is essential and is not vacuous — dropping it would admit f 0=1f\,0 = 1f0=1, k=1k = 1k=1; the strict monotonicity is what makes the gaps well defined and the denominators distinct; and k ≥ 2 guarantees that at least one gap exists, so the conclusion is not an empty existential. Asserting exactly 333 rather than at least 333 would be false, as (2,4,6,12)(2,4,6,12)(2,4,6,12) has a gap of 666.

Infrastructure: the block theorem is proved from Mathlib's padicNorm and padicValNat API — padicNorm.add_eq_max_of_ne, padicNorm.sum_lt', padicNorm.not_int_of_not_padic_int, pow_padicValNat_dvd and pow_succ_padicValNat_not_dvd — and needs no new definitions. That development is reusable beyond this mission and is a candidate for upstreaming to Mathlib alongside harmonic_not_int. Contributions are welcome on any milestone independently; a formalization of the conditional reduction to primes ppp with (p+1)/2(p+1)/2(p+1)/2 prime would also be a valuable addition, and is not included as a milestone here only because the problem page states it too briefly to formalize faithfully without consulting a primary source.

Selected references

  • P. Erdős, Egy Kürschák-féle elemi számelméleti tétel általánosítása (A generalisation of an elementary number-theoretic theorem of Kürschák), Mat. és Phys. Lapok 39 (1932), 17–24.
  • P. Erdős and R. L. Graham, Old and new problems and results in combinatorial number theory, Monographies de L'Enseignement Mathématique, Geneva, 1980, p. 33. scan
  • Various, Some of Paul's favorite problems, booklet for the conference "Paul Erdős and his mathematics", Budapest, July 1999, item 1.15.
  • K. Conrad, The ppp-adic growth of harmonic sums, expository notes (Theorem 2 is Kürschák's block theorem, with the 222-adic proof). pdf
  • T. F. Bloom, Erdős Problem #287, erdosproblems.com/287.
13 thms1 active userReviewed
Captain: xuanji

There is no Diophantine quintupleResearch Paper

Motivation: when pairwise square conditions limit a set

Diophantine equations ask for integer solutions to arithmetic equations. One family of questions starts with a set of positive integers and imposes the same condition on every pair: their product, increased by one, must be a square. The question is how many distinct integers can satisfy all those conditions together. It connects a simple definition with a global restriction on simultaneous integer solutions.

The paper There is no Diophantine quintuple, by Bo He, Alain Togbé, and Volker Ziegler, resolves the nonexistence question for sets of five elements. This mission targets its headline result, Theorem 1 in Section 1. The mathematical theorem is proved in the paper; the remaining goal is a complete Lean proof of that result.

Setting: positive integers and pairwise perfect squares

A perfect square is an integer of the form r2r^2r2 for a natural number rrr. A Diophantine mmm-tuple is a set of mmm distinct positive integers such that the product of any two different members, plus one, is a perfect square. Here mmm records the number of elements, not a bound on their sizes. A Diophantine quintuple would have exactly five members (definition in Section 1).

Write those five integers as a1,…,a5a_1,\ldots,a_5a1​,…,a5​. Positivity means ai>0a_i>0ai​>0 for every index. Distinctness means ai≠aja_i\ne a_jai​=aj​ whenever i≠ji\ne ji=j. The square condition requires a possibly different square root for each pair. There is no requirement that the ten square roots coincide, be distinct, or satisfy an additional ordering condition.

The theorem concerns positive integers. Replacing them by rational numbers changes the question. Likewise, allowing zero changes the admissible objects, and allowing repeated entries ceases to represent a five-element set. These domain choices are explicit in the formal target.

Formalization target: no Diophantine quintuple

The single goal is the following nonexistence statement:

∄ a1,…,a5∈Z>0[(∀i≠j, ai≠aj) ∧ (∀ 1≤i<j≤5, ∃rij∈N, aiaj+1=rij,2)].\nexists\,a_1,\ldots,a_5\in\mathbb Z_{>0}\quad \left[ (\forall i\ne j,\ a_i\ne a_j) \ \land\ (\forall\,1\le i<j\le5,\ \exists r_{ij}\in\mathbb N,\ a_i a_j+1=r_{ij}^{,2}) \right].∄a1​,…,a5​∈Z>0​[(∀i=j, ai​=aj​) ∧ (∀1≤i<j≤5, ∃rij​∈N, ai​aj​+1=rij,2​)].

This is Theorem 1 of the paper. The mission's goal is the existing declaration no_diophantine_quintuple.

The integers are unrestricted in size. The target does not fix the smallest entry, require a particular triple among the entries, or assume that an entry falls below a numerical search threshold. A proof must cover every quintuple satisfying the stated domain conditions.

Significance: an exact obstruction to larger sets

The result rules out an entire class of simultaneous square equations. As an immediate consequence, any set of distinct positive integers satisfying the same pairwise condition has at most four elements: a larger set would contain five distinct members that inherit the condition. This consequence explains why the five-element statement also constrains larger configurations.

A completed formalization would supply a reusable theorem that can be invoked whenever five distinct positive integers and their pairwise square witnesses arise. It would turn the informal nonexistence claim into a checked contradiction from precisely those hypotheses. The published statement is currently open for a Lean proof; its successful compilation verifies that the statement is well formed, not that the theorem has been proved.

Difficulty: the quantifier over all positive integers

Testing examples cannot establish this target by itself. Any computation with a fixed search limit addresses only a bounded collection, while the statement quantifies over all positive integers. A formal proof that uses a finite computation must also establish why the computation covers every possible case.

The conditions are simultaneous: each entry participates in four pairwise equations. Solving or excluding one isolated pair does not by itself settle whether all ten equations can hold together. The paper's proof overview in Section 2 describes the arithmetic estimates and computational components behind its result. Formalizing those components entails checking their hypotheses and connecting their conclusions to the unrestricted goal.

Formalization scope: five indexed natural numbers

The Lean declaration represents the entries by a function a : Fin 5 → Nat. It places the existence of that function under a negation and includes three conditions: every value is positive, different indices have different values, and every pair of different indices has a natural-number square witness.

The square condition is written for all unequal indices. This is equivalent to the usual condition for increasing pairs because multiplication is commutative. No increasing ordering of the five values is imposed. A development using sorted entries must justify its connection to this unrestricted indexed representation.

The root statement needs only Lean's core natural numbers, finite index type, arithmetic, and logic. It introduces no custom predicate whose meaning could hide additional assumptions. A complete proof may use Mathlib and reusable supporting results about integer arithmetic, squares, and the arithmetic tools required by the chosen argument. Supporting declarations should state their hypotheses explicitly and ultimately connect to this exact root theorem. Contributions establishing the known result, including an alternative rigorous proof, are within scope.

Selected references

  • Bo He, Alain Togbé, and Volker Ziegler, There is no Diophantine quintuple, arXiv preprint, 2016; revised 2018, arXiv:1610.04020v2. Paper. The target is Section 1, Theorem 1; the definition precedes it, and Section 2 gives the proof overview.
1 thm1 active userReviewed
Captain: OmkarMohanty

Opperman ConjectureOpen Problem

For every integer

n>1n > 1n>1

, there exists a prime p such that

n2<p<n2+nn ^2 < p < n^2 + nn2<p<n2+n
1 thm1 active userReviewed
Captain: Community (Bot)

The Twin Prime ConjectureOpen Problem

Among the most enduring mysteries in number theory is whether the primes keep producing twins — pairs like (11, 13) or (17, 19) that differ by exactly two — no matter how far out one looks. The general form was set down by Alphonse de Polignac in 1849, and the first deep theorem came from Viggo Brun in 1915, who proved that the reciprocals of the twin primes converge to a finite value, now called Brun's constant; in doing so he invented modern sieve theory and showed that twins must thin out even if there are infinitely many. Hardy and Littlewood went further, conjecturing a precise density of about 2C₂·x/(ln x)² for the count of twins below x. For nearly a century the infinitude itself stood untouched, until Yitang Zhang's stunning announcement on 17 April 2013 that some gap below 70 million recurs infinitely often — the first finite bound ever proved. A Polymath collaboration led by Terence Tao, together with James Maynard's independent multidimensional sieve, soon drove that bound down to 246, where it still stands. Closing the gap all the way to 2 — the twin prime conjecture itself — remains open. This mission states it cleanly: the set of primes p for which p + 2 is also prime is infinite.

3 thms1 active userReviewed
PreviousPage 2 of 3Next

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me