Mordell–Weil Theorem¶
For an abelian variety over a number field, the group of rational points is finitely generated.
Core Idea¶
The Mordell–Weil theorem states that if \(A\) is an abelian variety defined over a number field \(K\), then its group of \(K\)-rational points is finitely generated:
for some finite torsion subgroup and finite integer \(r\). For an elliptic curve \(E/K\), this says every rational point can be obtained by adding a finite list of generators and torsion points under the elliptic-curve group law.
The theorem is a finite-generation result, not a finiteness result: \(A(K)\) is often infinite when \(r>0\). Its autonomy lies in a reusable arithmetic-geometric bridge—algebraic points on a projective group variety become a finitely generated abelian group.
Scope of Application¶
For elliptic curves, the theorem gives the basic decomposition \(E(K)_{\mathrm{tors}}\oplus\mathbb Z^r\). The rank controls the infinite part and is central to Diophantine questions, descent algorithms, and the Birch–Swinnerton-Dyer conjecture. The accepted Mordell–Weil Rank node concerns this numerical invariant, not the theorem establishing its finiteness.
For higher-dimensional abelian varieties, the same finite-generation statement applies to rational points. The theorem supports arithmetic study of Jacobians: rational divisor classes on a curve map into a finitely generated group, enabling arguments about rational points on the curve.
Clarity¶
Finite generation means there exist \(P_1,\ldots,P_n\in A(K)\) such that every \(P\in A(K)\) is an integer linear combination of these points. It does not mean \(A(K)\) is finite or that the representation is unique.
Because a finitely generated abelian group has a finite torsion subgroup and free part, the structural decomposition follows from the group structure theorem after finite generation is known.
Manages Complexity¶
The theorem compresses an a priori unbounded search among algebraic coordinates into finite group data: torsion, rank, and generators. Once generators are known, questions about rational-point addition reduce to integer linear combinations.
In Diophantine applications, mapping points into an abelian variety replaces geometric uncertainty with arithmetic on a finitely generated group. Heights then provide quantitative control over coefficient size.
Abstract Reasoning¶
The standard descent lemma has the following shape. Suppose an abelian group \(G\) has a height \(h:G\to\mathbb R_{\ge0}\) such that \(h(mP)\) grows roughly as \(m^2h(P)\), height changes under translation by bounded amounts, and only finitely many points have bounded height. If \(G/mG\) is finite, choose representatives \(R_1,\ldots,R_t\).
Knowledge Transfer¶
The proof pattern transfers within arithmetic geometry to “weak Mordell–Weil plus height descent”: first prove a quotient finite, then use a proper size function to turn finite quotient data into finite generation.
The pattern resembles generic well-founded reduction but requires arithmetic inputs: number fields, rational points, multiplication maps, local-global descent, and height finiteness. It does not license analogous claims for arbitrary groups with an informal notion of size.
Relationships to Other Abstractions¶
Current abstraction Mordell–Weil Theorem Domain-specific
Parents (1) — more general patterns this builds on
-
Mordell–Weil Theorem presupposes Group Prime
Group is the proposed minimal parent by composition: the theorem's object \(A(K)\) is an abelian group, and the theorem adds a finite-generation guarantee from arithmetic geometry.
Hierarchy paths (5) — routes to 5 parentless roots
- Mordell–Weil Theorem → Group → Monoid → Semigroup → Set and Membership
- Mordell–Weil Theorem → Group → Monoid → Identity Element
- Mordell–Weil Theorem → Group → Monoid → Semigroup → Closure
- Mordell–Weil Theorem → Group → Monoid → Semigroup → Associativity → Invariance
- Mordell–Weil Theorem → Group → Monoid → Semigroup → Associativity → Symmetry
Neighborhood in Abstraction Space¶
Mordell–Weil Theorem sits in a sparse region of the domain-specific corpus (84th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Elliptic Arithmetic & Group Finiteness (5 abstractions)
Nearest neighbors
- Néron–Tate height — 0.81
- Coin Problem — 0.81
- Schneider–Lang Theorem — 0.81
- Real Closed Field — 0.80
- Cyclic Algebra — 0.80
Computed from structural-signature embeddings · 2026-09-08