Extended set-algebras and extremal accepted situations
Lax369799.ExtendedSetAlgebras · concepts/Lax369799/ExtendedSetAlgebras.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
The formal unary pieces of Definition 65 consist of an ordinary unary value and a set of immediate initial/root markers. Their order compares ordinary values and reverses marker inclusion. Expanding such pieces in a closed context and then evaluating agrees with evaluating their ordinary parts first (Lemma 66). Context evaluation is monotone (Lemma 86), and finite minimality supplies extremal accepted situations (Lemma 87). These constructions apply to arbitrary set-algebras.
Concept map
Evidence
Lean source view on GitHub
| 1 | import Lax369799.ExtendedContexts |
| 2 | import Lax369799.SetSystemAlgebras |
| 3 | import Lax369799.FiniteLocalReplacement |
| 4 | |
| 5 | /-! |
| 6 | --- |
| 7 | title: Extended set-algebras and extremal accepted situations |
| 8 | type: theorem |
| 9 | --- |
| 10 | The formal unary pieces of Definition 65 consist of an ordinary unary |
| 11 | value and a set of immediate initial/root markers. Their order compares |
| 12 | ordinary values and reverses marker inclusion. Expanding such pieces in |
| 13 | a closed context and then evaluating agrees with evaluating their ordinary |
| 14 | parts first (Lemma 66). Context evaluation is monotone (Lemma 86), and |
| 15 | finite minimality supplies extremal accepted situations (Lemma 87). |
| 16 | These constructions apply to arbitrary set-algebras. |
| 17 | -/ |
| 18 | |
| 19 | namespace Lax369799.ExtendedSetAlgebras |
| 20 | open RankedSystems (RankedSet) |
| 21 | open FinitePresentations FiniteContexts |
| 22 | open SetSystemAlgebras |
| 23 | open ExtendedContexts (Piece Pieces Marker) |
| 24 | |
| 25 | def PieceBelow {A : RankedSet} (E : SetAlgebra A) (p q : Piece A) : Prop := |
| 26 | Below E p.1 q.1 ∧ q.2 ⊆ p.2 |
| 27 | |
| 28 | def evaluatePieces {A : RankedSet} (E : SetAlgebra A) {k : ℕ} |
| 29 | (p : Pieces (FiniteSystem A) k) : Pieces A k := |
| 30 | fun i => ⟨E.eval 1 (p i).1, (p i).2⟩ |
| 31 | |
| 32 | noncomputable def expansion {A : RankedSet} {k : ℕ} |
| 33 | (p : Pieces (FiniteSystem A) k) (a : A k) : FiniteSystem A 0 := |
| 34 | flatten (relabel (fun _r u => match u with |
| 35 | | .inl s => s |
| 36 | | .inr ⟨h⟩ => h ▸ atomic a) (ExtendedContexts.context p).system) |
| 37 | |
| 38 | noncomputable def value {A : RankedSet} (E : SetAlgebra A) {k : ℕ} |
| 39 | (p : Pieces A k) (a : A k) : A 0 := |
| 40 | E.eval 0 (plug (ExtendedContexts.context p) (atomic a)) |
| 41 | |
| 42 | def Accepted {A : RankedSet} (E : SetAlgebra A) (F : Set (A 0)) {k : ℕ} |
| 43 | (p : Pieces A k) (a : A k) : Prop := value E p a ∈ F |
| 44 | |
| 45 | def IsExtremal {A : RankedSet} (E : SetAlgebra A) (F : Set (A 0)) {k : ℕ} |
| 46 | (p : Pieces A k) (a : A k) : Prop := |
| 47 | Accepted E F p a ∧ ∀ q b, (∀ i, PieceBelow E (q i) (p i)) → Below E b a → |
| 48 | Accepted E F q b → q = p ∧ b = a |
| 49 | |
| 50 | def ExtremalElement {A : RankedSet} (E : SetAlgebra A) (F : Set (A 0)) {k : ℕ} |
| 51 | (a : A k) : Prop := ∃ p, IsExtremal E F p a |
| 52 | |
| 53 | def UpwardClosed {A : RankedSet} (E : SetAlgebra A) (F : Set (A 0)) : Prop := |
| 54 | ∀ a b, a ∈ F → Below E a b → b ∈ F |
| 55 | |
| 56 | axiom pieces_evaluation {A : RankedSet} (E : SetAlgebra A) {k : ℕ} |
| 57 | (p : Pieces (FiniteSystem A) k) (a : A k) : |
| 58 | E.eval 0 (expansion p a) = value E (evaluatePieces E p) a |
| 59 | |
| 60 | axiom context_monotone {A : RankedSet} (E : SetAlgebra A) {k : ℕ} |
| 61 | (p q : Pieces A k) (hpq : ∀ i, PieceBelow E (p i) (q i)) |
| 62 | (a b : A k) (hab : Below E a b) : Below E (value E p a) (value E q b) |
| 63 | |
| 64 | axiom extremal_choice {A : RankedSet} (E : SetAlgebra A) (hA : RankedSystems.RankwiseFinite A) |
| 65 | (F : Set (A 0)) {k : ℕ} (p : Pieces A k) (a : A k) (ha : Accepted E F p a) : |
| 66 | ∃ q b, IsExtremal E F q b ∧ (∀ i, PieceBelow E (q i) (p i)) ∧ Below E b a |
| 67 | |
| 68 | axiom replacement {A : RankedSet} (E : SetAlgebra A) (hA : RankedSystems.RankwiseFinite A) |
| 69 | (F : Set (A 0)) (hF : UpwardClosed E F) {k : ℕ} |
| 70 | (C : Context A k 0) (a : A k) (ha : E.eval 0 (plug C (atomic a)) ∈ F) : |
| 71 | ∃ b, ExtremalElement E F b ∧ Below E b a ∧ E.eval 0 (plug C (atomic b)) ∈ F |
| 72 | |
| 73 | axiom simultaneous {A B : RankedSet} (E : SetAlgebra A) (hA : RankedSystems.RankwiseFinite A) |
| 74 | (F : Set (A 0)) (hF : UpwardClosed E F) (P : FiniteSystem B 0) |
| 75 | (q : ∀ v : P.Vertex, A (P.graph.label v).1) : |
| 76 | E.eval 0 (withLabels P q) ∈ F ↔ |
| 77 | ∃ r : ∀ v : P.Vertex, A (P.graph.label v).1, |
| 78 | (∀ v, ExtremalElement E F (r v) ∧ Below E (r v) (q v)) ∧ |
| 79 | E.eval 0 (withLabels P r) ∈ F |
| 80 | |
| 81 | end Lax369799.ExtendedSetAlgebras |
| 82 |
Used by
none
From Mathlib
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments