Flatten-resolutions with supported systems and explicit output maps
Lax369799.SupportedResolutions · concepts/Lax369799/SupportedResolutions.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
The four conditions of Lemma 46 specify an outer vertex map, local variable maps and yields, preservation of initial vertices and transitions, and preservation of output edges through the prescribed global map. Both levels of the resolving system are fully supported.
Concept map
Evidence
Lean source view on GitHub
| 1 | import Lax369799.SupportedYields |
| 2 | import Lax369799.SupportedSystems |
| 3 | import Lax369799.SupportedCompletion |
| 4 | import Lax369799.Resolutions |
| 5 | |
| 6 | /-! |
| 7 | --- |
| 8 | title: Flatten-resolutions with supported systems and explicit output maps |
| 9 | type: theorem |
| 10 | --- |
| 11 | The four conditions of Lemma 46 specify an outer vertex map, local |
| 12 | variable maps and yields, preservation of initial vertices and transitions, |
| 13 | and preservation of output edges through the prescribed global map. |
| 14 | Both levels of the resolving system are fully supported. |
| 15 | -/ |
| 16 | |
| 17 | namespace Lax369799.SupportedResolutions |
| 18 | open RankedSystems (RankedSet) |
| 19 | open FinitePresentations SupportedMorphisms |
| 20 | |
| 21 | structure Resolution {A : RankedSet} {m n : ℕ} (S : FiniteSystem (FiniteSystem A) n) |
| 22 | (T : SupportedSystems.System (SupportedSystems.System A) m) (τ : Fin m → Fin n) where |
| 23 | vertex : T.val.val.Vertex → S.Vertex |
| 24 | variableMap : ∀ v, Fin (T.val.val.graph.label v).1 → Fin (S.graph.label (vertex v)).1 |
| 25 | initial : ∀ v,T.val.val.graph.initial v → S.graph.initial (vertex v) |
| 26 | resolves : ∀ v, SupportedYields.InitialYield (Inner S.graph (vertex v)) |
| 27 | (T.val.val.graph.label v).2 (variableMap v) |
| 28 | transition : ∀ v (i : Fin (T.val.val.graph.label v).1) w, |
| 29 | T.val.val.graph.edge v i.val (.inl w) → S.graph.edge (vertex v) (variableMap v i).val (.inl (vertex w)) |
| 30 | exit : ∀ v (i : Fin (T.val.val.graph.label v).1) j, |
| 31 | T.val.val.graph.edge v i.val (.inr j) → S.graph.edge (vertex v) (variableMap v i).val (.inr (τ j)) |
| 32 | |
| 33 | open SupportedYields |
| 34 | |
| 35 | axiom sound {A : RankedSet} {m n : ℕ} (S : FiniteSystem (FiniteSystem A) n) |
| 36 | (T : SupportedSystems.System (SupportedSystems.System A) m) (τ : Fin m → Fin n) |
| 37 | (r : Resolution S T τ) (V : SupportedSystems.System A m) |
| 38 | (hV : Flattening.SystemFlattening (SupportedSystems.forgetPattern T) V.val) : |
| 39 | InitialYield (flatten S) V τ |
| 40 | |
| 41 | open RankedSystems (RankwiseFinite RankedMap) |
| 42 | open Resolutions |
| 43 | |
| 44 | axiom small_resolution {A B : RankedSet} (E : SupportedAlgebras.Algebra B) |
| 45 | (hB : RankwiseFinite B) (hE : SupportedAlgebras.UnfoldInvariant E) (η : RankedMap A B) |
| 46 | (S : FiniteSystem (FiniteSystem A) 0) |
| 47 | (T : SupportedSystems.System (SupportedSystems.System A) 0) (r : Resolution S T Fin.elim0) |
| 48 | (R : SupportedSystems.System A 0) |
| 49 | (hR : Flattening.SystemFlattening (SupportedSystems.forgetPattern T) R.val) : |
| 50 | ∃ (U : SupportedSystems.System (SupportedSystems.System A) 0) |
| 51 | (V : SupportedSystems.System A 0) (r' : Resolution S U Fin.elim0), |
| 52 | Flattening.SystemFlattening (SupportedSystems.forgetPattern U) V.val ∧ |
| 53 | (∀ v,SmallMap B (r'.variableMap v)) ∧ |
| 54 | E.eval 0 (SupportedSystems.relabel η R) = E.eval 0 (SupportedSystems.relabel η V) |
| 55 | |
| 56 | end Lax369799.SupportedResolutions |
| 57 |
Builds on
Used by
none
From Mathlib
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments