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

Finite meets in a set-algebra

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

    The value of a disjoint family of atomic elements is their meet. This includes the empty family, whose value is the greatest element. The universal property follows from the reverse morphism axiom and monotonicity of evaluation; no continuity axiom is needed.

    Concept map
    54 concepts; 3 descendants hidden
    100%
    Algebraic decomposition with boundary dataAlgebras and recognitionDeterministic elements and the earlierreplacement propertyBounded profiles refine finite contextualequivalenceContext decomposition with hole boundarydataRelabelling and deterministic contextsubstitutionFinite resolution approximation in a contextSmallification preserving identitycontinuationsDeterministic normal forms with identitycontinuationsUnary continuations of deterministiccontextsContinuity through expanded representativesSyntactic algebras with expanded continuityPlanted normal contexts and deterministicwitnessesYield acceptance of finite presentationsFinite meets in a set-algebraAutomaton property of the unprunedsyntactic algebraContexts over finite presentationsContextual preorders on finite presentationsFinite yield approximation of contextualacceptance and orderContext decomposition without pruningExtremal unary data for finite presentationsMorphisms of unpruned finite presentationsUnary normal forms without pruningOrdered syntactic algebras of finitepresentationsFinite presentations without reachabilitypruningSmall profiles of finite presentationsFinite approximation of a flatteningresolutionNormal forms retaining split-variableresolutionsContextual quotient algebras of finitepresentationsYield continuity for finite-presentationcontextsFinite sums are contextual meetsFlattening and contextsFlattening, resolutions, and yield congruenceFinite support for initial observationsMorphisms, unfoldings, and yieldsBounded profiles in root-free substitutionpatternsBounded optimal flatten-resolutionsLocally surjective maps of finitepresentationsResolution values of finite presentationsTransfer of resolutions through boundedprofilesRanked sets, set-systems, and systemsRenaming variables in systems andresolutionsCompression of the variables offlatten-resolutionsFinite families of split-variable resolutionsResolutions and bounded profilesRoot entries in substituted presentationsFinite support for root observationsThe earlier continuity-bearing set-algebrainterfaceSet-algebras with retained verticesSyntactic set-algebras and rankwise finitenessYield-syntactic order and quotientEvaluation and variable renaming inregular-tree algebrasCompression of variable maps by finiteobservationsContinuity of yields in a context
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

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

    Lean source view on GitHub

    1import Lax369799.SetSystemAlgebras
    2
    3/-!
    4---
    5title: Finite meets in a set-algebra
    6type: theorem
    7---
    8The value of a disjoint family of atomic elements is their meet. This
    9includes the empty family, whose value is the greatest element. The
    10universal property follows from the reverse morphism axiom and
    11monotonicity of evaluation; no continuity axiom is needed.
    12-/
    13
    14namespace Lax369799.FiniteAlgebraMeets
    15open RankedSystems (RankedSet)
    16open FinitePresentations SetSystemAlgebras
    17
    18def family {A : RankedSet} {n k : ℕ} (f : Fin k → A n) : FiniteSystem A n where
    19 size := k
    20 graph := {
    21 label := fun i => ⟨n, f i⟩
    22 initial := Set.univ
    23 root := ∅
    24 edge := fun _ d t => ∃ j : Fin n, d = j.val ∧ t = .inr j
    25 direction_valid := by rintro v d t ⟨j, rfl, _⟩; exact j.isLt }
    26
    27def value {A : RankedSet} (E : SetAlgebra A) {n k : ℕ} (f : Fin k → A n) : A n :=
    28 E.eval n (family f)
    29
    30axiom lower_iff {A : RankedSet} (E : SetAlgebra A) {n k : ℕ}
    31 (f : Fin k → A n) (x : A n) : Below E x (value E f) ↔ ∀ i, Below E x (f i)
    32
    33axiom component {A : RankedSet} (E : SetAlgebra A) {n k : ℕ}
    34 (f : Fin k → A n) (i : Fin k) : Below E (value E f) (f i)
    35
    36axiom monotone {A : RankedSet} (E : SetAlgebra A) {n k : ℕ}
    37 (f g : Fin k → A n) (h : ∀ i, Below E (f i) (g i)) : Below E (value E f) (value E g)
    38
    39end Lax369799.FiniteAlgebraMeets
    40
    Show ProofShow ProofShow Proof
    Builds on
    Used by
    From Mathlib

    none

    Discussion

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

    Loading discussion…