Borrow a better passport
The prerequisites are included before the words that depend on them. Skip what you already know.
Start with step one → Return to the storyReading a Lean statement
High school
Separate the objects, their conditions, and the conclusion.
Powers and positive integers
Middle school
A power repeats multiplication; positive integers start at one.
A hypothetical counterexample
High school
Assume a forbidden solution exists, then keep its evidence together.
Functions
High school
A function gives one output for each permitted input.
Curves defined by equations
High school
An equation describes pairs of coordinates satisfying it.
Prime numbers
Middle school
A prime is at least two and has no positive divisors except one and itself.
Comparing remainders
Middle school
Two integers can differ while having the same remainder.
Symmetry as a transformation
High school
A symmetry rearranges an object while preserving its rules.
Vectors and subspaces
University
Vectors can be added and scaled; a subspace stays closed under those operations.
The curve’s own addition
University
The curve’s points add: the straight line through two chooses their sum.
Torsion points E[ℓ]
University
The points killed by ℓ-fold addition keep the curve’s arithmetic in a finite cage.
Galois representations
University
Encode number-preserving symmetries as transformations of vectors.
Common factors and coprimality
Middle school
Coprime numbers share no positive divisor larger than one.
From the equation to a curve
University
A forbidden solution supplies explicit coefficients of a Weierstrass curve.
Irreducibility
University
No nonzero proper subspace is preserved by every allowed symmetry.
Forms and representations together
Master’s level
One statement asks for curve data and form data to agree inside a residue world.
The discriminant, from quadratics to cubics
High school
One formula can certify whether an equation’s curve is clean or singular.
The quantity c₄, from coefficients to a fingerprint
University
A short polynomial in the coefficients that tells how badly the curve breaks.
Semistability
University
A condition controlling how a curve behaves when reduced at each prime.
Clock arithmetic
Middle school
Computing inside a fixed finite set of residues is a number world of its own.
Counting points: the curve’s number at a prime
Master’s level
Reduce the curve modulo a prime and count that finite point set.
The complex plane
University
Use two real coordinates for a complex number; take the points above the real axis.
Modular forms
University
A complex-valued function with precise transformation and smoothness rules.
Weight and level
University
Weight controls the transformation rule; level chooses which transformations are required.
Cusp forms
University
A modular form with an additional zero-limit condition at every cusp.
Coefficients as arithmetic data
University
An expansion expresses the function through a sequence of numbers.
Normalized eigenforms
University
The coefficient sequence obeys extra arithmetic rules, with its first coefficient fixed to one.
Modularity of a curve
University
Find a qualifying form whose coefficients match the curve’s arithmetic data.
Residual modularity
University
Match arithmetic data after passing to a residue setting.
Lifting
University
A theorem recovers fuller information from residual information under extra conditions.