Documentation

LeanPool.LanguageGeneration.FiniteWitness.Width.Padding

Padding witnesses collapses the bad-sample dimension #

def GenLimit.FiniteWitness.BadSample {α : Type u_1} (H : Set (Set α)) (T : Set α → Finset α) (S : Finset α) :

A sample with a nonempty active subfamily whose common core is finite.

Equations
Instances For
    noncomputable def GenLimit.FiniteWitness.badCost {α : Type u_1} (H : Set (Set α)) (T : Set α → Finset α) :

    The supremum of one plus the size of every bad sample for an assignment.

    Equations
    Instances For
      noncomputable def GenLimit.FiniteWitness.paddedDimension {α : Type u_1} (H : Set (Set α)) :

      The infimum of bad-sample costs over positive witness assignments.

      Equations
      Instances For
        theorem GenLimit.FiniteWitness.badCost_le_iff {α : Type u_1} (H : Set (Set α)) (T : Set α → Finset α) (d : ℕ) :
        badCost H T ≤ ↑d ↔ ∀ (S : Finset α), BadSample H T S → S.card + 1 ≤ d
        theorem GenLimit.FiniteWitness.badCost_zero_iff {α : Type u_1} {H : Set (Set α)} {T : Set α → Finset α} (hp : Positive H T) :
        badCost H T = 0 ↔ Valid H T
        theorem GenLimit.FiniteWitness.padding_removes_finite_defects {α : Type u_1} {H : Set (Set α)} (hUUS : Generic.UUS H) {T : Set α → Finset α} (hp : Positive H T) (d : ℕ) (hb : ∀ (S : Finset α), BadSample H T S → S.card + 1 ≤ d) :
        ∃ (T' : Set α → Finset α), Valid H T' ∧ ∀ L ∈ H, T L ⊆ T' L

        A finite bound on bad sample sizes can be removed by retaining and padding witnesses.

        theorem GenLimit.FiniteWitness.finite_badCost_implies_finiteWitnesses {α : Type u_1} {H : Set (Set α)} (hUUS : Generic.UUS H) {T : Set α → Finset α} (hp : Positive H T) {d : ℕ} (hb : badCost H T ≤ ↑d) :