Evaluation of sums and contexts
Lax369799.EvaluationTheorems · concepts/Lax369799/EvaluationTheorems.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Evaluation turns disjoint union into meet. Substituting a set-system has the same value as substituting its evaluated atomic letter. Evaluation in every context is monotone for the induced algebra order. These are consequences of the unit, flattening, and morphism axioms used in the normal-form and extremal-context arguments.
Concept map
Evidence
Lean source view on GitHub
| 1 | import Lax369799.SetAlgebras |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Evaluation of sums and contexts |
| 6 | type: theorem |
| 7 | --- |
| 8 | Evaluation turns disjoint union into meet. Substituting a set-system has |
| 9 | the same value as substituting its evaluated atomic letter. Evaluation |
| 10 | in every context is monotone for the induced algebra order. These are |
| 11 | consequences of the unit, flattening, and morphism axioms used in the |
| 12 | normal-form and extremal-context arguments. |
| 13 | -/ |
| 14 | |
| 15 | namespace Lax369799.EvaluationTheorems |
| 16 | open RankedSystems Flattening SetAlgebras |
| 17 | |
| 18 | axiom eval_sum {A : RankedSet} (E : SetAlgebra A) {n : ℕ} (S T : SetSystem A n) : |
| 19 | E.eval n (sum S T) = meet E (E.eval n S) (E.eval n T) |
| 20 | |
| 21 | axiom context_evaluation {A : RankedSet} (E : SetAlgebra A) {k n : ℕ} |
| 22 | (C : SetContext A k n) (S : SetSystem A k) : |
| 23 | E.eval n (plug C S) = E.eval n (plug C (atomic (E.eval k S))) |
| 24 | |
| 25 | axiom context_monotone {A : RankedSet} (E : SetAlgebra A) {k n : ℕ} |
| 26 | (C : SetContext A k n) (a b : A k) (h : Below E a b) : |
| 27 | Below E (E.eval n (plug C (atomic a))) (E.eval n (plug C (atomic b))) |
| 28 | |
| 29 | axiom relabel_monotone {A B : RankedSet} (E : SetAlgebra A) |
| 30 | (f g : RankedMap B A) (h : ∀ r b, Below E (f r b) (g r b)) |
| 31 | {n : ℕ} (S : SetSystem B n) : |
| 32 | Below E (E.eval n (relabel f S)) (E.eval n (relabel g S)) |
| 33 | |
| 34 | end Lax369799.EvaluationTheorems |
| 35 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments