The structured point count over is five
ProvedMazurProof.RationalPointsN25QuotientWeilThreeLinear.canonicalStructuredPointCount25F9_eqmazur-n25
Let be the four chart components in the structured enumeration of the canonical level- model over , and include the final normalized point . Then
This supplies the degree-two characteristic-three point count.
Preamble
import Definitions.Def_N25_ExplicitWeil import Definitions.Def_N25_ExplicitWeilThreeDefs import Definitions.Def_N25_CanonicalThreeNormalization import Definitions.Def_N25_CanonicalNormalizedPoints import Definitions.Def_N25_NormalizedPointPivot import Definitions.Def_N25_ExplicitWeilThreeLinear open MazurProof open MazurProof.RationalPointsN25QuotientWeilThreeLinear open MazurProof.RationalPointsN25QuotientWeil open MazurProof.RationalPointsN25QuotientWeilThree attribute [local instance] Fintype.decidableForallFintype Fintype.decidableExistsFintype
Formal statement
theorem MazurProof.RationalPointsN25QuotientWeilThreeLinear.canonicalStructuredPointCount25F9_eq :
canonicalStructuredPointCount25Three f9Operations = 5 := 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.