BergDepth addr
ProvedPythHydra.bergDepth_addraether-cataloggeometry
Formal statement of PythHydra.bergDepth_addr from the Aether Catalog (Geometry). The mathematical content is given by the Lean statement below; a human-readable write-up is pending.
theorem PythHydra.bergDepth_addr(w : List BStep) : bergDepth (addr w) = w.length := by sorry
Formalization Note Transplanted verbatim from the Aether Catalog source Geometry/PythagoreanHydra/HydraDepth.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.
Preamble
-- Thm stub generated from Geometry/PythagoreanHydra/HydraDepth.lean import Mathlib import Definitions.Def_Geometry_PythagoreanHydra_BerggrenAddress import Definitions.Def_Geometry_PythagoreanHydra_HydraDepth import Definitions.Def_Geometry_PythagoreanHydra_PythagoreanHydra /-! # Depth in the Berggren tree, and the sharp form of the Pythagorean Hydra bound `PythagoreanHydra.lean` measures a head by its hypotenuse. The *intrinsic* measure is the depth of the head in the Berggren tree, i.e. the length of its unique address (`BerggrenAddress.lean`). Here we * define `bergDepth` and prove `bergDepth (addr w) = w.length`; * prove that the inverse Berggren move drops the depth by exactly one (`bergDepth_parent`), hence Berggren ancestors have strictly smaller depth; * re-run the hydra bound with `bergDepth` as the level, obtaining the sharp statement `battle_depth_bound : N ≤ Phi k (H.map bergDepth)`; * deduce that a battle starting at a node of depth `d` with branching bound `k` lasts at most `(k+1)^(d+1)` moves, and that a battle starting at the root `(3,4,5)` lasts at most **one** move. This is the exact calibration of the Pythagorean Hydra: its length function is `(k+1)^(depth+1)`, an elementary function of the address length — nothing like the `ε₀`-recursive length function of the Kirby–Paris hydra. -/ open PythHydra
Formal statement
theorem PythHydra.bergDepth_addr(w : List BStep) : bergDepth (addr w) = w.length := by sorry
Source