Finite iteration of context-preserving local choices
Lax369799.FiniteLocalReplacement · concepts/Lax369799/FiniteLocalReplacement.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Any rule that replaces a label in its current accepting context can be iterated over all vertices of a finite presentation. The local relation records both the original and the chosen label.
Concept map
Lean source view on GitHub
| 1 | import Lax369799.FiniteVertexReplacement |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Finite iteration of context-preserving local choices |
| 6 | type: theorem |
| 7 | --- |
| 8 | Any rule that replaces a label in its current accepting context can be |
| 9 | iterated over all vertices of a finite presentation. The local relation |
| 10 | records both the original and the chosen label. |
| 11 | -/ |
| 12 | namespace Lax369799.FiniteLocalReplacement |
| 13 | open RankedSystems (RankedSet) |
| 14 | open FinitePresentations FiniteContexts FiniteSyntacticAlgebra |
| 15 | |
| 16 | axiom simultaneous {A B : RankedSet} (E : Algebra A) (F : Set (A 0)) |
| 17 | (G : ∀ n, A n → A n → Prop) |
| 18 | (hG : ∀ k (C : Context A k 0) (a : A k), E.eval 0 (plug C (atomic a)) ∈ F → |
| 19 | ∃ b, G k a b ∧ E.eval 0 (plug C (atomic b)) ∈ F) |
| 20 | (P : FiniteSystem B 0) (q : ∀ v : P.Vertex, A (P.graph.label v).1) |
| 21 | (hq : E.eval 0 (withLabels P q) ∈ F) : |
| 22 | ∃ r : ∀ v : P.Vertex, A (P.graph.label v).1, |
| 23 | (∀ v, G _ (q v) (r v)) ∧ E.eval 0 (withLabels P r) ∈ F |
| 24 | |
| 25 | end Lax369799.FiniteLocalReplacement |
| 26 |
Builds on
From Mathlib
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments