RootedPhaseTrajectory.lean`

2 declarations, 0 contain sorry, 0 declared as axioms

The selected-root Boolean history has the exact source path comparison

lemma OAI.ContingencyTables.RootedPhaseTrajectory.event_le_distance line 20

theorem OAI.ContingencyTables.RootedPhaseTrajectory.recorded_event_bound line 33

Source documentation

Every event of the actual observed Boolean trajectory is bounded by the source list-path event plus one proved row error per transition.

theorem recorded_event_bound (A : Instance I J) (R : RootedCompletion.Selection A.T) (C : ℕ) (hC : 0<C) (K j k : ℕ)
    (hK : 1≤K) (hW : 100*A.d*K≤A.W) (hB : (K:ℝ)=binWidth A C)
    (hj : j≤rationalHeight A C) (xi : ℚ) (hx0 : 0<xi) (hx1 : xi≤1/4)
    (hPL : PublishedInputs.FiniteBoxPrekopaLeindler (dimension A))
    (hCheeger : PublishedInputs.FiniteCheeger (Grid (I := Fin (dimension A)) K))
…

Mentions: OAI.ContingencyTables.RootedCompletion.Selection, OAI.ContingencyTables.PublishedInputs.FiniteBoxPrekopaLeindler, OAI.ContingencyTables.PublishedInputs.FiniteCheeger