Locally surjective maps of finite presentations
Lax369799.PresentationCovers · concepts/Lax369799/PresentationCovers.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Definition
A cover of presentations preserves labels, initial vertices, roots, and edges, and is surjective on initial vertices, roots, and each successor set. Presentations may contain unreachable vertices. Restricting the source of a cover to its reachable part still covers a reachable target. This permits finite constructions to be checked before enumerating and removing unreachable vertices.
Concept map
Evidence
Lean source view on GitHub
| 1 | import Lax369799.Morphisms |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Locally surjective maps of finite presentations |
| 6 | type: definition |
| 7 | --- |
| 8 | A cover of presentations preserves labels, initial vertices, roots, and |
| 9 | edges, and is surjective on initial vertices, roots, and each successor |
| 10 | set. Presentations may contain unreachable vertices. Restricting the |
| 11 | source of a cover to its reachable part still covers a reachable target. |
| 12 | This permits finite constructions to be checked before enumerating and |
| 13 | removing unreachable vertices. |
| 14 | -/ |
| 15 | |
| 16 | namespace Lax369799.PresentationCovers |
| 17 | open RankedSystems Morphisms |
| 18 | |
| 19 | structure Cover {A : RankedSet} {n : ℕ} {V W : Type} |
| 20 | (S : Presentation A n V) (T : Presentation A n W) where |
| 21 | toFun : V → W |
| 22 | label : ∀ v, T.label (toFun v) = S.label v |
| 23 | initial : ∀ v, v ∈ S.initial → toFun v ∈ T.initial |
| 24 | root : ∀ v, v ∈ S.root → toFun v ∈ T.root |
| 25 | edge : ∀ v d t, S.edge v d t → T.edge (toFun v) d (Sum.map toFun id t) |
| 26 | initial_lift : ∀ w, w ∈ T.initial → ∃ v, v ∈ S.initial ∧ toFun v = w |
| 27 | root_lift : ∀ w, w ∈ T.root → ∃ v, v ∈ S.root ∧ toFun v = w |
| 28 | edge_lift : ∀ v d t, T.edge (toFun v) d t → |
| 29 | ∃ s, S.edge v d s ∧ Sum.map toFun id s = t |
| 30 | |
| 31 | axiom surjective_of_reachable {A : RankedSet} {n : ℕ} {V W : Type} |
| 32 | {S : Presentation A n V} {T : Presentation A n W} (f : Cover S T) |
| 33 | (hT : ∀ w, T.Reachable w) : Function.Surjective f.toFun |
| 34 | |
| 35 | axiom trim_cover {A : RankedSet} {n : ℕ} {V : Type} [Fintype V] |
| 36 | (S : Presentation A n V) (T : SetSystem A n) (f : Cover S T.graph) : |
| 37 | UnfoldsTo T (trim S) |
| 38 | |
| 39 | end Lax369799.PresentationCovers |
| 40 |
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