Unions of initial and root marks
Lax369799.FiniteMarkUnion · concepts/Lax369799/FiniteMarkUnion.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
For three presentations with the same labels and edges, union of their initial and root marks evaluates to the meet of the two separate values. The covering map folds the two copies of each vertex together.
Concept map
Lean source view on GitHub
| 1 | import Lax369799.ExpandedSyntacticAlgebra |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Unions of initial and root marks |
| 6 | type: theorem |
| 7 | --- |
| 8 | For three presentations with the same labels and edges, union of their |
| 9 | initial and root marks evaluates to the meet of the two separate values. |
| 10 | The covering map folds the two copies of each vertex together. |
| 11 | -/ |
| 12 | namespace Lax369799.FiniteMarkUnion |
| 13 | open RankedSystems (RankedSet Presentation) |
| 14 | open FinitePresentations FiniteSyntacticAlgebra FiniteContextualOrder FiniteAcceptance |
| 15 | |
| 16 | axiom evaluation_union {A : RankedSet} (L : Algebras.Language A) |
| 17 | (E : ExpandedSyntacticAlgebra.SyntacticAlgebra L) {n : ℕ} {V : Type} [Fintype V] |
| 18 | (G H K : Presentation (Carrier (Accepting L)) n V) |
| 19 | (hl : ∀ v, G.label v = K.label v ∧ H.label v = K.label v) |
| 20 | (hi : ∀ v, K.initial v ↔ G.initial v ∨ H.initial v) |
| 21 | (hr : ∀ v, K.root v ↔ G.root v ∨ H.root v) |
| 22 | (he : ∀ v d t, (G.edge v d t ↔ K.edge v d t) ∧ (H.edge v d t ↔ K.edge v d t)) : |
| 23 | E.algebra.eval n (enumerate K) = sumValue E.algebra |
| 24 | (E.algebra.eval n (enumerate G)) (E.algebra.eval n (enumerate H)) |
| 25 | |
| 26 | end Lax369799.FiniteMarkUnion |
| 27 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments