trunk tree induction
ProvedFreiman.trunk_tree_inductionalgebracontinued-fractionsformalization
Structural induction on pair/split/diagonal trees transports the exact witness rectangles and premise membership; the diagonal node splits by r≤s or s≤r.
Preamble
import Definitions.Def_Freiman_trunkGeometry import Mathlib.Tactic.FinCases import Mathlib.Tactic.Linarith open Freiman
Formal statement
theorem Freiman.trunk_tree_induction (C : TrunkCatalog) (hw : trunkAllWitnesses C)
(he : ∀ w : TrunkWitness, trunkWitnessValid C w → TrunkWitnessExclusion C w)
(hs : ∀ (R : CertRectangle) (axis : Bool), certRectangleValid R → ∀ r s : ℝ, certRectangleMem R r s →
(certRectangleValid (trunkRectangleHalf R axis false) ∧ certRectangleValid (trunkRectangleHalf R axis true)) ∧
(certRectangleMem (trunkRectangleHalf R axis false) r s ∨ certRectangleMem (trunkRectangleHalf R axis true) r s)) :
TrunkTreeSound C := by
sorrySource
Report Proposition4.1 s15:trunk, printed report p28; original source pp120–126. Complete sixteen-state trunk certificate,58230 records,90 case plans, with three explicitly unfilled interfaces.