Morphisms, unfoldings, and yields
Lax369799.Morphisms · concepts/Lax369799/Morphisms.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Definition
A morphism preserves labels, initial vertices, root vertices, and edges. Local surjectivity requires equality of the corresponding images at initial vertices, roots, and the successors of each vertex. Unfold-equivalence means having a common locally surjective cover. Initial yields are systems with an unfolding that maps into the given set-system; root yields are their planted counterparts after uprooting. See Sections 2.3–2.5.
Concept map
Lean source view on GitHub
| 1 | import Lax369799.RankedSystems |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Morphisms, unfoldings, and yields |
| 6 | type: definition |
| 7 | --- |
| 8 | A morphism preserves labels, initial vertices, root vertices, and edges. |
| 9 | Local surjectivity requires equality of the corresponding images at initial |
| 10 | vertices, roots, and the successors of each vertex. Unfold-equivalence means |
| 11 | having a common locally surjective cover. Initial yields are systems with |
| 12 | an unfolding that maps into the given set-system; root yields are their |
| 13 | planted counterparts after uprooting. See Sections 2.3–2.5. |
| 14 | -/ |
| 15 | |
| 16 | namespace Lax369799.Morphisms |
| 17 | open RankedSystems |
| 18 | |
| 19 | structure Morphism {A : RankedSet} {n : ℕ} (S T : SetSystem A n) where |
| 20 | toFun : S.Vertex → T.Vertex |
| 21 | initial : ∀ v, v ∈ S.graph.initial → toFun v ∈ T.graph.initial |
| 22 | root : ∀ v, v ∈ S.graph.root → toFun v ∈ T.graph.root |
| 23 | label : ∀ v, T.graph.label (toFun v) = S.graph.label v |
| 24 | edge : ∀ v d t, S.graph.edge v d t → T.graph.edge (toFun v) d (Sum.map toFun id t) |
| 25 | |
| 26 | def Morphism.LocallySurjective {A : RankedSet} {n : ℕ} {S T : SetSystem A n} |
| 27 | (f : Morphism S T) : Prop := |
| 28 | (∀ w ∈ T.graph.initial, ∃ v ∈ S.graph.initial, f.toFun v = w) ∧ |
| 29 | (∀ w ∈ T.graph.root, ∃ v ∈ S.graph.root, f.toFun v = w) ∧ |
| 30 | ∀ v d t, T.graph.edge (f.toFun v) d t → |
| 31 | ∃ s, S.graph.edge v d s ∧ Sum.map f.toFun id s = t |
| 32 | |
| 33 | def Isomorphic {A : RankedSet} {n : ℕ} (S T : SetSystem A n) : Prop := |
| 34 | ∃ f : Morphism S T, Function.Bijective f.toFun ∧ f.LocallySurjective |
| 35 | |
| 36 | /-- `UnfoldsTo S T` means that T is an unfolding of S. -/ |
| 37 | def UnfoldsTo {A : RankedSet} {n : ℕ} (S T : SetSystem A n) : Prop := |
| 38 | ∃ f : Morphism T S, f.LocallySurjective |
| 39 | |
| 40 | def UnfoldEquivalent {A : RankedSet} {n : ℕ} (S T : SetSystem A n) : Prop := |
| 41 | ∃ U : SetSystem A n, UnfoldsTo S U ∧ UnfoldsTo T U |
| 42 | |
| 43 | def DirectResolution {A : RankedSet} {n : ℕ} (S : SetSystem A n) |
| 44 | (T : System A n) : Prop := Nonempty (Morphism T.val S) |
| 45 | |
| 46 | def InitYield {A : RankedSet} {n : ℕ} (S : SetSystem A n) |
| 47 | (T : System A n) : Prop := |
| 48 | ∃ D : System A n, DirectResolution S D ∧ UnfoldsTo T.val D.val |
| 49 | |
| 50 | def Yield {A : RankedSet} {n : ℕ} (S T : SetSystem A n) : Prop := |
| 51 | (∃ U : System A n, InitYield S U ∧ T = U.val) ∨ |
| 52 | (∃ U : System A n, InitYield (uproot S) U ∧ T = plant U.val) |
| 53 | |
| 54 | def YieldBelow {A : RankedSet} {n : ℕ} (S T : SetSystem A n) : Prop := |
| 55 | ∀ U, Yield S U → Yield T U |
| 56 | |
| 57 | def YieldEquivalent {A : RankedSet} {n : ℕ} (S T : SetSystem A n) : Prop := |
| 58 | ∀ U, Yield S U ↔ Yield T U |
| 59 | |
| 60 | abbrev RegularTree (A : RankedSet) (n : ℕ) := |
| 61 | Quot (fun (S T : System A n) => UnfoldEquivalent S.val T.val) |
| 62 | |
| 63 | end Lax369799.Morphisms |
| 64 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments