Good reduction preserves the complete divisor of every selected modular unit
ProvedN25.Endgame.U25_orders_special_goodmazur-n25
Let be prime with or , let be a level- reduction datum at , let be the th reduced modular unit for , let be the reductions of the five selected geometric cusps, and let be the prescribed integer order table. Then
This shows that specialization preserves the entire unit divisor, including absence of additional zeros or poles.
Preamble
import Definitions.Def_N25_SelectedCusps import Definitions.Def_N25_Units import Definitions.Def_N25_UnitOrders set_option autoImplicit false open N25 open N25.Endgame
Formal statement
theorem N25.Endgame.U25_orders_special_good
(p : ℕ) [Fact p.Prime] (hp : p = 2 ∨ p = 3)
(D : RedDatum25 p) (i : Fin 5) :
(∀ j : Fin 5,
(redPlace25 D (pG25 j)).ord (N25.U25C (κ D.A) i) =
N25.unitOrders25 i j) ∧
∀ P : SpecialPlace D.A,
(∀ j : Fin 5, P ≠ redPlace25 D (pG25 j)) →
P.ord (N25.U25C (κ D.A) i) = 0 := by sorrySource
B. Mazur, Modular curves and the Eisenstein ideal, Publ. IHES 47 (1977); Lean formalization of the order-25 case for this mission. Modules in the MazurProof/Keystone/Tate families are adapted from anthropics/fermats-last-theorem (Apache-2.0) via the xiangyazi24/FLT fork.