Algorithms for Elliptic Curves over ℚ

Executive summary

Standardise the model, then extract the arithmetic

The first step with any curve over ℚ is to replace it by its minimal model, so that invariants are canonical and comparable. Tate's algorithm then determines the reduction type, Tamagawa number and conductor exponent at each bad prime. Torsion is settled by a short search constrained by Mazur's theorem. Rank requires descent, which produces an upper bound and a point search, and may leave a gap attributable to the Tate–Shafarevich group.

Learning objectives

Compute a minimal Weierstrass model.
Apply Tate's algorithm to obtain the reduction type and conductor.
Determine the torsion subgroup using Mazur's constraint.
Explain the structure of a descent computation.
Use canonical heights to test independence of points.

Section 01Minimal models

Weierstrass equations related by the admissible substitutions form an isomorphism class; the minimal model is the one whose discriminant has the smallest absolute value. Over ℚ it exists and is unique up to the remaining trivial transformations.

Why minimality matters

The conductor, the Tamagawa numbers and the real period are all defined relative to the minimal model. Computing them from a non-minimal equation gives wrong values — and they will still look like plausible values, so the error will not announce itself. Minimising first is not optional.

The minimal model is found by computing the invariants c₄, c₆, Δ, then removing twelfth powers from Δ consistently with fourth and sixth powers in c₄ and c₆ — a prime-by-prime reduction requiring the factorisation of the discriminant.

Section 02Tate's algorithm

At each prime dividing the minimal discriminant, Tate's algorithm classifies the reduction by a sequence of tests on the coefficients, outputting the Kodaira symbol, the Tamagawa number and the conductor exponent.

Reduction types and their data
Kodaira type	Reduction	Tamagawa number c_p	Conductor exponent
I₀	Good	1	0
I_n (n ≥ 1)	Multiplicative	n or gcd(n, 2), by splitting	1
II, II*	Additive	1	≥ 2
III, III*	Additive	2	≥ 2
IV, IV*	Additive	1 or 3	≥ 2
I_n*	Additive	2 or 4	≥ 2

Where the conductor is used

The conductor is the level of the modular form attached to the curve, so it is the key into modular form databases and is how curves are indexed in standard tables. The Tamagawa numbers enter the strong BSD formula directly.

Section 03Torsion

AlgorithmTorsion subgroup determinationin: E over ℚ → out: E(ℚ)_tors

Compute the minimal model and its discriminant.
Apply Nagell–Lutz: a torsion point has integral coordinates with y = 0 or y² dividing the discriminant. A finite list of candidates.
Alternatively and usually faster, reduce modulo several primes of good reduction; the torsion injects into E(F_p), so gcd of the group orders bounds it.
Test each candidate by computing its multiples until the identity or an excessively large coordinate appears.
Confirm the resulting group is one of the fifteen allowed by Mazur's theorem.

Reduction is the practical method

Reducing modulo a handful of good primes and taking the gcd of the group orders usually pins down the torsion immediately and costs almost nothing. Nagell–Lutz is the certificate; reduction is the search.

Section 04Rank and descent

Stage 012-descentMap E(ℚ)/2E(ℚ) into a Selmer group computed from local conditions, giving an upper bound on the rank.
Stage 02Search for pointsLook for rational points of bounded height, giving a lower bound. Sieving and lattice methods extend the reachable height.
Stage 03Compare boundsIf the upper and lower bounds agree, the rank is determined.
Stage 04Handle the gapA discrepancy is attributed to the Tate–Shafarevich group; higher descents or Heegner point constructions may close it.

Independence of found points is tested by the canonical height pairing: the height regulator matrix is non-singular exactly when the points are independent, and its determinant enters the strong BSD formula.

Descent may not terminate conclusively

Rank computation is not a guaranteed-terminating algorithm. A 2-descent may leave a gap that higher descents fail to close, and generators of very large height may escape any feasible search. Reported ranks should carry their method and any conditionality.

ReferenceFrequently asked questions

Why do curves need to be minimised before comparison?

Because the same curve has infinitely many Weierstrass equations with different discriminants. Without minimisation, two equations for the same curve appear to have different invariants and database lookups fail.

How large can the coordinates of a generator be?

There is no known effective bound in general, and curves are known whose smallest generator has coordinates with hundreds of digits. This is precisely why rank computation is hard and why the analytic prediction is valuable as a guide.

What is the canonical height for?

It is a quadratic form on the Mordell-Weil group that measures the arithmetic size of a point and is compatible with the group law. It is used to test independence of points, to bound searches, and it appears in the strong BSD formula through the regulator.

NavigateContinue in this stream

Curated next steps from this page. The site also surfaces algorithmically related reading below.

ProvenanceSources and further reading

This page is an original KEVOS explanatory article. It presents the underlying mathematics — definitions, algorithms, complexity results and selection criteria — in KEVOS editorial voice. No text is reproduced from any copyrighted source. Where numerical tables are relevant, KEVOS links to live authoritative databases rather than republishing static values.

Handbook application: from concept to controlled practice

Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review Algorithms for Elliptic Curves over ℚ. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.

The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.

Treat Algorithms for Elliptic Curves over ℚ as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—section, minimal, algorithm, torsion, elliptic—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.

For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.

A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.

Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.

Step-by-step operating method

Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.

Worked-example protocol

Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.

Stage	Record	Quality check
Input	Objects, domain, notation, assumptions	Every symbol is defined
Method	Permitted operation or cited result at each step	All hypotheses hold
Output	Exact result and representation	Correct type, domain and form
Verification	Substitution, invariant or alternative derivation	Independent agreement
Boundary test	Zero, identity, degenerate or failed hypothesis	Scope is understood

Common failure modes and recovery actions

1. Watch for

Using a theorem without checking every hypothesis.

Recovery: Return to the governing definition or requirement and restate the decision in one sentence.

2. Watch for

Treating a suggestive example as a proof of the general case.

Recovery: Separate evidence from assumption, assign an owner and set a date for validation.

3. Watch for

Changing notation or conventions part-way through an argument.

Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.

4. Watch for

Hiding a division-by-zero, convergence, finiteness or commutativity assumption.

Recovery: Record the consequence, decision and rationale, then update the controlled baseline.

5. Watch for

Reporting a computed result without a residual, substitution or structural check.

Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.

Review checklist

Can every symbol be traced to a definition or prior result?
Which hypothesis does each major step use?
Does the method cover zero, identity, degenerate and boundary cases?
Can the conclusion be checked by a second representation or calculation?
Are mandatory requirements distinguished from recommendations and illustrative values?
Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
Is there a named owner and a trigger for review, escalation, change or retirement?

Questions for deeper application

What is the most important distinction a practitioner must preserve when applying Algorithms for Elliptic Curves over ℚ?