OAI/Combinatorics/ContingencyTables/Rooted/RootedCompletion.lean
20 declarations, 0 contain sorry, 0 declared as axioms
Forest completion with an explicit component-root selector
Only reachability and constancy on each component are needed for the integral completion. Making these data explicit permits the executed least-root selector to replace the original quotient representative, without asserting that two different selectors are equal.
- structure
OAI.ContingencyTables.RootedCompletion.Selectionline 21 - lemma
OAI.ContingencyTables.RootedCompletion.Selection.idempotentline 26 - def
OAI.ContingencyTables.RootedCompletion.originalline 29 - def
OAI.ContingencyTables.RootedCompletion.canonicalline 34 - def
OAI.ContingencyTables.RootedCompletion.Selection.mapline 39 - def
OAI.ContingencyTables.RootedCompletion.rowColumnline 49Source documentation
The concrete row-then-column vertex order of the contingency graph.
def rowColumn {m n : ℕ} (T : SimpleGraph (Fin m⊕Fin n)) [DecidableRel T.Adj] : Selection T := … - lemma
OAI.ContingencyTables.RootedCompletion.rowColumn_rootline 53 - def
OAI.ContingencyTables.RootedCompletion.pathline 58 - def
OAI.ContingencyTables.RootedCompletion.flowline 63 - lemma
OAI.ContingencyTables.RootedCompletion.flow_skewline 66 - lemma
OAI.ContingencyTables.RootedCompletion.flow_supportedline 74 - theorem
OAI.ContingencyTables.RootedCompletion.flow_divergence_allline 81 - theorem
OAI.ContingencyTables.RootedCompletion.flow_divergenceline 88 - def
OAI.ContingencyTables.RootedCompletion.tableline 101 - lemma
OAI.ContingencyTables.RootedCompletion.table_supportedline 106 - lemma
OAI.ContingencyTables.RootedCompletion.table_rowline 111 - lemma
OAI.ContingencyTables.RootedCompletion.table_columnline 125 - theorem
OAI.ContingencyTables.RootedCompletion.zero_of_nonroot_sumsline 145 - theorem
OAI.ContingencyTables.RootedCompletion.table_uniqueline 201 - theorem
OAI.ContingencyTables.RootedCompletion.table_originalline 226