OAI/Combinatorics/Automata/Diagram.lean
33 declarations, 0 contain sorry, 0 declared as axioms
- lemma
OAI.OneWayLiveness.FiniteWiring.color_eq_of_reachable_fromline 11Source documentation
Only edge constraints in the starting component are needed.
lemma color_eq_of_reachable_from (color : V → C) (s : V) (hc : ∀ x y, G.Reachable s x → G.Adj x y → color x = color y) {y : V} (h : G.Reachable s y) : color s = color y := by … - def
OAI.OneWayLiveness.Pairing.markedline 28Source documentation
Index the outer identity paths touched by a specified set of interface edges. The definition is made once, independently of a replacement diagram.
noncomputable def marked (v : Pairing (A ⊕ B)) (u : Pairing (B ⊕ A)) (J : Finset B) : Finset A := …
Mentions: OAI.OneWayLiveness.Pairing
- lemma
OAI.OneWayLiveness.Pairing.mem_markedline 32 - lemma
OAI.OneWayLiveness.Pairing.left_reachable_eqline 36 - lemma
OAI.OneWayLiveness.Pairing.marked_card_leline 45 - lemma
OAI.OneWayLiveness.Pairing.support_sandwich_subset_markedline 64Source documentation
Unmarked original identity paths retain their equality constraints through every supported perturbation of the middle diagram.
lemma support_sandwich_subset_marked (v : Pairing (A ⊕ B)) (u : Pairing (B ⊕ A)) (huv : compose v u = identity A) (J : Finset B) (a : Pairing (B ⊕ B)) (ha : support a ⊆ J) : support (compose (compose v a) u) ⊆ marked v u J := by …Mentions: OAI.OneWayLiveness.Pairing, OAI.OneWayLiveness.Pairing.compose, OAI.OneWayLiveness.Pairing.identity, OAI.OneWayLiveness.Pairing.support, OAI.OneWayLiveness.Pairing.marked
- lemma
OAI.OneWayLiveness.Pairing.common_supportline 120Source documentation
The simultaneous support estimate: a single small set works for every middle diagram supported in the original set, including products and powers.
lemma common_support (v : Pairing (A ⊕ B)) (u : Pairing (B ⊕ A)) (huv : compose v u = identity A) (J : Finset B) : ∃ K : Finset A, K.card ≤ J.card ∧ ∀ a : Pairing (B ⊕ B), support a ⊆ J → support (compose (compose v a) u) ⊆ K := …Mentions: OAI.OneWayLiveness.Pairing, OAI.OneWayLiveness.Pairing.compose, OAI.OneWayLiveness.Pairing.identity, OAI.OneWayLiveness.Pairing.support
- instance
OAI.OneWayLiveness.Pairing.(instance at line 131)line 131 - lemma
OAI.OneWayLiveness.Pairing.mul_eq_composeline 138 - lemma
OAI.OneWayLiveness.Pairing.one_eq_identityline 139 - lemma
OAI.OneWayLiveness.Pairing.rank_oneline 141 - lemma
OAI.OneWayLiveness.Pairing.support_oneline 149 - lemma
OAI.OneWayLiveness.Pairing.rank_mul_le_leftline 153 - lemma
OAI.OneWayLiveness.Pairing.rank_mul_le_rightline 155 - lemma
OAI.OneWayLiveness.Pairing.full_rank_isUnitline 158 - lemma
OAI.OneWayLiveness.Pairing.rank_eq_card_of_isUnitline 172 - lemma
OAI.OneWayLiveness.Pairing.rank_mul_unitline 179 - lemma
OAI.OneWayLiveness.Pairing.rank_unit_mulline 184 - lemma
OAI.OneWayLiveness.Pairing.support_mul_subsetline 190 - lemma
OAI.OneWayLiveness.Pairing.support_pow_subsetline 193 - def
OAI.OneWayLiveness.Pairing.reduceline 202Source documentation
Delete the prescribed caps of an idempotent. Its retained left endpoints are used as the smaller index set, avoiding an arbitrary numbering.
noncomputable def reduce (e z : Pairing (A ⊕ A)) : Pairing ({i // i ∈ lefts e} ⊕ {i // i ∈ lefts e}) := …Mentions: OAI.OneWayLiveness.Pairing, OAI.OneWayLiveness.Pairing.lefts
- def
OAI.OneWayLiveness.Pairing.expandline 206 - lemma
OAI.OneWayLiveness.Pairing.expand_reduceline 210 - lemma
OAI.OneWayLiveness.Pairing.reduce_expandline 213 - lemma
OAI.OneWayLiveness.Pairing.splitRight_absorbline 220 - lemma
OAI.OneWayLiveness.Pairing.splitLeft_absorbline 227 - lemma
OAI.OneWayLiveness.Pairing.reduce_selfline 234 - lemma
OAI.OneWayLiveness.Pairing.reduce_mulline 239 - lemma
OAI.OneWayLiveness.Pairing.reduce_sandwichline 245 - lemma
OAI.OneWayLiveness.Pairing.rank_reduceline 252 - lemma
OAI.OneWayLiveness.Pairing.reduce_injectiveline 262 - lemma
OAI.OneWayLiveness.Pairing.reduce_common_supportline 268 - lemma
OAI.OneWayLiveness.Pairing.card_reducedline 277