OAI/Combinatorics/ContingencyTables/Rooted/ComputedLargeForest.lean
12 declarations, 0 contain sorry, 0 declared as axioms
The executed maximum-capacity forest on the original cell vertices
The program uses the concrete row-then-column natural indexing. The returned adjacency list is decoded and transported back to the original bipartite vertex type. Its catalog and optimality obligations follow from the stored capacities, rather than supplied correctness predicates.
- abbrev
OAI.ContingencyTables.ComputedLargeForest.vertexEquivline 22 - def
OAI.ContingencyTables.ComputedLargeForest.smallline 24 - def
OAI.ContingencyTables.ComputedLargeForest.graphline 27 - def
OAI.ContingencyTables.ComputedLargeForest.capacitiesline 30 - lemma
OAI.ContingencyTables.ComputedLargeForest.graph_edgeline 33 - lemma
OAI.ContingencyTables.ComputedLargeForest.capacities_cellline 41 - lemma
OAI.ContingencyTables.ComputedLargeForest.catalog_correctline 45 - lemma
OAI.ContingencyTables.ComputedLargeForest.capacity_positiveline 88 - lemma
OAI.ContingencyTables.ComputedLargeForest.empty_codeline 118 - def
OAI.ContingencyTables.ComputedLargeForest.computedline 128Source documentation
The output list itself determines the forest.
noncomputable def computed (r : Fin m→ℕ) (c : Fin n→ℕ) (b : Fin m→Fin n→ℕ) (W : ℕ) : SimpleGraph (Fin m⊕Fin n) := … - lemma
OAI.ContingencyTables.ComputedLargeForest.weight_transportline 132 - theorem
OAI.ContingencyTables.ComputedLargeForest.computed_specline 145Source documentation
The executed list program gives a maximum-capacity forest on the actual row and column vertices.
theorem computed_spec (r : Fin m→ℕ) (c : Fin n→ℕ) (b : Fin m→Fin n→ℕ) (W : ℕ) (hW : 1≤W) : computed r c b W≤cellGraph (small b W) ∧ (computed r c b W).IsAcyclic ∧ ∀ F : SimpleGraph (Fin m⊕Fin n),F≤cellGraph (small b W) → F.IsAcyclic → weight F (capacity b)≤weight (computed r c b W) (capacity b) := by …Mentions: OAI.ContingencyTables.ComputedLargeForest.computed, OAI.ContingencyTables.ComputedLargeForest.small