The study of the integers and the structures built from them — prime numbers, and the rational, algebraic, and p-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 L-functions.
Missions
Captain: Lucas
Chebotarëv's Density Theorem (Stevenhagen–Lenstra 1996)Research Paper
Motivation
Given a monic polynomial f with integer coefficients, one can reduce it modulo each prime p and factor it over the finite field Fp. The way f factors changes with p, 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 with a minimum of terminology.
Timeline.
1837 — Dirichlet: primes are equidistributed (in analytic density) over the invertible residue classes modulo m.
1880/1896 — Frobenius: the density of primes with a given decomposition type of f modulo p 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] be monic of degree n with nonzero discriminantΔ(f), so that f has n distinct complex zeros α1,…,αn. Let K=Q(α1,…,αn) be its splitting field and G=Gal(K/Q) its Galois group. Every σ∈G permutes the zeros; the lengths of the cycles (including cycles of length 1) form the cycle pattern of σ, a partition of n.
For a prime p∤Δ(f), the degrees of the irreducible factors of fmodp over Fp form the decomposition type of f modulo p, again a partition of n.
A Frobenius substitution of p is an element σ∈G such that, for some prime ideal Q of the ring of integers OK lying over p,
σ(x)≡xp(modQ)for all x∈OK.
For p∤Δ(f) these elements form a single conjugacy class of G, written σp.
A set S of primes has (analytic, or Dirichlet) densityδ if
logs−11∑p∈Sp−s⟶δ(s↓1),
and natural densityδ if #{p≤x:p∈S}/#{p≤x}→δ as x→∞.
Formalization targets
Goal: Chebotarëv's density theorem
For every conjugacy class C of G,
the set {p prime:p∤Δ(f),σp∈C} has analytic density #G#C.
Milestones
Theorem of Dirichlet: for m≥1 and gcd(a,m)=1, the primes p≡a(modm) have density 1/φ(m).
A set of primes with natural density δ has analytic density δ.
Galois theory of finite fields: for a squarefree g∈Fp[X], the cycle pattern of x↦xp on the zeros of g equals the decomposition type of g.
For p∤Δ(f), the Frobenius substitutions of p form exactly one conjugacy class of G.
For p∤Δ(f), the cycle pattern of σp equals the decomposition type of f modulo p.
For f=Xm−1 and p∤m, σp(ζ)=ζp for every primitive m-th root of unity ζ; that is, σp corresponds to pmodm under G≅(Z/mZ)×.
Theorem of Frobenius: the primes p∤Δ(f) for which f has a given decomposition type t have density #{σ∈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 f has a zero modulo almost every prime then f 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 ℓ-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 with factorization of f modulo p, including the fact that p∤Δ(f) forces p to be unramified in K. The analytic core is harder: one needs Dedekind zeta functions and L-functions of number fields and their behaviour at s=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; in particular, the statement over Q alone cannot be proved by induction on itself.
Formalization scope
All declarations live in the namespace ChebotarevDensity and share one definition file.
K is Mathlib's SplittingField of f viewed in Q[X]; G is Polynomial.Gal; Δ(f) is Mathlib's Polynomial.discr.
A Frobenius substitution is expressed with Mathlib's IsArithFrobAt at some prime ideal of OK containing p; "σp∈C" means that some Frobenius substitution of p lies in C (for p∤Δ(f) this is equivalent to all of them lying in C, by milestone 4).
The cycle pattern is Equiv.Perm.partition of the permutation induced on the complex zeros of f; it includes fixed points.
The decomposition type is the multiset of degrees of the normalized (monic) irreducible factors of fmodp.
Analytic density uses ∑′p−s over the primes of S and the limit s→1+ within (1,∞); natural density compares prime counts up to x∈N.
The hypotheses Δ(f)=0 and "f monic" are those of the source; the theorems are not vacuous, since e.g. f=Xm−1 satisfies them.
Welcome contributions: Dedekind zeta functions and Hecke L-functions at s=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.
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]] is algebraic over 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 p may appear, but only after roughly ω(p)≫p coefficients — already forces algebraicity.
For linear differential equations, the conjecture is a strengthening of the Grothendieck–Katz p-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 have bounded denominators (implication (1)⇒(2) below).
1970s — Grothendieck and Katz: the p-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]] be a formal power series with rational coefficients and write f(i) for its i-th formal derivative. Let g∈Q(z,y0,…,yn−1) be a rational function in n+1 variables. The series fsolves the algebraic ODE defined by g if
f(n)(z)=g(z,f(z),f′(z),…,f(n−1)(z))
and g is defined at (0,f(0),…,f(n−1)(0)). Concretely, g=p/q for polynomials p,q with q(0,f(0),…,f(n−1)(0))=0 and f(n)⋅q(z,f,…,f(n−1))=p(z,f,…,f(n−1)).
For N∈N, Z[1/N]⊆Q is the subring generated by 1/N. For a function ω from the primes to Z, the coefficients of f are ω-integral if for every prime p the numbers a0,…,aω(p) lie in Z(p) (denominators prime to p); ω is superlinear if ω(p)/p→∞.
Formalization targets
Goal: the Lam–Litt conjecture
For f 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.
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 p-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(k2k)2zk. Its equation is singular at z=0, which the non-singularity hypothesis on g 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 z and variable i + 1 is f(i).
The ODE hypothesis is existential: some representation g=p/q with q nonzero at the initial point and 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] (equivalently over Q(z)).
Z[1/N] is the subalgebra of Q generated by 1/N; since 1/0=0 in Lean, N=0 gives Z.
ω takes values in Z; negative values impose no condition at that prime. Superlinearity is the limit ω(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 p-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
G. Eisenstein, Über eine allgemeine Eigenschaft der Reihen-Entwicklungen aller algebraischen Funktionen, Bericht der Königl. Preuss. Akademie der Wissenschaften zu Berlin, 1852.
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer 4: The Discrete Logarithm Circuit Gives a Good Output with Probability at Least 1/480Research Paper
Motivation
The discrete logarithm problem modulo a prime asks, given a prime p, a generator g of the multiplicative group modulo p, and a nonzero residue x, for the exponent r with gr≡x(modp). Its presumed classical hardness underlies Diffie–Hellman key exchange, ElGamal encryption and the Digital Signature Algorithm. The best classical algorithm known when Shor wrote, Gordon's adaptation of the number field sieve, runs in time exp(O((logp)1/3(loglogp)2/3)).
In §6 of Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer (SIAM J. Comput. 26(5), 1997; doi:10.1137/S0097539795293172, arXiv:quant-ph/9508027), Shor gave a quantum algorithm that uses two modular exponentiations and two quantum Fourier transforms and outputs, with constant probability, a pair from which r can be computed. The quantitative core of that analysis is a single number: the circuit produces a "good" output with probability at least 1/480. This mission formalizes that bound and the three estimates it is assembled from.
Setting
Let p be a prime and g a generator of (Z/pZ)×, so that 1,g,…,gp−2 are all the nonzero residues. Fix the unknown r with 0≤r<p−1 and put x=gr. Let q=2l be the power of 2 with p<q<2p.
The Fourier matrixAq is the q×q matrix with entries (Aq)a,c=q−1/2exp(2πiac/q) for 0≤a,c<q (§4, eq. (4.1)). Rows index input basis vectors and columns output basis vectors.
The algorithm uses three registers: two holding numbers 0≤a,b<q and one holding a nonzero residue modulo p. It starts from the state
p−11a=0∑p−2b=0∑p−2∣a,b,gax−b(modp)⟩(6.1)
(preFourierState), applies Aq to each of the first two registers (finalState), and measures all three registers. The probability of observing ∣c,d,y⟩ is the squared modulus of its amplitude (outcomeProb).
For integers z and q>0, the symmetric residue{z}q is the residue of z modulo q in (−q/2,q/2] (symmRes). Put
T=rc+d−p−1r{c(p−1)}q.
An observed state ∣c,d,y⟩ is good (IsGood) when
∣{T}q∣≤21(6.10)and∣{c(p−1)}q∣≤q/12(6.11).
Goodness depends only on (c,d).
Formalization targets
Goal: a good output with probability at least 1/480 (§6, p. 1504)
0≤c,d<q(c,d)good∑y∈(Z/p)×∑Pr[c,d,y]≥4801.
The constant is the one the page carries forward. The goal fixes no threshold on p: it is stated for every prime p that admits a power of two strictly between p and 2p.
Each good state is likely, eq. (6.17). If (c,d) is good, then Pr[c,d,y]≥1/(20q2) for every y.
Many good pairs (p. 1504). At least q/12 pairs (c,d) are good.
Each good c is likely (p. 1504). If (c,d) is good for some d, then ∑d′,yPr[c,d′,y]≥(p−1)/(20q2)≥1/(40q).
Significance
The result. The bound 1/480 is what turns the circuit into an algorithm. Repeating the circuit O(1) times in expectation yields a good output, and from a good pair (c,d) one reads off an equation that determines r modulo divisors of p−1 (§6, eqs. (6.18)–(6.20)). Together with the quantum Fourier transform circuit and reversible modular exponentiation, this places the discrete logarithm modulo a prime in quantum polynomial time. Every later analysis of quantum attacks on discrete-logarithm cryptography starts from this success probability or a sharpened version of it.
Formalizing it. The result has been proved since 1994–1997 and is textbook material; it is not open. As far as is known, no machine-checked proof of Shor's discrete-logarithm analysis exists. The paper's proof of eq. (6.17) replaces a sum by an integral with an error term O(W/(pq)) whose constant is not given, yet states 1/(20q2) for every prime. A formal proof must therefore either control that error explicitly or find another argument, and so settles a point the paper leaves informal. Numerically, the smallest value of q2Pr[c,d,y] over good states is about 0.49 for all primes p<90, so the unconditional claim is not in doubt for small p. The page also contains two small slips, recorded under Formalization scope; a complete development pins down exactly what is true.
Difficulty
The exponential sum (6.4) runs over pairs (a,b) satisfying a congruence modulo p−1, while the phases are taken modulo q. The two moduli are unrelated: q is a power of two and p−1 is arbitrary. Eliminating a through the congruence introduces a floor function ⌊(br+k)/(p−1)⌋, and the resulting phase is not linear in b. The obvious estimate treats the sum as a geometric series in b and bounds it by its first-order phase; this fails because the floor term perturbs every phase by an amount of size up to ∣{c(p−1)}q∣. Condition (6.11) only keeps this perturbation within π/6 of the main phase; it does not remove it. The per-state bound must survive this perturbation uniformly in p, r and k, including small primes where the paper's integral approximation gives no explicit control.
The count of good pairs needs a separate argument about how often a multiple c(p−1) lies within q/12 of a multiple of q when gcd(p−1,q) is large.
Formalization scope
States are functions Fin q × Fin q × (ZMod p)ˣ → ℂ. The first two registers range over {0,…,q−1}; the third over the units modulo p.
Matrix convention. Following §2, rows are inputs, so the amplitude of ∣c,d,y⟩ after the transforms is ∑a,bψ(a,b,y)(Aq)a,c(Aq)b,d. finalState is defined this way from (6.1) and Aq. It is not typed in as the closed form (6.3) or (6.4). A formalization that defined the final state by (6.4) directly would make milestone 1 trivial, and is ruled out.
Probability of a basis state is the squared norm of its amplitude, with no normalization hypothesis.
Parameters.p is prime (Fact p.Prime). The generator is encoded as orderOf g = p - 1. r<p−1 is a parameter, with x=gr. q is given by q = 2 ^ l together with p<q<2p. No large-p threshold is added anywhere.
Arithmetic.x−b is x⁻¹ ^ b in the unit group. p−1 is computed in Z and R inside T and the congruences, and as natural-number subtraction only where p≥2 makes it exact. T is real.
Condition (6.10) is stated as "some integer j has ∣T−jq∣≤21". Because q≥4, this is equivalent to the page's form with j the closest integer to T/q.
Not formalized. The preparation of (6.1) by testing and restarting is not formalized; the state (6.1) is taken as displayed. The printed test "whether the number is less than p" should read p−1, as the sums in (6.1) show. Also out of scope: the recovery of r (eqs. (6.18)–(6.20)), the repetition count "480t", and all running-time claims.
Printed slips.
The page asserts that for each c there is exactly oned satisfying (6.10). At a tie {T}q=±21 there can be two such d. Milestone 3 states only the count, which needs at least one.
The page's intermediate bound "at least p/(240q)" should be (p−1)/(240q). The conclusion 1/480 is unaffected, since q and 2p are both even and so q≤2(p−1). Only 1/480 is stated.
Needed infrastructure: finite exponential sums and their modulus, the symmetric residue and its basic properties, and counting multiples in residue classes of Z/q. The exponential-sum estimates of milestones 1 and 2 are reusable in the order-finding analysis of §5 of the same paper. Proofs of any milestone, of the normalization ∑Pr=1, and of auxiliary lemmas about symmRes are welcome.
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer 2: Factoring from a Random ResidueResearch Paper
Motivation
Shor's 1997 paper (SIAM J. Comput. 26(5), arXiv:quant-ph/9508027) gives a polynomial-time quantum algorithm for factoring integers. The quantum computer does not factor directly: it finds the multiplicative order of an element modulo n. The step from order finding to factoring is classical and randomized, and goes back to Miller's 1976 work on primality testing (G. L. Miller, Riemann's hypothesis and tests for primality, J. Comput. System Sci. 13 (1976)). Every account of Shor's algorithm, and every resource estimate for breaking RSA with a quantum computer, depends on this reduction succeeding with a constant probability per trial. This mission formalizes that probability bound as Shor states it on p. 1498 of the published paper.
Setting
Let n>1 be an odd integer with prime factorization
n=i=1∏kpiαi,
so k is the number of distinct prime factors of n, all odd. The unit group(Z/nZ)× consists of the residues coprime to n; it has φ(n) elements, where φ is Euler's totient function.
For a unit x the orderr=ordn(x) is the least positive integer with xr≡1(modn). For each i the local orderri is the order of xmodpiαi, taken modulo the full prime power, not modulo pi. For a positive integer m, ν2(m) denotes the exponent of the largest power of 2 dividing m.
The reduction is: choose x uniformly at random from (Z/nZ)×, obtain its order r (from the quantum subroutine), and compute
g(x)=gcd(xr/2−1,n).
The procedure yields a nontrivial factor at x when r is even and 1<g(x)<n. In Lean this event is ShorAlgorithms.Reduction.successEvent n u for u : (ZMod n)ˣ, and ri is localOrder n u p for p ∈ n.primeFactors.
Formalization targets
Goal: the success probability
x∈(Z/n)×Pr[r even and 1<gcd(xr/2−1,n)<n]≥1−2k−11.
It is stated for every odd n>1. For a prime power (k=1) the bound is 0, so the statement says nothing there; it is informative exactly when n is not a prime power, as the paper remarks. The constant is sharp: for n=21 exactly 6 of the 12 units succeed, so 1−1/2k in place of 1−1/2k−1 would be false.
Milestones, in the order the page uses them
Success criterion. If r is even and xr/2≡−1(modn), then 1<gcd(xr/2−1,n)<n.
Order is the lcm.r=lcm(r1,…,rk).
Failure forces agreement. For odd n, if the procedure fails at x, then ν2(r1)=⋯=ν2(rk).
At most half per odd prime power. For an odd prime p and α≥1, at most φ(pα)/2 units modulo pα have order with a prescribed 2-adic valuation.
All agree rarely. The units for which ν2(r1)=⋯=ν2(rk) number at most φ(n)/2k−1.
Significance
The result. The bound turns an order-finding oracle into a factoring algorithm: when n is odd and not a prime power, each trial succeeds with probability at least 1/2, so t independent trials all fail with probability at most 2−t. Even numbers and prime powers are split classically, as the paper notes, so the bound completes the reduction from factoring to order finding. The same criterion — a square root of 1 other than ±1 splits n — underlies the Miller–Rabin test and several classical factoring methods.
Formalizing it. The mathematics is classical and proved; the paper gives a sketch of one paragraph. This mission writes out the sketch as machine-checked statements over Mathlib's ZMod, including the probabilistic step, which in the paper is an informal appeal to the Chinese remainder theorem and "50% probability of agreeing with the previous ones". Mathlib already has the needed ingredients (cyclicity of (Z/pα)× for odd p, ZMod.chineseRemainder, ZMod.card_units_eq_totient), but not the reduction or its probability bound.
Difficulty
The success criterion (milestone 1) is elementary. The substance is the counting. The obvious route — treating the ν2(ri) as independent and each "equal to the previous one with probability 1/2" — needs both a precise product decomposition of the unit group modulo n into the unit groups modulo piαi, compatible with the local orders, and the count in a cyclic group of even order of the elements whose order has a given 2-adic valuation. The informal phrase "at most a 50% probability of agreeing with the previous ones" hides a conditioning argument over k−1 coordinates that has to be done by an explicit cardinality bound. A second pitfall is milestone 3: its converse direction and its forward direction use oddness of n in different places, and modulo a power of 2 the argument breaks because −1≡1(mod2).
Formalization scope
Sample space. Uniform on (ZMod n)ˣ; probabilities are stated in cleared-denominator form, (1−2−(k−1))φ(n)≤#{successes} in R, with the count as Nat.card of a subtype. Non-units have no multiplicative order and are not sampled.
The gcd.xr/2 is represented by its least nonnegative residue .val, which is at least 1 for a unit when n>1, so the natural-number subtraction in val - 1 never truncates. r/2 is natural-number division, used only under Even r.
k.n.primeFactors.card, at least 1 for n>1, so k - 1 does not truncate. Since n is odd this equals the page's "number of distinct odd prime factors".
Local orders. The order of the image of x in ZMod (p ^ n.factorization p) under the reduction homomorphism.
Hypotheses. The goal assumes exactly n odd and n>1. It does not assume "not a prime power": that clause in the paper describes when the bound is useful. Milestones 1 and 2 do not assume n odd, because they do not need it; milestones 3 and 5 do.
No trivialization. Counting over all of ZMod n instead of the units would put non-units (with junk order 0) into the denominator; the goal counts over (ZMod n)ˣ and divides by φ(n). The goal's constant is the paper's 1−1/2k−1, which is attained, so it cannot be weakened into a triviality without changing the theorem.
Welcome contributions. A reusable counting lemma for elements of prescribed 2-adic order in a finite cyclic group; the transfer of ZMod.chineseRemainder to unit groups and to local orders; and proofs of the milestones in any order.
D. E. Knuth, The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, 2nd ed., Addison-Wesley, 1981.
G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford University Press, 1979 (Theorem 121, Chinese remainder theorem).
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 q rows of an optimal simplex tableau restricts the integer points to an affine subspace f+W of Rq spanned by the tableau columns. When W is irrational, its integer points span only a proper subspace V⊊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)) 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 W strictly larger than the span V of the lattice (Theorem 9, equivalently Theorem 1 for Zn).
Setting
Work in Rn with the Euclidean inner product and the open balls Bε(x). For X⊆Rn, ⟨X⟩ denotes its linear span.
A lattice of a linear space V is an additive group Λ={λ1a1+⋯+λmam∣λi∈Z} generated by linearly independent vectors a1,…,am with ⟨a1,…,am⟩=V (Definition 6, IsLatticeOf Λ V). A linear subspace L⊆V is a Λ-subspace if it has a basis contained in Λ (Definition 7, IsLambdaSubspace Λ V L). For Z2, the line x2=2x1 is a Λ-subspace and the line x2=2x1 is not.
For sets W,S the interior relative to W is intW(S)={x∈S∣Bε(x)∩W⊆S for some ε>0} (intW W S). The relative interior is relint(S)=intaff(S)(S).
Let W⊇V be a linear space. A set S is a Λ-free convex set of W if S⊆W, S is convex and Λ∩intW(S)=∅. It is maximal if no other Λ-free convex set of W properly contains it (Definition 8, IsLambdaFree, IsMaxLambdaFree).
The statements also use a polyhedron in W (W intersected with finitely many closed half-spaces), a polytope (convex hull of a finite set), the dimensiondim(S) of the affine hull with dim∅=−1 (affDim), and a facet: a nonempty face S∩{⟨a,x⟩=b} of a valid inequality with dimF=dimS−1. The recession cone is rec(S)={r∣x+tr∈S∀x∈S,t≥0} and the lineality space is rec(S)∩−rec(S).
Formalization targets
Goal: Theorem 9 (p. 8)
For a lattice Λ of V and a linear space W⊇V with dimW≥1, a set S is a maximal Λ-free convex set of W 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;(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.
Main milestone: Theorem 10 (p. 8)
For dimV≥1, S is a maximal Λ-free convex set of V if and only if either S=P+L is a polyhedron with P a polytope, L a Λ-subspace and dimS=dimP+dimL=dimV, with no lattice point in intV(S) and a lattice point in the relative interior of every facet; or S=v+L is an affine hyperplane of V whose direction L is not a Λ-subspace.
Supporting milestones
Lemma 13 (bounded full-dimensional case), Lemma 15 (lattice points near half-lines), Lemma 16 (S+⟨recS⟩ stays Λ-free), Lemma 17 (projection along a Λ-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).
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 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 V on their boundary, and the hyperplanes of (ii), whose trace on V is a hyperplane of V that is not a Λ-subspace. Theorem 9 is the geometric input to the paper's Theorem 3: every minimal valid inequality of Rf(W) is the gauge of a maximal lattice-free convex set of f+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 S by a half-space and intersects the half-spaces. It gives a polyhedron only when finitely many lattice points matter, that is, when S is bounded. For unbounded S, 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 Λ-subspace. In the subspace setting of Theorem 9, one must also track the interiors relative to W and to V separately. Identity (6) holds only when intW(S) meets V, and the half-space case (iii) is exactly the case where it does not.
Formalization scope
Rn is EuclideanSpace ℝ (Fin n), linear spaces are Submodule ℝ, and Λ 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 is excluded. Dimensions are integers with dim∅=−1, and facets are nonempty, so no dimension equation holds through truncated subtraction.
Two readings of the page are fixed.
Theorem 9 assumes dimW≥1 and Theorem 10 assumes dimV≥1. For W=V={0} the only maximal set is ∅, which satisfies none of the listed cases, so the printed statements are false there.
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 and affine W) 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, 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.
Milnor conjecture (Voevodsky 2003), formalizedResearch Paper
Motivation
For a field F, two invariants built from very different data turn out to carry the same mod-2 information. One is Milnor K-theoryKnM(F), defined by generators and relations from the multiplicative group F× alone. The other is Galois cohomologyHn(F,Z/2), the continuous cohomology of the absolute Galois group of F. In 1970 Milnor considered a natural map 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 charF=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)/2.
Timeline. The attributions below follow the introduction of Voevodsky 2003.
1970: Milnor considers the map 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) (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 2 as the coefficient prime.
1982: Merkurjev and Suslin extend degree 2 to every prime ℓ (Merkurjev–Suslin 1982).
Degree 3, ℓ=2: proved by Merkurjev–Suslin and, independently, by Rost.
2003: Voevodsky proves all degrees, in every characteristic =2 (Voevodsky 2003, Cor. 7.5), using the motivic Steenrod operations constructed in Voevodsky 2003b. This work was cited for his 2002 Fields Medal.
Milnor K-theory. For n≥0, KnM(F) is the quotient of the n-fold tensor power (F×)⊗n, taken over Z with F× written additively, by the subgroup generated by the pure tensors a1⊗⋯⊗an in which some adjacent pair satisfies ai+ai+1=1. This is the degree-n part of T(F×)/I, where I is the two-sided ideal generated by a⊗(1−a). The class of a1⊗⋯⊗an is the symbol{a1,…,an}. In particular K0M(F)=Z and K1M(F)=F×. In Lean these are MilnorK F n and symbol a for a : Fin n → Fˣ.
Galois cohomology. Let Fsep be a separable closure and GF=Gal(Fsep/F) the absolute Galois group, a profinite group under the Krull topology. Hn(F,Z/2) is the continuous cohomology Hctsn(GF,Z/2) with trivial action, computed from GF-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× fix a∈Fsep. The Kummer characterχa:GF→Z/2 is χa(σ)=0 if σ(a)=a and 1 otherwise. It is a continuous homomorphism representing the Kummer class δa∈H1. The Galois symbol of (a1,…,an) is the class of the homogeneous cocycle
(x0,…,xn)⟼j=1∏n(χaj(xj)−χaj(xj−1)),
the homogeneous form of (σ1,…,σn)↦χa1(σ1)⋯χan(σn), i.e. the cup product δa1∪⋯∪δan. In Lean this is galoisSymbol a.
Formalization targets
Goal: the Milnor conjecture (Voevodsky 2003, Corollary 7.5)
For every field F with charF=2 and every n≥0 there is a homomorphism
φ:KnM(F)→Hn(F,Z/2),φ{a1,…,an}=δa1∪⋯∪δan,
which is surjective and whose kernel is exactly 2KnM(F).
Since symbols generate KnM(F), such a φ is unique; it is the norm residue homomorphism. The statement is therefore equivalent to 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 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 n. It then argues by induction on n through geometry over F: 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 2 with coefficients Z/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 F 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 charF=2 is [NeZero (2 : F)].
Hn is Mathlib's continuousCohomology, built from homogeneous cochains, with Z/2 as a trivial representation of GF with the Krull topology.
KnM(F) is defined one degree at a time, not as a graded ring.
"Kernel =2KnM" means φ(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 φ 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. 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;
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) (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 SpecF;
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→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.
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
D. Orlov, A. Vishik, V. Voevodsky, An exact sequence for K∗M/2 with applications to quadratic forms, Ann. of Math. 165 (2007), 1–13. https://doi.org/10.4007/annals.2007.165.1
C. Haesemeyer, C. Weibel, The Norm Residue Theorem in Motivic Cohomology, Annals of Math. Studies 200, Princeton, 2019. https://doi.org/10.1515/9780691189635
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.
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
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:
Source
Milestone
Status
Theorem 2.1
General multiplicity estimate, with every geometric and numerical conclusion.
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.
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 1 — sit between algebra and analysis: an element has both archimedean zeros, in the complex disc, and non-archimedean ones, at p-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 r in the adic space Spa(Z[[T]]).
The result was put to work in Clausen–Scholze's Lectures on Analytic Geometry (Lecture VII), where Z((T))>r supplies a two-term presentation of the real numbers as a condensed abelian group: for 0<r′<r<1 there is an exact sequence 0→Z((T))rfr′Z((T))r→R→0, whose existence rests on the principality of the kernel of evaluation at r′. The quantitative refinement of that sequence (Propositions 7.2 and 7.3 of the notes) is what produces the ℓp-norms in the analytic ring structure on R.
Setting
Fix a real number r with 0<r<1. An integral Laurent series is a family of integers (an)n∈Z whose support is bounded below, written f=∑n≫−∞anTn; these form the ring Z((T)) under coefficientwise addition and the Cauchy product.
Define
Z((T))>r={n≫−∞∑anTn∃s>r,∣an∣snn→∞0}⊆Z((T)).
Concretely, f lies in Z((T))>r when the associated Laurent expansion converges on some punctured disc {0<∣y∣<s} with s>r strictly larger than r — an overconvergence condition. For x a real or complex number, f(x)=∑nanxn 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 p is available and produces Fp((T)). And the condition is an overconvergence condition: the radius s is required to be strictly larger than r, 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.
The ring is a subring of the domain 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 x with 0<∣x∣≤r (up to conjugation); the ideals (p) for p prime; and kernels of evaluation at a topologically nilpotent unit x of a finite extension of Qp (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→0 needs. Downstream, that presentation is the input to the computation of measures on R in the analytic-ring formalism, and the reason ℓp-spaces with p<1 appear there at all. Without it, one has no finite free resolution of 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 p-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⟩ over a complete field K — does not apply: the coefficient ring Z is not a field, and no single valuation controls it. An element of Z((T))>r must be divided simultaneously by archimedean generators (complex zeros in the disc) and p-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 x: one first needs a real polynomial g∈1+TnR[T] with x as its only zero in {0<∣y∣≤r}, then a correction series h with small coefficients such that gh has integer coefficients. Neither factor alone is integral.
Showing that an element of 1+TZ[[T]] with no zero in the closed disc of radius r 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 p-adic Weierstrass argument, which is why the reduction and p-adic surjectivity milestones are prerequisites rather than side remarks.
Formalization scope
The ambient ring is Mathlib's LaurentSeries ℤ (Hahn series over Z indexed by Z), and Z((T))>r is given as a set of such series, cut out by the decay condition ∣an∣sn→0 as n→+∞ for some s>r. Evaluations are unordered sums over 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))whose underlying set isZ((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=Qp of part (3) of the source theorem (topologically nilpotent units of proper finite extensions of Qp 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}.
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 x-adic expansions of real numbers with bounded integer digits; and p-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
Almost every classical transcendence theorem is a statement about the interaction between the additive structure of C and the exponential function. Hermite proved in 1873 that e is transcendental, Lindemann in 1882 that eα is transcendental for every nonzero algebraic α — hence that π is transcendental and the circle cannot be squared — and Weierstrass in 1885 extended this to the linear independence of eα1,…,eαn over Q for distinct algebraic α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 e and π are algebraically independent, or that e+π 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α is transcendental for algebraic α=0.
1885, Weierstrass: for pairwise distinct algebraic α1,…,αn, the values eα1,…,eαn are linearly independent over Q.
1934, Gelfond and Schneider, independently: if λ=0 is a logarithm of an algebraic number and β is algebraic and irrational, then 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 of algebraic numbers are linearly independent over Q, then 1,λ1,…,λn are linearly independent over 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 for the complex exponential function. A tuple z1,…,zn of complex numbers is linearly independent over Q when the only rationals q1,…,qn with ∑iqizi=0 are q1=⋯=qn=0; here C is viewed as a vector space over Q.
For a subset S⊆C, let Q(S) denote the subfield of C generated by S over Q. The transcendence degreetrdegQQ(S) is the cardinality of a transcendence basis of Q(S) over Q: the largest number of elements of Q(S) that are algebraically independent over Q. A number x is transcendental over Q when no nonzero polynomial with rational coefficients vanishes at x, and numbers x1,…,xm are algebraically independent over Q when no nonzero polynomial in m variables with rational coefficients vanishes at (x1,…,xm).
Formalization targets
Goal
z1,…,zn linearly independent over Q⟹trdegQQ(z1,…,zn,ez1,…,ezn)≥n.
The goal fixes no numerical constant and no special shape for the zi: it asserts only the inequality, for every n and every Q-linearly independent tuple. The case n=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): α algebraic and nonzero ⇒eα transcendental.
Lindemann–Weierstrass (1885): ∑iβieαi=0 for distinct algebraic αi and algebraic βi not all zero.
Gelfond–Schneider (1934): λ=0 a logarithm of an algebraic number, β algebraic irrational ⇒eβλ transcendental.
Six exponentials theorem: x1,x2 and y1,y2,y3 each Q-linearly independent ⇒ at least one of the six numbers exiyj is transcendental.
Baker (1966): Q-linearly independent logarithms of algebraic numbers, together with 1, are linearly independent over Q.
Ax (1971), power series form: trdegCC(f1,…,fn,g1,…,gn)≥n+1 when gi′=fi′gi, the gi are units, and no nontrivial Q-linear combination of the fi is constant.
Conditional corollary: Schanuel's conjecture implies that e and π are algebraically independent over Q.
Significance
Schanuel's conjecture decides, in one stroke, a long list of questions that are individually open: the algebraic independence of e and π, the irrationality of e+π and of eπ, the transcendence of ee and ππ, 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 zi is exactly the Lindemann–Weierstrass theorem, and its restriction to zi 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 π, 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-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, 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 n, 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: the exponential relation is expressed as the differential equation gi′=fi′gi with PowerSeries.derivative, and the conclusion bounds Algebra.trdeg ℂ of the ℂ-subalgebra generated by the fi and the gi. 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.)
Gelbart's Langlands Survey I: Hecke's Correspondence between Automorphic Forms and Dirichlet SeriesResearch Paper
Motivation
The Langlands program proposes that the arithmetic of number fields is encoded in the
representation theory of reductive groups over their adele rings. Its conjectures — reciprocity
and functoriality — are stated in the survey this mission formalizes,
Gelbart 1984, only after a long preparatory
part on the classical results they generalize, and it is that classical part (Part II of the
survey) that admits precise formal statements today.
The classical engine is a theorem of Hecke (1936): a holomorphic function on the upper
half-plane, given by a Fourier expansion in e2πinz/h, transforms in a prescribed way
under z↦−1/zexactly when the Dirichlet series built from its Fourier coefficients
continues analytically and satisfies a functional equation. One side of the equivalence is a
symmetry of an analytic object on the upper half-plane; the other is an analytic property of a
series assembled from arithmetic data. Gelbart presents this as the prototype of the
"reciprocity" that the Langlands conjectures extend to GLn and beyond.
Timeline of the material covered here.
1859: Riemann derives the functional equation of ζ(s) from the transformation law of the
Jacobi theta function, via the Mellin transform (Gelbart, §II.B.2, p. 187).
1920s: Hasse and Minkowski establish the local-global principle for rational quadratic forms
(Gelbart, §II.A, p. 186).
1936: Hecke proves the equivalence that is this mission's goal, and characterizes Euler
products among Dirichlet series of automorphic forms (Gelbart, §II.B.2, Theorems 1 and 2).
1967: Weil extends Hecke's theorem to congruence subgroups; Langlands formulates functoriality.
Setting
Fix a sequence of complex numbers a0,a1,a2,… subject to the growth condition
an=O(nc) for some c>0, a period h>0, a weight k>0, and a sign C=±1.
Three objects are attached to this data.
The form: f(z)=n≥0∑ane2πinz/h, holomorphic on the
upper half-plane {z:Imz>0}.
The Dirichlet series: φ(s)=n≥1∑nsan,
absolutely convergent for Res>c+1.
The completed series:
Φ(s)=(h2π)−sΓ(s)φ(s).
Two conditions on this data are compared.
(A)Φ(s)+sa0+k−sCa0extends to an entire function, bounded in every vertical strip, andΦ(k−s)=CΦ(s).(B)f(−1/z)=C(iz)kf(z)(Imz>0).
Condition (B) says that f is automorphic of weight k for the group of transformations
generated by z↦z+h and z↦−1/z; invariance under z↦z+h is built
into the Fourier expansion.
Formalization targets
Goal — Theorem 1 (Hecke), p. 188
(A)⟺(B)
for every coefficient sequence of polynomial growth and all h,k>0, C=±1. The goal
fixes no particular group, no level and no arithmetic input: it is the general equivalence, from
which the classical examples follow by specialization.
Milestones
The milestone list follows the survey: the local-global principle of §II.A, the Riemann–theta
computation that motivates Hecke's proof (§II.B.2, p. 187), the Mellin representation of Φ,
the two implications of Theorem 1 separately, and the Euler-product criterion of Theorem 2
(p. 189).
Significance
Hecke's theorem is what makes "this L-function is automorphic" a checkable assertion: it
converts a statement about analytic continuation and a functional equation — often the only
handle one has on an arithmetically defined Dirichlet series — into the existence of an
automorphic form with prescribed Fourier coefficients. Weil's converse theorem, the modularity of
elliptic curves, and the automorphy criteria used throughout the Langlands program are
descendants of this statement. Downstream of it sit the classical applications listed in the
survey: the functional equations of ζ and of Dirichlet L-functions, and the
identification of theta series of quadratic forms with modular forms.
Status. Hecke's theorem is a classical, fully proved result (Hecke 1936; a textbook treatment is
Ogg, Modular forms and Dirichlet series, Ch. 1). Hasse–Minkowski is likewise classical. Neither
has a formalization in Mathlib at the pinned revision: Mathlib supplies the completed Riemann
zeta function and its functional equation, the Jacobi theta transformation law, LSeries and its
abscissa theory, the Gamma function and the Mellin transform, and modular forms with
SlashAction, but no converse theorem and no local-global principle for quadratic forms. What
this mission produces is therefore new formal mathematics on top of an old result, not a
re-derivation of something already machine-checked.
Difficulty
The forward implication (B) ⇒ (A) is Riemann's argument: split
∫0∞(f(iy)−a0)ys−1dy at y=1, substitute y↦1/y in the lower
piece, and use (B). The obstacle is not the algebra but the analysis that licenses it: exchanging
the sum defining f with the integral, controlling f(iy)−a0 as y→0+, where the
naive termwise bound diverges, and showing the result is entire and bounded on vertical strips
rather than merely holomorphic on a half-plane.
The reverse implication (A) ⇒ (B) is harder, and it is where the first idea fails: one
cannot simply run the computation backwards, because the Mellin inversion integral
2πi1∫(σ)Φ(s)y−sds converges only once boundedness in vertical
strips is combined with Stirling decay of Γ, and the contour shift that produces the a0
terms needs both. Mathlib has the Mellin transform and an inversion theorem, under hypotheses that
are not met verbatim here; supplying that bridge is the main work.
Formalization scope
Conventions committed to in Lean, all of them invisible in the prose.
f is defined as an unconditional tsum over n≥0, so it takes the junk value 0 where
the series fails to converge; every statement about f is guarded by Imz>0,
and a separate item asserts summability there.
φ is Mathlib's LSeries, whose n=0 term is 0 by definition, so a0 never enters
the Dirichlet series — only the correction terms a0/s and Ca0/(k−s).
"Entire" is rendered as differentiability on all of C; "bounded in every vertical
strip" as: for all reals σ1,σ2 there is an M bounding the function on
σ1≤Res≤σ2.
The functional equation is imposed on the continued function F as F(k−s)=CF(s); for
C=±1 this is equivalent to Φ(k−s)=CΦ(s) on the half-plane of convergence.
Complex powers (2π/h)−s, (z/i)k and ys−1 are principal-branch cpow; on the
upper half-plane z/i has positive real part, so no branch ambiguity arises.
The growth hypothesis is ∥an∥≤Knc for n≥1 with c>0, and the
abscissa used throughout is σ=c+1.
The printed source reads Φ(s)+a0/s+C/(k−s); the term Ca0/(k−s) used here is the
standard form of the correction (see Ogg, Ch. 1), and the two agree when a0=0.
No trivializing reading is available: condition (A) requires the entire function to agree withΦ(s)+a0/s+Ca0/(k−s) on Res>c+1, where Φ is genuinely defined,
so it is not satisfied by an arbitrary entire function; and the hypotheses of the goal are
satisfiable — the Jacobi theta coefficients with h=2, k=1/2, C=1 are an instance,
recorded as its own item.
A complete development needs: summability and holomorphy of q-expansions of polynomial growth;
the Mellin transform of an exponentially decaying series; entirety and strip-boundedness of the
continued Φ; Mellin inversion with Stirling control of Γ; and, for the Euler-product
item, the passage from multiplicativity to an Euler product for LSeries. All of these are
reusable beyond this mission. Contributions to any single item are welcome; the two implications
of the goal are independently valuable and are listed as separate milestones for that reason.
E. Hecke, Über die Bestimmung Dirichletscher Reihen durch ihre Funktionalgleichung, Math. Ann.
112 (1936), 664–699. https://doi.org/10.1007/BF01565437
A. Ogg, Modular forms and Dirichlet series, W. A. Benjamin, 1969.
R. P. Langlands, Problems in the theory of automorphic forms, Lectures in Modern Analysis and
Applications III, Lecture Notes in Math. 170 (1970), 18–61.
https://doi.org/10.1007/BFb0079065
J.-P. Serre, A course in arithmetic, Springer GTM 7, 1973 (Ch. IV: Hasse–Minkowski).
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, introduced by Grothendieck and Drinfeld and containing the absolute
Galois group Gal(Q/Q); a pro-ℓ one; and a
pro-unipotent one GT, together with its graded companion GRT. 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 carries a distinguished family of elements
σ3,σ5,σ7,…, one in each odd degree at least 3, produced from the
Knizhnik-Zamolodchikov associator. Deligne, Drinfeld and Ihara conjectured that
grt1 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), introduces GT, GRT, associators, and the
defining equations of grt1; the Knizhnik-Zamolodchikov associator shows the set
of associators is non-empty, hence σ3,σ5,… exist and are non-zero.
2012 - F. Brown, Mixed Tate motives over Z (Annals of Mathematics 175, 949-976,
doi:10.4007/annals.2012.175.2.10), proves that
the ζf(r1,…,rn) with 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 generated by the σ2p+1 is free on them.
The converse half - that these elements generate all of grt1 - is open.
Setting
Let F(x,y) be the free Lie algebra over Q on two generators x and y,
graded by total word length. For a Lie algebra A over Q and a,b∈A, write
ψ(a,b) for the image of ψ∈F(x,y) under the unique Lie algebra morphism
sending x↦a and y↦b.
For n≥1, the Drinfeld-Kohno Lie algebratn is generated over Q
by symbols tij, 1≤i,j≤n, subject to
the third relation for i,j,k,l pairwise distinct and the fourth for i,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 algebragrt1 is the set of
ψ∈F(x,y) satisfying three equations:
ψ(x,y)=−ψ(y,x),ψ(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.
All three are linear in ψ and degree preserving, so grt1 is a graded
Q-subspace.
grt1 is not closed under the bracket of F(x,y); it is closed under the
Ihara (Poisson) bracket
{f,g}=[f,g]+Dfg−Dgf,
where Df is the derivation of F(x,y) determined by Dfx=0 and
Dfy=[y,f]. Writing Der for the Lie algebra of derivations of F(x,y)
under the commutator, the assignment f↦Df satisfies
[Df,Dg]=D{f,g}, and it is injective on grt1; this is the form in which
the Lie structure of grt1 is expressed in the formal statements below.
Finally, for n1≥2 and n2,…,nk≥1 the multiple zeta value is
These numbers are the coefficients of the Knizhnik-Zamolodchikov associator, which is why they
enter a mission about grt1; 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 {,}.
Concretely: the Lie algebra morphism from the free Lie algebra on countably many generators to
Der sending the p-th generator to Dσp is injective, and its image is
exactly 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 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 is closed under it; the degree-3 element
[x+y,[x,y]] lies in grt1; every odd degree ≥3 contains a non-zero element of
grt1; multiple zeta values satisfy the stuffle and shuffle relations; and
ζ(2,1)=ζ(3).
Significance
A positive answer would determine grt1 completely and, through the
GT-GRT-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 up to the same freeness statement. Without it, even the dimension of
grt1 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,
grt1 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 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). Even the milestone
"grt1 is closed under the Ihara bracket" is not a formality: the pentagon equation
lives in t4 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.
The base field is Q. The source works over a field K of characteristic zero; every
statement here is over Q.
grt1 is modelled inside the free Lie algebraFreeLieAlgebra ℚ (Fin 2),
i.e. by Lie polynomials, not the completed Lie algebra 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.
tn 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+1 under the shift Fin 4 = {0,1,2,3} versus indices 1,2,3,4.
Homogeneity is expressed by the rescaling characterisation: ψ has degree n if
ψ(cx,cy)=cnψ(x,y) for all c∈Q. Over an infinite field this is
equivalent to homogeneity for the word-length grading.
The Ihara derivation uses Dfx=0. The source writes Dfx=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 in Remark 7.2; Dfx=0 is the convention under which both
hold, and is the standard one.
The Lie structure on grt1 is carried by the injection f↦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↦Df is injective on grt1 but not on
all of F(x,y), where Dy=0; a supporting item records the injectivity actually
used.
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 and first letter
≥2. The stuffle and shuffle products are multisets of words, so no free module on words
is needed.
Nothing here is vacuous by construction: the defining equations of grt1 are
linear conditions on a non-zero graded space, t4=0, and the milestone
[x+y,[x,y]]∈grt1, [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, the degree-3 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 withGal(Q/Q), Leningrad Math. J. 2 (1991), 829-860.
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.
Esquisse d'un Programme I: Dessins d'Enfants and the Faithfulness of the Galois ActionResearch Paper
Motivation
In Esquisse d'un Programme (1984), Alexandre Grothendieck describes a discovery that reorganised his mathematical interests: a finite oriented combinatorial map drawn on a surface — a dessin d'enfant, a child's drawing — determines canonically a smooth projective algebraic curve together with a map to the projective line ramified only above 0, 1 and ∞, and that curve and map are defined over the field Q of algebraic numbers (Esquisse, §3, pp. 14–16 of the French text). Consequently the absolute Galois group Γ=Gal(Q/Q) acts on these purely combinatorial objects; in the spherical case, where the structural map is a rational function f(z)=P(z)/Q(z), the action of γ∈Γ is obtained simply by applying γ to the coefficients of P and Q. Grothendieck states in §2 (p. 9) that the resulting outer action of Γ on the profinite fundamental group π^0,3 of P1∖{0,1,∞} is faithful, and in §3 that the theorem of Belyi, announced at the 1978 Helsinki congress, is what makes the dictionary between combinatorics and arithmetic exact.
Timeline of the results this mission formalizes. Belyi (1979, On Galois extensions of a maximal cyclotomic field, Izv. Akad. Nauk SSSR) proved that a smooth projective curve over C is defined over a number field if and only if it admits a map to P1 unramified outside {0,1,∞}; the "only if" half is an explicit construction with polynomials over Q. Grothendieck (1984) drew the consequence that Γ acts on dessins and asserted faithfulness of the action on π^0,3. Lenstra, in an appendix to L. Schneps (ed.), The Grothendieck Theory of Dessins d'Enfants (LMS Lecture Notes 200, CUP 1994), showed that the action is already faithful on the much smaller class of plane trees, equivalently on Shabat polynomials. That tree-level statement is the goal of this mission, because it is the sharpest form of faithfulness that can be stated without first building the theory of étale fundamental groups.
Setting
Work over Q, realized as the algebraic closure of Q, and write Γ for its group of field automorphisms fixing Q pointwise.
A nonconstant polynomial P over a field K is a Belyi polynomial (classically a Shabat polynomial) when every critical value of P lies in {0,1}: for every z∈K with P′(z)=0 one has P(z)=0 or P(z)=1. Over an algebraically closed field of characteristic zero this says exactly that P, viewed as a degree-n map P1→P1, is unramified outside the fibres over 0, 1 and ∞. The associated dessin is the preimage P−1([0,1]), a plane tree with n edges whose vertices are the points above 0 and 1, with vertex orders equal to the multiplicities of the corresponding roots of P and of P−1.
Two Belyi polynomials define the same dessin exactly when they are affinely equivalent: Q=P(aX+b) for some a=0 and some b. The target coordinate is already rigidified by the normalisation of the critical values to {0,1}; only the source coordinate remains free.
The group Γ acts coefficientwise: Pγ is the polynomial obtained from P by applying γ to each coefficient. This is exactly the action described in §3 of the Esquisse. It sends Belyi polynomials to Belyi polynomials, and it descends to an action on affine equivalence classes, i.e. on dessins.
Formalization targets
Goal — faithfulness of the Galois action on plane trees
∀γ∈Γ,γ=1⟹∃P∈Q[X] a Belyi polynomial with P∼affPγ.
Equivalently: no nontrivial element of the absolute Galois group fixes every plane tree. This is the weakest stable form of the faithfulness assertion in the Esquisse: it fixes no degree, no genus and no tree, asserting only that some dessin is moved.
Supporting targets
Belyi's theorem, polynomial form. For every finite set S⊆Q there is a Belyi polynomial f∈Q[X] with f(S)⊆{0,1}.
Descent to Q. Every Belyi polynomial over C is affinely equivalent to one whose coefficients are algebraic over Q.
Galois equivariance and invariants.Pγ is again a Belyi polynomial of the same degree, and the multiplicity of z as a root of P−c equals the multiplicity of γ(z) as a root of Pγ−γ(c): the dessin's vertex and face orders are Galois invariants.
Finiteness of the orbit. The set of Galois conjugates of a fixed polynomial over Q is finite — the "visibly finite number of conjugates" of §3.
Finiteness in a fixed degree. For each n there are only finitely many monic Belyi polynomials of degree n over Q with vanishing subleading coefficient.
Separation. For every α∈Q there is a Belyi polynomial P such that every γ fixing the class of P fixes α. The goal follows from this by taking α with γ(α)=α.
Significance
The result itself. Faithfulness turns the combinatorics of finite maps into a faithful representation of Γ: every nontrivial automorphism of Q is detected by a finite tree, so invariants of dessins (degree, valency lists, monodromy group, field of moduli) are in principle a complete set of tools for distinguishing Galois elements. It is also the entry point to the anabelian programme described in §3 of the Esquisse, since the same statement expresses that Γ embeds into the outer automorphism group of π^0,3.
Formalizing it. Belyi's theorem and the faithfulness of the Galois action on trees are both established results. Mathlib at the environment revision of this mission contains no declaration mentioning Belyi maps or dessins d'enfants, and no étale fundamental group, so both statements have to be built from the polynomial and Galois-theoretic libraries. What this mission produces is a formal version of the combinatorial half of the dictionary, in a form that avoids scheme theory entirely: everything is phrased with polynomials over Q and C, so the development rests only on Mathlib's existing polynomial, field theory and Galois theory libraries.
Difficulty
The naive attack on the goal — exhibit one tree and one Galois element moving it — does not scale: the statement quantifies over all γ=1, and Γ has no accessible presentation. The real work is the separation statement, which demands, for an arbitrary algebraic number α, a tree whose isomorphism class remembers α; the construction must control both the existence of a Belyi polynomial with prescribed arithmetic and the rigidity that makes affine equivalence classes finite. Belyi's theorem in polynomial form is itself an induction on the degree of the field of definition of the critical values, and each step changes the polynomial, so bookkeeping of critical values through composition is the bulk of the formal proof. The descent statement over C is not a formal manipulation either: it needs the finiteness of the set of Belyi polynomials of a given degree up to affine equivalence, which is where the combinatorial classification enters.
Formalization scope
Conventions fixed in the Lean development, and not to be re-litigated by solvers:
Q is AlgebraicClosure ℚ, and Γ is its group of Q-algebra automorphisms.
"Belyi polynomial" means: positive degree, and every root of the formal derivative is sent to 0 or 1. Critical values are required to lie in{0,1}, not to be exactly {0,1}; degenerate cases such as Xn (one finite critical value) are therefore included.
Being a Belyi polynomial is stated over an arbitrary field but is only intended over algebraically closed fields (Q, C), where quantifying over the field's own elements captures all critical points.
Dessin isomorphism is modelled as affine equivalence of the source variable only; conjugating by an affine map of the target is excluded, since the target is rigidified by {0,1}.
The Galois action is coefficientwise application of γ.
Trivialization is ruled out as follows: the goal asserts the existence of a moved Belyi polynomial for each nontrivial γ, with the nondegeneracy 0 < deg P built into the definition, so no constant or empty witness satisfies it, and no hypothesis of the goal is vacuous (γ=1 is satisfiable).
A complete development needs: critical values and their behaviour under composition of polynomials; the classification of Belyi polynomials of fixed degree up to affine equivalence; Galois descent for a finite set of polynomials stable under conjugation; and, for the descent target, the identification of the coefficients of a Belyi polynomial over C as algebraic numbers. All of these are reusable outside this mission. Contributions of general polynomial-ramification infrastructure are welcome, as are alternative formalizations of the same statements over a general algebraically closed field of characteristic zero.
Selected references
A. Grothendieck, Esquisse d'un Programme (1984), published in L. Schneps and P. Lochak (eds.), Geometric Galois Actions 1, LMS Lecture Note Series 242, Cambridge University Press, 1997. https://doi.org/10.1017/CBO9780511758874
G. V. Belyi, On Galois extensions of a maximal cyclotomic field, Izv. Akad. Nauk SSSR Ser. Mat. 43 (1979), 267–276. English translation: Math. USSR-Izv. 14 (1980), 247–256. https://doi.org/10.1070/IM1980v014n02ABEH001096
L. Schneps (ed.), The Grothendieck Theory of Dessins d'Enfants, LMS Lecture Note Series 200, Cambridge University Press, 1994. https://doi.org/10.1017/CBO9780511569302
S. K. Lando and A. K. Zvonkin, Graphs on Surfaces and Their Applications, Encyclopaedia of Mathematical Sciences 141, Springer, 2004. https://doi.org/10.1007/978-3-540-38361-1
Kawahira: The Riemann Hypothesis and Holomorphic Index in Complex DynamicsResearch Paper
Motivation
The Riemann hypothesis asserts that every non-trivial zero of the Riemann zeta function ζ lies on the line Res=1/2; the simplicity hypothesis asserts in addition that every such zero is a simple zero of ζ. Both are statements about the location and the order of a discrete set of points in the complex plane, and almost every reformulation of them stays inside analytic number theory.
Kawahira (2016) gives a reformulation of a different kind. He attaches to ζ an explicit meromorphic self-map of the Riemann sphere and shows that the Riemann hypothesis together with the simplicity hypothesis is equivalent to a statement about the local dynamics of that map: it has no attracting fixed point. The translation is elementary once the right object is in place — the holomorphic index (residue fixed point index) of a fixed point — and it turns a question about zeros into a question about stability. This mission formalizes that translation, together with the supporting propositions on indices and multipliers that make it work.
Setting
For a non-constant meromorphic g:C→C, define the nu function
νg(z)=z−zg′(z)g(z).
If α=0 is a zero of g of order m≥1, then α is a fixed point of νg with multiplier
λ=νg′(α)=1−mα1,
and if α is a pole of order m the multiplier is 1+mα1. A fixed point α of a holomorphic map f is attracting if ∣f′(α)∣<1, indifferent if ∣f′(α)∣=1, and repelling if ∣f′(α)∣>1.
The holomorphic index of f at a fixed point α is
ι(f,α)=2πi1∮Cz−f(z)dz,
the integral being over a small positively oriented circle around α. When the multiplier λ is not 1 one has ι=1−λ1, and the Möbius map λ↦1−λ1 carries the unit disk onto the half-plane Reι>1/2. So a fixed point is attracting, indifferent or repelling exactly according to whether Reι is >1/2, =1/2 or <1/2: the critical line reappears, in the index plane.
The point of the construction is that νg is engineered so that the index of νg at a simple zero α of g is α itself (and mα at a zero of order m). Writing νζ=νg for g=ζ: a non-trivial zero α of order m has index mα, so Reι=mReα, and asking that this equal 1/2 is asking for m=1 and Reα=1/2.
Formalization targets
Goal — Theorem 1 of the paper, conditions (a), (b), (c)
(RH∧simplicity)⟺(every non-trivial zero is an indifferent fixed point of νζ)⟺(νζ has no attracting fixed point).
Supporting targets
The milestones are the paper's Propositions 3, 4, 5, 7, 8, 9, its Theorem 11 (the variant for the Riemann xi function ξ), and Proposition 13 of the appendix (the Newton map Ng(z)=z−g(z)/g′(z), for which every zero of g becomes an attracting fixed point — the contrast that explains why νg, and not Ng, sees the critical line).
Significance
The equivalence converts the simultaneous truth of the Riemann and simplicity hypotheses into the non-existence of an attracting fixed point of one explicitly given meromorphic function. Nothing in the translation is conjectural: the content is the index computation, the symmetry α↦1−α of the non-trivial zeros supplied by the functional equation, and the classification of fixed points by the real part of the index. What a formalization adds is a machine-checked statement of the dictionary, and a reusable Lean development of the holomorphic index, which Mathlib does not currently contain — the index, its relation to the multiplier, and its behaviour at zeros and poles are general facts of one-variable complex dynamics, independent of this application.
Status, precisely: the Riemann hypothesis is open, and this mission does not ask anyone to settle it. Every target here is a theorem with a published proof; the work is to formalize those proofs. The goal theorem is an equivalence between two open statements, so it is provable without deciding either side.
Difficulty
The obvious route to the goal — compute νζ′ at a zero, apply the classification, done — fails in one direction. From "no attracting fixed point" one gets Re(mα)≤1/2 for each non-trivial zero α of order m, which alone excludes neither a multiple zero nor a zero to the left of the critical line. The functional equation must be used to pair α with 1−α, whose index is m(1−α); only the two inequalities together force m=1 and Reα=1/2. A complete Lean proof therefore needs, besides the local computation: that the non-trivial zeros lie in the open strip 0<Res<1, that α and 1−α are zeros of the same order, and that the trivial zeros and the pole at s=1 give repelling fixed points.
The index milestone (Proposition 3) is a residue computation on a small circle, and the hypotheses have to be arranged so that z−f(z) has exactly one zero inside; the other genuinely analytic milestone is the order-m computation of νg′, where g′ vanishes at the fixed point when m≥2 and the singularity is removable rather than absent.
Formalization scope
The development is over C with Mathlib's riemannZeta. Conventions the Lean statements commit to:
Non-trivial zero means: a zero of ζ that is not one of −2,−4,−6,…. Nothing about the critical strip is built into the definition; that the non-trivial zeros lie in 0<Res<1 is part of the work.
Simplicity of a zero α is expressed as ζ′(α)=0.
νg is a total function C→C, using Lean's convention that division by zero returns zero. At a zero of g this total function agrees with the genuine holomorphic extension of νg, so multipliers there are the true ones. At a point where g is non-zero and g′ vanishes, and at a pole of g, the total function takes an artefactual value; the statements about νζ therefore carry the explicit guard ζ(α)=0∨ζ′(α)=0 together with α=0,1. The excluded points are exactly the pole of ζ (a repelling fixed point, by Proposition 7 of the paper) and the poles of νζ, so the guarded statements are equivalent to the paper's, but they are guarded, and a reader should check that they consider the guards faithful.
The xi function is taken in Kawahira's normalization ξ(z)=21z(1−z)π−z/2Γ(z/2)ζ(z), written in Lean through Mathlib's entire function Λ0 so that the Lean ξ is entire and has the correct values at z=0,1 rather than removable-singularity artefacts; the definition file carries a proved lemma identifying it with 21z(1−z)Λ(z) off {0,1}.
Conditions (d) and (e) of the paper's Theorems 1 and 10 — the purely topological reformulations in terms of a topological disk D with νζ(D)⊂D, and their homeomorphic deformations — are not part of this mission. They rest on the topological characterization of attracting fixed points (the paper's Proposition 2), whose proof uses the Riemann mapping theorem and the Schwarz–Pick lemma; the Riemann mapping theorem is not available in Mathlib, and the intended strength of the inclusion νζ(D)⊂D (compact containment) needs to be fixed before the statement can be formalized faithfully. Theorem 14 of the appendix, which is of the same topological kind, is likewise out of scope. A contribution supplying Proposition 2 in a defensible form would be welcome, as a separate mission.
Nothing here is vacuous: the goal is an equivalence of two statements each of which is satisfiable in form, and the guards exclude only points at which the Lean encoding of νζ is known not to model the meromorphic map.
Reusable beyond this mission: the holomorphic index, the multiplier classification, the general nu-function and Newton-map computations at a zero of order m — all stated for an arbitrary function analytic at the point, not for ζ.
J. Milnor, Dynamics in One Complex Variable, 3rd ed., Annals of Mathematics Studies 160, Princeton University Press, 2006. (Holomorphic index: Lemma 12.2; topological characterization of fixed points: Section 8.)
E. C. Titchmarsh, The Theory of the Riemann Zeta Function, 2nd ed., Oxford University Press, 1986. (Functional equation; trivial zeros; the xi function.)
D. Schleicher, Newton's Method as a Dynamical System: Efficient Root Finding of Polynomials and the Riemann ζ Function, Fields Inst. Commun. 53 (2008), 213–224.
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+1?
Infinitely many Sophie Germain primes p with 2p+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 and
a>0, then an+b is prime for infinitely many n.
1857 — Bunyakovsky states the single-polynomial case for arbitrary degree. It is open for
every fixed polynomial of degree ≥2; not one instance, not even n2+1, is known.
1904 — Dickson states the case of arbitrarily many linear polynomials.
1962 — Bateman and Horn give the conjectural asymptotic count of such n≤N, refining
Hypothesis H to a quantitative form
(Math. Comp. 16 (1962), 363–367).
1978 — Iwaniec proves that n2+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 n, n+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} 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] of polynomials with integer coefficients. Fix a finite set
F⊆Z[X] of polynomials f, each subject to the Bunyakovsky
condition:
degf≥1;
the leading coefficient of f is positive;
f is irreducible in Z[X].
Irreducibility in Z[X] is strictly stronger than irreducibility in Q[X]: it
also forces the content of f to be 1, ruling out 2X2+2.
Even an irreducible family can be blocked by congruences. The polynomial X2+X+2 is
irreducible with positive leading coefficient, yet n2+n+2 is even for every integer n, so it
is prime only when it equals 2. The family F therefore also has to satisfy the
Schinzel condition: for every prime p there exists an integer n with
p∤f∈F∏f(n).
Equivalently, no prime is a fixed divisor of the product ∏f∈Ff. A family
satisfying both conditions is called admissible.
Target
For an admissible family F, write
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.
The milestones are, in order: the linear one-polynomial case (Dirichlet); the reduction of the
Schinzel condition to the finitely many primes p≤∑f∈Fdegf; 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+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+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 n. 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) for n≤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) has few prime factors infinitely often, but they cannot distinguish
"one prime factor" from "two", which is why Iwaniec's n2+1 result stops at P2. The
analytic input that works for degree one — the nonvanishing of Dirichlet L-functions on
ℜs=1 — has no known analogue for a polynomial of degree ≥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, and true).
Primality is asserted of the absolute value ∣f(n)∣ as a natural number. Since the leading
coefficient is positive and degf≥1, the values are eventually positive, so this is
equivalent to asking for a positive prime value at all large n.
The variable n ranges over N, not Z, and "infinitely often" means that
the set of such n is infinite.
Irreducibility is irreducibility in Z[X] (so primitivity is included), and the
degree hypothesis is degf≥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 p — not over p 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} and {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
n.
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
k-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/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+1 congruent to 3 modulo 4.
1965–1969: Yamamoto’s congruence analysis and Mordell’s exposition reduce the remaining prime cases to six classes modulo 840.
1970–1971: Vaughan bounds the density of possible exceptions; Terzi develops a stronger congruence sieve modulo 120120.
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 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 n, write IsErdosStraus(n) for the following literal property:
∃x,y,z∈N,1≤x<y<z,n4=x1+y1+z1.
Every fraction is evaluated in Q. The predicate contains only these witnesses, inequalities, and equality. The required range of the conjecture is n>2; distinctness is part of the mathematical target. In particular, the prime 2 cannot simply be imported from a formulation permitting repeated denominators. The boundary value n=3 is included, with denominators 1,4,12.
Formalization targets
The unresolved root goal is
∀n∈N,n>2⟹IsErdosStraus(n).
The supporting milestones concern established mathematics. Denominator clearing relates the rational equation to 4xyz=n(yz+xz+xy) under strict positivity. Positive scaling transports a solution for n to one for kn while preserving the strict order. An explicit even-number family supplies the case needed for the prime reduction.
The elementary families cover 3∣n, n≡2(mod3), n≡3(mod4), and n≡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>2 outside 1(mod24). The useful reduction is an equivalence between the root goal and its restriction to primes 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) holds for n>2 whenever n+1 has a prime divisor q≡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>2 satisfying
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 49 and omits 529; 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-840 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 120120, and Vaughan’s density theorem, bounding the exceptional count by Xexp(−c(logX)2/3) for a positive constant c. 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),
or
−(4c2d+1)/k(mod4cd)(c,d,k≥1,k∣4c2d+1).
Here division by c denotes a modular inverse; division by k 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 4 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 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-840 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/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/z, Mem. Fac. Sci. Kyushu Univ. A 19 (1965), 37–47; original paper.
Around 1637 Pierre de Fermat wrote, in the margin of his copy of Diophantus' Arithmetica, that no n-th power with n>2 splits as a sum of two like powers, and that he had a proof the margin was too narrow to hold. The claim resisted every generation of number theorists that attacked it, and the machinery built during those attacks — cyclotomic fields, ideal theory, class numbers, elliptic curves, modular forms, Galois representations — became a large part of modern algebraic number theory. The statement itself is elementary enough to explain to a schoolchild; nothing about its proof is.
Timeline. Fermat himself proved the case n=4 by infinite descent, as a corollary of the fact that the area of a right triangle with integer sides is never a perfect square. Euler treated n=3 in his Vollständige Anleitung zur Algebra (1770), by a descent in Z[−3] that assumed a unique-factorization property later supplied by others. Dirichlet and Legendre settled n=5 between 1825 and 1830, Dirichlet added n=14 in 1832, and Lamé published n=7 in 1839. In 1847 Kummer made the decisive structural step: introducing ideal numbers to repair the failure of unique factorization in Z[ζp], he proved the theorem for every regular prime exponent — those p not dividing the class number of Q(ζp), a condition he characterized by divisibility of Bernoulli numerators. Irregular primes were left open, and the elementary programme stalled there for over a century.
The route that closed the problem came from a different direction. The modularity conjecture of Taniyama (1955), refined by Shimura and given conceptual support by Weil (1967), predicted that every elliptic curve over Q arises from a modular form. Hellegouarch and then Frey (1985) attached to a hypothetical solution ap+bp=cp the curve y2=x(x−ap)(x+bp), whose ramification behaviour is too tame for a curve of its conductor. Serre made this precise as the epsilon conjecture, and Ribet proved it in 1986: modularity of semistable elliptic curves over Q implies Fermat's Last Theorem. Wiles proved that modularity statement, with the key Hecke-algebra input supplied jointly with Taylor, in two 1995 Annals of Mathematics papers. Breuil, Conrad, Diamond and Taylor removed the semistability hypothesis in 2001.
Setting
Fix a natural number n and natural numbers a,b,c. A Fermat triple of exponent n is a triple (a,b,c) of strictly positive naturals with
an+bn=cn.
For n=1 such triples are everywhere, and for n=2 they are the Pythagorean triples, parametrized by (k(u2−v2),2kuv,k(u2+v2)). The assertion at issue is that from n=3 upward there are none at all: the hypothesis 3≤n and the positivity hypotheses 0<a, 0<b, 0<c are exactly what is needed, since n≤2 and the degenerate triples with a zero entry both produce solutions.
Two standard reductions organize any attack. First, if (a,b,c) is a triple of exponent n and m∣n, then (an/m,bn/m,cn/m) is a triple of exponent m; since every n≥3 is divisible by 4 or by an odd prime p≥3, the general statement follows from the cases n=4 and n=p an odd prime. Second, for a prime exponent p one may assume gcd(a,b,c)=1, and the classical literature then splits on whether p∤abc (case I) or p∣abc (case II).
Formalization targets
Goal
∀n≥3,∀a,b,c∈N>0,an+bn=cn.
This is the mission's single goal, referenced as the published platform theorem fermat_last_theorem. It fixes no exponent, no congruence class, and no auxiliary structure: any complete argument, classical or modern, discharges it.
Significance
The result itself. As a Diophantine statement, Fermat's Last Theorem is a closed case; its value now lies in what proving it required. The proof established the modularity of semistable elliptic curves over Q, made modularity lifting ("R=T") a standard technique, and turned Galois deformation theory into a working tool. Those consequences — not the non-existence of Fermat triples — are what the surrounding mathematics uses daily; the Fermat statement is the compact certificate that the machinery works.
Formalizing it. The theorem is proved but not formally verified end to end, and that gap is the mission. Machine-checked proofs exist for the small exponents and for Kummer's regular-prime case: Mathlib carries the general statement together with the cases n=3 and n=4, and the flt-regular project verified the regular-prime theorem in Lean 4. No formal proof of the full theorem exists in any system; Buzzard's ongoing FLT project at Imperial College is building one by reducing the statement to results known to experts by the late 1980s. Contributions here need not follow that route — a complete Lean proof of any single case not yet covered, or of any structural ingredient (level lowering, modularity lifting, the properties of the Frey curve), is a genuine advance, and the platform's sketch mechanism is the natural way to record such a reduction.
Difficulty
The naive attacks fail for identifiable reasons, and a solver should rule them out before spending time on them. Congruence and descent arguments of the kind that settle n=3,4,5,7 depend on the arithmetic of a specific small ring and do not generalize: the descent step needs unique factorization in Z[ζn] or a substitute, and unique factorization fails there for all but finitely many n. Kummer's ideal-theoretic repair recovers the argument exactly when p is regular, and no argument in that family is known to handle irregular primes; the irregular primes are moreover infinite in number, so no finite computation closes them. Parity, size, and modular-arithmetic obstructions have all been shown insufficient, since the equation has solutions modulo every prime power for suitable triples. The only known complete proof passes through modularity, which means the formal development needs elliptic curves over Q, their Galois representations, modular forms and Hecke algebras, level-lowering, and a modularity lifting theorem — none of which is a shortcut around the difficulty, all of which is where the difficulty actually lives.
Formalization scope
The target is stated over N, so no truncated subtraction enters the statement and no sign analysis is hidden in it; the equivalent formulations over Z and over Q follow by clearing denominators and moving terms, and a solver who prefers to work over Z must supply that bridge. Exponentiation is Monoid.npow on N, and 00=1 plays no role because 3≤n. The hypotheses 0<a, 0<b, 0<c are all load-bearing and none of them is vacuous, so the statement admits no trivializing reading: dropping any one makes it false, and every hypothesis is satisfiable, so the conclusion cannot be reached by contradiction from the assumptions alone. Mathlib does not contain Fermat's Last Theorem, so the goal cannot be discharged by citing a library lemma.
A complete development will want: the reduction from general n to n=4 and odd prime exponents; the coprimality normalization; cyclotomic fields, class groups, and the regularity criterion for the Kummer line of attack; and, for the modular route, Weierstrass curves over Q, conductors and minimal models, Galois representations attached to torsion points, modular forms and Hecke operators, and the level-lowering and modularity-lifting statements. Most of that infrastructure is reusable well beyond this mission and is welcome as separate published theorems and definitions. Partial contributions are welcome in either style: a direct proof of a single exponent, or a sketch that reduces the goal to child lemmas with statements that stand on their own.
Selected references
Andrew Wiles, Modular elliptic curves and Fermat's Last Theorem, Annals of Mathematics 141 (1995), 443–551. https://doi.org/10.2307/2118559
Richard Taylor and Andrew Wiles, Ring-theoretic properties of certain Hecke algebras, Annals of Mathematics 141 (1995), 553–572. https://doi.org/10.2307/2118560
Kenneth A. Ribet, On modular representations of Gal(Q/Q) arising from modular forms, Inventiones Mathematicae 100 (1990), 431–476. https://doi.org/10.1007/BF01231195
Christophe Breuil, Brian Conrad, Fred Diamond and Richard Taylor, On the modularity of elliptic curves over Q: wild 3-adic exercises, Journal of the American Mathematical Society 14 (2001), 843–939. https://doi.org/10.1090/S0894-0347-01-00370-8
Ernst Eduard Kummer, Beweis des Fermat'schen Satzes der Unmöglichkeit von xλ+yλ=zλ für eine unendliche Anzahl Primzahlen λ, Monatsberichte der Königlich Preußischen Akademie der Wissenschaften zu Berlin (1847), 132–139.
Gerhard Frey, Links between stable elliptic curves and certain Diophantine equations, Annales Universitatis Saraviensis 1 (1986), 1–40.
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,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
🏆Completed
Captain: xuanji
Every Odd Number Greater Than 1 is the Sum of at Most 159 PrimesResearch Paper
Motivation
Schnirelmann showed around 1930, by elementary means, that some absolute constant k makes every integer n>1 a sum of at most k primes. For odd n:
Schnirelmann (1930s): some finite k, by elementary methods.
Klimov, Pil'tai, Sheptitskaya (1972):115; Riesel–Vaughan (1983):19 for all integers, using zero-based prime-counting estimates.
Ramaré (1995): every even integer is a sum of at most six primes, so every odd n>1 is a sum of at most seven. (Ann. Sc. Norm. Super. Pisa, 1995)
Helfgott (2013): every odd n>5 is a sum of three primes. (arXiv:1312.7748)
The campaign's earlier values (100001 down to 241) came from Schnirelmann's method with every constant written out. Those arguments stall near 241 because the medium range relies only on a Chebyshev lower bound for π(y). This entry adds the small-shift idea of Riesel and Vaughan, which removes that bottleneck without any zeta-zero input.
Setting
A representation of n as a sum of at most k primes is a finite multiset of primes summing to n with at most k elements counted with multiplicity. The Schnirelmann density of A⊆Z≥0 is σ(A)=infN≥1∣A∩{1,…,N}∣/N (Mathlib: schnirelmannDensity).
Formalization target
Goal
∀n∈N,n odd,n>1⟹∃s multiset of primes,∣s∣≤159,∑s=n.
This is the campaign template with the value 159 filled in.
How the bound arises
Let B={(p−3)/2:p odd prime} and A=B+B. We show σ(A)≥1/79, then conclude with Mann's theorem as in the 241 entry. Write L=logy for the scale.
Chebyshev constant log2. Mathlib's ψ(x)≥(x−1)log2−log(x+2) gives π(x)≥(xlog2−O(logx))/logx, better than the constant 2/3 used in earlier entries. On its own it covers L≲90 through B⊆A.
Small-shift range (Riesel–Vaughan 1983, Lemma 8). Fix the first 150 odd primes p1 (up to 877) and let R(s) count s=p1+q with q prime. Then ∑sR(s) needs only π, and ∑sR(s)2 needs an upper bound for prime pairs q,q+d with a fixed even shift d. That bound is the Selberg sieve for a(a+d) on an interval, whose local data are those of the existing Goldbach sieve with s:=d. The weight sum ∑p1=p2C(p1−p2) over these primes is a finite computation. Cauchy–Schwarz then gives #{s≤y:R(s)>0}≥y/158 for 90≲L≤3000.
Large rangeL≥3000: the Selberg pointwise bound r(s)≤bC(s)s/log2s, the weighted first moment (now with constant (log2)2), a high moment of C(s), and Hölder, as in the 241 entry, at a much higher threshold.
Mann's theorem turns 79σ(A)≥1 into 79A=Z≥0, so every odd n beyond a small bound is a sum of 158 odd primes plus one 3, and small n are handled with twos and threes: K=2⋅79+1=159.
Significance
The argument stays elementary: no prime number theorem and no zeros of ζ or L-functions. New reusable components:
Explicit Selberg upper bound for prime pairs (q,q+d) with a fixed shift, uniform in d.
The Riesel–Vaughan small-shift second-moment argument.
Chebyshev's log2 constant from Mathlib carried into the sieve moments.
Formalization scope
The Lean statement is the campaign template verbatim with 159 in place of the value. Already proved on the platform: Schnir.sieve_ineq, Schnir.G_lower, Schnir.pi_lower, Schnir.basis_of_density. Mathlib supplies the Chebyshev bounds (Chebyshev.psi_ge', Chebyshev.theta_le_log4_mul_x) and the Λ² sieve framework (Mathlib.NumberTheory.SelbergSieve).
Selected references
H. Riesel, R. C. Vaughan, On sums of primes, Ark. Mat. 21 (1983), 45–74.
Helfgott (2013): every odd n>5 is a sum of three primes. (arXiv:1312.7748)
The campaign's earlier values (100001 down to 241) came from Schnirelmann's method with every constant written out. Those arguments stall near 241 because the medium range relies only on a Chebyshev lower bound for π(y). This entry adds the small-shift idea of Riesel and Vaughan, which removes that bottleneck without any zeta-zero input.
Setting
A representation of n as a sum of at most k primes is a finite multiset of primes summing to n with at most k elements counted with multiplicity. The Schnirelmann density of A⊆Z≥0 is σ(A)=infN≥1∣A∩{1,…,N}∣/N (Mathlib: schnirelmannDensity).
Formalization target
Goal
∀n∈N,n odd,n>1⟹∃s multiset of primes,∣s∣≤151,∑s=n.
This is the campaign template with the value 151 filled in.
How the bound arises
Let B={(p−3)/2:p odd prime} and A=B+B. We show σ(A)≥1/75, then conclude with Mann's theorem as in the 241 entry. Write L=logy for the scale.
Chebyshev constant log2. Mathlib's ψ(x)≥(x−1)log2−log(x+2) gives π(x)≥(xlog2−O(logx))/logx, better than the constant 2/3 used in earlier entries. On its own it covers L≲90 through B⊆A.
Small-shift range (Riesel–Vaughan 1983, Lemma 8). Fix the first 500 odd primes p1 (up to 3581) and let R(s) count s=p1+q with q prime. Then ∑sR(s) needs only π, and ∑sR(s)2 needs an upper bound for prime pairs q,q+d with a fixed even shift d. That bound is the Selberg sieve for a(a+d) on an interval, whose local data are those of the existing Goldbach sieve with s:=d. The weight sum ∑p1=p2C(p1−p2) over these primes is a finite computation. Cauchy–Schwarz then gives #{s≤y:R(s)>0}≥y/150 for 90≲L≤104.
Large rangeL≥104: the Selberg pointwise bound r(s)≤bC(s)s/log2s, the weighted first moment (now with constant (log2)2), a high moment of C(s), and Hölder, as in the 241 entry, at a much higher threshold.
Mann's theorem turns 75σ(A)≥1 into 75A=Z≥0, so every odd n beyond a small bound is a sum of 150 odd primes plus one 3, and small n are handled with twos and threes: K=2⋅75+1=151.
Significance
The argument stays elementary: no prime number theorem and no zeros of ζ or L-functions. New reusable components:
Explicit Selberg upper bound for prime pairs (q,q+d) with a fixed shift, uniform in d.
The Riesel–Vaughan small-shift second-moment argument.
Chebyshev's log2 constant from Mathlib carried into the sieve moments.
Formalization scope
The Lean statement is the campaign template verbatim with 151 in place of the value. Already proved on the platform: Schnir.sieve_ineq, Schnir.G_lower, Schnir.pi_lower, Schnir.basis_of_density. Mathlib supplies the Chebyshev bounds (Chebyshev.psi_ge', Chebyshev.theta_le_log4_mul_x) and the Λ² sieve framework (Mathlib.NumberTheory.SelbergSieve).
Selected references
H. Riesel, R. C. Vaughan, On sums of primes, Ark. Mat. 21 (1983), 45–74.
Helfgott (2013): every odd n>5 is a sum of three primes. (arXiv:1312.7748)
The campaign's first proved value, 100001, came from Schnirelmann's method with every constant written out. This entry records a sharper value, 241, from the same elementary circle of ideas.
Setting
A representation of n as a sum of at most k primes is a finite multiset of primes summing to n with at most k elements counted with multiplicity. The Schnirelmann density of A⊆Z≥0 is σ(A)=infN≥1∣A∩{1,…,N}∣/N (Mathlib: schnirelmannDensity).
Formalization target
Goal
∀n∈N,n odd,n>1⟹∃s multiset of primes,∣s∣≤241,∑s=n.
This is the campaign template with the value 241 filled in. The argument proves the stronger statement that every odd n≥483 is a sum of exactly241 primes; the at-most form for all odd n>1 follows.
How the bound arises
It follows the companion 351 entry, with every parameter pushed to the limit of the same tools. Let B={(p−3)/2:p odd prime} and A=B+B. We show σ(A)≥1/120:
Sieve at a low threshold. The explicit Selberg inequality with z=s/(logs)2 gives r(s)≤445C(s)s/(logs)2 for even s≥e130, where r(s) counts representations s=p+q by odd primes and C(s)=∏p∣s(1+p/(p−1)2).
Weighted first moment.∑e130<s≤xr(s)(logs)2/s≥0.439x for x≥e159.
Sixteenth moment of C. Expanding C(s)16 over squarefree divisors, treating the primes up to 31 exactly and bounding the tail in one step, gives ∑s≤x,2∣sC(s)16≤9.44⋅1012x.
Hölder with exponent 16 then gives #{s≤x:r(s)>0}≥x/238 for x≥e159. Below that scale, Chebyshev's bound π(y)−1≥2y/(3logy) and B⊆A suffice, so σ(A)≥1/120 at every scale.
Mann's theorem, σ(D+E)≥min{1,σ(D)+σ(E)} for sets containing 0, gives 120A=Z≥0, so 240B=Z≥0. For odd n≥3K=723, write (n−3K)/2 as a sum of 240 elements of B and add one more 3. For 483≤n<723, use n−2K threes and 3K−n twos. This gives K=241.
About 241 is the floor of this method: the medium range relies on the Chebyshev constant 2/3, which forces the sieve threshold below e4k/3 and so inflates the sieve coefficient.
Significance
The bound is far weaker than Tao's 5 or Helfgott's 3, but it rests on an elementary argument with no "sufficiently large" threshold and no prime number theorem, so it is a realistic target for a complete formalization. Reusable components:
Explicit Chebyshev-type lower bound for π(y).
Explicit Selberg upper-bound sieve for r(s) at an arbitrary threshold.
High moments ∑s≤xC(s)q of the singular-series factor.
Mann's theorem (αβ theorem) on Schnirelmann density.
Formalization scope
The Lean statement is the campaign template verbatim with 241 in place of the value. All the ingredients above except the moment bound and the final assembly are already proved on the platform (Schnir.sieve_ineq, Schnir.G_lower, Schnir.pi_lower, Schnir.basis_of_density).
Explicit improvement of the 100001 constant (unpublished AI-assisted calculation, October 2026), extending the 351 entry. Source of the constant 241; not peer reviewed.
1 thm1 active userReviewed
🏆Completed
Captain: xuanji
Every Odd Number Greater Than 1 is the Sum of at Most 6101 PrimesResearch Paper
Motivation
Schnirelmann showed around 1930, by elementary means, that some absolute constant k makes every integer n>1 a sum of at most k primes. For odd n:
Schnirelmann (1930s): some finite k, by elementary methods.
Vinogradov (1937): every sufficiently large odd integer is a sum of three primes.
Ramaré (1995): every even integer is a sum of at most six primes, so every odd n>1 is a sum of at most seven. (Ann. Sc. Norm. Super. Pisa, 1995)
Helfgott (2013): every odd n>5 is a sum of three primes. (arXiv:1312.7748)
The campaign's first proved value, 100001, came from Schnirelmann's method with every constant written out. This entry records a sharper value, 6101, from the same elementary circle of ideas.
Setting
A representation of n as a sum of at most k primes is a finite multiset of primes summing to n with at most k elements counted with multiplicity. The Schnirelmann density of A⊆Z≥0 is σ(A)=infN≥1∣A∩{1,…,N}∣/N (Mathlib: schnirelmannDensity).
Formalization target
Goal
∀n∈N,n odd,n>1⟹∃s multiset of primes,∣s∣≤6101,∑s=n.
This is the campaign template with the value 6101 filled in. The source proves the stronger statement that every odd n≥12203 is a sum of exactly6101 primes; the at-most form for all odd n>1 follows.
How the bound arises
It keeps the explicit Selberg sieve, Cauchy–Schwarz and Schnirelmann's original sumset inequality from the 100001 entry, and improves the first moment:
Whole-triangle count. Counting all pairs with p+q≤x gives ∑s≤xr(s)≥2(x−2000)2/(9(logx)2) for x≥2000.
Weighting. Weighting r(s) by (logs)2/s cancels the varying factor in the sieve bound r(s)≤9C(s)s/(logs)2, giving a weighted first moment of at least 10044x.
Second moment of C. With ∑s≤x,2∣sC(s)2≤221x, Cauchy–Schwarz yields σ(A)≥1/2200 for A=B+B, B={(p−3)/2}.
Schnirelmann's inequality with m=1525 (the least m with (1−1/2200)m<1/2) gives K=4m+1=6101.
Significance
The bound is far weaker than Tao's 5 or Helfgott's 3, but it rests on an elementary argument with no "sufficiently large" threshold and no prime number theorem, so it is a realistic target for a complete formalization and a large step down from 100001. Reusable components:
Explicit Chebyshev-type lower bound for π(y).
Explicit Selberg upper-bound sieve for r(s).
Moment bounds for the singular-series factor C(s).
The Lean statement is the campaign template verbatim with 6101 in place of the value. Mathlib already has schnirelmannDensity, the Λ² Selberg sieve setup (Mathlib/NumberTheory/SelbergSieve.lean) and central-binomial bounds.
Helfgott (2013): every odd n>5 is a sum of three primes. (arXiv:1312.7748)
The campaign's first proved value, 100001, came from Schnirelmann's method with every constant written out. This entry records a sharper value, 97041, from the same elementary circle of ideas.
Setting
A representation of n as a sum of at most k primes is a finite multiset of primes summing to n with at most k elements counted with multiplicity. The Schnirelmann density of A⊆Z≥0 is σ(A)=infN≥1∣A∩{1,…,N}∣/N (Mathlib: schnirelmannDensity).
Formalization target
Goal
∀n∈N,n odd,n>1⟹∃s multiset of primes,∣s∣≤97041,∑s=n.
This is the campaign template with the value 97041 filled in. The source proves the stronger statement that every odd n≥194083 is a sum of exactly97041 primes; the at-most form for all odd n>1 follows.
How the bound arises
It is the argument behind the 100001 entry, unchanged up to the last step: the explicit Selberg sieve and Cauchy–Schwarz give σ(A)≥1/35000 for A=B+B, B={(p−3)/2:p odd prime}. The only change is to take the smallest admissible m in Schnirelmann's inequality: (1−1/35000)m<1/2 first holds at m=24260 (rather than the rounded 25000), so 2mA=Z≥0 and K=4m+1=97041.
Significance
The bound is far weaker than Tao's 5 or Helfgott's 3, but it rests on an elementary argument with no "sufficiently large" threshold and no prime number theorem, so it is a realistic target for a complete formalization and a large step down from 100001. Reusable components:
Explicit Chebyshev-type lower bound for π(y).
Explicit Selberg upper-bound sieve for r(s).
Moment bounds for the singular-series factor C(s).
The Lean statement is the campaign template verbatim with 97041 in place of the value. Mathlib already has schnirelmannDensity, the Λ² Selberg sieve setup (Mathlib/NumberTheory/SelbergSieve.lean) and central-binomial bounds.