Correctness of radical normalization: if `r² = B`, then scaling sends
ProvedCryptography.IsogenySIDH.radicalNormalize_correctaether-catalogcryptography
Correctness of radical normalization: if r² = B, then scaling sends
B*y² = x³ + A*x² + x to the normalized Montgomery equation.
theorem Cryptography.IsogenySIDH.radicalNormalize_correct{A B r x y : K}
(hrad : r ^ 2 = B)
(hP : B * y ^ 2 = x ^ 3 + A * x ^ 2 + x) :
OnMontgomery A (radicalNormalize r (x, y)) := by sorry
Formalization Note Transplanted verbatim from the Aether Catalog source Cryptography/IsogenySIDH/RadicalMontgomery.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.
Preamble
-- Thm stub generated from Cryptography/IsogenySIDH/RadicalMontgomery.lean
import Mathlib
import Definitions.Def_Cryptography_AbstractAlgebra_IsogenyFoundations
import Definitions.Def_Cryptography_IsogenySIDH_RadicalMontgomery
/-
# Radical 2-isogeny verification on Montgomery curves
This file builds on the catalog's isogeny group-action foundations and verifies,
at the level of affine rational functions, the degree-two quotient map with
kernel generated by the rational two-torsion point `(0,0)`.
For the Montgomery equation `y² = x³ + A*x² + x`, put
* `X = x + x⁻¹`,
* `Y = y * (1 - x⁻²)`.
The image satisfies `Y² = X³ + A*X² - 4*X - 4*A`. The formulas are invariant
under `x ↦ x⁻¹`, the nontrivial deck transformation of this quotient. Avoiding
an affine point structure keeps the statements directly reusable with
Mathlib's several projective/Weierstrass point representations.
-/
open Cryptography.IsogenySIDH
variable {K : Type*} [Field K]Formal statement
theorem Cryptography.IsogenySIDH.radicalNormalize_correct{A B r x y : K}
(hrad : r ^ 2 = B)
(hP : B * y ^ 2 = x ^ 3 + A * x ^ 2 + x) :
OnMontgomery A (radicalNormalize r (x, y)) := by sorrySource