A three-note audition
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.
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.
Clock arithmetic
Middle school
Computing inside a fixed finite set of residues is a number world of its own.
Functions
High school
A function gives one output for each permitted input.
Symmetry as a transformation
High school
A symmetry rearranges an object while preserving its rules.
Matrices as transformations
High school
A two-by-two table of numbers describes a transformation with its own arithmetic.
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.
Congruence subgroups of matrices
University
The level names which matrix transformations are kept and which are sent to zero.
Coefficients as arithmetic data
University
An expansion expresses the function through a sequence of numbers.
Cusp forms
University
A modular form with an additional zero-limit condition at every cusp.
Common factors and coprimality
Middle school
Coprime numbers share no positive divisor larger than one.
Normalized eigenforms
University
The coefficient sequence obeys extra arithmetic rules, with its first coefficient fixed to one.
A hypothetical counterexample
High school
Assume a forbidden solution exists, then keep its evidence together.
Curves defined by equations
High school
An equation describes pairs of coordinates satisfying it.
The curve’s own addition
University
The curve’s points add: the straight line through two chooses their sum.
Counting points: the curve’s number at a prime
Master’s level
Reduce the curve modulo a prime and count that finite point set.
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.
Vectors and subspaces
University
Vectors can be added and scaled; a subspace stays closed under those operations.
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.
Irreducibility
University
No nonzero proper subspace is preserved by every allowed symmetry.
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.
Lifting
University
A theorem recovers fuller information from residual information under extra conditions.