Mordell–Weil Rank of an Elliptic Curve¶
Count the independent infinite-order rational points on an elliptic curve over a declared number field by taking the free rank of its finitely generated Mordell–Weil group.
Core Idea¶
The Mordell–Weil rank of an elliptic curve measures how many independent infinite-order rational points are needed to generate the non-torsion part of its rational-point group. Let \(E\) be an elliptic curve over a number field \(K\). The chord-and-tangent law makes the \(K\)-rational points \(E(K)\) an abelian group. The Mordell–Weil theorem says that this group is finitely generated, so the structure theorem for finitely generated abelian groups gives
Scope of Application¶
Individual curve arithmetic. Rank says whether the rational-point group is finite or infinite and specifies how many independent non-torsion generators a full group description needs. Together with torsion and a saturated basis, it makes the abstract finite-generation theorem explicit for one curve.
Descent computations. A two-descent, three-descent, or higher descent maps rational points into finite arithmetic data. The resulting Selmer information gives an upper bound; independently found points give a lower bound. Equality certifies rank. The abstraction organizes the computation around closing a gap rather than treating every discovered point as a separate result.
Clarity¶
Mordell–Weil rank clarifies three questions that are often conflated:
- Does the curve have rational points? The identity point always exists, and other torsion points may exist even at rank zero.
- Are there infinitely many rational points? Over a number field, this holds exactly when rank is positive.
- How many independent non-torsion directions generate them? This is the integer \(r\).
Manages Complexity¶
An elliptic curve can have rational points with enormous coordinates, and repeated addition can generate infinitely many further points. Rank compresses that unbounded visible set into a finite structural description: a finite torsion subgroup, \(r\) independent non-torsion generators, and integer coefficients. Instead of cataloging points one by one, one asks whether a candidate basis is independent, generating, and saturated.
Abstract Reasoning¶
Use the following recognition and inference sequence:
- Declare \(E\) and \(K\); verify that \(E(K)\) lies in a Mordell–Weil finite-generation setting.
- Separate \(E(K)_{\mathrm{tors}}\) from the non-torsion quotient.
- Exhibit independent infinite-order points to obtain a lower bound.
- Obtain a mathematically justified upper bound, commonly through descent.
- Accept an exact rank only when lower and upper bounds coincide.
- Keep any analytic comparison or Selmer quantity labeled by its own kind.
Knowledge Transfer¶
Within arithmetic geometry, the same rank reasoning transfers literally across elliptic curves, base fields, twists, and families: isolate a finitely generated rational-point group, remove torsion, and count free generators. The Mordell–Weil theorem extends the finite-generation setting to abelian varieties, where an analogous free rank remains meaningful, although this node keeps the elliptic-curve scope explicit.
Transfer to linear algebra is skeletal rather than literal. Both domains replace a complicated object with an invariant count of independent directions, and tensoring explains the bridge.
Relationships to Other Abstractions¶
Current abstraction Mordell–Weil Rank of an Elliptic Curve Domain-specific
Parents (2) — outgoing typed relations
-
Mordell–Weil Rank of an Elliptic Curve is a kind of Dimension Prime
Dimension. Mordell–Weil rank is a strict specialization of an independent-degree count: \(r=\dim_{\mathbb Q}(E(K)\otimes_{\mathbb Z}\mathbb Q)\).
-
Mordell–Weil Rank of an Elliptic Curve presupposes Group Prime
Dimension. Mordell–Weil rank is a strict specialization of an independent-degree count: \(r=\dim_{\mathbb Q}(E(K)\otimes_{\mathbb Z}\mathbb Q)\).
Hierarchy paths (6) — routes to 6 parentless roots
- Mordell–Weil Rank of an Elliptic Curve → is a kind of Dimension
- Mordell–Weil Rank of an Elliptic Curve → presupposes Group → is a kind of Monoid → includes Identity Element
- Mordell–Weil Rank of an Elliptic Curve → presupposes Group → is a kind of Monoid → is a kind of Semigroup → includes Closure
- Mordell–Weil Rank of an Elliptic Curve → presupposes Group → is a kind of Monoid → is a kind of Semigroup → is a kind of Set and Membership
- Mordell–Weil Rank of an Elliptic Curve → presupposes Group → is a kind of Monoid → is a kind of Semigroup → includes Associativity → is a kind of Invariance
- Mordell–Weil Rank of an Elliptic Curve → presupposes Group → is a kind of Monoid → is a kind of Semigroup → includes Associativity → is a kind of Symmetry
Neighborhood in Abstraction Space¶
Mordell–Weil Rank of an Elliptic Curve 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 — Unclustered & Miscellaneous (2769 abstractions)
Nearest neighbors
- Structure Theorem for Finitely Generated Modules over a Principal Ideal Domain — 0.85
- Jacobian variety — 0.82
- Elliptic Divisibility Sequence — 0.82
- Local Tate Duality — 0.81
- Tunnell's theorem — 0.80
Computed from structural-signature embeddings · 2026-10-25