OAI/Combinatorics/ContingencyTables/Dense/DenseBoundedRejection.lean

GitHub source file

6 declarations, 0 contain sorry, 0 declared as axioms

1. def OAI.ContingencyTables.GridBoundary.trialSuccess line 19
2. theorem OAI.ContingencyTables.GridBoundary.trialSuccess_some_iff line 25
3. theorem OAI.ContingencyTables.GridBoundary.trialSuccess_ideal_mass line 40
4. theorem OAI.ContingencyTables.GridBoundary.trialSuccess_ideal_failure line 50
5. def OAI.ContingencyTables.GridBoundary.denseBoundedLaw line 59
6. theorem OAI.ContingencyTables.GridBoundary.denseBoundedLaw_variation line 70

   Source documentation

   The finite sampler always returns an actual table and is within the requested error of uniform, assuming finite-box interpolation and finite Cheeger inequalities.

   theorem denseBoundedLaw_variation (R : Option I → ℕ) (P : Option J → ℕ)
       (d : ℕ) (hd : 14 ≤ d) (hR : ∀ i, d ^ 12 ≤ R i) (hP : ∀ j, d ^ 12 ≤ P j)
       (hRmax : ∀ i, R (some i) ≤ R none) (hPmax : ∀ j, P (some j) ≤ P none)
       (hdimR : Fintype.card (Option I) ≤ d) (hdimP : Fintype.card (Option J) ≤ d)
       (hfree : Fintype.card (I × J) ≤ d) (htotal : ∑ i, R i = ∑ j, P j)
       (e : I × J ≃ Fin q) (hPL : PublishedInputs.FiniteBoxPrekopaLeindler q)
       (hCheeger : PublishedInputs.FiniteCheeger (Grid (I := Fin q) (4 * d ^ 8)))
   …

   Mentions: OAI.ContingencyTables.PublishedInputs.FiniteBoxPrekopaLeindler, OAI.ContingencyTables.PublishedInputs.FiniteCheeger, OAI.ContingencyTables.GridBoundary.Grid