OAI/Combinatorics/ContingencyTables/Transport/IndexedTableLaw.lean
11 declarations, 0 contain sorry, 0 declared as axioms
Embedding accepted-table laws into the computed completion list
- abbrev
OAI.ContingencyTables.IndexedTableLaw.Indexline 13 - def
OAI.ContingencyTables.IndexedTableLaw.indexline 15 - def
OAI.ContingencyTables.IndexedTableLaw.tableAtline 18 - lemma
OAI.ContingencyTables.IndexedTableLaw.tableAt_eq_someline 21 - lemma
OAI.ContingencyTables.IndexedTableLaw.tableAt_indexline 32 - lemma
OAI.ContingencyTables.IndexedTableLaw.index_eq_iffline 36 - def
OAI.ContingencyTables.IndexedTableLaw.lawline 46 - lemma
OAI.ContingencyTables.IndexedTableLaw.count_noneline 50 - lemma
OAI.ContingencyTables.IndexedTableLaw.count_someline 56Source documentation
Invalid completions have zero count; every valid completion has exactly the count of its unique feasible table.
lemma count_some (htotal : ∑ i,R i=∑ j,P j) (hN : (∑ i,R i)≤N) (p : IntegerLaw (Option (Table R P)) Q) (k : Index m n N) : (law R P hN p).count (some k)= (tableAt R P htotal k).elim 0 (fun X => p.count (some X)) := by …Mentions: OAI.ContingencyTables.IntegerLaw, OAI.ContingencyTables.Table, OAI.ContingencyTables.IndexedTableLaw.Index, OAI.ContingencyTables.IndexedTableLaw.law, OAI.ContingencyTables.IndexedTableLaw.tableAt
- lemma
OAI.ContingencyTables.IndexedTableLaw.count_indexline 65 - theorem
OAI.ContingencyTables.IndexedTableLaw.retry_count_indexline 73Source documentation
Embedding tables into the explicit finite candidate list commutes with every bounded first-success retry.
theorem retry_count_index (htotal : ∑ i,R i=∑ j,P j) (hN : (∑ i,R i)≤N) (p : IntegerLaw (Option (Table R P)) Q) (fallback X : Table R P) (J : ℕ) : ((law R P hN p).retry (index R P hN fallback) J).count (index R P hN X)= (p.retry fallback J).count X := by …Mentions: OAI.ContingencyTables.IntegerLaw, OAI.ContingencyTables.Table, OAI.ContingencyTables.IndexedTableLaw.law, OAI.ContingencyTables.IndexedTableLaw.index