trunk anchors from specs
OpenFreiman.trunk_anchors_from_specsalgebracontinued-fractionsformalization
The first and last source specifications are exactly the two actual signed parent anchors, without assuming normalization is invariant under a tie swap.
Preamble
import Definitions.Def_Freiman_trunkGeometry import Mathlib.Tactic.FinCases import Mathlib.Tactic.Linarith open Freiman
Formal statement
theorem Freiman.trunk_anchors_from_specs (p : LowerPair) (k : Fin 16) (pi par : ℕ) (hm : TrunkMode p k pi par)
(hs : ∀ sp ∈ trunkSpecs (trunkPlanAt (trunkCatalog.states k) pi), trunkSpecHolds p sp) :
(∀ l, (trunkPlanAt (trunkCatalog.states k) pi).labels.head? = some l → trunkParentEndpoint p true ≤ trunkLocalUpper p l) ∧
(∀ l, (trunkPlanAt (trunkCatalog.states k) pi).labels.getLast? = some l → lowerLocalLower p l ≤ trunkParentEndpoint p false) := 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.