While this submission is a draft, it cannot be used by other submissions.

Evaluation of sums and contexts

Lax369799.EvaluationTheorems · concepts/Lax369799/EvaluationTheorems.lean · lax-369799

proven

Loading review…

Sign in with ORCID

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural 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
    6 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    This concept declares 4 statements. Each proof establishes one of them relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.SetAlgebras
    2
    3/-!
    4---
    5title: Evaluation of sums and contexts
    6type: theorem
    7---
    8Evaluation turns disjoint union into meet. Substituting a set-system has
    9the same value as substituting its evaluated atomic letter. Evaluation
    10in every context is monotone for the induced algebra order. These are
    11consequences of the unit, flattening, and morphism axioms used in the
    12normal-form and extremal-context arguments.
    13-/
    14
    15namespace Lax369799.EvaluationTheorems
    16open RankedSystems Flattening SetAlgebras
    17
    18axiom 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
    21axiom 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
    25axiom 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
    29axiom 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
    34end Lax369799.EvaluationTheorems
    35
    Show ProofShow ProofShow ProofShow Proof
    Builds on
    Used by

    none

    From Mathlib

    none

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…