DenseExponentBound.lean`

2 declarations, 0 contain sorry, 0 declared as axioms

Bounded bit allowance for every dense Metropolis decision

theorem OAI.ContingencyTables.GridBoundary.denseExponent_upper line 14

theorem OAI.ContingencyTables.GridBoundary.denseMetropolis_finite_coin line 46

Source documentation

The paper's fixed allowance implements every possible acceptance probability exactly, including a proposed move whose probability is one.

theorem denseMetropolis_finite_coin (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) (a b : Grid (I := Fin q) (4 * d ^ 8)) :
…

Mentions: OAI.ContingencyTables.GridBoundary.Grid