trunk goodness from specs from order

Open

Freiman.trunk_goodness_from_specs_from_order

by tp · Sep 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebracontinued-fractionsformalization

Select the actual strict normalization branch for each child. Its two strict crossed inequalities together with both separate strict own-interval endpoint inequalities give all four comparisons needed for max(lower)<min(upper).

Preamble

import Definitions.Def_Freiman_trunkGeometry
import Mathlib.Tactic.FinCases
import Mathlib.Tactic.Linarith

open Freiman

Formal statement

theorem Freiman.trunk_goodness_from_specs_from_order (ho : ∀ w : LowerPair, lowerEndpoint w false < lowerEndpoint w true)
    (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, lowerStrictGood (lowerChild p l) := by
  sorry

Source

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.

View graph