The study of algebraic structures — groups, rings, and fields — and, through algebraic geometry, the geometry of the solution sets of polynomial equations. Using commutative algebra to describe these varieties, the field provides a common language of symmetry and structure that underlies much of modern mathematics.
Missions
🏆Completed
Captain: Lucas
Fundamental Theorem of Galois Theory I: Galois Extensions and the Galois CorrespondenceTextbook
Motivation
Many questions about polynomial equations — which equations can be solved by radicals, which geometric constructions are possible with ruler and compass, how the roots of a polynomial are related — become questions about the symmetries of a field extension. The fundamental theorem of Galois theory, going back to Évariste Galois, is the dictionary that makes this possible: for a finite Galois extension it matches intermediate fields with subgroups of a finite group, so that questions about fields become questions in finite group theory. The same dictionary underlies Kummer theory and class field theory, and it is the step that turns the unsolvability of the general quintic (Abel–Ruffini) into a statement about solvable groups.
This mission follows the Wikipedia article Fundamental theorem of Galois theory (revision 1345286594): its main statement, its list of properties of the correspondence, three of its worked examples, and its section on the infinite case.
Setting
A field extensionE/F is a field E with a field F inside it; it is finite when E is finite-dimensional as an F-vector space, of dimension [E:F]. An intermediate field is a field K with F⊆K⊆E. The automorphism groupG=Aut(E/F) is the group of field automorphisms σ of E with σ(a)=a for every a∈F.
The two maps of the correspondence are:
for a subgroup H≤G, the fixed fieldEH={x∈E:σ(x)=x for all σ∈H};
for an intermediate field K, the fixing subgroupAut(E/K)={σ∈G:σ(x)=x for all x∈K}.
The extension is Galois when it is normal and separable; for a finite extension this is equivalent to ∣G∣=[E:F]. When E/F is Galois, G is written Gal(E/F).
For an infinite algebraic Galois extension, G carries the Krull topology: the coarsest topology for which each restriction map G→Gal(L/F), with L/F a finite Galois subextension and Gal(L/F) discrete, is continuous.
Formalization targets
Goal: Galois if and only if the correspondence is one-to-one
For a finite extension E/F,
E/F is Galois⟺(∀K,EAut(E/K)=K) and (∀H≤G,Aut(E/EH)=H).
Milestones
Basic form (forward direction of the goal, already on the platform): for finite Galois E/F the two maps are mutually inverse.
Non-Galois case: for finite non-Galois E/F, H↦EH is injective but not surjective, K↦Aut(E/K) is surjective but not injective, and F is not the fixed field of any subgroup.
Inclusion reversing: H1≤H2⟺EH2⊆EH1.
Degrees: [E:EH]=∣H∣ and [EH:F]=[G:H].
Normality: EH/F is normal ⟺H is a normal subgroup.
Quotient: if H is normal, restriction to EH induces an isomorphism G/H≅Gal(EH/F).
Example 1: K=Q(2,3) has degree 4, is Galois, its Galois group is a Klein four-group, and it has five subgroups and five intermediate fields.
Example 2: the splitting field of x3−2 over Q has degree 6, Galois group ≅S3, six subgroups and six intermediate fields.
Example 4: Q(32) has degree 3, trivial automorphism group, and is not Galois.
Infinite case, well-definedness: for any Galois extension, Aut(E/K) is closed in the Krull topology.
Infinite case (already on the platform): intermediate fields correspond bijectively to closed subgroups.
Significance
The result. The correspondence turns the lattice of intermediate fields of a finite Galois extension into the (reversed) lattice of subgroups of a finite group, with degrees matching indices and normal subextensions matching normal subgroups. This is the tool used to classify subfields, to compute Galois groups of explicit polynomials, and to prove that solvability by radicals corresponds to solvability of the Galois group.
Formalizing it. The theorems are classical, and Mathlib contains formal proofs of the general finite and infinite correspondences (for example IsGalois.intermediateFieldEquivSubgroup and the InfiniteGalois namespace). This mission's contribution is a statement set indexed by the source: the converse direction ("only if Galois") as the goal, the non-Galois behaviour, each listed property, and the concrete examples of the article. The explicit examples require genuine computation: degrees of towers, minimal polynomials, and counting subgroups and subfields.
Difficulty
The general statements reduce to Artin's theorem and a degree count, but the non-Galois milestone asks for four separate claims about injectivity and surjectivity, each needing the correct direction of Artin's theorem. The examples cannot be settled by a general principle: showing that Q(2,3) has exactly five intermediate fields, or that the splitting field of x3−2 has degree 6, requires irreducibility arguments and an explicit transfer through the correspondence. Showing that Q(32) has no non-trivial automorphism requires knowing that the other two roots of x3−2 are not real.
Formalization scope
All statements use Mathlib's IntermediateField F E, IntermediateField.fixedField, IntermediateField.fixingSubgroup, the automorphism group E ≃ₐ[F] E, and IsGalois (normal and separable). Finite means FiniteDimensional F E. Subgroups in the finite statements range over all subgroups; in the infinite case the Krull topology is Mathlib's standard topology on E ≃ₐ[F] E. Degrees are Module.finrank, orders are Nat.card, and the index is Subgroup.index. The concrete fields of the examples are taken inside R (for Q(2,3) and Q(32), with 32=21/3 the real cube root) or as the abstract splitting field (for x3−2). The quotient milestone takes the normality of H and of EH/F as instance hypotheses; they are equivalent by milestone 5, so neither is vacuous.
The article's Example 3 (the anharmonic group acting on C(λ)) and the "Applications" section are out of scope for this first mission. No new definitions are needed; contributions of proofs for any milestone are welcome.
Symplectic Modules Free over an Abelian NilradicalResearch Paper
Motivation
Polynomial representations provide a concrete way to study modules over Lie algebras: the underlying vector space is a polynomial ring, while the Lie generators act by explicit multiplication, shift, and differential operators. Chen and Tan classify a family of modules over the symplectic Lie algebra sp2ℓ(C) that are free of rank one over the universal enveloping algebra of an abelian nilradical. Their paper determines the family, its isomorphism classes, its weight and simplicity criteria, its finite-length behavior at exceptional parameters, and an application to Hamiltonian Lie algebras. This mission packages those headline results into one common Lean target, corresponding to Theorems 1.1--1.3 of Chen--Tan.
The common-family formulation matters. The source does not assert three unrelated existence theorems: one explicit two-parameter family τ(C,Φ) carries all of the classification, simplicity, finite-length, and Hamiltonian consequences. The Lean goal therefore quantifies that family once and requires all headline properties of the same witness.
Setting
Fix ℓ≥2 and the complex symplectic Lie algebra sp2ℓ(C). The relevant maximal parabolic subalgebra has an abelian nilradicaln. Its enveloping algebra is a polynomial algebra in the root generators, represented formally by a multivariate polynomial ring. A rank-one free U(n)-module can consequently be modeled on that polynomial ring.
The definition bundle presents the simple Chevalley generators and their action by explicit operators depending on a scalar C∈C and a polynomial parameter Φ. Rather than assuming that these formulas already form a representation, the target asks for a generator presentation satisfying the symplectic Lie relations and for a representation family τ(C,Φ) realizing the formulas. It also formalizes module equivalence, weight spaces, simplicity, Noetherian and Artinian conditions, finite composition factors, and the Shen--Larsson construction for a Hamiltonian Lie algebra.
Formalization targets
Common polynomial-module family
Prove that for every ℓ≥2 there is one generator presentation and one family
(C,Φ)⟼τ(C,Φ)
of sp2ℓ(C)-representations on the polynomial ring, free of rank one over the abelian nilradical, satisfying the explicit generator formulas. Prove the source's classification and isomorphism criteria, including that τ(C,Φ) is a weight module exactly when Φ is constant, and the stated simplicity criterion outside the exceptional arithmetic set
{2ℓ+1−2n:n∈Z>0}.
For exceptional C, prove the Noetherian/Artinian and finite-composition-series conclusions and the weight/nonweight classification of the composition factors. Finally, prove that the canonical Hamiltonian Shen--Larsson construction has the exact degree-weight spaces and the source's simplicity and weight-module consequences. All clauses must be witnessed by the same family τ.
Significance
The result gives a complete algebraic description of a large concrete class of non-highest-weight modules. It separates the generic simple regime from an exceptional finite-length regime and shows how nonweight symplectic modules generate weight modules over an infinite-dimensional Hamiltonian Lie algebra. The explicit formulas make the family suitable for calculation, while the classification prevents duplicate parameter choices from being mistaken for genuinely different modules.
Formalization adds checks that are easy to blur in prose. In particular, the generator formulas cannot be called a Lie representation until the defining relations have been verified, and the same witness must support every later theorem. A completed proof will contribute reusable Lean infrastructure for symplectic root data, polynomial representations, module-theoretic finiteness, exact weight-space descriptions, and Hamiltonian Lie-algebra functors. The paper's proofs are known; the open task is their machine-checked reconstruction.
Difficulty
The first obstacle is structural rather than computational. Checking formulas on individual generators is insufficient: all Chevalley and Serre relations must hold with the correct operator order and signs, after which the action must extend to the full Lie algebra. Classification then requires controlling arbitrary rank-one-free modules, not merely verifying that the displayed examples exist.
The exceptional parameters introduce a second layer. Generic simplicity and exceptional finite length are logically different claims, and the composition-factor statement must be tied to the same parameterized representation. The Hamiltonian application adds another algebra and a tensor construction; exact weight spaces and simplicity cannot be obtained by treating the functor as an opaque interface. The Lean goal deliberately keeps these obligations inside one theorem so that separate convenient witnesses cannot satisfy different portions.
Formalization scope
The mission works over C with natural rank ℓ≥2. The definition bundle uses concrete multivariate polynomials, matrices and linear maps, a presented symplectic Lie algebra, Lie representations, submodules, and tensor products. The exceptional set is expressed with complex coercions, so no accidental natural-number division is involved. The nilradical action, freeness, parameter equivalence, weight-space equalities, simplicity, finite-length properties, and Hamiltonian brackets are transparent propositions in the bundle.
The final theorem is a single conjunction under one existentially quantified presentation and one existentially quantified family τ. Several convenient corollaries can be projected from it, but they are not independent targets and do not permit different witnesses. The bundle contains no custom axioms or opaque semantic assumptions, and the only admitted term is the main theorem's sorry. Contributions may split the proof into source-numbered lemmas about generator relations, classification, exceptional submodules, or the Shen--Larsson application, provided the shared-family quantifier structure is preserved.
Selected references
Yang Chen and Haijun Tan, Simple sp2ℓ(C)-modules which are free over an abelian nilradical, Journal of Algebra 697 (2026), 341--372, Theorems 1.1--1.3 (formal Theorems 3.7, 3.8, 4.7, 4.9, and 5.2). DOI
G. Shen, foundational work on mixed-product constructions for modules over Lie algebras of Cartan type, cited in the source paper for the Shen--Larsson functor.
On Ideal Lattices and Learning with Errors over Rings: Multiplication by t ∈ I with tI⁻¹ Coprime to J Induces an R-Module Isomorphism M/JM ≅ IM/IJMResearch Paper
Background and motivation
Ring learning with errors (ring-LWE) is the algebraic variant of the learning-with-errors problem on which most practical lattice-based cryptography is built, including the key-encapsulation scheme ML-KEM standardized by NIST in 2024. Its hardness rests on the paper of Lyubashevsky, Peikert and Regev, On ideal lattices and learning with errors over rings (J. ACM 60(6), 2013, doi:10.1145/2535925; conference version at EUROCRYPT 2010). The paper's main theorem (Theorem 3.6, p. 19) is a polynomial-time quantum reduction from worst-case approximate shortest-vector problems on ideal lattices to the ring-LWE decision problem. Statements about reductions, running times and negligible probabilities are outside the scope of this mission.
What this mission formalizes is the algebraic tool both of the paper's reductions rest on, which the authors list among their main technical contributions (p. 7): a Chinese-remainder technique for clearing an ideal. An arbitrary ideal I of the ring of integers R need not be principal, so a reduction that receives samples from a lattice I cannot simply divide by a generator. Lemmas 2.14 and 2.15 show that, modulo an ideal J such as ⟨q⟩, multiplication by a well-chosen t∈I identifies R/qR with I/qI, and more generally M/JM with IM/IJM for every fractional ideal M. Steps 1–3 of the BDD-to-LWE reduction of §4.2 consist of exactly these identifications. The authors note that the lemmas are "probably standard for experts in computational number theory" (p. 16); the formulation used in lattice cryptography is theirs, and it is reused throughout the later literature on algebraic lattices.
Setting
Let K be a number field of degree n and R=OK its ring of integers. An integral ideal is a nonzero ideal I⊆R (the paper excludes {0}, footnote 2, p. 13). A fractional ideal is a set I⊂K such that dI is an integral ideal for some nonzero d∈R; the nonzero fractional ideals form a group under multiplication, and I−1 denotes the inverse. Two integral ideals are coprime when I+J=R.
For t∈R the cleared ideal is t⋅I−1=⟨t⟩I−1. When t∈I it is an integral ideal, and "t⋅I−1 is coprime to J" means
t⋅I−1⊆Randt⋅I−1+J=R.
For a fractional ideal M and t∈I, the map θt(u)=t⋅u sends M into IM, and therefore induces an R-linear map
θt:M⟶IM/IJM,u↦tumodIJM.
The dual of a fractional ideal L is L∨={x∈K:Tr(xL)⊆Z}; R∨ is the codifferent, and I∨=I−1R∨. For the cyclotomic field K=Q(ζ), ζ a primitive m-th root of unity, τk (k∈Zm∗) is the automorphism with τk(ζ)=ζk, and for a prime q≡1(modm) with a primitive m-th root of unity ω∈Zq the primes above q are qi=⟨q,ζ−ωi⟩, i∈Zm∗. Calligraphic I,J,M of the paper are written I, J, M in the milestone texts.
Formalization targets
Goal: Lemma 2.15 (p. 17)
For nonzero ideals I,J⊆R, t∈I with t⋅I−1 coprime to J, and a nonzero fractional ideal M,
θt:M→IM/IJMis surjective with kernelJM,soM/JM≅IM/IJM
as R-modules, via umodJM↦tumodIJM.
Milestones
The existence content of Lemma 2.13 (a coprime pair has c∈J with c≡1modI), already proved on the platform and entered as a reference. Lemma 2.12 (Chinese Remainder Theorem) is also included as a reference item, without being a milestone.
Lemma 2.14 (p. 16): for nonzero I,J there exists a nonzero t∈I with t⋅I−1 coprime to J.
The kernel claim of the proof of Lemma 2.15: u∈M and tu∈IJM imply u∈JM.
The surjectivity claim of the proof: if c∈t⋅I−1 and c≡1modJ, then for v∈IM, cv∈tM and cv−v∈IJM.
Companion statements
§4.2 step 2 (p. 23) and step 3 (p. 24): multiplication by t is a bijection R/qR→I/qI and I∨/qI∨→R∨/qR∨ for every integer q≥2, the two instances of Lemma 2.15 the reduction uses.
Lemma 2.16 (p. 17): τj(qi)=qi/j for all i,j∈Zm∗.
Lemma 2.9 (p. 14): n1/pN(I)1/n≤λ1(I)≤n1/pN(I)1/nΔK1/n in every ℓp norm, p∈[1,∞], stated as two items.
Significance
The isomorphism of Lemma 2.15 is what makes ideal lattices usable in worst-case to average-case reductions: it turns a discrete Gaussian sample from an arbitrary ideal I into a uniform element of the fixed ring Rq, and turns the ring-LWE secret in Rq∨ back into a coset of qI∨. Lemma 2.16 is the corresponding tool for the search-to-decision reductions of §5, which move between the CRT components R/qi of a completely split q. Lemma 2.9 gives the scale of the lattices involved.
On the formal side, none of Lemmas 2.14–2.16 is stated on the platform or in Mathlib in this form. Mathlib has the Chinese remainder theorem for ideals, inverses of fractional ideals in Dedekind domains, trace duals with I∨=I−1R∨, and the isomorphism Gal(Q(ζm)/Q)≅(Z/mZ)∗; the mission connects these to the quotient modules and explicit primes that lattice cryptography works with. All statements are proved in the paper; what remains is the formal proof.
Difficulty
The obvious argument for Lemma 2.15 — both quotients have cardinality N(J), so an injective map is bijective — needs the multiplicativity of the norm on fractional ideals and finiteness of the quotients, and still needs the kernel computation, which uses unique factorization: from tu∈IJM one has to cancel I and M inside the group of fractional ideals and then use coprimality of tI−1 and J. Lemma 2.14 needs the factorization of I along the primes of J and a CRT choice of t; for J=0 it would assert that I is principal, which is why the nonzero convention matters. In Lemma 2.16 the delicate point is the direction of the action: τj sends qi to qi/j, not qij.
Formalization scope
K is a NumberField, R is 𝓞 K, fractional ideals are FractionalIdeal (𝓞 K)⁰ K, and integral ideals are coerced into them. Ideals are nonzero, per footnote 2: every statement carries I ≠ ⊥ (and J ≠ ⊥, M ≠ 0 where the paper's convention applies); I ≠ ⊥ is essential because Lean defines 0−1=0. Two kernel/surjectivity milestones drop the nonzero hypotheses on J and M, which only strengthens them.
"tI−1 coprime to J" is the predicate ClearedCoprime: tI−1≤1 and tI−1+J=1 in the semiring of fractional ideals.
M/N is the quotient of the R-module M by N∩M; θt is the given R-linear map M→IM/IJM. The goal states surjectivity and the kernel of this map. A bare statement that some isomorphism M/JM≅IM/IJM exists would be true for unrelated reasons and is not the lemma.
Duals are Mathlib's FractionalIdeal.dual ℤ ℚ. τj is the inverse image of j under IsCyclotomicExtension.Rat.galEquivZMod, acting on ideals by images; ωi uses the representative of i in {0,…,m−1}. ℓp norms sum over all n complex embeddings; λ1 bounds are phrased through nonzero elements of I.
Dropped algorithmic clauses: "such t can be found efficiently" (Lemma 2.14), "this isomorphism may be efficiently inverted" (Lemma 2.15), the "deterministic polynomial-time algorithm" of Lemma 2.13 (only the existence of c is referenced), and "which can be efficiently inverted" in §4.2. No complexity notion is encoded.
Contributions welcome: proofs of the milestones, of the goal from them, and of the companion statements; general lemmas on quotients M/JM of fractional ideals are reusable beyond this mission.
Selected references
V. Lyubashevsky, C. Peikert, O. Regev, On ideal lattices and learning with errors over rings, J. ACM 60(6), Article 43, 2013. https://doi.org/10.1145/2535925
V. Lyubashevsky, C. Peikert, O. Regev, On ideal lattices and learning with errors over rings, EUROCRYPT 2010, LNCS 6110, pp. 1–23. https://doi.org/10.1007/978-3-642-13190-5_1
Hilbert's Nullstellensatz (Wikipedia) I: Formulations over Algebraically Closed FieldsTextbook
Motivation
Hilbert's Nullstellensatz ("theorem of zeros") is the basic link between algebra and geometry. It was proved by David Hilbert in his second major paper on invariant theory in 1893, after his 1890 paper that proved the basis theorem, and it is a foundational result of algebraic geometry. It gives an algebraic criterion for when a system of polynomial equations over an algebraically closed field has a solution, and an algebraic criterion for when one polynomial vanishes wherever a given family does. Every dictionary between affine varieties and ideals — points and maximal ideals, algebraic sets and radical ideals, irreducible sets and prime ideals — is a consequence.
This mission follows the Wikipedia article Hilbert's Nullstellensatz (snapshot of 27 September 2026): its introduction, its section Formulations, the statement of Zariski's lemma from Proofs, and the first theorem of Generalizations (finitely generated algebras over Jacobson rings).
Setting
Let k be a field and K an algebraically closed field extension of k (every non-constant polynomial over K has a root in K). Write k[X1,…,Xn] for the polynomial ring in n variables. A point is an n-tuple a=(a1,…,an)∈Kn, and f(a) is the value of a polynomial f at a.
For an ideal J, the algebraic set (zero locus) is V(J)={a∈Kn:f(a)=0 for all f∈J}.
For U⊆Kn, the vanishing ideal is I(U)={p:p(a)=0 for all a∈U}.
The radical of J is J={p:pr∈J for some r∈N}.
For a∈Kn, ma=(X1−a1,…,Xn−an) is the ideal of the point.
A subset W⊆Kn is irreducible (Zariski topology) if it is nonempty and is not covered by two algebraic sets without lying in one of them.
A commutative ring is Jacobson if every radical ideal is an intersection of maximal ideals.
Formalization targets
Goal: the Nullstellensatz
If p∈k[X1,…,Xn] vanishes on V(J)⊆Kn, then
∃r∈N,pr∈J.
This is the statement of the article's section Formulations, with the coefficient field k and the algebraically closed field K allowed to differ.
Milestones
Systems of equations. Over algebraically closed K: a system f1=⋯=fm=0 has no solution in Kn iff g1f1+⋯+gmfm=1 for some gi; and f vanishes on all solutions iff fr=g1f1+⋯+gmfm for some r and gi.
Geometric form.I(V(J))=J.
Weak Nullstellensatz. A proper ideal of k[X1,…,Xn] has a common zero in Kn; algebraic closedness is needed, as (X2+1)⊆R[X] shows; for K=C, n=1 this is the fundamental theorem of algebra: P has a complex root iff degP=0.
Correspondences.V is an order-reversing bijection from radical ideals onto algebraic sets, with inverse I; I({a})=ma is maximal; every maximal ideal of K[X1,…,Xn] is some ma; an algebraic set W is irreducible iff I(W) is prime.
Intersections.J=⋂m⊇Jm=⋂a∈V(J)ma.
Zariski's lemma. A field finitely generated as an algebra over a field K is a finite extension of K.
Jacobson rings. A finitely generated algebra S over a Jacobson ring R is Jacobson, and for a maximal ideal n⊆S, n∩R is maximal and S/n is finite over R/(n∩R).
Significance
The Nullstellensatz makes the zero sets of polynomial systems accessible through ideals: solvability of a system becomes the ideal-membership question 1∈J, and the geometry of algebraic sets becomes the algebra of radical ideals. Consequences include the identification of the points of Kn with the maximal ideals of K[X1,…,Xn], the description of irreducible algebraic sets by prime ideals, and the reduction of the fundamental theorem of algebra to the case n=1. The Jacobson-ring version extends the first equality of the intersection formula to every finitely generated algebra over a field.
All statements here are classical and proved. Mathlib already contains versions of several of them in its own vocabulary (Jacobson rings, Zariski's lemma, and a Nullstellensatz over an algebraically closed coefficient field). What this mission adds is a single set of statements matching the article's formulations: the version with separate fields k⊆K, the explicit systems-of-equations form, the point-ideal and irreducibility correspondences over Kn, and the intersection formula — and, for solvers, the bridges from these concrete statements to Mathlib's abstract ones.
Difficulty
The inclusion J⊆I(V(J)) is immediate; the content is the reverse inclusion, which requires producing a point of Kn from purely algebraic data. When k=K the ideal J lives over k while the points live over K, so a result stated only for K[X1,…,Xn] does not apply directly: an ideal of k[X] must be related to the ideal it generates in K[X] without losing membership information. For the correspondences, the explicit ideals ma and the closed-set definition of irreducibility must be matched with the abstract notions (maximal spectrum, irreducible closed subsets) used in the library.
Formalization scope
Points of Kn are functions Finn→K; polynomials are MvPolynomial (Fin n) k. When k=K, K is a k-algebra and evaluation of a polynomial over k at a point of Kn goes through k→K.
n=0 is allowed throughout; so is the unit ideal J=k[X], where V(J)=∅ and empty intersections of ideals are the whole ring.
Irreducibility is stated through closed sets (algebraic sets) without putting a topology on Kn. The degree in the n=1 statement is Mathlib's Polynomial.degree, with deg0=−∞.
In the goal, the exponent r may be 0; that witness only works when J is the unit ideal, so it does not trivialize the statement.
Out of scope: the proofs via resultants and Gröbner bases, the effective Nullstellensatz, Lang's infinite-variable version, the scheme-theoretic generalizations, and the projective and analytic Nullstellensätze.
Reusable output: the definitions V, I, algebraic set, irreducible set and ma, and bridges to Mathlib's MvPolynomial.zeroLocus, MvPolynomial.vanishingIdeal, and IsJacobsonRing.
Selected references
D. Hilbert, Ueber die vollen Invariantensysteme, Mathematische Annalen 42 (1893).
Clifford Casimir I: Odd-Sector Adjoint Spectrum on Cl(6,0)Research Paper
Motivation
The real Clifford algebra Cl(6,0) is the smallest Euclidean Clifford algebra whose full structure carries a nontrivial multiplicity-eight representation-theoretic decomposition, and it has become a recurring object in programs that build internal gauge and family structure from Clifford generators rather than imposing it by hand. Within such programs, the single most basic representation-theoretic question one can ask about the algebra is: how does a distinguished su(2) subalgebra, acting by the adjoint action, decompose the odd part of the algebra as a representation?
This mission answers that question exactly, for the specific triple of bivectors built on the index set {0,2,5}. The computation was carried out structurally (by splitting active indices from spectator indices) in the LeanProofs research program in 2026 and recorded with exact multiplicities; no machine-checked proof exists yet. The purpose here is to close that gap: the result is finite-dimensional linear algebra, completely within reach of a Lean 4 + Mathlib development, and every constant in it is explicit.
Setting
Fix R6 with its standard inner product and the associated quadratic form Q60=diag(1,1,1,1,1,1), and let Cl(6,0)=CliffordAlgebra(Q60) be the real Clifford algebra generated by symbols e0,…,e5 with
ei2=1,eiej=−ejei(i=j).
The algebra is Z-graded in the usual sense: it is the direct sum of its grade-k subspaces, spanned by products of k distinct generators, of dimension (k6). The odd sector is the linear span of the odd grades,
On it, register three bivectors and their halved adjoint actions:
E1=e0e2,E2=e2e5,E3=e0e5,Ti=21adEi,
where adX(Y)=XY−YX. The triple satisfies the su(2) relations [E1,E2]=2E3 and cyclic permutations, so the Ti generate a copy of su(2) with [T1,T2]=T3 cyclically. The associated quadratic Casimir is the endomorphism
C=−(T12+T22+T32).
Because each Ei is even, every Ti preserves the odd sector, and so does C.
Formalization targets
Goal — the Casimir spectrum with exact multiplicities
CCl−(6,0)has eigenvalue 2 with multiplicity 24and eigenvalue 0 with multiplicity 8,
the two eigenspaces spanning the whole odd sector. Equivalently, as a representation of the generated Spin(3)≅SU(2),
Cl−(6,0)≅8Vj=1⊕8Vj=0,
eight copies of the spin-1 module and eight copies of the trivial module. The goal deliberately asserts only the eigenspace dimensions and their spanning property — the decomposition shape — not any particular basis or pairing.
Stronger — the Cartan weight decomposition
T3-weights on Cl−(6,0):0(multiplicity 16),+1and−1(multiplicity 8 each),
the three weight spaces spanning the sector. This refines the goal: each j=1 copy contributes weights −1,0,+1 and each j=0 copy contributes weight 0.
Significance
The result itself. The spectrum pins down exactly how an su(2) acting from inside the algebra sees the odd sector: not irreducibly, but as a clean 8⊕8 multiplicity split between spin-1 and spin-0. In the LeanProofs program this decomposition is load-bearing for everything downstream that distinguishes "active" indices from "spectator" indices — the multiplicity 8 is the number of spectator degrees of freedom, and its appearance in the spectrum is what makes the split structural rather than coincidental. The weight decomposition further identifies the Cartan grading and is the natural first test case for any technology that must eventually handle larger Clifford algebras or other subalgebras.
Formalizing it. The computation is proved (structurally, by hand, in the research record) but not machine-checked. Everything needed lives in Mathlib: CliffordAlgebra, its Z2 grading CliffordAlgebra.evenOdd, Submodule, LinearMap, Module.finrank. What the mission produces is a fully verified finite spectral computation inside Clifford algebra — a reusable certificate that the platform's Clifford and grading infrastructure supports exact representation-theoretic bookkeeping, not just algebraic identities.
Difficulty
The obstruction is bookkeeping, not ideas. The natural attack — split indices into active {0,2,5} and spectator {1,3,4}, decompose Cl(active)⊗Cl(spectator) as a tensor product of graded pieces, and read off the 8=23 multiplicity from the spectator sector — requires transferring the su(2) action across such a tensor decomposition, which Mathlib does not provide ready-made for Clifford algebras. A purely computational route (fix the 64-element blade basis, build the 32×32 matrices of the Ti explicitly, compute kernels) is straightforwardly correct but laborious; making it readable is the real work. The statement is stated through arbitrary endomorphisms bound pointwise to the halved adjoint actions precisely so that solvers may choose either route.
Formalization scope
The mission commits to: the quadratic form Q60 as QuadraticMap.weightedSumSquares ℝ (fun _ : Fin 6 => 1); generators e6 i = CliffordAlgebra.ι Q60 (Pi.single i 1); the odd sector as the Mathlib-native CliffordAlgebra.evenOdd Q60 1; and the registered triple as products of two generators. All theorems quantify over endomorphism witnesses bound pointwise to 21adEi, so no particular matrix realization is privileged. Spectra are stated as eigenspace decompositions with exact Module.finrank multiplicities — never as pointwise eigenvalue claims, which would be false for mixed vectors. No trivializing formalization exists: the multiplicities are hard constants, and the dimension gate (32) rules out statements about degenerate sector choices. The definition file is reusable for any future mission on Cl(6,0); the su(2) relations and dimension gate are self-contained milestones. Contributions of either a structural (active/spectator split) or computational (explicit blade basis) proof are equally welcome.
Selected references
Lawson & Michelsohn, Spin Geometry, Princeton University Press, 1989 (Clifford algebra grading and structure).
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.
Ngo's Fundamental Lemma II: Isogenies of Root Data and Paired GroupsResearch Paper
Motivation
Waldspurger's non-standard fundamental lemma is an identity between stable orbital
integrals on the Lie algebras of two reductive groups that are not isomorphic, and not even
isogenous as algebraic groups, but whose root data become identified after tensoring with
Q. The basic example is the pair (Sp2n,SO2n+1), whose
root systems Cn and Bn are exchanged by Langlands duality; the identity is what allows
the twisted fundamental lemma to be deduced from the ordinary one. Waldspurger formulated
the conjecture in L'endoscopie tordue n'est pas si tordue (2008); it is Theorem 1.12.7 of
Bao Chau Ngo, Le lemme fondamental pour les algebres de Lie, Publ. Math. IHES 111 (2010),
1-169 (DOI), proved there in equal characteristic
by the same Hitchin-fibration argument that gives the ordinary fundamental lemma.
Before any of that geometry can start, the two sides have to be compared: one needs a single
Cartan subalgebra, a single Weyl group and a single space of characteristic polynomials serving
both groups at once. Producing that comparison is a self-contained piece of linear algebra over
the root data, carried out in Ngo's §1.12, and it is what this mission asks for.
Setting
Let G1 and G2 be split reductive groups over a field, pinned, with maximal tori T1 and
T2. Each is determined by its root datum(X∗(Ti),X∗(Ti),Φi,Φi∨,Δi), where Φi is the set of roots,
Φi∨ the set of coroots and Δi the set of simple roots singled out by the
pinning.
An isogeny of root data between G1 and G2 (Ngo, Definition 1.12.1) is a pair of
isomorphisms of Q-vector spaces
ψ∗:X∗(T2)⊗Q⟶X∗(T1)⊗Q,ψ∗:X∗(T1)⊗Q⟶X∗(T2)⊗Q
which are transposes of one another, such that ψ∗ carries the set of lines
Qα2 (α2∈Φ2) bijectively onto the set of lines
Qα1 (α1∈Φ1), matching lines of simple roots with lines of simple
roots, and such that ψ∗ has the same property for the lines spanned by coroots. Two
semisimple groups with the same adjoint group are isogenous in this sense; so are a group and
its Langlands dual, the interesting cases being Bn↔Cn, F4 and G2,
where a short root α is sent to αˇ and a long root to nαˇ with
n=∣αlong∣2/∣αshort∣2. Groups obtained by twisting a
pair of isogenous pinned groups by a common torsor are called paired.
A prime p is good with respect to ψ∗ when it divides neither of the indices
the two lattices being compared inside the single Q-vector space identified by
ψ∗.
Formalization targets
Goal (1.12.4 and 1.12.6): the Weyl groups are identified compatibly
ψ∗wψ∗−1∈W2for all w∈W1,and conversely,
i.e. conjugation by ψ∗ carries the Weyl group W1 acting on
X∗(T1)⊗Q onto the Weyl group W2 acting on X∗(T2)⊗Q.
Ngo's reason is that the reflection attached to a root depends only on the line through that
root, so the bijection of root lines transports reflections to reflections. This equivariance
is what makes the induced isomorphism t1→t2 descend to an
isomorphism ν:cG1→cG2 of the spaces of characteristic
polynomials, which is Lemme 1.12.6 and which is what allows two points a1 and a2 with
ν(a1)=a2 to be compared at all.
Milestones
Two steps lead there: the reflection computation that makes a matched pair of root lines give
a matched pair of reflections, and the integral statement behind Ngo's good-characteristic
hypothesis — that when the two indices above are invertible in the base ring, the two lattices
become identified after base change.
Significance
Theorem 1.12.7, the non-standard fundamental lemma, asserts that for two paired groups over
Ov=k[[ϖ]] with residue characteristic exceeding twice the Coxeter numbers, and for
points a1 and a2 corresponding under ν, the stable orbital integrals of the
characteristic functions of g1(Ov) and g2(Ov) agree. Waldspurger
showed that this identity, together with the ordinary fundamental lemma, implies the twisted
fundamental lemma. None of the objects in that statement — reductive group schemes over a
discrete valuation ring, orbital integrals, Haar measures on the centralizer tori — exists in
Mathlib today. The comparison of §1.12 does not need any of them: it is a statement about
lattices, root systems and Weyl groups, and it is a strict prerequisite, since without the
isomorphism ν the two sides of Theorem 1.12.7 cannot even be matched up.
Beyond this paper, the notion of an isogeny of root data and the good-characteristic base
change of a pair of lattices are reusable: they are the standard bookkeeping behind Langlands
duality for split groups, and neither is currently available.
Difficulty
The reflection step looks like a one-line computation and is one — but only once the two
proportionality constants are known to agree. If ψ∗(α2)=cα1 and
ψ∗(α1∨)=c′α2∨, the conjugate of sα1 is sα2
exactly when c=c′, and that is forced by transposition together with
⟨α,α∨⟩=2. The genuine difficulty in the goal is different: the
definition only says that ψ∗ and ψ∗ permute lines, so one has to show that the
bijection induced on root lines and the bijection induced on coroot lines are the same
bijection. A solver who assumes this without proof has assumed the substance of 1.12.4.
The lattice milestone has its own trap: the quotient Λ1/(Λ1∩Λ2) must
be shown to have vanishing Tor after base change, not merely to vanish, or the
inclusion becomes only surjective.
Formalization scope
Root data are modelled by Mathlib's RootPairing ι ℚ M N, with M the character space, N
the cocharacter space, and rational coefficients throughout, so that "tensoring with
Q" is built into the ambient objects rather than performed explicitly. A choice of
simple roots is recorded as a subset of the index type rather than as a RootPairing.Base;
nothing in the statements depends on that subset beyond its role in the definition of an
isogeny. The Weyl group is the subgroup of linear automorphisms of the cocharacter space
generated by the coreflections, which is the form in which it acts on the Cartan.
The goal is stated as a two-sided intertwining property rather than as an equality of
subgroups: every element of W1 is intertwined by ψ∗ with some element of W2 and
conversely. This avoids introducing a conjugation homomorphism, and it is the form in which
the statement is used. Both root pairings in the goal are required to be finite, reduced root
systems, matching Ngo's hypothesis that G1 and G2 are reductive groups.
The good-characteristic condition is formalized exactly as Ngo writes it, by the invertibility
in the base ring of the two indices, each expressed as the cardinality of an explicit quotient
group; the conclusion is the bijectivity of the map induced on the tensor product by the
inclusion of the intersection. If a quotient were infinite its cardinality is reported as 0,
and invertibility of 0 then forces the base ring to be trivial, so no false statement hides
in that corner.
No statement here is vacuous: any pair consisting of a root system and itself, with ψ∗
and ψ∗ the identity, satisfies every hypothesis, and the pair (Bn,Cn) gives the
intended non-trivial instances.
T. A. Springer, Reductive groups, in Automorphic Forms, Representations and L-functions, Proc. Sympos. Pure Math. 33 (1979), 3-27. https://doi.org/10.1090/pspum/033.1
Some elementary functions, such as e−x2, sin(x)/x and xx, have antiderivatives that cannot be written as elementary functions. Liouville's theorem, formulated by Joseph Liouville between 1833 and 1841, is the algebraic statement that explains when an elementary antiderivative can exist: if a function has an elementary antiderivative at all, then that antiderivative lies in the differential field of the function, plus finitely many logarithms. The theorem underlies the Risch algorithm for symbolic integration, which relies on it to find any elementary antiderivative.
Setting
A differential field is a field F together with a derivation D:F→F, i.e. an additive map satisfying D(ab)=aDb+bDa. Its constants form the subfield
Con(F)={f∈F:Df=0}.
Let G⊇F be a differential field extension (the derivation of G restricts to that of F).
G is a logarithmic extension of F if G=F(t) with t transcendental over F and Dt=Ds/s for some nonzero s∈F (so t behaves like logs).
G is an exponential extension of F if G=F(t) with t transcendental over F and Dt/t=Ds for some s∈F (so t behaves like es).
G is an elementary differential extension of F if there is a finite chain of subfields F=K0⊆K1⊆⋯⊆Km=G in which every step Ki+1=Ki(ti) is algebraic, logarithmic or exponential.
The running example is C(x), the field of rational functions in one variable with the standard derivative d/dx.
Formalization targets
Goal: Liouville's theorem
Let F⊆G be differential fields of characteristic zero with Con(F)=Con(G), and let G be an elementary differential extension of F. If f∈F and g∈G satisfy Dg=f, then there are n≥0, constants c1,…,cn∈Con(F) and nonzero f1,…,fn∈F, and s∈F with
f=c1f1Df1+⋯+cnfnDfn+Ds.
Milestones from the article
The constants Con(F) form a subfield of F.
C(x) carries a (unique) derivation extending the formal derivative of polynomials.
Con(C(x))=C.
1/x has no antiderivative in C(x).
The antiderivatives lnx+C of 1/x exist in the logarithmic extension C(x,lnx).
1/(x2+1) has no antiderivative in C(x).
x2+11=2i1uDu with u=1−ix1+ix, i.e. tan−1x=2i1ln1−ix1+ix has the form required by the theorem.
Significance
The theorem reduces the question of whether an integral is elementary to a question about the base differential field. That reduction is what makes decision procedures for integration in finite terms (the Risch algorithm) possible, and it is the standard route to proving that e−x2, sin(x)/x or xx have no elementary antiderivative.
The result is classical and proved (Liouville; modern algebraic proof by Rosenlicht; textbook proof in Geddes–Czapor–Labahn, §12.4). Mathlib contains a formalization of the algebraic-extension part of the argument (IsLiouville, isLiouville_of_finiteDimensional in Mathlib/FieldTheory/Differential/Liouville.lean); the logarithmic and exponential steps and the full theorem for elementary extensions are the remaining work.
Difficulty
The algebraic steps can be handled by taking traces. The central difficulty is the transcendental steps: for a logarithmic or exponential generator t one must show, by comparing partial-fraction expansions in t and degrees in t, that an expression of the Liouville form over K(t) can be pushed down to one over K. This needs the hypothesis that no new constants appear. The induction must also track how constants and logarithmic derivatives behave along the whole chain.
Formalization scope
A differential field is a Mathlib Field with a Differential instance (a derivation over Z, written a′); the extension F⊆G is an Algebra F G with DifferentialAlgebra F G, i.e. D commutes with the embedding. The chain of the elementary extension is a sequence of IntermediateField F G, starting at ⊥ and ending at ⊤. Each step adjoins a single element, which is algebraic, logarithmic, or exponential over the previous field, and every derivative is computed in G. Characteristic zero is assumed (CharZero F). The article does not state it, but it is the standing convention of the theorem in its standard sources. Con(F)=Con(G) is stated as the equality of the image of Con(F) with Con(G). In the conclusion, the fi are required to be nonzero, so the quotients Dfi/fi carry no division-by-zero junk.
For the C(x) examples, C(x) is Mathlib's RatFunc ℂ. Mathlib does not provide its derivative, so the examples take an arbitrary derivation satisfying IsStandardDerivation (it agrees with the formal derivative on polynomials). Milestone 2 asserts that exactly one such derivation exists, so the examples are not vacuous.
Selected references
J. Liouville, Premier / Second mémoire sur la détermination des intégrales dont la valeur est algébrique, J. École Polytechnique XIV (1833), 124–193.
Métodos Numéricos (Freitas) III: Sistemas Lineares e a Convergência de Gauss-SeidelTextbook
Motivation
Linear systems are the inner loop of scientific computing: discretized differential equations, least-squares fitting, network flow balances and equilibrium models all end in Ax=b. Direct elimination solves the system exactly in O(n3) operations, but for the large sparse systems produced by discretization the cost and the round-off growth make iterative methods preferable: start from an arbitrary vector and apply a cheap update until the residual is small. The question such a method raises is when the iteration converges, and to that the chapter gives a clean sufficient answer: diagonal dominance.
This mission is the third in a series formalizing the lecture notes Métodos Numéricos by Sergio Roberto de Freitas (UFMS, 2000). It covers the iterative part of Chapter 5, Solução de Sistemas Lineares.
Setting
Let A=(aij) be a real ntimesn matrix and binmathbbRn. Assume aiineq0 for all i.
The Jacobi method computes every coordinate of the new iterate from the old one:
Both are instances of an affine iterationx(k+1)=Bx(k)+d associated with an equivalent rewriting Ax=biffx=Bx+d.
The matrix A is diagonally dominant when each diagonal entry dominates its row:
∣aii∣>sumjneqi∣aij∣qquad(i=1,dots,n).
Target
The goal theorem is Proposição 5.10.1: if A is diagonally dominant and x^\\star solves Ax^\\star = b, then the Gauss-Seidel iterates converge to x^\\star from any starting vector.
The milestones are the general facts the source uses to get there: that the limit of a convergent affine iteration is a fixed point of it and hence a solution of the system (Proposição 5.5.1), that a contraction condition lVertBvrVertleclVertvrVert with c<1 forces convergence to the solution (Proposição 5.5.3), and that the Jacobi sweep has exactly the solutions of Ax=b as its fixed points (Proposição 5.5.2).
Significance
Diagonal dominance is the hypothesis a practitioner can check by inspection, and it is satisfied by the matrices that come from standard finite-difference stencils, from strictly diagonally dominant collocation systems and from many equilibrium models. The theorem says that for those systems Gauss-Seidel needs no spectral analysis and no preconditioner to be safe: convergence holds from any starting vector. The supporting milestones isolate the two halves of the argument — a fixed-point identification and a contraction estimate — in a form reusable for other splittings (Jacobi, SOR, block variants).
Mathlib has Banach's fixed point theorem and the theory of matrix norms, but not the Gauss-Seidel sweep, the notion of diagonal dominance as used here, or the convergence statement, which is what this mission adds.
Difficulty
Gauss-Seidel is not a plain affine map applied coordinatewise: within one sweep the coordinates are updated sequentially, so the new value of coordinate i depends on the new values of coordinates j<i. Formalizing the sweep therefore requires a recursion over the coordinate index before the recursion over the iteration counter, and the contraction estimate has to be propagated along that inner recursion. The classical proof compares \\max_i |x_i^{(k+1)} - x_i^\\star| with \\max_i |x_i^{(k)} - x_i^\\star| and needs, for each i, a bound that already uses the improved bounds for j<i; getting that induction right is the substance of the mission.
Formalization scope
Vectors are functions from a finite index type with n elements to mathbbR, and convergence is convergence in that finite product space (equivalently, coordinatewise). The Gauss-Seidel sweep is defined through an auxiliary partial sweep: after k inner steps the first k coordinates carry their new values and the remaining ones their old values, and the full sweep is the partial sweep after n steps. The Jacobi sweep is defined directly. Diagonal dominance is the strict inequality above, with the sum taken over the row with the diagonal index removed; for n=0 every statement is vacuous, and the goal theorem is then trivially true because the space has a single point. Division by the diagonal entry is total division, so the definitions make sense even when aii=0; diagonal dominance rules that out, because the right-hand side of the dominance inequality is nonnegative. The goal theorem assumes a solution x^\\star is given rather than asserting its existence, and it asserts convergence for every starting vector, generalizing the source's choice x(0)=0. The contraction milestone states the consistency of the norms as the hypothesis lVertBvrVertleclVertvrVert in the supremum norm rather than fixing a particular matrix norm.
Selected references
S. R. Freitas, Métodos Numéricos, Departamento de Computação e Estatística, Universidade Federal de Mato Grosso do Sul, 2000. Chapter 5, Solução de Sistemas Lineares, pp. 85–118. (Course notes supplied with this mission.)
5 thms3 active usersReviewed
🏆Completed
Captain: wenxinzhang
Picard groups of semi-local or finite semiringsOpen Problem
Motivation
Invertible modules over a commutative semiring are Zariski-locally free, so local semirings have trivial Picard group. The source asks whether the ring-theoretic semilocal conclusion survives without subtraction: must every invertible module over a semiring with finitely many maximal ideals be free? If not, is the conclusion at least true for finite semirings?
This mission turns CUHK-Shenzhen AI Math Problem 19, Picard groups of semi-local or finite semirings, into an auditable Lean campaign. The objective is not merely to transcribe notation: it is to expose the mathematical model, the capstone, and a smaller attack surface as separate artifacts that other formalizers can inspect and reuse.
Setting
The main theorem asserts freeness for every invertible module over a commutative semiring with finite maximal spectrum. A separate milestone states the finite-semiring fallback. Both are positive formulations; a concrete counterexample to either resolves that target negatively and should motivate a corrected classification.
Significance
Solving this target would settle the precise finite or analytic core represented by the Lean statement and would create reusable infrastructure in semirings, Picard groups, invertible modules, finite semirings. Even a rigorous disproof is valuable: several entries in this collection deliberately ask whether an attractive extrapolation is true, and Lean forces a counterexample to satisfy every side condition. The mission therefore treats theorem proving and model criticism as equally legitimate research outcomes.
Difficulty
Ring proofs use subtraction-sensitive k-ideal properties and decompositions into local factors that can fail for semirings. Finite indecomposable semirings need not be local and may have positive Krull dimension. Invertible modules are projective with strong duality, but familiar rank and determinant arguments may not survive additive noncancellation.
Suggested attack route
Formalize the known local-freeness proof from the evaluation isomorphism and study patching over finitely many principal opens. Identify exactly where partitions of unity require k-ideals. For finite semirings, enumerate idempotent matrices representing projective modules, impose the invertibility constraints, and seek either a reduction to principal rank-one modules or a minimal counterexample. Product decompositions and faithful-action lemmas should be reusable.
Formalization scope
The Lean targets use Mathlib's commutative semiring, maximal spectrum, module, invertible-module, and free-module notions. 'Semilocal' is encoded only as finiteness of MaximalSpectrum; no unproved decomposition theorem is assumed. The finite fallback assumes the underlying semiring type is finite but does not assume the module itself finite separately. Cardinality-only variants from the source are not the capstone.
The natural-language source remains authoritative for motivation, while the Lean declaration is authoritative for what Prove2Me will verify. The mission description calls out restrictions where the current formal target is a finite-dimensional core, a fixed interpretation of informal terminology, or one sharpened subquestion from a broader classification problem. Those restrictions should not be silently generalized in a proof claim.
Milestones
Resolve the finite-semiring statement, computationally or structurally, while developing the local-to-semilocal patching lemmas needed by the main theorem.
The capstone is marked as the mission's main item and is never duplicated as a milestone. Definitions precede theorem statements in the proposal order. A milestone is considered complete only when its own exact statement is proved; proving a nearby theorem with stronger-looking prose but mismatched quantifiers, signs, supports, dimensions, or asymptotic constants does not complete it.
Timeline and literature status
The CUHK-Shenzhen AI Math Problems page added this problem on June 24, 2026. At the drafting date, August 31, 2026, the status and target corrections described above were checked against the source page and the cited primary material.
Acceptance criteria
A contribution may prove the displayed theorem or refute it by constructing data satisfying every Lean hypothesis while negating the conclusion. Informal changes of model do not count: any proposed correction must be submitted as a separately reviewed statement with an explanation of which source ambiguity or false implication it repairs. Definitions must remain computational or mathematically constrained; fields that simply assume the desired conclusion are not acceptable. Every proof must compile against the mission's pinned Mathlib revision, use no sorry, and expose a top-level theorem solution when submitted to Prove2Me.
The main theorem is intentionally separated from a smaller milestone. Contributors should preserve that dependency order, publish reusable lemmas rather than monolithic tactics, and report whether a lemma is analytic, algebraic, combinatorial, or infrastructure-only. Numerical evidence, external computer algebra, and exhaustive search are welcome for discovery, but a final certificate must be replayable by Lean. If an external result is invoked, its hypotheses must be represented in the formal statement or proved in the dependency tree.
Formal verification policy
The files were built locally with Lean 4.30.0 and Mathlib revision c5ea00351c28e24afc9f0f84379aa41082b1188f, the supported Prove2Me environment at drafting time. The mission definition file is ordered before all theorem files, and each theorem imports exactly that public definition module or Mathlib. Independent blind read-backs accompany the draft items so reviewers can compare what the Lean code literally says with this mathematical description. Human confirmation remains required before the public proposal can be submitted for moderation.
Celestial w_{1+∞} wedge algebra and gluon S-algebra (Zhu review, §7.1)Research Paper
Motivation
In celestial holography, scattering amplitudes of massless particles in four-dimensional flat spacetime are rewritten, by a Mellin transform in the particle energies, as correlation functions of operators on the two-dimensional celestial sphere. Soft theorems then become Ward identities of two-dimensional currents. Guevara, Himwich, Pate and Strominger (arXiv:2103.03961) found that the conformally soft graviton modes obtained this way close under the collinear OPE into an infinite-dimensional algebra, and Strominger (arXiv:2105.14346) identified it, after a rescaling, with the wedge subalgebra of w1+∞, the Lie algebra of polynomial area-preserving (Hamiltonian) vector fields on a two-plane. The review of B. Zhu (arXiv:2606.24285, Section 7.1) summarises this derivation, together with its gauge-theory counterpart, the gluon S-algebra, and the action of w1+∞ on it. The review describes the celestial w-algebra as a consistency test for any proposed flat-space hologram.
Setting
The wedge range is the set of labels (p,m) with
p∈{1,23,2,25,…},1−p≤m≤p−1,p−1−m∈Z,
equivalently: p+m−1 and p−m−1 are both natural numbers. Let W be the complex vector space with basis {wmp} indexed by the wedge range, and define a bilinear bracket on W by Eq. (7.8),
[wmp,wnq]=(m(q−1)−n(p−1))wm+np+q−2,
where the right-hand side is 0 whenever (p+q−2,m+n) falls outside the wedge.
Eq. (7.9) realises wmp as the monomial up+m−1vp−m−1 in the polynomial ring C[u,v], equipped with the Poisson bracket {f,g}=∂uf∂vg−∂vf∂ug.
The conformally soft graviton modesHmk (k=2,1,0,−1,…, 2k−2≤m≤22−k) obey the commutator (7.5) with factorial coefficients and the gravitational coupling κ. The rescaling (7.6), wmp=κ1(p−m−1)!(p+m−1)!Hm−2p+4, turns (7.5) into (7.8).
On the gauge-theory side, with colour index a and Lie-algebra structure constants fabc, the conformally soft gluon modes Rnk,a obey (7.14). The rescaling (7.15), Smq,a=(q−m−1)!(q+m−1)!Rm3−2q,a, gives the S-algebra (7.16), [Smp,a,Snq,b]=−ifabcSm+np+q−1,c. The wedge algebra acts on it by (7.17), [wmp,Snq,a]=(m(q−1)−n(p−1))Sm+np+q−2,a.
Formalization targets
Goal: (7.8) is a Lie bracket
[X,X]=0,[X,[Y,Z]]=[[X,Y],Z]+[Y,[X,Z]]for all X,Y,Z∈W.
Milestones
Closure of the wedge (7.7)–(7.8): if (p,m) and (q,n) are in the wedge and m(q−1)−n(p−1)=0, then (p+q−2,m+n) is in the wedge.
Rescaling (7.5) ⇒ (7.8): any family Hmk satisfying (7.5) in a complex vector space with a bilinear bracket, rescaled by (7.6), satisfies (7.8) (for κ=0).
Poisson realisation on generators (7.9): {up+m−1vp−m−1,uq+n−1vq−n−1}=2(m(q−1)−n(p−1))up+q+m+n−3vp+q−m−n−3. The review's "convention-dependent overall factor" is pinned to 2.
Poisson realisation, linear form (7.9): the linear map wmp↦up+m−1vp−m−1 intertwines (7.8) with 21{⋅,⋅}.
Gluon rescaling (7.14) ⇒ (7.16).
The S-algebra is a Lie algebra (7.16), given that fabc are Lie structure constants.
S is a w1+∞-module (7.17): [[X,Y],s]=[X,[Y,s]]−[Y,[X,s]].
Significance
The statements fix, in a machine-checked form, the precise normalisations used in the celestial literature: the wedge range, the rescalings (7.6) and (7.15), and the overall factor in the Poisson realisation, which the review leaves convention-dependent. They form the algebraic base layer for later formalisations of deformations of w1+∞, its loop algebra Lw1+∞, and the gluon–graviton soft algebras. The results themselves are established in the physics literature. The formal work that remains is the combinatorics of the factorial coefficients, the closure of the finite wedge range, and the Jacobi identities.
Difficulty
None of the statements is deep, but each carries bookkeeping that is easy to get wrong. The factorial coefficients of (7.5) and (7.14) must cancel exactly against the rescalings. At the corners of the wedge (m=p−1, n=q−1, or p+q−2<1) the target label leaves the wedge, and the structure constant must be shown to vanish there. The Jacobi identity for (7.8) does not follow term by term from the formula; the natural route is through the Poisson realisation, which must first be shown to be faithful.
Formalization scope
All objects are over C. Labels p,m,q,n,k,l are rationals, and every label set is carved out by the predicate "p+m−1 and p−m−1 are natural numbers". Vector spaces with a given basis are finitely supported functions on the index set, and brackets are the bilinear extensions of the basis formulas. When the target label of a bracket falls outside the wedge, the bracket is defined to be 0 (milestone 1 shows this only happens when the structure constant already vanishes). Factorials of rational arguments are taken of the truncation ⌊⋅⌋+ to a natural number; on the relevant ranges the arguments are natural numbers, and at the single corner where (7.5) has argument −1 its prefactor vanishes. The operator-level identities (milestones 2 and 5) are stated for an arbitrary complex vector space with an arbitrary bilinear bracket, taking (7.5) resp. (7.14) as hypotheses on the given modes. The colour algebra is given by structure constants f:ι3→C on a finite index set ι, with antisymmetry and the Jacobi identity as the definition of Lie structure constants. The factor κ−1 uses the convention 0−1=0, and milestone 2 assumes κ=0.
Selected references
B. Zhu, Topics in Celestial holography: A bottom-up perspective, invited review for Physics Reports, arXiv:2606.24285v3, 2026. https://arxiv.org/abs/2606.24285 (Section 7.1, Eqs. (7.1)–(7.17)).
A. Guevara, E. Himwich, M. Pate, A. Strominger, Holographic symmetry algebras for gauge theory and gravity, JHEP 2021. https://arxiv.org/abs/2103.03961
Most Tensor Problems Are NP-Hard 4: A Rational 2×2×2 Tensor Has Smaller Rank over the Reals Than over the RationalsResearch Paper
Motivation
The rank of a matrix does not depend on the field in which its entries are read: a rational matrix has the same rank over Q, R and C, because rank is computed by Gaussian elimination, which never leaves the field of the entries. For 3-tensors, arrays A=[[aijk]] with three indices, this fails. Tensor rank governs the complexity of bilinear maps (the exponent of matrix multiplication is a statement about the rank of one tensor), the uniqueness of the CANDECOMP/PARAFAC decompositions used in psychometrics and signal processing, and the identifiability of latent-variable models. In each application the field matters: algorithms are run over R or C, while complexity results are often proved over Q or finite fields.
Håstad (1990) proved that deciding rank(A)≤r is NP-complete over finite fields and NP-hard over Q. De Silva and Lim (2008) gave real tensors whose rank over C is strictly smaller than their rank over R. Hillar and Lim (2013, Theorem 1.14) showed that the same phenomenon already occurs between Q and R, for a 2×2×2 tensor with integer entries, so that Håstad's result over Q does not by itself say anything about rank over R.
Setting
Let E be a field. The outer product of x∈El, y∈Em, z∈En is the tensor x⊗y⊗z∈El×m×n with entries xiyjzk. The rank of A over E is
If A has entries in a subfield F⊆E, both rankF(A) and rankE(A) are defined, and rankE(A)≤rankF(A).
The paper's example uses x=[1,0]⊤, y=[0,1]⊤ and
A=2x⊗x⊗x−4y⊗y⊗x+4y⊗x⊗y−4x⊗y⊗y∈Q2×2×2.
A decomposition A=u1⊗u2⊗u3+v1⊗v2⊗v3 with ui=[ai,bi]⊤, vi=[ci,di]⊤ is equivalent to the eight cubic equations (30) in the twelve unknowns a1,…,d3, one for each entry of A.
In Lean, outer x y z and rankOver E A implement the two definitions, tensorA is A, and System30 is (30).
Formalization targets
Goal: Theorem 1.14
∃A∈Q2×2×2:rankR(A)<rankQ(A).
Milestones (proof of Theorem 1.14, p. 0:26)
With z=x+2y and zˉ=x−2y:
zˉ⊗z⊗zˉ+z⊗zˉ⊗z=A,so rankR(A)≤2.
A tensor of rank at most 2 over a field is a sum of two outer products, and for A the identity (29) A=u1⊗u2⊗u3+v1⊗v2⊗v3 holds exactly when the coordinates of ui,vi satisfy (30).
Every solution of (30) in a field of characteristic zero satisfies 2c22−d22=0 and c1d2d3+2=0.
Lemma 8.1: (30) has no rational solution.
rankQ(A)>2.
Significance
The theorem shows that tensor rank, unlike matrix rank, is not invariant under field extension even between Q and R, and even for the smallest nontrivial format 2×2×2. Its consequence for complexity is that a hardness result for rank over Q cannot be transferred to R by reading the same instance in a larger field; the paper accordingly re-examines Håstad's construction to obtain hardness over R and C (Theorem 8.2), which is outside this mission.
The result is proved in the paper, with the decisive algebraic step delegated to a computer-algebra computation (Appendix). A machine-checked proof replaces that computation by a certificate verified in Lean, and it settles a printed error: one of the two consequences of (30) in the proof of Lemma 8.1 is printed with the wrong sign (see Formalization scope). No formalization of array tensor rank over a field, or of its field dependence, is known to exist in Mathlib or on this platform.
Difficulty
The upper bound is an identity among explicit 2×2×2 arrays. The lower bound is the substance: one must show that the cubic system (30), which has real solutions, has no rational one. Since (30) is solvable over R, no argument by signs, inequalities or real geometry can work; the obstruction is arithmetic, coming from the irrationality of 2. The step that fails in a naive attempt is the elimination: eliminating ten of the twelve unknowns from eight cubic equations by hand is impractical. A second, smaller difficulty is the reduction from "rankQ(A)≤2" to two terms of the special form (29), which requires absorbing the scalars and padding a decomposition with fewer than two terms.
Formalization scope
Tensors are functions Fin l → Fin m → Fin n → E, with 0-based indices: the paper's aijk is A (i-1) (j-1) (k-1). Vectors are Fin n → E.
rankOver E A is the sInf over N of the lengths r of decompositions ∑sλsxs⊗ys⊗zs. The set is nonempty (one term per entry), so this is the paper's minimum. Zero summands are allowed; this gives the same minimum as the paper's sum of nonzero rank-1 tensors.
rankR of a rational tensor is rankOver ℝ of its entrywise cast to R; rankQ is rankOver ℚ, whose witnesses are rational. A formalization in which both ranks range over real witnesses would make the theorem false.
The goal is the printed existential. It is not a loophole: the milestones concern the paper's explicit tensor.
Readings of loose phrases: "Suppose not and that there exist ui,vi with (29). Identity (29) gives eight equations found in (30)" is split into a general statement (rank at most 2 over any field means a sum of two outer products) and the equivalence of (29) with (30) over every field of characteristic zero (milestone 2); both are stated in a generality in which their hypotheses can hold, because for A over Q they cannot. "Polynomial consequences of (30)" is read as "holds at every solution of (30) in every field of characteristic zero" (milestone 3); over Q alone the statement would be vacuous, since (30) has no rational solution.
Corrected error. The paper prints the second consequence as c1d2d3−2=0. It is false: the real solution from milestone 1 has c1d2d3=−2. The milestone states c1d2d3+2=0 (checked by a Gröbner basis computation over Q), which serves the paper's argument equally. The Appendix certificates Gk, Hk (p. 0:34) are not used in any statement.
Out of scope: Theorem 1.15/8.2 (Håstad's construction over R and C) and the conjectures of §13.
Needed infrastructure: finite sums of arrays, Real.sqrt and irrational_sqrt_two, and an ideal-membership certificate for milestone 3. The array rank rankOver is reusable for any statement about tensor rank over a field. The platform's mme_tensor_rank (restriction-based rank of a TensorObj over a single field, from the matrix-multiplication exponent series) is a different object and is not reused. Proofs of any milestone, and alternative certificates for Lemma 8.1, are welcome.
V. de Silva and L.-H. Lim, Tensor rank and the ill-posedness of the best low-rank approximation problem, SIAM J. Matrix Anal. Appl. 30(3), 1084–1127, 2008. https://doi.org/10.1137/06066518X
F. L. Hitchcock, The expression of a tensor or a polyadic as a sum of products, J. Math. Phys. 6, 164–189, 1927. https://doi.org/10.1002/sapm192761164
Finite congruence lattices: characterization and undecidabilityOpen Problem
Motivation
A finite algebra has a lattice of congruences, ordered by inclusion. The source studies which finite lattices arise in this way, and the available goal captures its colored-graph characterization. The source is OpenAI's September 2026 manuscript.
Setting
A congruence is an equivalence relation preserved by every basic operation of an algebra. A graph witness assigns lattice-valued colors to pairs of finitely many vertices, with symmetry, diagonal, triangle, separation, and seed-connectivity conditions.
Formalization targets
Representable(L)⟺HasGraphWitness(L).
For any finite type Lat carrying a lattice structure with a least element ⊥, Lat is Representable if and only if it HasGraphWitness. Representable means that there is a positive size n and an algebra on Fin n (a finite list of operations, each of some finite arity, acting on the carrier) such that Lat is order-isomorphic to the poset of congruences of that algebra, where a congruence is an equivalence relation compatible with every operation: if corresponding arguments are related coordinatewise, the outputs are related; congruences are ordered by the inherited order on equivalence relations. HasGraphWitness means that there is a positive size n and a Lat-valued coloring color of ordered pairs from Fin n satisfying five conditions: color is symmetric; color(a,b)=⊥ exactly when a=b; color(a,b) ≤ color(a,m) ⊔ color(m,b) for all a, b, m; whenever lower ≰ upper in Lat, some pair has color ≤ lower but not ≤ upper; and for every nonempty finite set of seed pairs, any pair whose color is at most the join of the seed colors is connected to the seeds. Connected is the equivalence closure of the relation Marked, where a,b are Marked if some self-map p of the vertices satisfies color(p x,p y) ≤ color(x,y) for all x,y and sends some seed pair (s,t) to (a,b).
The equivalence provides a finite combinatorial certificate for representation as an entire congruence lattice. It is the characterization component of the manuscript. The manuscript presents a mathematical argument; the attached goal currently has status Open, so the requested contribution is a Lean proof of the displayed formal target.
Difficulty
Representing a lattice inside a congruence lattice is weaker than obtaining all congruences. The witness’s seed-connectivity condition must capture this fullness and work in both directions.
Formalization scope
The lattice is finite and has a least element. The algebra carrier and graph witness carrier each have positive finite size. Operations have finite arities, and representation is an order isomorphism. The manuscript’s undecidability conclusions are not among the attached targets.
The shared definitions are supplied by FiniteCongruenceGraph. The target uses Lean 4.33.1 with the pinned Mathlib environment. Contributions should preserve the existing statement and develop reusable supporting lemmas in its definitions.
Selected references
OpenAI, Finite congruence lattices: characterization and undecidability, preprint, September 2026. Manuscript.
A Counterexample to Kaplansky's Direct-Finiteness Conjecture in Odd CharacteristicOpen Problem
Motivation
The odd-characteristic version of direct finiteness has different coefficient constraints from the binary case. The source fixes one odd prime and links a group-algebra counterexample to a cellular automaton. The source is OpenAI's September 2026 manuscript.
Setting
For a finitely supported coefficient function b on a group, the cellular map sends a configuration x:G→K to g↦∑ub(u)x(gu). The prime is the smallest prime factor of (m!)2+1, where m is a fixed central binomial coefficient.
Formalization targets
p=minPrimeDiv(((6001200)!)2+1),∣K∣=p4,ab=1=ba,cellular(b) injective and not surjective.
The defined proposition MainClaim holds. Here sourceM is the central binomial coefficient C(1200,600), and sourcePrime is the smallest prime factor of (sourceM!)²+1. MainClaim asserts that this number p is prime and odd, and that there exist a finite field K of characteristic p with exactly p⁴ elements and a finitely generated group G containing a nontrivial element of finite order, together with two elements a and b of the group algebra K[G] such that ab = 1 but ba ≠ 1. Moreover, for the map cellular(b) sending x : G → K to g ↦ Σ_u b(u)·x(g·u), the sum running over the support of b, this map is injective but not surjective. The formal statement is admitted in the source rather than proved here.
The conclusion combines a scalar one-sided inverse with failure of surjectivity of a finite-memory linear map. It specifies the characteristic and field size without claiming the construction works at every odd prime. The manuscript presents a mathematical argument; the attached goal currently has status Open, so the requested contribution is a Lean proof of the displayed formal target.
Difficulty
The group must retain nontrivial torsion while supporting the required finite sums. Matrix-level relations and an arbitrary choice of characteristic do not meet this target.
Formalization scope
The goal unfolds MainClaim. It proves primality and oddness of the fixed sourcePrime, then existentially supplies the finite field, finitely generated group, nontrivial finite-order element, and algebra elements. The cellular convention uses right-translated inputs gu.
The shared definitions are supplied by OddKaplansky. The target uses Lean 4.33.1 with the pinned Mathlib environment. Contributions should preserve the existing statement and develop reusable supporting lemmas in its definitions.
Selected references
OpenAI, A Counterexample to Kaplansky's Direct-Finiteness Conjecture in Odd Characteristic, preprint, September 2026. Manuscript.
Hyperbolic polynomials define convex optimization regions through real-rooted line restrictions. A spectrahedral representation would describe the same region by one finite symmetric positive-semidefinite matrix inequality. The source manuscript presents the surrounding research claim.
Setting
The formal ambient space consists of two real symmetric 4×4 matrices X,Z and a vector y∈ℝ³. A fixed determinant expression defines a multivariate polynomial p. At e=((I,I),0), the cone consists of x for which every complex root of t↦p(te−x) is real and nonnegative.
Formalization target
Prove dim(ambient)=23, p(e)=1, and
p is homogeneous of degree 20,degp=20,
with every line polynomial real-rooted. For every N>0 and linear symmetric pencil L, prove
The formal target rules out every finite homogeneous real symmetric pencil size. It also verifies the algebraic and root properties of its fixed polynomial. The published target is currently Open; the manuscript's argument and a checked Lean proof are separate deliverables.
Difficulty
Excluding one determinantal expression is weaker than excluding all matrix-inequality representations of the cone. The final universal quantifier ranges over all positive dimensions and all real linear pencils.
Formalization scope
The published Lean formula has asserted degree 20. The manuscript abstract describes degree 16; this draft follows the actual published degree-20 statement rather than substituting the manuscript number. Symmetric matrices use selfAdjoint, and positivity is Matrix.PosSemidef. No affine pencil or projected semidefinite lift is asserted here.
Selected references
OpenAI, A nonspectrahedral hyperbolicity cone, preprint, 2026. Pinned manuscript.
An explicit noncoordinate polynomial with affine three-space zero fibreOpen Problem
Motivation
A hypersurface can be abstractly affine space without its defining equation being an ambient coordinate. Distinguishing these two properties is the embedding question behind the Abhyankar–Sathaye problem. The source manuscript presents the surrounding research claim.
Setting
For n ≥ 4, let R=ℂ[X₀,…,Xₙ₋₁]. A polynomial F is a coordinate if a ℂ-algebra automorphism of R sends some variable Xᵢ to F. Its zero fiber is represented by the quotient R/(F).
Formalization target
For every n ≥ 4, find F with
R/(F)≅CC[X0,…,Xn−2],F is not a coordinate.
The source supplies an explicit construction, while this selected goal asks for existence.
The target separates the intrinsic affine-space quotient from ambient polynomial equivalence in every dimension at least four. The published target is currently Open; the manuscript's argument and a checked Lean proof are separate deliverables.
Difficulty
An isomorphism of the quotient rings need not extend to an automorphism of the ambient ring. Both the quotient isomorphism and the failure of every possible coordinate automorphism must be established.
Formalization scope
The goal uses multivariate polynomials indexed by Fin n, a principal ideal, and ℂ-algebra equivalences. A separate published derivation target and its explicit polynomial definitions are retained as related references. That target concerns n−1 commuting locally nilpotent derivations, their common kernel and ordinary extra-variable partial derivatives; it is not asserted as a logical dependency of the existence goal.
Selected references
OpenAI, An explicit noncoordinate polynomial with affine three-space zero fibre, preprint, 2026. Pinned manuscript.
Compatibility between reassociation and braiding imposes equations on formal Lie expressions. The question is whether those equations leave precisely the free family of odd-weight generators predicted by the Deligne–Drinfeld conjecture. The source manuscript presents the surrounding research claim.
Setting
Let L be the free Lie algebra over ℚ on x and y, each of weight one. The solution space W satisfies antisymmetry, the three-term relation, and the pentagon equation in the four-strand infinitesimal braid algebra. Its operation is the Ihara bracket {p,q}=Dₚq−D_qp+[p,q]. The free algebra F has generators indexed by k ≥ 0 with weights 2k+3.
Formalization target
Establish a graded bracket-preserving linear equivalence
F=LieQ⟨e3,e5,e7,…⟩≅W,
together with mutually inverse continuous maps on the products of weight pieces. The completed maps must preserve the bracket degree by degree, including the finite convolution sum defining its weight-n component.
The target simultaneously expresses freeness and exhaustion of the full equation space. Finding a free subalgebra alone leaves the exhaustion assertion unresolved. The published target is currently Open; the manuscript's argument and a checked Lean proof are separate deliverables.
Difficulty
The pentagon relation couples substitutions in the braid Lie algebra. Constructing odd-weight solutions does not by itself show that all solutions are generated by them, nor that the completed bracket has the required compatibility.
Formalization scope
The published definition block specifies the braid quotient, tangent construction of D, weighted Lie words, rational submodules and product completions. Generator k has weight 2k+3. The factor spaces carry the explicitly supplied discrete topology. The goal is exactly MainStatement, including its inverse, continuity and completed-bracket clauses. The available reference set supplies the definition block and one target, so no unsupported paper lemmas are attached as milestones.
Selected references
OpenAI, The Deligne-Drinfeld conjecture, preprint, 2026. Pinned manuscript.
Quadratic stabilization of the canonical Foulkes--Howe mapResearch Paper
Motivation: plethysm, Foulkes' conjecture and the canonical map
Plethysm — decomposing Syma(SymbV) into irreducible GL(V)-representations — is one of the oldest open problems in the representation theory of the general linear group, and it is central to geometric complexity theory, where the coordinate rings of Chow varieties of products of linear forms control lower-bound arguments. Foulkes' conjecture (1950) predicts that for a≤b there is a GL(V)-equivariant injection Syma(SymbV)↪Symb(SymaV). A natural candidate is supplied by a specific map, the canonical Foulkes–Howe mapμa,b,V:Symb(SymaV)→Syma(SymbV); its surjectivity yields such an embedding by complete reducibility. Its image is the degree-b part of the coordinate ring of the Chow variety of decomposable a-forms, so surjectivity for large b is a statement about that variety's normalization. The question is from which degree b on the map is surjective, uniformly in dimV.
1993 — Brion proves eventual surjectivity of the canonical map for fixed a and V (Brion, Manuscripta Math. 1993); in 1997 he gives an effective bound depending on both a and dimV (Séminaires et Congrès 2, SMF, 1997, Theorem 3.3).
2008 — McKay proves a propagation theorem for Foulkes-type injectivity (J. Algebra 2008); Ikenmeyer gives a weight-shift proof (arXiv:1509.04957, 2015).
2015 — Landsberg's introduction to geometric complexity theory asks for a polynomial stabilization bound (Problem 7.19) (Ann. Univ. Ferrara 2015).
2017 — Cheung, Ikenmeyer and Mkrtchyan show that the canonical map has nonzero kernel at (a,b)=(5,5) and (6,6) in suitable dimensions (J. Symbolic Comput. 2017).
2022 — Raicu, Sam and Weyman bound the regularity of the Segre ring and modules of covariants on the Chow variety (Vietnam J. Math. 2022), without computing the top degree controlling stabilization.
2026 — An OpenAI preprint, Quadratic stabilization of the canonical Foulkes–Howe map (OpenAI Math Release, September 25, 2026), claims surjectivity for all a≥2, b≥a(a−1) and every finite-dimensional V. The preprint has not been peer reviewed and its theorem is not formally verified.
Setting
Let V be a finite-dimensional complex vector space and SymV its symmetric algebra. SymnV⊆SymV is the span of products v1⋯vn of n vectors. For vj,i∈V (1≤j≤b, 1≤i≤a), the canonical Foulkes–Howe map is the linear map determined by
where the outer products on the left and right are taken in Sym(SymaV) and Sym(SymbV) respectively. Equivalently: identify SymaW with symmetric tensors via averaging, multiply b such tensors in (SymV)⊗a, and project back. That this formula is well defined on Symb(SymaV) is part of the content.
Formalization targets
Goal: quadratic stabilization (Theorem 1)
For every finite-dimensional complex V and integers a≥2, b≥a(a−1), there is a unique linear map
μ:Symb(SymaV)⟶Syma(SymbV)
satisfying the displayed formula on monomials, and μ is surjective.
The bound a(a−1) is not claimed to be sharp; the content is a stabilization degree polynomial in a and independent of dimV. The goal statement is published on the platform with status Open: no machine-checked proof exists yet.
Significance
The result itself. Surjectivity gives, by complete reducibility, a GL(V)-equivariant embedding Syma(SymbV)↪Symb(SymaV) for b≥a(a−1) (Corollary 4 of the source), e.g. the sixth-power comparison for b≥30. It answers positively the request for a polynomial bound in Landsberg's Problem 7.19, and it says that the coordinate ring of the Chow variety of decomposable a-forms agrees with its normalization in every degree b≥a(a−1). Since the canonical map is known to fail to be injective at (5,5) and (6,6), an explicit range of surjectivity is the right kind of statement for this specific map.
Formalizing it. The statement is purely algebraic and uniform in V, a, b. A formal proof would need multilinear algebra over symmetric algebras (symmetric powers of symmetric powers), which is reusable for plethysm and invariant-theory projects.
Difficulty
Surjectivity is equivalent to the vanishing of every symmetric a-linear form on SymbV whose diagonal vanishes on products of b vectors. The naive induction on a fails because the factors in different slots share a common product and cannot be varied independently; the dimension of V also grows the space of such forms without bound, so arguments using a fixed basis or dimension count do not give a uniform bound. Brion's effective bound depends on dimV, and regularity bounds for the normalization do not locate the top degree of the quotient that controls stabilization.
Formalization scope
SymnV is represented as the submodule SymPow n V of Mathlib's SymmetricAlgebra ℂ V spanned by products of n vectors, and Symb(SymaV) is SymPow b (SymPow a V).
IsFoulkesMap a b V μ states the monomial formula above, with the normalizing factor (a!)−b and the sum over b-tuples of permutations of Fin a.
The goal asserts existence, surjectivity and uniqueness of a linear map with this formula; uniqueness rules out choosing an arbitrary surjection, so the theorem is about the canonical map and not merely about dimensions.
V ranges over all finite-dimensional complex vector spaces in an arbitrary universe; a≥2 and b≥a(a−1) are natural numbers.
Needed infrastructure: symmetric powers inside the symmetric algebra, polarization/annihilator criteria, and directional-derivative operators on polynomial functions.
Selected references
H. O. Foulkes, Concomitants of the quintic and sextic up to degree four in the coefficients of the ground form, J. London Math. Soc. 25 (1950), 205–209. https://doi.org/10.1112/jlms/s1-25.3.205
M. Brion, Stable properties of plethysm: on two conjectures of Foulkes, Manuscripta Math. 80 (1993), 347–371. https://doi.org/10.1007/BF03026558
M.-W. Cheung, C. Ikenmeyer and S. Mkrtchyan, Symmetrizing tableaux and the 5th case of the Foulkes conjecture, J. Symbolic Comput. 80 (2017), 833–843. https://doi.org/10.1016/j.jsc.2016.09.002
A Torsion-Free Group Algebra with Zero DivisorsResearch Paper
Motivation: Kaplansky's zero-divisor conjecture
For a field K and a group G, the group algebraK[G] consists of finite formal sums ∑gagg with ag∈K, multiplied by extending the group law bilinearly. If g∈G has finite order m>1, then (1−g)(1+g+⋯+gm−1)=0, so K[G] has zero divisors. Kaplansky's zero-divisor conjecture asserts that this is the only source: if G is torsion-free, K[G] has no nonzero zero divisors. Together with the unit and idempotent conjectures it is one of the central problems connecting ring theory, group theory and topology, and positive answers are known for large classes of groups (elementary amenable groups, groups with the unique-product property, torsion-free 3-manifold groups).
Timeline
1940 — Higman's thesis raises the question and proves the domain property for groups in which every nontrivial subgroup maps onto Z (Higman, Proc. LMS 1940); the thesis formulation is reproduced by Sandling (1981).
1956/1957 — Kaplansky poses the problem (Problem 6 in Problems in the theory of rings, National Research Council, 1957).
1987 — Rips and Segev construct torsion-free groups without the unique-product property, removing the standard route to the conjecture (J. Algebra 1987); Steenbock gives a graphical small-cancellation treatment (J. Algebra 2015).
1988 — Kropholler, Linnell and Moody prove the conjecture for torsion-free elementary amenable groups (Proc. AMS 1988).
2021 — Gardam disproves the related unit conjecture over F2 (Ann. of Math. 2021), and later over C (arXiv:2312.05240, 2024). A nontrivial unit is not a zero divisor, so the zero-divisor conjecture remained open.
2026 — Fisher and Sánchez-Peralta prove the domain conclusion for torsion-free 3-manifold groups and division-ring embeddings for virtually compact special groups (J. Comb. Algebra 2026).
2026 — An OpenAI preprint, A Torsion-Free Group Algebra with Zero Divisors (OpenAI Math Release, September 23, 2026), claims a finitely presented torsion-free group G with a finite 2-dimensional classifying space such that F2[G] has nonzero zero divisors. The preprint has not been peer reviewed and its theorem is not formally verified.
Setting
A group G is torsion-free if gn=1 with n≥1 implies g=1. It is finitely presented if it has a presentation with finitely many generators and relations. A classifying space (or K(G,1)) for G is a path-connected space X with π1(X)≅G whose universal cover is contractible; it is finite two-dimensional if it is a finite CW complex with cells only in dimensions ≤2. A group with a finite-dimensional classifying space is automatically torsion-free, but the formal goal asks for both properties explicitly.
The coefficient field is F2=Z/2, and F2[G] is Mathlib's MonoidAlgebra (ZMod 2) G.
Formalization targets
Goal: a counterexample to the zero-divisor conjecture (Theorem 1.1)
There exist a group G and α,β∈F2[G] such that
Gfinitely presented,Gtorsion-free,Ghas a finite 2-dimensional K(G,1),α=0,β=0,αβ=0.
This is the full Theorem 1.1 of the source, including its "Moreover" clause. The source proves existence probabilistically; it does not exhibit a concrete presentation. The goal statement is published on the platform with status Open: no machine-checked proof exists yet.
Significance
The result itself. If correct, the theorem disproves Kaplansky's zero-divisor conjecture over F2, a problem open since the 1940s, and shows that torsion-freeness — even together with finite presentability and a 2-dimensional classifying space — does not force K[G] to be a domain. It implies that G fails the unique-product property, and it bears on the implications among the Kaplansky conjectures (zero divisors, units, idempotents) and on approaches through the Atiyah conjecture and division-ring embeddings.
Formalizing it. The claim refutes a long-standing conjecture by an intricate probabilistic and topological construction, which is a strong case for machine verification. A full formal proof needs the probabilistic existence argument, planar separation, and asphericity of a 2-complex — none of which is a routine Mathlib application. Partial contributions (e.g. the characteristic-2 cancellation argument once asphericity and root separation are assumed, or the torsion-freeness of groups with finite-dimensional K(G,1)) are welcome. A related machine-checked result exists only for the weaker non-unique-product property of Gardam's A2 lattice (Mian–Siddique 2026).
Difficulty
Writing down α,β whose product cancels in characteristic two is the easy part; the source does this by a parity argument on a graph of simultaneous steps. The hard part is two safeguards in the quotient group: both factors must remain nonzero (no vertex label other than the root can collapse to the identity), and the group must be torsion-free, which the source obtains by proving the 2-complex is aspherical. Standard tools — small-cancellation or CAT(0) criteria — are not applied; instead the source must exclude spherical arrangements of arbitrarily many paths of arbitrary length, which a union bound over sizes cannot handle.
Formalization scope
TorsionFree G is the plain group-theoretic notion (gn=1, n>0 implies g=1); finite presentability is Group.IsFinitelyPresented.
HasFiniteTwoDimensionalClassifyingSpace G asks for a Hausdorff, path-connected space X with a finite CW structure on all of X, no cells above dimension 2, at least one 2-cell, a group isomorphism G≃π1(X,x), and a surjective covering map from a contractible space onto X (so X is aspherical). Requiring a 2-cell excludes only the case of free groups, whose group algebras are domains.
The witnessing group lives in Type and is existentially quantified together with its group structure; the zero divisors are elements of MonoidAlgebra (ZMod 2) G.
A trivializing reading is excluded because all three group properties and both nonvanishing conditions are required simultaneously.
Infrastructure needed: CW complexes and covering spaces (partially in Mathlib), the fundamental group of a 2-complex built by attaching cones, Hurewicz/Whitehead-type asphericity arguments, and random graph constructions.
P. H. Kropholler, P. A. Linnell and J. A. Moody, Applications of a new K-theoretic theorem to soluble group rings, Proc. Amer. Math. Soc. (1988). https://doi.org/10.2307/2046771
S. P. Fisher and P. Sánchez-Peralta, Division rings for group algebras of virtually compact special groups and 3-manifold groups, J. Comb. Algebra (2026). https://doi.org/10.4171/JCA/89
I. Mian and S. Siddique, A machine-checked proof that Gardam's A2 lattice does not have unique products, preprint, 2026. https://arxiv.org/abs/2609.22380v1
An explicit failure of complex affine-space cancellationResearch Paper
Motivation
Zariski's cancellation problem asks whether affine space can be recognized from its cylinder: if a variety X satisfies X×A1≅An+1, must X≅An? Algebraically, for a finitely generated commutative C-algebra A and an independent variable w,
A[w]≅C[n+1]⟹?A≅C[n],
where C[r] is a polynomial ring in r variables and all isomorphisms are C-algebra isomorphisms. The problem is one of the central questions of affine algebraic geometry, closely tied to the recognition of affine space, coordinates of polynomial rings, and polynomial fibrations.
2026. Gaifullin and Petrov still list the characteristic-zero problem in dimension ≥3 as unresolved (arXiv:2607.13593).
The source of this mission is an OpenAI preprint dated September 23, 2026.
Setting
Let p,s,u,F,J be independent variables over C and P=C[p,s,u,F,J]. Put
x=s2+u3+p2F,H=x2F−(1+2sx)J−p2J2−pu,A=P/(H).
So A is the coordinate ring of the hypersurface {H=0}⊂A5. For a C-algebra A, A[w] denotes the polynomial ring in one further variable, and C[r] the polynomial ring in r variables.
Formalization targets
Goal: Theorem 1.1
Ais a finitely generated integral domain of Krull dimension 4,A[w]≅CC[5],A≅CC[4].
The Lean statement OAI.ComplexCancellation.main is open on the platform.
Significance
Theorem 1.1 gives a negative answer to Zariski's cancellation problem over C in dimension four, with an explicit counterexample of degree small enough to write in one line. The same polynomial yields two further consequences proved in the paper: H is a coordinate of P[w] but not of P, so the Stable Coordinate Conjecture fails in ambient dimension five (Corollary 1.2); and the maps p:SpecA→A1 and (p,H):A5→A2 are smooth A3-fibrations that are not Zariski-locally trivial, disproving the Dolgachev–Weisfeiler conjecture over these bases (Corollary 7.1). Cancellation in dimension three over C is not addressed.
The result is proved in an OpenAI preprint, which has not been peer reviewed. No machine-checked proof exists.
Difficulty
The cylinder isomorphism A[w]≅C[5] is comparatively explicit: a locally nilpotent derivation sends H to p3, and exponentiating converts H into H+p3w. The hard part is proving A≅C[4]. Standard invariants do not help: A is smooth, factorial-type obstructions vanish, and topologically SpecA is contractible like C4 since its cylinder is C5. The paper uses additive group actions (locally nilpotent derivations), passing to an associated graded algebra along p=0, lifting actions through a line bundle over a smooth affine quadric, and a rigidity argument based on the Mason–Stothers polynomial abc inequality.
Formalization scope
P := MvPolynomial (Fin 5) ℂ with p, s, u, F, J := X 0, …, X 4; x and H are transcribed literally; A := P ⧸ Ideal.span {H}.
Dimension is ringKrullDim A = 4; integrality is IsDomain A; finite generation is Algebra.FiniteType ℂ A.
The cylinder statement is Nonempty (Polynomial A ≃ₐ[ℂ] MvPolynomial (Fin 5) ℂ); the non-polynomiality is ¬ Nonempty (A ≃ₐ[ℂ] MvPolynomial (Fin 4) ℂ). All isomorphisms are C-algebra isomorphisms.
A complete development needs: explicit polynomial automorphisms (for the cylinder), Krull dimension of hypersurface quotients, locally nilpotent derivations and their kernels, filtrations and associated graded rings, and the Mason–Stothers theorem for polynomials. Contributions formalizing Proposition 2.2, Proposition 3.4 (the graded identification), Propositions 4.1–4.3, Lemma 5.1 (order of a locally nilpotent derivation), Lemma 6.1 (Mason–Stothers) and Proposition 6.3 are welcome.
L. Makar-Limanov, On the hypersurface x+x2y+z2+t3=0 in C4 or a C3-like threefold which is not C3, Israel J. Math., 1996. https://doi.org/10.1007/BF02937314
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data 2: The Improved Juels–Sudan Sketch Is an Average-Case Secure Sketch for s-Element Sets with Entropy Loss t log nResearch Paper
Motivation
Many security-relevant inputs are noisy and do not repeat exactly: fingerprint minutiae, iris codes, lists of personal preferences, the set of features extracted from a document. A cryptographic key derived from such an input must be reproducible from a later, slightly different reading, without storing the input itself. Dodis, Ostrovsky, Reyzin and Smith (SIAM J. Comput. 38(1), 2008; arXiv:cs/0602007) introduced secure sketches for this purpose: public helper data that lets the holder of a nearby reading recover the original exactly, while revealing as little as possible about it.
When the input is a set of features, the natural distance is the size of the symmetric difference. Juels and Sudan proposed the fuzzy vault for this setting (Des. Codes Cryptogr. 38, 2006). Section 6.2 of Dodis et al. gives a simpler, deterministic variant, the improved Juels–Sudan sketch (Construction 5), whose storage and entropy loss are both tlogn for s-element subsets of an n-element universe, independent of s. The paper's Theorem 6.1 is the analysis of that construction. This mission formalizes it.
Setting
Laws and average min-entropy. A random variable is identified with its law. For a pair (A,B),
H~∞(A∣B)=−log2b∑amaxPr[A=a∧B=b],
which equals −log2Eb←B[maxaPr[A=a∣B=b]], the average min-entropy of §2.4: the negative logarithm of the best probability of guessing A after seeing B.
Secure sketches. Let M be a set with an integer-valued distance dis. A pair of procedures (SS,Rec) is an average-case (M,m,m~,t)-secure sketch (Definitions 3 and 4) if
(security) for all random variables W over M and I with H~∞(W∣I)≥m, one has H~∞(W∣(SS(W),I))≥m~.
The difference m−m~ is the entropy loss.
The metric. For a finite universe U with n=∣U∣, SDifs(U) is the set of s-element subsets of U with dis(w,w′)=∣w△w′∣.
Construction 5. Identify U with a finite field F of n elements and let t≤s.
SS(w): form p′(z)=∏x∈w(z−x), monic of degree s, and output its coefficients as−1,…,as−t of degree s−1 down to s−t.
Rec(w′,(as−1,…,as−t)): form phigh(z)=zs+∑i=s−ts−1aizi; find a polynomial plow of degree at most s−t−1 that agrees with phigh on at least s−t/2 points of w′ (Reed–Solomon decoding); output the roots of phigh−plow.
The Lean development names these charPoly, sketchCoeffs, sketch, pHigh, Step3Cond and recover, and the metric SDifS with distance sdifDist, in the namespace FuzzyExtractors.ImprovedJS.
Formalization targets
Goal: Theorem 6.1
For every finite field F with n elements, all t≤s and every real m,
(SS,Rec)is an average-case(SDifs(F),m,m−tlog2n,t)-secure sketch.
The goal is uniform in m: the entropy loss tlogn does not depend on the input distribution.
Milestones (the correctness half)
The paper's argument on p. 21 splits into four steps, each a milestone:
p′=phigh+q with degq≤s−t−1, and phigh=−q on w;
∣w△w′∣≤t implies ∣w∩w′∣≥s−t/2, so −q is a valid plow;
any two valid plow coincide;
Rec(w′,SS(w))=w whenever ∣w△w′∣≤t.
A fifth, off the goal's path, records Step 2's remark that the sketch consists of the first t elementary symmetric polynomials of w, up to sign.
The security half is the entropy bound: since SS takes at most nt values, H~∞(W∣(SS(W),I))≥H~∞(W∣I)−tlogn (the paper cites its Lemma 3.1, which is posed in the first mission of this series and is not restated here).
Significance
The result. Theorem 6.1 gives a secure sketch for set difference whose sketch length and entropy loss are tlogn, which the paper shows is essentially optimal when n≫s (§6.2, via Lemma C.1 and a constant-weight code bound). It improves the original fuzzy vault, whose entropy loss the paper analyses in Appendix D and finds good only when the stored data is very large. Through the paper's generic composition with randomness extractors (Lemma 4.1), it yields fuzzy extractors for set-valued inputs in large universes, the regime of biometric feature sets.
Formalizing it. The theorem is proved in the paper; no machine-checked version exists on Prove2Me or, to our knowledge, elsewhere. A formal proof combines three pieces of reusable infrastructure: a probabilistic layer (average min-entropy of laws on arbitrary types, and the chain-rule-type bound for a function with few values), the combinatorics of symmetric differences of equal-size sets, and the algebra of Reed–Solomon unique decoding (a low-degree polynomial is determined by its values on enough points). Each of these is useful beyond this mission.
Difficulty
No step is deep; the difficulty is in the bookkeeping. The correctness argument relies on exact degree accounting: phigh must agree with p′ in every coefficient of degree at least s−t, so that the remainder has degree at most s−t−1, and the uniqueness count ("two candidates agree on at least s−t points") requires the threshold to be at leasts−t/2; the paper's sentence says "more than", which does not support the argument as written. The roots of phigh−plow must be shown to form exactly the set w, with no multiplicities lost. The security half needs the average min-entropy of a joint law with a deterministic, nt-valued component bounded uniformly over all auxiliary variables, including those with infinite or uncountable range, where sums are infinite sums of extended nonnegative reals.
Formalization scope
Conventions committed to in Lean:
Laws are PMFs; the procedures are kernels M → PMF S, here deterministic (PMF.pure). Average min-entropy is the joint form above, logarithms base 2, and the auxiliary I ranges over an arbitrary ι : Type (a superset of the paper's {0,1}∗), never restricted to finite types.
The universe is the field F itself, [Field 𝔽] [Fintype 𝔽], with n = Fintype.card 𝔽; the paper's "n is a prime power" is then automatic.
The paper leaves t≤s implicit; every statement assumes it. No parity condition on t is imposed: "at least s−t/2" is written 2⋅#≥2s−t in N, which covers odd t.
"Degree at most s−t−1" is degree < s - t, so plow=0 when t=s.
The sketch is a vector in Ft indexed from 0: entry i is the coefficient of degree s−1−i. The storage bound tlogn holds by this type and is not restated.
Rec takes an arbitrary valid plow (by choice) instead of running a decoding algorithm. The paper's "fail" output is encoded as returning w′, which only occurs when correctness makes no claim.
Running time is out of scope. Theorem 6.1's clause that SS and Rec run in time polynomial in s, t and logn is dropped, and no surrogate predicate replaces it.
A formalization that checks only correctness, drops or trivializes the entropy clause, or lets Rec see w itself, would not be Theorem 6.1. The goal states both clauses through the definition of an average-case secure sketch, with Rec given only w′ and the sketch.
Contributions welcome: proofs of the milestones, a general lemma bounding average min-entropy loss by the logarithm of the number of sketch values (the paper's Lemma 2.2(b) and Lemma 3.1), and Reed–Solomon uniqueness lemmas stated for reuse.
E. Agrell, A. Vardy, K. Zeger, Upper Bounds for Constant-Weight Codes, IEEE Trans. Inform. Theory 46(7):2373–2395, 2000. https://doi.org/10.1109/18.887851
Métodos Numéricos (Freitas) II: Zeros de Polinômios e o Algoritmo de HornerTextbook
Motivation
Polynomial equations are the special case of root finding where algebra says a great deal before analysis is needed: the number of roots is known, the roots of a real polynomial come in conjugate pairs, the rational candidates can be listed, and the whole complex plane can be narrowed down to an annulus that must contain every root. A numerical method that exploits this information starts closer to the answer and needs fewer evaluations; and each evaluation itself can be made cheaper by Horner's scheme, which also delivers the deflated quotient for free.
This mission is the second in a series formalizing the lecture notes Métodos Numéricos by Sergio Roberto de Freitas (UFMS, 2000). It covers Chapter 4, Zeros de Polinômios.
Setting
Throughout, a polynomial is written in the book's convention
P(z)=a0zn+a1zn−1+dots+an−1z+an,
so the index i names the coefficient of zn−i and a0 is the leading coefficient. The coefficients are real (integral, in the rational-root milestone) and z ranges over mathbbC unless stated otherwise.
Horner's algorithm computes P(c) by the recurrence b0=a0, bi=ai+c,bi−1, so that P(c)=bn, using n multiplications and n additions. The same numbers b0,dots,bn−1 are the coefficients of the deflated polynomial Q with P(w)=(w−c),Q(w)+P(c).
With A=max∣a1∣,dots,∣an∣ and B=max∣a0∣,dots,∣an−1∣, the chapter's two localization results confine the roots to the annulus
frac11+B/∣an∣;le;∣z∣;le;1+fracA∣a0∣.
Target
The goal theorem is the outer bound (Proposição 4.2.1): every complex root of P satisfies ∣z∣le1+A/∣a0∣, where A is the largest absolute value among the non-leading coefficients.
The milestones are the companion results of the chapter: the inner bound (Proposição 4.2.2), the fact that non-real roots of a real polynomial occur in conjugate pairs (Proposição 4.1.1), the existence of a real root in odd degree (Proposição 4.1.2), the correctness of Horner's evaluation scheme, and the deflation identity that accompanies it.
Significance
The two localization bounds are what makes a search for complex roots finite: they give an explicit compact region to sweep, and they give scale information that prevents an iteration from wandering off. The conjugate-pair statement halves the work for real polynomials and is the reason odd-degree real polynomials always have a real root. The rational-root test turns exact factorization into a finite search. Horner's scheme is the standard way a polynomial is evaluated inside every root finder, and its deflation identity is what lets a method remove a root that has already been found and continue with a polynomial of lower degree.
Mathlib already contains general results close to some of these (a polynomial over a real closed field of odd degree has a root; rational-root divisibility), so those milestones are accessible; the two localization bounds and the Horner statements in the book's index convention are the substantive new work.
Difficulty
The localization proofs in the source are short but rest on a geometric-series estimate that is only valid for ∣z∣>1; the boundary cases ∣z∣le1 have to be treated separately in a formal proof, and the degenerate situations (n=1, coefficients all zero except the leading one) must be checked rather than waved through. The inner bound is obtained from the outer one by the substitution w=1/z, which requires knowing that zneq0 is a root of P if and only if w is a root of the reversed polynomial — an argument that has to be made explicit. The Horner statements look computational but need a careful induction because the exponents are natural-number subtractions.
Formalization scope
Coefficients are given as a function a:mathbbNtomathbbR together with a degree n, and the polynomial is the finite sum sumi=0naizn−i; two versions are provided, one evaluated at a real point and one at a complex point, with the coefficients coerced into mathbbC. Only indices 0leilen are read, so the values of a beyond n are irrelevant to every statement. The exponent n−i is natural-number subtraction, which is harmless in this range. No hypothesis says that the family a describes a polynomial of exact degree n beyond the explicit assumptions a0neq0 or anneq0 where they appear. The constants A and B are given as hypotheses equating them to the maximum of the relevant finite family of absolute values, rather than being defined separately. The rational-root and odd-degree milestones are stated with Mathlib's polynomial type instead of the coefficient-family encoding, since their statements involve no index convention.
Selected references
S. R. Freitas, Métodos Numéricos, Departamento de Computação e Estatística, Universidade Federal de Mato Grosso do Sul, 2000. Chapter 4, Zeros de Polinômios, pp. 71–84. (Course notes supplied with this mission.)
Brown-Gabrielse Invariance Theorem for an Imperfect Penning TrapResearch Paper
Motivation
The most precisely measured property of an elementary particle is the magnetic moment of the electron. The 2022 Northwestern measurement of Fan, Myers, Sukra and Gabrielse (arXiv:2209.13084) reports −μ/μB=g/2=1.00115965218059(13), and, combined with the Standard-Model prediction, α−1=137.035999166(15). Those numbers are experimental results, not theorems, and nothing in this mission asserts them.
What is a theorem is the piece of mathematics the measurement rests on. A single electron is held in a Penning trap: a uniform magnetic field plus an electrostatic quadrupole potential. The quantity the experiment needs is the free-space cyclotron frequency νc=eB/(2πm), but what a trap lets you observe are its three normal-mode frequencies — the trap-modified cyclotron frequency νˉc, the axial frequency νˉz, and the magnetron frequency νˉm. A real apparatus is never perfect: the magnetic field is tilted relative to the axis of the potential, and the potential is elliptically distorted. The invariance theorem of Brown and Gabrielse (Phys. Rev. A 25, 2423 (1982)), quoted as Eq. (4) of the measurement paper, says that a particular combination of the three observed frequencies is completely insensitive to both imperfections:
νc=νˉc2+νˉz2+νˉm2.
This is what makes a part-per-trillion measurement possible with an imperfect trap, and it is the object of this mission.
Setting
Work in R3. A particle of charge q and mass m sits in a uniform magnetic field B=Bb with b a unit vector, and in the static field of a quadratic electrostatic potential. Dividing the Hessian of that potential by the mass gives a real 3×3 matrix K, and the equation of motion of the particle is linear:
r′′(t)=−Kr(t)+ωc(r′(t)×b),ωc=mqB.
Two properties of K carry all the physics of the trap: K is symmetric, because it is a Hessian, and traceless, because the potential satisfies Laplace's equation in the vacuum region where the particle moves. Beyond that, K is arbitrary — an arbitrary K is exactly what "the axis of the potential is tilted relative to b, and the potential is elliptically distorted" means, so no separate tilt angle or ellipticity parameter appears anywhere.
Substituting the ansatz r(t)=ue−iωt with u∈C3 turns the equation of motion into the linear system M(ω)u=0, where
is the matrix of u↦b×u. A frequency ω is a normal mode of the trap precisely when detM(ω)=0. The three eigenfrequencies of the trap, written ωˉc,ωˉz,ωˉm (angular versions of νˉc,νˉz,νˉm), are the non-negative solutions of that equation.
Target
The goal is the invariance theorem in the form: if the three numbers ωˉc,ωˉz,ωˉm are the eigenfrequencies of the trap, in the sense that
detM(ω)=−(ω2−ωˉc2)(ω2−ωˉz2)(ω2−ωˉm2)for all ω∈R,
then, for every symmetric traceless K and every unit vector b,
ωˉc2+ωˉz2+ωˉm2=ωc2.
The milestones are the three steps of the argument, in increasing order of dependence:
Mode equation. The exponential ansatz solves the equation of motion at every time if and only if its amplitude lies in the kernel of M(ω). This is what makes M(ω) the right object to take determinants of.
Characteristic polynomial. For symmetric K, detM(ω) is real and depends on ω only through ω2: it equals −q(ω2) with q(λ)=det(λI−K)−ωc2λ(λ⟨b,b⟩−⟨b,Kb⟩).
Ideal trap. For K=diag(−ωz2/2,−ωz2/2,ωz2), b=(0,0,1) and ωc2≥2ωz2, the determinant factors explicitly, with eigenfrequencies (ωc±ωc2−2ωz2)/2 and ωz.
Significance
The result. The invariance theorem is why the electron magnetic moment can be measured to 0.13 parts per trillion in an apparatus whose magnetic field and electrode axis are not, and cannot be, exactly aligned. Without it, every misalignment and every elliptic distortion would enter the extracted νc as a systematic error, and the frequency ratio νa/νc that gives g/2 would have to be corrected with a model of the imperfections rather than being invariant under them.
Formalizing it. The theorem is a short, completely classical piece of linear algebra — the point of formalizing it is to have the frequency-metrology identity available as a machine-checked statement, together with a reusable model of linear motion in crossed electric and magnetic fields (the mode matrix, its characteristic cubic, and the correspondence between the exponential ansatz and the kernel of the mode matrix).
Status — please read before treating this as open. All four statements in this proposal have been proved by the drafting agent on a local Lean 4.28 / Mathlib installation; the proofs are deliberately not uploaded, so the platform statements are genuinely open here, but this is a formalization-transfer mission, not an open research problem. Milestone 3 is included precisely so that the goal's factorization hypothesis is known to be satisfiable and the goal is not vacuously true. The statements themselves were additionally compiled in this platform's default Lean environment before this proposal was assembled.
Difficulty
The obvious first idea — solve detM(ω)=0 and add up the roots — is exactly the thing not to do: for a tilted, elliptically distorted trap the three eigenfrequencies have no usable closed form. The whole content of the theorem is that the sum of their squares is the coefficient of ω4 in the characteristic polynomial and therefore needs no root formula at all: it is Vieta plus the two structural facts trK=0 and ⟨b,b⟩=1. The work in Lean is consequently not analysis but bookkeeping: computing a 3×3 determinant with complex off-diagonal entries and extracting one coefficient of the resulting cubic in ω2. The one place real care is needed is the mode-equation milestone, where derivatives of complex-valued functions of a real variable must be handled honestly.
Formalization scope
Conventions fixed by the Lean statements, and not visible in the prose:
Vectors are functions on a three-element index set and matrices are 3×3; no abstract inner-product space is used.
K is an arbitrary real matrix in the definitions; symmetry and tracelessness are hypotheses on the individual theorems, not part of the model.
"Unit vector" is the algebraic condition ⟨b,b⟩=1; no norm is used.
The magnetic term is −iωωcC(b) with C(b)u=b×u, i.e. the sign convention is fixed by the ansatz r(t)=ue−iωt and the force ωc(r′×b).
"The eigenfrequencies are ωˉc,ωˉz,ωˉm" is formalized as the functional identitydetM(ω)=−(ω2−ωˉc2)(ω2−ωˉz2)(ω2−ωˉm2) for all real ω — that is, as a factorization with multiplicity, not as a set of solutions of detM(ω)=0, which would not pin down multiplicities and would make the sum rule false in degenerate cases.
No sign conditions are imposed on ωˉc,ωˉz,ωˉm; the conclusion involves only their squares.
Nothing in this mission formalizes any measured quantity: g/2, α, and the frequencies of the actual apparatus appear only as motivation.
Only Mathlib is needed: matrices over R and C, determinants of 3×3 matrices, the cross product, and derivatives of complex-valued functions of a real variable. The definitions are reusable for any linear-motion-in-a-magnetic-field problem.
Selected references
X. Fan, T. G. Myers, B. A. D. Sukra, G. Gabrielse, Measurement of the Electron Magnetic Moment, Phys. Rev. Lett. 130, 071801 (2023), arXiv:2209.13084 — Eq. (4) is the statement formalized here.
L. S. Brown, G. Gabrielse, Precision spectroscopy of a charged particle in an imperfect Penning trap, Phys. Rev. A 25, 2423 (1982), doi:10.1103/PhysRevA.25.2423 — the original invariance theorem.
L. S. Brown, G. Gabrielse, Geonium theory: Physics of a single electron or ion in a Penning trap, Rev. Mod. Phys. 58, 233 (1986), doi:10.1103/RevModPhys.58.233 — the trap eigenfrequencies and the hierarchy νˉc≫νˉz≫νˉm.
Koide Mass Relation: Exact Algebraic ContentResearch Paper
Motivation
In 1982 Yoshio Koide, searching for an empirical formula for the Cabibbo angle, noticed that the
three charged-lepton masses satisfy
me+mμ+mτ=32(me+mμ+mτ)2.
With the present-day values me=0.510998910±0.000000013 MeV,
mμ=105.6583663±0.0000038 MeV and mτ=1776.99±0.29 MeV, the dimensionless
ratio on the left over the bracket on the right equals 0.666667±0.000016 — the value
32 to five digits. Whether this is numerology or a shadow of flavour physics beyond the
Standard Model is an open physics question; what is not open, and what this mission is about, is
the exact mathematical content of the relation: which triples of nonnegative reals satisfy it,
what its polynomial (square-root-free) consequences are, and what its geometric reading is.
The material formalized here is Chapter 3 ("A Mass Relation") of F. Goffinet's 2008 doctoral thesis
A bottom-up approach to fermion masses (Université catholique de Louvain), which collects the
algebraic and geometric properties of the relation and proposes a mixing-matrix generalization.
None of the statements below depends on any physics input: they are elementary real-algebraic facts
about the function q defined next. The physics enters only in which numbers one plugs in.
Setting
For a family of n nonnegative "masses" m=(m1,…,mn), not all zero, define the Koide
splitting parameter
q(m)=(∑imi)2∑imi.
In Lean this is koideRatio, defined by exactly this quotient for m : Fin n → ℝ (with Lean's
convention that x=0 for x<0 and x/0=0, so the definition is total; every statement in
the mission carries the nonnegativity and nondegeneracy hypotheses that make it meaningful).
Two further objects from the chapter are formalized alongside it.
The degeneracy angle. Put S=(m1,…,mn) in "generation space" and let
ψ be the angle between S and the democratic direction (1,…,1). In Lean, koideCos is
the cosine ⟨S,1⟩/(∥S∥∥1∥) written out as a
quotient of sums, and koideAngle is its arccos.
The pseudo-masses of the chapter's generalization: given a mixing matrix
U∈Cn×n, m~i=∑jUijmj (pseudoMass).
Koide's relation is the statement q(me,mμ,mτ)=32; the value q=31
corresponds to exact degeneracy m1=m2=m3 and q=1 to maximal hierarchy.
Target
The goal theorem is the exact solution of the relation for the third mass. For m1,m2,m3>0,
writing P=m1m2 and R=m1+4P+m2,
q(m1,m2,m3)=32⟺m3=7(m1+m2)+20P+43(m1+m2)Ror(4P<m1+m2 and m3=7(m1+m2)+20P−43(m1+m2)R).
This is equation (3.25) of the source, made precise: the "−" branch of (3.25) is a genuine
solution exactly when 4m1m2<m1+m2, and is a spurious root of the squared equation
otherwise (for instance at m1=m2, where the "−" value is positive but fails the relation).
The milestones cover, in the source's order: the range n1≤q≤1 and its two equality
cases (Table 3.1); the geometric reading cosψ=1/nq and the equivalence
ψ=45∘⟺q=32 (eq. (3.5)–(3.6), Fig. 3.1); the square-root-free polynomial
consequence (eq. (3.24)) and its matrix form (eq. (3.30)); the failure of the converse
(eqs. (3.26)–(3.28)); the ∑izi=0 reformulation in the composite-model parametrization
(eqs. (3.18)–(3.22)); the τ-mass prediction (eq. (3.4)); and the fact that the pseudo-mass
extension (3.31)–(3.32) reduces to the original relation at U=Id.
Significance
The result itself. The goal theorem turns an empirical numerical coincidence into a complete
description of its solution set: given any two masses, it says exactly which third masses are
admissible, and it separates the two roots by an explicit inequality. This is what licenses the
standard use of the relation as a prediction: fixing me and mμ and the normal hierarchy
mτ>mμ singles out one root, giving mτ=1776.968874 MeV, a number two orders of
magnitude more precise than the direct measurement (milestone on eq. (3.4)). The bound
31≤q≤1 with its equality cases explains why the relation can never hold for the
neutrinos in a near-degenerate spectrum, and why the up-quark family sits near the opposite
boundary. The square-root-free form (3.24)/(3.30) is what any Lagrangian-level model must reproduce,
since square roots of masses do not appear in a mass matrix; the failure of its converse is the
price paid for removing them, and the mission pins that failure down with an explicit witness.
Formalizing it. All the statements here are classical-strength real algebra, and none is
formalized in Mathlib: there is no koideRatio, no Cauchy–Schwarz-style equality analysis for the
∑m vs. (∑m)2 pair, and no treatment of the 45∘ geometry. The mission
produces a small reusable development — the parameter, its sharp bounds with equality cases, and its
angle formulation — that any later formalization of mass-relation phenomenology can import. It also
records, machine-checked, where the source text is imprecise: the "±" discussion after (3.25)
and the claim that (3.1) has exactly two solutions for the third mass.
Difficulty
Nothing here needs heavy machinery, and everything here needs care with square roots.
The bounds are Cauchy–Schwarz in one direction and (∑mi)2≥∑mi in
the other, but the equality cases are where the work is: the upper bound saturates exactly when at
most one mass is nonzero, and a proof must handle the mixed terms without assuming positivity of all
entries. The goal theorem is a quadratic in z=m3 — z2−4(x+y)z+(x2+y2−4xy)=0
with x=m1, y=m2 — so the difficulty is not solving it but keeping the
equivalence exact in both directions: passing from m3 back to z requires z≥0, which is
precisely where the "−" branch survives or dies, and the discriminant has to be recognized as a
perfect square times 3. The obvious route of squaring the relation twice, as the source does to
reach (3.24), is not reversible; a solver who squares must come back and discharge the sign
conditions, and the counterexample milestone shows that the lost information is real.
Formalization scope
Masses are real numbers, not physical quantities with units, and are indexed by Fin n (Fin 3 for
the three-generation statements); the mixing matrix in the pseudo-mass definition is complex, as in
the source. koideRatio, koideCos, koideAngle and pseudoMass are total functions and rely on
Lean's junk conventions outside their intended domain, so each statement carries its own
hypotheses — nonnegativity of every entry and the existence of a strictly positive entry — rather
than delegating them to the definitions. No statement is vacuous: every hypothesis set is satisfied
by the physical charged-lepton triple, and the degenerate configurations the quantifiers admit
(all-zero families, the n=0 family) are excluded by those hypotheses rather than by a side
condition that can never hold.
The angle statements use Real.arccos and are stated for the cosine written out as an explicit
quotient of sums, not through an inner-product-space instance; a solver is free to route the proof
through EuclideanSpace if that is convenient. The matrix milestone uses
Matrix.IsHermitian.eigenvalues for a 3×3 complex Hermitian matrix and states the conclusion
as an identity in C between trM, trM2 and
detM. Contributions of general-n versions of the three-generation statements, and of the
equality analysis as standalone lemmas, are welcome.
Selected references
F. Goffinet, A bottom-up approach to fermion masses, PhD thesis, Université catholique de
Louvain, December 2008. Chapter 3, pp. 59–86. http://hdl.handle.net/2078.1/20873
J.-M. Gérard, F. Goffinet, M. Herquet, A new look at an old mass relation, Phys. Lett. B 633
(2006) 563–566. https://arxiv.org/abs/hep-ph/0510289 (the pseudo-mass extension).