The earlier continuity-bearing set-algebra interface
Lax369799.SetAlgebras · concepts/Lax369799/SetAlgebras.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Definition
A set-algebra evaluates set-systems and satisfies the unit, flattening, unfold-invariance, morphism, and continuity axioms of the earlier draft. The disjoint union of atomic systems defines meet; the induced order has exactly when . Morphisms reverse this order, while continuity says that a common lower bound for all yields is a lower bound for the original set-system. Both initial and root yields occur here. This original interface is retained for conditional results. The syntactic quotient instead uses ExpandedSyntacticAlgebra and expanded continuity. The revised Definition 63 is represented in SetSystemAlgebras, using unpruned finite presentations and no continuity field.
Concept map
Lean source view on GitHub
| 1 | import Lax369799.Algebras |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: The earlier continuity-bearing set-algebra interface |
| 6 | type: definition |
| 7 | --- |
| 8 | A set-algebra evaluates set-systems and satisfies the unit, flattening, |
| 9 | unfold-invariance, morphism, and continuity axioms of the earlier draft. |
| 10 | The disjoint union of atomic systems defines meet; the induced order has |
| 11 | `a ≤ b` exactly when `a ∧ b = a`. Morphisms reverse this order, while |
| 12 | continuity says that a common lower bound for all yields is a lower bound |
| 13 | for the original set-system. Both initial and root yields occur here. |
| 14 | This original interface is retained for conditional results. The syntactic |
| 15 | quotient instead uses ExpandedSyntacticAlgebra and expanded continuity. |
| 16 | The revised Definition 63 is represented in SetSystemAlgebras, using |
| 17 | unpruned finite presentations and no continuity field. |
| 18 | -/ |
| 19 | |
| 20 | namespace Lax369799.SetAlgebras |
| 21 | open RankedSystems Morphisms Flattening |
| 22 | |
| 23 | noncomputable def meetOf {A : RankedSet} (eval : ∀ n, SetSystem A n → A n) |
| 24 | {n : ℕ} (a b : A n) : A n := eval n (sum (atomic a) (atomic b)) |
| 25 | |
| 26 | def BelowOf {A : RankedSet} (eval : ∀ n, SetSystem A n → A n) |
| 27 | {n : ℕ} (a b : A n) : Prop := meetOf eval a b = a |
| 28 | |
| 29 | structure SetAlgebra (A : RankedSet) where |
| 30 | eval : ∀ n, SetSystem A n → A n |
| 31 | unit : ∀ n (a : A n), eval n (atomic a) = a |
| 32 | associative : ∀ n (S : SetSystem (SetSystem A) n), |
| 33 | eval n (relabel eval S) = eval n (flatten S) |
| 34 | unfold_invariant : ∀ n (S T : SetSystem A n), |
| 35 | UnfoldEquivalent S T → eval n S = eval n T |
| 36 | morphism : ∀ n (S T : SetSystem A n), Nonempty (Morphism S T) → |
| 37 | BelowOf eval (eval n T) (eval n S) |
| 38 | continuity : ∀ n (S : SetSystem A n) (a : A n), |
| 39 | (∀ T, Yield S T → BelowOf eval a (eval n T)) → BelowOf eval a (eval n S) |
| 40 | |
| 41 | noncomputable def meet {A : RankedSet} (E : SetAlgebra A) {n : ℕ} (a b : A n) : A n := |
| 42 | meetOf E.eval a b |
| 43 | |
| 44 | def Below {A : RankedSet} (E : SetAlgebra A) {n : ℕ} (a b : A n) : Prop := |
| 45 | BelowOf E.eval a b |
| 46 | |
| 47 | structure SetAlgebraMorphism {A B : RankedSet} (E : SetAlgebra A) (F : SetAlgebra B) where |
| 48 | map : RankedMap A B |
| 49 | commutes : ∀ n (S : SetSystem A n), F.eval n (relabel map S) = map n (E.eval n S) |
| 50 | |
| 51 | end Lax369799.SetAlgebras |
| 52 |
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