Build the idea in three steps
- Reducing coefficients modulo a prime can change a curve’s behavior. Some primes give bad reduction.
- The discriminant Δ and invariant c₄ are quantities computed from the curve’s coefficients. This repository tests which primes divide them.
- For every prime dividing Δ, semistability requires it not to divide c₄. This exact condition supports the later theorems.
A small example
The passport is not a visual smoothness test. It is evidence for the prime-by-prime divisibility statement shown in Lean.