Finite meets in a set-algebra
Lax369799.FiniteAlgebraMeets · concepts/Lax369799/FiniteAlgebraMeets.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
The value of a disjoint family of atomic elements is their meet. This includes the empty family, whose value is the greatest element. The universal property follows from the reverse morphism axiom and monotonicity of evaluation; no continuity axiom is needed.
Concept map
Evidence
Lean source view on GitHub
| 1 | import Lax369799.SetSystemAlgebras |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Finite meets in a set-algebra |
| 6 | type: theorem |
| 7 | --- |
| 8 | The value of a disjoint family of atomic elements is their meet. This |
| 9 | includes the empty family, whose value is the greatest element. The |
| 10 | universal property follows from the reverse morphism axiom and |
| 11 | monotonicity of evaluation; no continuity axiom is needed. |
| 12 | -/ |
| 13 | |
| 14 | namespace Lax369799.FiniteAlgebraMeets |
| 15 | open RankedSystems (RankedSet) |
| 16 | open FinitePresentations SetSystemAlgebras |
| 17 | |
| 18 | def family {A : RankedSet} {n k : ℕ} (f : Fin k → A n) : FiniteSystem A n where |
| 19 | size := k |
| 20 | graph := { |
| 21 | label := fun i => ⟨n, f i⟩ |
| 22 | initial := Set.univ |
| 23 | root := ∅ |
| 24 | edge := fun _ d t => ∃ j : Fin n, d = j.val ∧ t = .inr j |
| 25 | direction_valid := by rintro v d t ⟨j, rfl, _⟩; exact j.isLt } |
| 26 | |
| 27 | def value {A : RankedSet} (E : SetAlgebra A) {n k : ℕ} (f : Fin k → A n) : A n := |
| 28 | E.eval n (family f) |
| 29 | |
| 30 | axiom lower_iff {A : RankedSet} (E : SetAlgebra A) {n k : ℕ} |
| 31 | (f : Fin k → A n) (x : A n) : Below E x (value E f) ↔ ∀ i, Below E x (f i) |
| 32 | |
| 33 | axiom component {A : RankedSet} (E : SetAlgebra A) {n k : ℕ} |
| 34 | (f : Fin k → A n) (i : Fin k) : Below E (value E f) (f i) |
| 35 | |
| 36 | axiom monotone {A : RankedSet} (E : SetAlgebra A) {n k : ℕ} |
| 37 | (f g : Fin k → A n) (h : ∀ i, Below E (f i) (g i)) : Below E (value E f) (value E g) |
| 38 | |
| 39 | end Lax369799.FiniteAlgebraMeets |
| 40 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments