OAI/Combinatorics/ContingencyTables/Sampling/ExactExpectedTime.lean
2 declarations, 0 contain sorry, 0 declared as axioms
Summability of the actual exact sampler's public runtime
- theorem
OAI.ContingencyTables.ExactExpectedTime.boundline 23Source documentation
Expected runtime is bounded by the explicit costs of the ordinary prefix and the probability-weighted correction branch.
theorem bound (hPL : ∀ q,PublishedInputs.FiniteBoxPrekopaLeindler q) (hCheeger : ∀ q k,PublishedInputs.FiniteCheeger (GridBoundary.Grid (I := Fin q) (4*k^8))) …Mentions: OAI.ContingencyTables.PublishedInputs.FiniteBoxPrekopaLeindler, OAI.ContingencyTables.PublishedInputs.FiniteCheeger, OAI.ContingencyTables.GridBoundary.Grid
- theorem
OAI.ContingencyTables.ExactExpectedTime.summableline 69Source documentation
The physical tail is summable for every equal-total margin pair.
theorem summable (hPL : ∀ q,PublishedInputs.FiniteBoxPrekopaLeindler q) (hCheeger : ∀ q k,PublishedInputs.FiniteCheeger (GridBoundary.Grid (I := Fin q) (4*k^8))) …Mentions: OAI.ContingencyTables.PublishedInputs.FiniteBoxPrekopaLeindler, OAI.ContingencyTables.PublishedInputs.FiniteCheeger, OAI.ContingencyTables.GridBoundary.Grid