OAI/Combinatorics/ContingencyTables/Sampling/ProfileInverseRepairProgram.lean
12 declarations, 0 contain sorry, 0 declared as axioms
A polynomial binary program for each labelled inverse repair
- abbrev
OAI.ContingencyTables.ProfilePrograms.InverseRepairInputline 13Source documentation
The three indices are the negative cell, positive cell and crossing cell. A crossing cell outside the small list has its length as index.
abbrev InverseRepairInput := List ℕ×(List ℕ×(ℕ×(ℕ×ℕ)))
- def
OAI.ContingencyTables.ProfilePrograms.backwardRowsline 15 - def
OAI.ContingencyTables.ProfilePrograms.backwardRowsRealizerline 18 - lemma
OAI.ContingencyTables.ProfilePrograms.polynomial_backwardRowsline 21 - def
OAI.ContingencyTables.ProfilePrograms.backwardColumnsline 26 - def
OAI.ContingencyTables.ProfilePrograms.backwardColumnsRealizerline 29 - lemma
OAI.ContingencyTables.ProfilePrograms.polynomial_backwardColumnsline 34 - def
OAI.ContingencyTables.ProfilePrograms.backwardViewsline 41 - def
OAI.ContingencyTables.ProfilePrograms.backwardViewsRealizerline 44 - theorem
OAI.ContingencyTables.ProfilePrograms.polynomial_backwardViewsline 48 - lemma
OAI.ContingencyTables.SmallGraphProfiles.transfer_at_indexline 65 - theorem
OAI.ContingencyTables.SmallGraphProfiles.backwardViews_eqline 74Source documentation
Exactness holds for all input profiles; neither boundedness nor a preexisting proof of a defect is needed to execute the inverse formula.
theorem backwardViews_eq (B : I → J → ℕ) (v : SmallProfile small) (s t : I×J) : backwardViews (viewList small e v false, (List.ofFn (fun i => B (e i).val.1 (e i).val.2), (cellIndex small e s,(cellIndex small e t,cellIndex small e (t.1,s.2)))))= (viewList small e (inverseRepairProfile small B v s t) false, viewList small e (inverseRepairProfile small B v s t) true) := by …Mentions: OAI.ContingencyTables.SmallGraphProfiles.viewList, OAI.ContingencyTables.SmallGraphProfiles.cellIndex, OAI.ContingencyTables.SmallGraphProfiles.inverseRepairProfile