Nonempty powerset algebras
Lax369799.NonemptyPowersets · concepts/Lax369799/NonemptyPowersets.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
The nonempty subsets of each sort form an algebra by choosing one allowed label at each vertex and collecting all resulting evaluations. Nonemptiness allows arbitrary choices at components removed by reachable restriction. This construction is used for projections that forget extra vertex marks.
Concept map
Evidence
Lean source view on GitHub
| 1 | import Lax369799.PolynomialContexts |
| 2 | import Mathlib.Data.Fintype.Powerset |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Nonempty powerset algebras |
| 7 | type: theorem |
| 8 | --- |
| 9 | The nonempty subsets of each sort form an algebra by choosing one allowed |
| 10 | label at each vertex and collecting all resulting evaluations. Nonemptiness |
| 11 | allows arbitrary choices at components removed by reachable restriction. |
| 12 | This construction is used for projections that forget extra vertex marks. |
| 13 | -/ |
| 14 | namespace Lax369799.NonemptyPowersets |
| 15 | open RankedSystems Algebras PolynomialContexts |
| 16 | |
| 17 | abbrev Carrier (B : RankedSet) : RankedSet := fun n => {s : Set (B n) // s.Nonempty} |
| 18 | |
| 19 | def values {B : RankedSet} (E : Algebra B) {n : ℕ} (S : System (Carrier B) n) : Set (B n) := |
| 20 | {b | ∃ q : ∀ v, B (S.val.graph.label v).1, |
| 21 | (∀ v, q v ∈ (S.val.graph.label v).2.val) ∧ E.eval n (withLabels S q) = b} |
| 22 | |
| 23 | noncomputable def evaluate {B : RankedSet} (E : Algebra B) (n : ℕ) |
| 24 | (S : System (Carrier B) n) : Carrier B n := |
| 25 | ⟨values E S, by |
| 26 | let q := fun v => Classical.choose (S.val.graph.label v).2.property |
| 27 | exact ⟨E.eval n (withLabels S q), q, |
| 28 | fun v => Classical.choose_spec (S.val.graph.label v).2.property, rfl⟩⟩ |
| 29 | |
| 30 | axiom algebra {B : RankedSet} (E : Algebra B) : |
| 31 | ∃ F : Algebra (Carrier B), F.eval = evaluate E |
| 32 | |
| 33 | axiom finite_carrier {B : RankedSet} (hB : RankwiseFinite B) : RankwiseFinite (Carrier B) |
| 34 | |
| 35 | end Lax369799.NonemptyPowersets |
| 36 |
Builds on
From Mathlib
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments