DenseFiniteTransition.lean`

2 declarations, 0 contain sorry, 0 declared as axioms

The bounded finite fair-bit experiment implements the dense transition

def OAI.ContingencyTables.GridBoundary.finiteDenseStepLaw line 20

theorem OAI.ContingencyTables.GridBoundary.finiteDenseStepLaw_eq line 30

Source documentation

A proposal integer followed by the fixed acceptance allowance realizes the entire dense transition law, including unused codes and rejected moves.

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

Mentions: OAI.ContingencyTables.GridBoundary.Grid