OAI/Combinatorics/TwoWayAutomata/Classes.lean
31 declarations, 0 contain sorry, 0 declared as axioms
- theorem
OAI.TwoWayComplementation.Diagram.corner_compline 11 - theorem
OAI.TwoWayComplementation.Diagram.corner_pow_succline 17 - theorem
OAI.TwoWayComplementation.Diagram.nesting_reflline 23 - theorem
OAI.TwoWayComplementation.Diagram.nesting_transline 26 - theorem
OAI.TwoWayComplementation.Diagram.comp_monoline 39 - theorem
OAI.TwoWayComplementation.Diagram.through_loop_throughline 46 - theorem
OAI.TwoWayComplementation.Diagram.recurrence_idempotentline 54Source documentation
Idempotence of the recurrence relation.
theorem recurrence_idempotent {m : ℕ} (e : Diagram m) (he : comp e e = e) (positive : Bool) : e.recurrence positive ○ e.recurrence positive = e.recurrence positive := by …Mentions: OAI.TwoWayComplementation.Diagram, OAI.TwoWayComplementation.Diagram.comp
- theorem
OAI.TwoWayComplementation.Diagram.corner_returnsline 69 - theorem
OAI.TwoWayComplementation.Diagram.corner_forward_absorptionline 78Source documentation
Positive through-edge absorption in a corner.
theorem corner_forward_absorption {m : ℕ} (e z : Diagram m) (hz : z ∈ e.corner) : e.forward ○ e.loopClosure true ○ z.forward ⊆ z.forward ∧ z.forward ○ e.loopClosure true ○ e.forward ⊆ z.forward := by …Mentions: OAI.TwoWayComplementation.Diagram
- theorem
OAI.TwoWayComplementation.Diagram.corner_through_absorptionline 94 - theorem
OAI.TwoWayComplementation.Diagram.loopClosure_comp_selfline 116 - theorem
OAI.TwoWayComplementation.Diagram.loopClosure_compline 120 - theorem
OAI.TwoWayComplementation.Diagram.surviving_absorptionline 125 - theorem
OAI.TwoWayComplementation.Diagram.recurrence_transline 144 - theorem
OAI.TwoWayComplementation.Diagram.class_nonemptyline 151 - theorem
OAI.TwoWayComplementation.Diagram.class_relatedline 156 - theorem
OAI.TwoWayComplementation.Diagram.class_eq_of_memline 164 - theorem
OAI.TwoWayComplementation.Diagram.class_eq_of_commonline 175 - theorem
OAI.TwoWayComplementation.Diagram.surviving_loop_iffline 181 - theorem
OAI.TwoWayComplementation.Diagram.not_mem_missing_iffline 190 - theorem
OAI.TwoWayComplementation.Diagram.missing_selfline 201 - theorem
OAI.TwoWayComplementation.Diagram.surviving_compline 206 - theorem
OAI.TwoWayComplementation.Diagram.missing_compline 234Source documentation
A class can disappear from a product only if it disappears from a factor.
theorem missing_comp {m : ℕ} (e z w : Diagram m) (he : comp e e = e) (hz : z ∈ e.corner) (hw : w ∈ e.corner) : e.missing (comp z w) ⊆ e.missing z ∪ e.missing w := by …Mentions: OAI.TwoWayComplementation.Diagram, OAI.TwoWayComplementation.Diagram.comp
- theorem
OAI.TwoWayComplementation.Diagram.missing_pow_succline 251 - theorem
OAI.TwoWayComplementation.Diagram.class_countline 261Source documentation
There are at most two signed recurrent classes per boundary label.
theorem class_count {m : ℕ} (e : Diagram m) : e.classes.ncard ≤ 2 * m := by …Mentions: OAI.TwoWayComplementation.Diagram
- theorem
OAI.TwoWayComplementation.Diagram.through_comp_recurrenceline 272 - theorem
OAI.TwoWayComplementation.Diagram.recurrence_comp_throughline 278 - theorem
OAI.TwoWayComplementation.Diagram.rectangle_subsetline 284 - theorem
OAI.TwoWayComplementation.Diagram.rectangle_eq_of_relatedline 290 - theorem
OAI.TwoWayComplementation.Diagram.rectangle_coverline 315Source documentation
The recurrent rectangles cover every through edge, including for an empty boundary.
theorem rectangle_cover {m : ℕ} (e : Diagram m) (he : comp e e = e) {positive : Bool} {u v : Fin m} (huv : (u, v) ∈ e.through positive) : ∃ p, (p, p) ∈ e.recurrence positive ∧ (u, v) ∈ e.rectangle positive p := by …Mentions: OAI.TwoWayComplementation.Diagram, OAI.TwoWayComplementation.Diagram.comp
- theorem
OAI.TwoWayComplementation.Diagram.rectangle_survivesline 330