OAI/GroupTheory/ArtinCAT0/Wires.lean
32 declarations, 0 contain sorry, 0 declared as axioms
- structure
OAI.ArtinCAT0.WireSystemline 7 - lemma
OAI.ArtinCAT0.WireSystem.mate_mateline 17 - lemma
OAI.ArtinCAT0.WireSystem.pass_passline 18 - abbrev
OAI.ArtinCAT0.WireSystem.Liveline 19 - structure
OAI.ArtinCAT0.WireSystem.Cutline 21 - abbrev
OAI.ArtinCAT0.WireSystem.Cut.qline 27 - def
OAI.ArtinCAT0.WireSystem.Cut.Removedline 29 - abbrev
OAI.ArtinCAT0.WireSystem.Cut.Keptline 30 - lemma
OAI.ArtinCAT0.WireSystem.Cut.removed_passline 32 - lemma
OAI.ArtinCAT0.WireSystem.Cut.pass_neline 47 - lemma
OAI.ArtinCAT0.WireSystem.Cut.internalline 52 - lemma
OAI.ArtinCAT0.WireSystem.Cut.mate_pass_outsideline 62 - def
OAI.ArtinCAT0.WireSystem.Cut.spliceline 71 - lemma
OAI.ArtinCAT0.WireSystem.Cut.splice_insideline 75 - lemma
OAI.ArtinCAT0.WireSystem.Cut.splice_outsideline 77 - lemma
OAI.ArtinCAT0.WireSystem.Cut.splice_keptline 80 - lemma
OAI.ArtinCAT0.WireSystem.Cut.splice_spliceline 87 - lemma
OAI.ArtinCAT0.WireSystem.Cut.splice_neline 96 - def
OAI.ArtinCAT0.WireSystem.Cut.reducedline 106 - lemma
OAI.ArtinCAT0.WireSystem.Cut.live_keptline 113 - def
OAI.ArtinCAT0.WireSystem.Cut.liveEquivline 117 - def
OAI.ArtinCAT0.WireSystem.Cut.extendline 123 - lemma
OAI.ArtinCAT0.WireSystem.Cut.extend_keptline 129 - lemma
OAI.ArtinCAT0.WireSystem.Cut.extend_pass_removedline 132 - lemma
OAI.ArtinCAT0.WireSystem.Cut.extend_mateline 149 - lemma
OAI.ArtinCAT0.WireSystem.Cut.extend_passline 162 - lemma
OAI.ArtinCAT0.WireSystem.Cut.reduced_colorline 172 - structure
OAI.ArtinCAT0.WireSystem.Resolutionline 186Source documentation
The bivalent parts of a finite graph can be suppressed. In addition to its boundary matching we retain extension of every antisymmetric edge weight.
structure Resolution where …
- def
OAI.ArtinCAT0.WireSystem.Resolution.expandline 198 - lemma
OAI.ArtinCAT0.WireSystem.Resolution.expand_colorline 217 - def
OAI.ArtinCAT0.WireSystem.Resolution.of_all_liveline 224 - theorem
OAI.ArtinCAT0.WireSystem.resolveline 239Source documentation
Suppression of all bivalent vertices of a finite matching graph, with reversal-compatible labels and a cocycle lifting property. A closed component without live ends receives zero in the lift.
theorem resolve {C : Type*} (r : C → C) (hr : Function.Involutive r) : ∀ (D : Type u) [Fintype D] (W : WireSystem D) (c : D → C), (∀ d, c (W.mate d) = r (c d)) → (∀ d, W.pass d ≠ d → c (W.pass d) = r (c d)) → ∃ R : W.Resolution, ∀ d, c (R.mate d).val = r (c d.val) := by …Mentions: OAI.ArtinCAT0.WireSystem