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

Order and yield properties of set-algebras

Lax369799.SetAlgebraTheorems · concepts/Lax369799/SetAlgebraTheorems.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

    Meet is associative, commutative, and idempotent, and its induced relation is a partial order with meet as infimum (lemma:meet−is−meetlemma:meet-is-meet). Evaluation reverses yield inclusion (lemma:yieldssubset−yaleqlemma:yieldssubset-yaleq). Elements of ranks zero and one are deterministic (lemma:det−characterisationlemma:det-characterisation).

    Concept map
    8 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.AutomatonProperty
    2
    3/-!
    4---
    5title: Order and yield properties of set-algebras
    6type: theorem
    7---
    8Meet is associative, commutative, and idempotent, and its induced relation
    9is a partial order with meet as infimum (`lemma:meet-is-meet`). Evaluation
    10reverses yield inclusion (`lemma:yieldssubset-yaleq`). Elements of ranks
    11zero and one are deterministic (`lemma:det-characterisation`).
    12-/
    13
    14namespace Lax369799.SetAlgebraTheorems
    15open RankedSystems Morphisms SetAlgebras AutomatonProperty
    16
    17axiom meet_laws {A : RankedSet} (E : SetAlgebra A) (n : ℕ) :
    18 (∀ a b c : A n, meet E (meet E a b) c = meet E a (meet E b c)) ∧
    19 (∀ a b : A n, meet E a b = meet E b a) ∧
    20 (∀ a : A n, meet E a a = a)
    21
    22axiom order_laws {A : RankedSet} (E : SetAlgebra A) (n : ℕ) :
    23 (∀ a : A n, Below E a a) ∧
    24 (∀ a b : A n, Below E a b → Below E b a → a = b) ∧
    25 (∀ a b c : A n, Below E a b → Below E b c → Below E a c) ∧
    26 (∀ a b c : A n, Below E c (meet E a b) ↔ Below E c a ∧ Below E c b)
    27
    28axiom yield_order {A : RankedSet} (E : SetAlgebra A) {n : ℕ}
    29 (S T : SetSystem A n) (h : YieldBelow S T) : Below E (E.eval n T) (E.eval n S)
    30
    31axiom low_rank_deterministic {A : RankedSet} (E : SetAlgebra A)
    32 {n : ℕ} (hn : n ≤ 1) (a : A n) : Deterministic E a
    33
    34end Lax369799.SetAlgebraTheorems
    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…