The optimized Sutherland -coordinate equals the cleared raw-coordinate formula
ProvedMazurProof.RationalPointsN25SutherlandBridge.tateToSutherlandY_eq_rawmazur-n25
Let with , , and nonzero transformed -denominator. Put and . Then
where is the common factor and is the explicit -denominator. This identifies the raw and optimized Sutherland coordinates.
Preamble
import Mathlib import Mathlib.AlgebraicGeometry.EllipticCurve.DivisionPolynomial.Degree import Mathlib.AlgebraicGeometry.EllipticCurve.DivisionPolynomial.Basic import Mathlib.NumberTheory.EllipticDivisibilitySequence import Mathlib.Tactic import Definitions.Def_RationalPointsN25SutherlandBridge import Definitions.Def_TateNFDivision import Definitions.Def_TateOrder25Factor open MazurProof open MazurProof.RationalPointsN25SutherlandBridge open MazurProof.TateOrder25Factor set_option linter.style.longLine false
Formal statement
theorem MazurProof.RationalPointsN25SutherlandBridge.tateToSutherlandY_eq_raw
{b c : ℚ} (hc : c ≠ 0) (hd : b - c ≠ 0)
(hB : tateToSutherlandYDen25 b c ≠ 0) :
((b / c) * (c ^ 2 / (b - c)) - 2 * (b / c) + 1) /
((c ^ 2 / (b - c)) ^ 2 - c ^ 2 / (b - c) - b / c + 1) =
tateToSutherlandCommon25 b c * (b - c) /
tateToSutherlandYDen25 b c := 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.