Documentation

LeanPool.Feige.ChainFromBoolean

Calibrated statistic sequences along maximal Boolean chains #

This file evaluates twoPointKFinset on the states of a maximal chain and extends the resulting finite sequence by zero. The extension is a CalibratedChain, so the exact telescoping calibration lemma applies immediately.

noncomputable def Feige.booleanChainK {m : } (γ β : Fin m) (σ : Equiv.Perm (Fin m)) (j : ) :

The two-point statistic along the maximal chain encoded by σ, extended by zero from the sentinel index m + 1 onwards.

Equations
Instances For
    @[simp]
    theorem Feige.booleanChainK_of_lt {m : } (γ β : Fin m) (σ : Equiv.Perm (Fin m)) {j : } (hj : j < m + 1) :
    booleanChainK γ β σ j = twoPointKFinset γ β (chainState σ j, hj)
    @[simp]
    theorem Feige.booleanChainK_of_not_lt {m : } (γ β : Fin m) (σ : Equiv.Perm (Fin m)) {j : } (hj : ¬j < m + 1) :
    booleanChainK γ β σ j = 0
    theorem Feige.booleanChainK_sentinel {m : } (γ β : Fin m) (σ : Equiv.Perm (Fin m)) :
    booleanChainK γ β σ (m + 1) = 0
    theorem Feige.twoPointKFinset_nonneg {ι : Type u_1} [Fintype ι] (γ β : ι) (S : Finset ι) :
    theorem Feige.booleanChainK_antitone {m : } (γ β : Fin m) (σ : Equiv.Perm (Fin m)) ( : ∀ (i : Fin m), 0 γ i) ( : ∀ (i : Fin m), 0 β i) :
    theorem Feige.booleanChainK_initial {m : } (γ β : Fin m) (σ : Equiv.Perm (Fin m)) ( : ∀ (i : Fin m), 0 γ i) :
    booleanChainK γ β σ 0 = 1
    noncomputable def Feige.booleanCalibratedChain {m : } (γ β : Fin m) (σ : Equiv.Perm (Fin m)) ( : ∀ (i : Fin m), 0 γ i) ( : ∀ (i : Fin m), 0 β i) :

    The calibrated sequence carried by a maximal Boolean-lattice chain.

    Equations
    Instances For
      theorem Feige.booleanChain_exact_calibration {m : } (γ β : Fin m) (σ : Equiv.Perm (Fin m)) ( : ∀ (i : Fin m), 0 γ i) ( : ∀ (i : Fin m), 0 β i) {α : } ( : 0 α) :
      (booleanCalibratedChain γ β σ ).rejectedMass α α

      Exact calibration for the statistic values along any maximal Boolean-lattice chain.