Heights and the Mordell–Weil theorem
Use arithmetic size, quadratic normalization and descent to explain finite generation over a number field.
On this page
The question for today
What you’ll understand
- Distinguish naive x-height from a specified canonical-height normalization.
- Explain why weak Mordell–Weil needs height descent to yield finite generation.
- Interpret the rank and torsion decomposition only over the stated number field.
Repeated chord constructions can produce rational coordinates with rapidly growing numerators and denominators. Height measures that arithmetic size, rather than geometric distance on a real graph. Its canonical correction behaves quadratically under multiplication and supplies the descent needed to turn finitely many residue classes into finitely many generators. This bridge is the core of Mordell–Weil: neither a finite search nor a finite quotient alone proves that every rational point has been accounted for.
Normalize height before comparing values
For a rational affine point with x=a/b in lowest terms and b positive, define the logarithmic x-height as log max(|a|,b), and set the height of O to zero. A number field uses the absolute logarithmic projective height, with local weights normalized by its degree over Q. Bounded height gives finitely many points in a fixed number field by Northcott's theorem. The fixed field or bounded-degree hypothesis is essential: over an algebraic closure there are infinitely many torsion points of canonical height zero.
We use the Silverman normalization: the canonical height is one half the limit of four to the minus n times the x-height of 2ⁿP. Thus it differs from half the naive height by a bounded function. Some sources and software instead call the unhalved limit the height. Both are valid conventions, but a numerical comparison or a regulator formula must account for the factor two. An additive change of bounded size disappears in the limit; a multiplicative normalization does not.
A finite quotient is only the weak theorem
Mordell–Weil states that E(K) is a finitely generated abelian group when K is a number field. Hence it is a free abelian group of finite rank plus a finite torsion subgroup. Weak Mordell–Weil first proves that E(K)/nE(K) is finite for an integer n greater than one. That statement alone is insufficient: the additive group Q has trivial quotient by nQ but is not finitely generated. A separate arithmetic compactness argument must control repeated division.
Choose finitely many coset representatives. Any point can be written as nQ plus one of them. The quadratic height and its pairing show that Q has smaller height once the starting point lies beyond a bound depending on those representatives. Repeating this reduction reaches a bounded-height set, which is finite by Northcott. The representatives together with that finite set generate E(K). This is an existence argument for a finite basis, not automatically a terminating rank algorithm for every input curve.
Quadraticity supplies certificates with limits
The canonical height is nonnegative and vanishes exactly on torsion points over a number field. The pairing is positive definite on the free part, so a nonsingular positive Gram matrix can certify independence of a proposed collection of points. Independence gives a lower bound for rank; it does not establish that those points span the entire free group. Even a full-rank subgroup can have finite index, affecting a regulator by the square of that index.
Finite approximations to the height need error bounds. If a global duplication inequality bounds the absolute difference between h_x(2Q) and four h_x(Q) by C, telescoping gives an error at most C divided by six times four to the n for the half-limit approximant. The constant must be proved for the chosen curve and model. A few stable decimal digits without such control are useful evidence but do not certify a zero height or rule out an omitted independent point.
Work it through
Naive heights do not already satisfy exact quadratic scaling
For P=(3,5) on y²=x³−2, use 2P=(129/100,−383/1000) to calculate the first two half-limit approximants to the canonical height.
The x-coordinate three has naive height log three. At n=0 the approximant is (log three)/2, approximately 0.549306.
The doubled x-coordinate is in lowest terms, so its naive height is log 129. At n=1 the approximant is (log 129)/8, approximately 0.607477.
These are different because the naive height only satisfies the duplication relation up to a bounded error. Neither number is the exact canonical height, and an error estimate is required before using a finite approximation as a certificate.
Canonical quadraticity belongs to the limiting corrected height. The raw coordinates supply approximants, whose normalization and error must both be recorded.
The living notebook
Explore the model
Interactive lab · optimization
Compare linear scaling with quadratic size
Pause and reset, then set both controls to η = 0.5 and x₀ = 2. Predict that one Step changes x from two to one and f=x²/2 from two to one half. For a fresh comparison, pause and reset, then set η = 0.75 and x₀ = 2; predict x becomes one half and f becomes one eighth. The squared size scales by the square of the coordinate factor. This scalar quadratic illustrates height scaling but computes no elliptic height or arithmetic descent.
- Position x0
- 2
- Objective x²/2
- 2
- Iteration behavior
- Stable step
Gradient descent on f(x) = x²/2: xₙ = (1 − η)ⁿx₀. Playback advances two discrete iterations per second. Values outside |x| ≤ 4 are explicitly reported. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.
Look forA quadratic size changes by a squared factor, while a valid descent argument also needs arithmetic finiteness.
Pause & reason
Check your understanding
Your turn
Try it yourself
Suppose a proven global duplication bound has C=3. A certified interval for the n=2 half-limit approximant is [0.20,0.21]. Enclose the canonical height and decide whether this certifies that P has infinite order. Does it determine the entire rank?
Take a moment to make a prediction or work it out on paper. Open a hint when you need one.
Give me a hint
The telescoping tail is bounded by C/(6·4²); enlarge both ends of the interval by that amount.
Compare with the solution
The error bound is 3/96=1/32=0.03125. Thus the canonical height lies in [0.16875,0.24125], a strictly positive interval. Under the stated certified duplication and numerical bounds, P is not torsion and supplies a rank lower bound of one. It gives neither an upper bound nor a complete basis. A second point might be independent, and a subgroup generated by P might have nontrivial index in a rank-one free part. Those questions require additional descent and saturation information.
Keep the idea
Take it with you
- State the factor-two convention when reporting a canonical height or height pairing.
- Weak Mordell–Weil plus a height descent proves finite generation over number fields.
- Certified independent points bound rank below; completeness and saturation need separate arguments.
Read further
Original sources and deeper explanations to follow at your own pace.
Optional progress, saved in this browser when available. Revisit any lesson at any time.
Lesson not marked complete.