The initial-label algebra
Lax369799.InitialAlgebra · concepts/Lax369799/InitialAlgebra.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
A constant ranked set carries an algebra that reads only the label of the initial vertex. Finite instances recognize initial-vertex predicates.
Concept map
Evidence
Lean source view on GitHub
| 1 | import Lax369799.Algebras |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: The initial-label algebra |
| 6 | type: theorem |
| 7 | --- |
| 8 | A constant ranked set carries an algebra that reads only the label of the |
| 9 | initial vertex. Finite instances recognize initial-vertex predicates. |
| 10 | -/ |
| 11 | namespace Lax369799.InitialAlgebra |
| 12 | open RankedSystems Algebras |
| 13 | |
| 14 | noncomputable def initial {A : RankedSet} {n : ℕ} (S : System A n) : S.val.Vertex := |
| 15 | Classical.choose S.property.1 |
| 16 | |
| 17 | noncomputable def evaluate {C : Type} (n : ℕ) (S : System (fun _ => C) n) : C := |
| 18 | (S.val.graph.label (initial S)).2 |
| 19 | |
| 20 | axiom algebra (C : Type) : ∃ E : Algebra (fun _ => C), E.eval = evaluate |
| 21 | |
| 22 | axiom recognizes {A : RankedSet} (p : ∀ n, A n → Prop) : |
| 23 | Recognizable {S : System A 0 | p _ (S.val.graph.label (initial S)).2} |
| 24 | |
| 25 | end Lax369799.InitialAlgebra |
| 26 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments