Projective-vector equivalence is transitive
ProvedKeystoneLadder.SameP1Vec.transmazur-n25
Let be a field and let . With meaning for some nonzero , if and , then
This allows projective correctness statements from separate ladder and division-polynomial stages to be chained. Formalization note: decidable equality on is used only by the surrounding executable representation.
Preamble
import Mathlib
import Definitions.Def_KeystoneLadder
set_option linter.unusedSectionVars false
set_option linter.unusedSimpArgs false
set_option linter.unusedTactic false
set_option linter.overlappingInstances false
open Polynomial
open WeierstrassCurve
open WeierstrassCurve.Affine
open KeystoneLadder
universe u
variable {k : Type u} [Field k] [DecidableEq k]
variable (E : WeierstrassCurve k)
open KeystoneLadder.SameP1VecFormal statement
theorem KeystoneLadder.SameP1Vec.trans {u v w : Fin 2 → k} (huv : SameP1Vec u v) (hvw : SameP1Vec v w) :
SameP1Vec u w := 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.