Function-field Frobenius iteration agrees with Laurent-series iteration
ProvedN25.Endgame.coe_qExpFrobeniusModL_pow25mazur-n25
Let be prime, let be a field of characteristic , let be the level- -expansion function field, and let be its Laurent-series realization. Write for Frobenius on and for Frobenius on Laurent series. Then for every and ,
This lets calculations on Laurent expansions be transported back to the modular function field.
Preamble
import Definitions.Def_N25_Endgame import Definitions.Def_AlgebraicCurve_Correspondence open N25 open N25.Endgame
Formal statement
theorem N25.Endgame.coe_qExpFrobeniusModL_pow25
(p : ℕ) [Fact p.Prime] (K : Type*) [Field K] [CharP K p]
(n : ℕ) (x : ModularCurve.qExpFunctionFieldC K Γ25) :
((ModularCurve.qExpFrobeniusModL K Γ25 p ^ n) x : LaurentSeries K) =
(ModularCurve.qExpand K p ^ n) (x : LaurentSeries K) := 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.