Set-algebras with retained vertices
Lax369799.SetSystemAlgebras · concepts/Lax369799/SetSystemAlgebras.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Definition 63 evaluates all finite set-systems, including unreachable vertices. Its axioms are the atomic unit, associativity, invariance under unfold-equivalence, and the reverse comparison for morphisms. There is no continuity axiom. Foldings here are locally surjective covers that are also surjective on all vertices, as in Definitions 8 and 18. The yield-syntactic quotient has this structure, with its contextual order equal to the order induced by binary disjoint union.
Concept map
Evidence
This concept declares 7 statements. Each proof establishes one of them relative to its assumptions.
1 eval_sum proven
2 evaluation_monotone proven
3 folding_invariance proven
4 meet_laws proven
5 order_laws proven
6 syntactic_order proven
7 syntactic_structure proven
Lean source view on GitHub
| 1 | import Lax369799.ExpandedSyntacticAlgebra |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Set-algebras with retained vertices |
| 6 | type: theorem |
| 7 | --- |
| 8 | Definition 63 evaluates all finite set-systems, including unreachable |
| 9 | vertices. Its axioms are the atomic unit, associativity, invariance under |
| 10 | unfold-equivalence, and the reverse comparison for morphisms. There is |
| 11 | no continuity axiom. Foldings here are locally surjective covers that are |
| 12 | also surjective on all vertices, as in Definitions 8 and 18. |
| 13 | The yield-syntactic quotient has this structure, with its contextual |
| 14 | order equal to the order induced by binary disjoint union. |
| 15 | -/ |
| 16 | |
| 17 | namespace Lax369799.SetSystemAlgebras |
| 18 | open RankedSystems (RankedSet) |
| 19 | open FinitePresentations FiniteSyntacticAlgebra |
| 20 | |
| 21 | def UnfoldEquivalent {A : RankedSet} {n : ℕ} (S T : FiniteSystem A n) : Prop := |
| 22 | ∃ U : FiniteSystem A n, |
| 23 | ∃ f : PresentationCovers.Cover U.graph S.graph, |
| 24 | ∃ g : PresentationCovers.Cover U.graph T.graph, |
| 25 | Function.Surjective f.toFun ∧ Function.Surjective g.toFun |
| 26 | |
| 27 | structure SetAlgebra (A : RankedSet) extends Algebra A where |
| 28 | unfold_invariant : ∀ n (S T : FiniteSystem A n), |
| 29 | UnfoldEquivalent S T → eval n S = eval n T |
| 30 | morphism : ∀ n (S T : FiniteSystem A n), Nonempty (FiniteMorphisms.Morphism S T) → |
| 31 | sumValue toAlgebra (eval n T) (eval n S) = eval n T |
| 32 | |
| 33 | def Below {A : RankedSet} (E : SetAlgebra A) {n : ℕ} (a b : A n) : Prop := |
| 34 | sumValue E.toAlgebra a b = a |
| 35 | |
| 36 | structure Morphism {A B : RankedSet} (E : SetAlgebra A) (D : SetAlgebra B) where |
| 37 | map : RankedSystems.RankedMap A B |
| 38 | commutes : ∀ n (S : FiniteSystem A n), |
| 39 | D.eval n (relabel map S) = map n (E.eval n S) |
| 40 | |
| 41 | axiom folding_invariance {A : RankedSet} (E : SetAlgebra A) {n : ℕ} |
| 42 | (S T : FiniteSystem A n) (f : PresentationCovers.Cover S.graph T.graph) |
| 43 | (hf : Function.Surjective f.toFun) : E.eval n S = E.eval n T |
| 44 | |
| 45 | axiom eval_sum {A : RankedSet} (E : SetAlgebra A) {n : ℕ} (S T : FiniteSystem A n) : |
| 46 | E.eval n (sum S T) = sumValue E.toAlgebra (E.eval n S) (E.eval n T) |
| 47 | |
| 48 | axiom meet_laws {A : RankedSet} (E : SetAlgebra A) (n : ℕ) : |
| 49 | (∀ a b c : A n, sumValue E.toAlgebra (sumValue E.toAlgebra a b) c = |
| 50 | sumValue E.toAlgebra a (sumValue E.toAlgebra b c)) ∧ |
| 51 | (∀ a b : A n, sumValue E.toAlgebra a b = sumValue E.toAlgebra b a) ∧ |
| 52 | (∀ a : A n, sumValue E.toAlgebra a a = a) |
| 53 | |
| 54 | axiom order_laws {A : RankedSet} (E : SetAlgebra A) (n : ℕ) : |
| 55 | (∀ a : A n, Below E a a) ∧ |
| 56 | (∀ a b : A n, Below E a b → Below E b a → a = b) ∧ |
| 57 | (∀ a b c : A n, Below E a b → Below E b c → Below E a c) ∧ |
| 58 | (∀ a b c : A n, Below E c (sumValue E.toAlgebra a b) ↔ Below E c a ∧ Below E c b) |
| 59 | |
| 60 | axiom evaluation_monotone {A B : RankedSet} (E : SetAlgebra A) {n : ℕ} |
| 61 | (P : FiniteSystem B n) (q r : ∀ v : P.Vertex, A (P.graph.label v).1) |
| 62 | (h : ∀ v, Below E (q v) (r v)) : |
| 63 | Below E (E.eval n (withLabels P q)) (E.eval n (withLabels P r)) |
| 64 | |
| 65 | axiom syntactic_order {A : RankedSet} (L : Algebras.Language A) |
| 66 | (E : ExpandedSyntacticAlgebra.SyntacticAlgebra L) {n : ℕ} |
| 67 | (a b : FiniteContextualOrder.Carrier (FiniteAcceptance.Accepting L) n) : |
| 68 | FiniteContextualOrder.ClassBelow (FiniteAcceptance.Accepting L) a b ↔ |
| 69 | sumValue E.algebra a b = a |
| 70 | |
| 71 | axiom syntactic_structure {A : RankedSet} (L : Algebras.Language A) |
| 72 | (E : ExpandedSyntacticAlgebra.SyntacticAlgebra L) : |
| 73 | ∃ D : SetAlgebra (FiniteContextualOrder.Carrier (FiniteAcceptance.Accepting L)), |
| 74 | D.toAlgebra = E.algebra |
| 75 | |
| 76 | end Lax369799.SetSystemAlgebras |
| 77 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments