Mazur’s Torsion Theorem: Full Classification and All Fifteen GroupsResearch Paper
Why rational torsion deserves a complete classification
An elliptic curve has rational solutions that can be added using a canonical group law. A torsion point is a rational solution that returns to the identity after a positive number of additions. These points form the finite part of the rational-point group and constrain which finite arithmetic configurations a curve can carry. Barry Mazur determined the possible groups uniformly over all elliptic curves defined over the rational numbers. The theorem is established mathematics; the remaining task is its complete formal proof, including the assertion that every permitted group occurs. The source is Theorem III.5.1 and its occurrence remark, printed page 156 of Modular curves and the Eisenstein ideal.
Curves, rational points, and finite additive order
A Weierstrass curve over the rational numbers is an equation
where all five coefficients are rational. Its discriminant measures singularity. The curves in this mission have nonzero discriminant, so they are elliptic curves. The group consists of its rational points together with the distinguished point at infinity, which is the additive identity. The rational torsion subgroup is
This subgroup is formed using the actual rational-point group; it is not a separately supplied finite group or a collection of coordinate certificates.
The symbol denotes a cyclic group of order , with its additive operation. A product of two such groups has componentwise addition. An additive group isomorphism is a bijection that preserves addition. Consequently, classifying a subgroup by an isomorphism identifies its complete group structure and its number of elements, rather than only the orders of selected points.
Formalization targets
For every elliptic curve , the torsion subgroup must be finite and isomorphic to one of
or
Conversely, for every parameter in either displayed range, there must exist an elliptic curve over whose full rational torsion subgroup is isomorphic to that group. The curve may depend on the parameter. The goal combines unconditional finiteness, classification, and all fifteen occurrence cases. The cyclic case includes curves with trivial rational torsion. Occurrence requires equality of the entire torsion group up to isomorphism; constructing an embedding or a single point of the desired order does not meet that target.
The supporting point-order milestone is Corollary III.5.2, on the same source page: every rational point of positive finite order has order in the eleven-element cyclic list. Infinite-order points are outside that milestone's hypothesis. The four other milestone clauses separate finiteness, group classification, cyclic occurrence, and bicyclic occurrence so their contributions can be reviewed individually.
What the formal proof will provide
The final classification theorem will be available in the standard Lean vocabulary for rational elliptic curves, finite-order subgroups, cyclic groups, products, and additive equivalences. Its main downstream consumer is the canonical classification endpoint of the MazurTheorem repository. Occurrence supplies the converse needed for an exact list of possible groups. Together these results also give a torsion-cardinality bound of sixteen and uniformly exclude rational torsion configurations outside the list.
The existing repository contains substantial checked prerequisites and reductions. A prerequisite receives credit according to its actual hypotheses, conclusion, and connection to the acceptance theorem. This campaign does not treat the full classification as already formalized, and it does not treat locally checked source as a platform-verified contribution before transfer and verification. Existing proofs should be reused with their attribution and dependency graph intact. Open definitions and unproved mathematical comparisons must remain visible as obligations.
The remaining difficulty
Finite-abelian-group classification alone cannot establish which groups arise from an arbitrary rational elliptic curve. The crucial arithmetic exclusions require connecting concrete rational points with genuine arithmetic-geometric objects. A theorem about a supplied quotient or Jacobian does not construct that quotient or Jacobian; an interface that assumes a missing comparison leaves that comparison unproved. The foundational work includes represented modular curves, Jacobians and Picard functors, integral models, specialization, and the arithmetic needed to exclude prohibited point orders. These requirements reflect the mathematical source and the repository's current proof architecture.
The occurrence direction has a different verification obligation. Explicit rational points and order computations must be supplemented by a proof that the curve is nonsingular and that its entire rational torsion subgroup has precisely the claimed shape. Machine arithmetic and external tables can guide the selection of examples, but the published occurrence theorem must have a checked proof.
Formalization scope and contribution boundaries
Curves are Mathlib's WeierstrassCurve ℚ with IsElliptic; rational points are (E⁄ℚ).Point. Torsion is AddCommGroup.torsion, the cyclic groups are the additive groups of ZMod, and isomorphisms are additive equivalences. The target definition bundle repeats the repository's fifteen-group vocabulary in a campaign namespace. A checked compatibility bridge identifies its classification predicate with the repository's canonical predicate. This definition boundary exists solely to state platform obligations faithfully; its named consumers are the campaign goal and the repository's classification endpoint.
The goal has no supplied finiteness, rank, reduction, modularity, semistability, point-order classification, or group-classification hypothesis. Finiteness is an explicit conclusion. The numerical expression Set.ncard ≤ 16 is only a corollary: Set.ncard is zero on infinite sets, so that expression alone cannot certify this mission's completion. Checked proofs must have no placeholders, custom axioms, unchecked computation, or proof-strengthening options. The permitted foundational dependencies are propext, Quot.sound, and Classical.choice; open targets are displayed separately from their eventual proofs.
The repository's execution ledger remains the source of contributor assignment. Its selected foundations are the coherent-cohomology-to-Jacobian lane and the represented-modular-curve lane. Contracts marked paused remain paused unless the maintainers explicitly revise their assignment. Platform milestones describe mathematical completion obligations, not automatic authorization to claim every repository task. Contributors can close occurrence examples, reuse checked arithmetic reductions, and advance selected foundational packages with a concrete downstream consumer. Progress must track integrated obligations rather than code volume or the number of generated statements. Licenses, source commits, original authors, and upstream notices must accompany all transferred proofs.
Selected references
- Barry Mazur, Modular curves and the Eisenstein ideal, Publications Mathématiques de l'IHÉS 47 (1977), 33–186. Part III, §5, Theorem (5.1), the following occurrence remark, and Corollary (5.2), printed p. 156. DOI; Numdam.
- Daniel S. Kubert, Universal bounds on the torsion of elliptic curves, Proceedings of the London Mathematical Society (3) 33 (1976), 193–237, especially Chapter IV's rational parametrizations, cited by Mazur's occurrence remark. DOI.
- Vasily Ilin and contributors, MazurTheorem, public Lean formalization. Repository; campaign source snapshot
54d43d8dda8a6fcf069cc02a815f850d762c5c0c. Existing uncommitted changes are excluded from source-snapshot claims.