The structured characteristic-three count equals the semantic point cardinality
ProvedMazurProof.RationalPointsN25QuotientSmallThreeSemantic.canonicalStructuredPointCount25Three_field_eq_cardmazur-n25
Let be a finite field of characteristic with decidable equality. Let be the structured chart count computed from the ordinary field operations, and let be the normalized projective solutions of the semantic canonical equations. Then
This validates the structured executable count as an actual projective curve point count. Formalization note: the finite-type and decidable-equality instances support enumeration of the field carrier.
Preamble
import Definitions.Def_N25_CanonicalThreeNormalization import Definitions.Def_N25_CanonicalNormalizedPoints import Definitions.Def_N25_NormalizedPointPivot import Definitions.Def_N25_ExplicitSmallThreeFields import Definitions.Def_N25_ExplicitKummerThreeProjective import Definitions.Def_N25_ExplicitWeilThreeLinear import Definitions.Def_N25_ExplicitSmallThreeSemantic open MazurProof open MazurProof.RationalPointsN25QuotientSmallThreeSemantic open MazurProof.RationalPointsN25QuotientWeil open MazurProof.RationalPointsN25QuotientF2 open MazurProof.RationalPointsN25QuotientWeilThree open MazurProof.RationalPointsN25QuotientWeilThreeLinear open MazurProof.RationalPointsN25QuotientKummerThree open MazurProof.RationalPointsN25QuotientKummerThreeProjective universe u
Formal statement
theorem MazurProof.RationalPointsN25QuotientSmallThreeSemantic.canonicalStructuredPointCount25Three_field_eq_card
(K : Type u) [Field K] [CharP K 3] [Fintype K] [DecidableEq K] :
canonicalStructuredPointCount25Three (fieldTernaryOperations K) =
Nat.card {P : NormalizedProjective4 K // IsCanonicalNormalizedThree P} := 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.