The hypotenuse never decreases along a word.
ProvedCryptography.BerggrenModular.hyp_le_applyWordaether-catalogcryptography
The hypotenuse never decreases along a word.
theorem Cryptography.BerggrenModular.hyp_le_applyWord(w : List Move) {v : Tri} (h : Valid v) :
v.2.2 ≤ (applyWord w v).2.2 := by sorry
Formalization Note Transplanted verbatim from the Aether Catalog source Cryptography/BerggrenModular/Core.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.
Preamble
-- Thm stub generated from Cryptography/BerggrenModular/Core.lean import Mathlib import Definitions.Def_Cryptography_BerggrenModular_Core /-! # Berggren moves over `ℤ`: the exact move classifier and free-monoid seed recovery This file is the integer-side foundation for the modular study carried out in `Cryptography.BerggrenModular.Modular` and `Cryptography.BerggrenModular.Hardness`. The three Berggren (Barning–Hall) moves `B₁, B₂, B₃` act on integer triples and preserve the Lorentz form `a² + b² − c²`; on the cone of positive Pythagorean triples they generate a ternary tree rooted at `(3,4,5)`. The central object here is an **exact, purely linear classifier** ``` whichMove (a,b,c) = if 5a < 3c then B₁ else if 5a < 4c then B₂ else B₃ ``` which reads off, from a single child state, *which* move produced it. The thresholds `3/5` and `4/5` are the images of the ratio tests `m < 2n`, `2n < m < 3n`, `m > 3n` in the Euclid parametrisation `a = m²−n²`, `b = 2mn`, `c = m²+n²`, transported through `m/n = √((c+a)/(c−a))`. ## Main results * `whichMove_applyMove` — soundness *and* completeness of the classifier over `ℤ`. * `applyMove_valid` — the positive Pythagorean cone is invariant. * `invMove_applyMove` — each move is inverted by an explicit integer matrix. * `recover_applyWord` — a **linear-time seed-recovery algorithm** over `ℤ`: the control word is recovered exactly from a single observed state. * `applyWord_injective` — the Berggren monoid acts freely on the cone (so the length-`k` search space really has `3^k` distinct states). -/ open Cryptography open BerggrenModular /-! ## Moves -/ /-! ## The positive Pythagorean cone -/ /-! ## The exact linear classifier -/ /-! ## Words, orbits and seed recovery -/
Formal statement
theorem Cryptography.BerggrenModular.hyp_le_applyWord(w : List Move) {v : Tri} (h : Valid v) :
v.2.2 ≤ (applyWord w v).2.2 := by sorrySource