Contextual quotient algebras of finite presentations
Lax369799.FiniteSyntacticAlgebra · concepts/Lax369799/FiniteSyntacticAlgebra.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
The contextual quotient carries evaluation for unpruned finite presentations. Evaluation respects isomorphism, the atomic unit, and associativity. This is the substitution-algebra structure alone; no yield-continuity law is asserted here.
Concept map
Evidence
This concept declares 6 statements. Each proof establishes one of them relative to its assumptions.
1 accepting_classes proven
2 accepting_sum_value proven
3 contextual_algebra proven
4 contextual_recognition proven
5 evaluation_monotone proven
6 sum_value proven
Lean source view on GitHub
| 1 | import Lax369799.FiniteContextualOrder |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Contextual quotient algebras of finite presentations |
| 6 | type: theorem |
| 7 | --- |
| 8 | The contextual quotient carries evaluation for unpruned finite |
| 9 | presentations. Evaluation respects isomorphism, the atomic unit, and |
| 10 | associativity. This is the substitution-algebra structure alone; no |
| 11 | yield-continuity law is asserted here. |
| 12 | -/ |
| 13 | |
| 14 | namespace Lax369799.FiniteSyntacticAlgebra |
| 15 | open RankedSystems (RankedSet) |
| 16 | open FinitePresentations FiniteContextualOrder |
| 17 | |
| 18 | structure Algebra (A : RankedSet) where |
| 19 | eval : ∀ n, FiniteSystem A n → A n |
| 20 | unit : ∀ n (a : A n), eval n (atomic a) = a |
| 21 | associative : ∀ n (S : FiniteSystem (FiniteSystem A) n), |
| 22 | eval n (relabel eval S) = eval n (flatten S) |
| 23 | isomorphic : ∀ n (S T : FiniteSystem A n), Isomorphic S T → eval n S = eval n T |
| 24 | |
| 25 | def sumValue {A : RankedSet} (E : Algebra A) {n : ℕ} (a b : A n) : A n := |
| 26 | E.eval n (binary a b) |
| 27 | |
| 28 | def AcceptingClass {A : RankedSet} (F : ClosedProperty A) (a : Carrier F 0) : Prop := |
| 29 | ∃ S : FiniteSystem A 0, quotientMap F 0 S = a ∧ S ∈ F |
| 30 | |
| 31 | axiom accepting_classes {A : RankedSet} (F : ClosedProperty A) (hF : IsoInvariant F) : |
| 32 | (∀ S, AcceptingClass F (quotientMap F 0 S) ↔ S ∈ F) ∧ |
| 33 | (∀ a b, AcceptingClass F a → ClassBelow F a b → AcceptingClass F b) |
| 34 | |
| 35 | axiom contextual_algebra {A : RankedSet} (F : ClosedProperty A) (hF : IsoInvariant F) : |
| 36 | ∃ E : Algebra (Carrier F), ∀ n (S : FiniteSystem (FiniteSystem A) n), |
| 37 | E.eval n (relabel (quotientMap F) S) = quotientMap F n (flatten S) |
| 38 | |
| 39 | axiom contextual_recognition {A : RankedSet} (F : ClosedProperty A) (hF : IsoInvariant F) |
| 40 | (E : Algebra (Carrier F)) |
| 41 | (hE : ∀ n (S : FiniteSystem (FiniteSystem A) n), |
| 42 | E.eval n (relabel (quotientMap F) S) = quotientMap F n (flatten S)) : |
| 43 | ∃ P : Set (Carrier F 0), ∀ S : FiniteSystem A 0, |
| 44 | E.eval 0 (relabel (fun r a => quotientMap F r (atomic a)) S) ∈ P ↔ S ∈ F |
| 45 | |
| 46 | axiom evaluation_monotone {A B : RankedSet} (F : ClosedProperty A) (hF : IsoInvariant F) |
| 47 | (E : Algebra (Carrier F)) |
| 48 | (hE : ∀ n (S : FiniteSystem (FiniteSystem A) n), |
| 49 | E.eval n (relabel (quotientMap F) S) = quotientMap F n (flatten S)) |
| 50 | {n : ℕ} (P : FiniteSystem B n) |
| 51 | (q r : ∀ v : P.Vertex, Carrier F (P.graph.label v).1) |
| 52 | (h : ∀ v, ClassBelow F (q v) (r v)) : |
| 53 | ClassBelow F (E.eval n (withLabels P q)) (E.eval n (withLabels P r)) |
| 54 | |
| 55 | axiom sum_value {A : RankedSet} (F : ClosedProperty A) (hF : IsoInvariant F) |
| 56 | (E : Algebra (Carrier F)) |
| 57 | (hE : ∀ n (S : FiniteSystem (FiniteSystem A) n), |
| 58 | E.eval n (relabel (quotientMap F) S) = quotientMap F n (flatten S)) |
| 59 | {n : ℕ} (S T : FiniteSystem A n) : |
| 60 | sumValue E (quotientMap F n S) (quotientMap F n T) = quotientMap F n (sum S T) |
| 61 | |
| 62 | axiom accepting_sum_value {A : RankedSet} (F : ClosedProperty A) (hF : IsoInvariant F) |
| 63 | (hSum : ∀ S T, S ∈ F → T ∈ F → sum S T ∈ F) |
| 64 | (E : Algebra (Carrier F)) |
| 65 | (hE : ∀ n (S : FiniteSystem (FiniteSystem A) n), |
| 66 | E.eval n (relabel (quotientMap F) S) = quotientMap F n (flatten S)) |
| 67 | (a b : Carrier F 0) : |
| 68 | AcceptingClass F a → AcceptingClass F b → AcceptingClass F (sumValue E a b) |
| 69 | |
| 70 | end Lax369799.FiniteSyntacticAlgebra |
| 71 |
Builds on
Used by
From Mathlib
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments