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

Nonempty powerset algebras

Lax369799.NonemptyPowersets · concepts/Lax369799/NonemptyPowersets.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 nonempty subsets of each sort form an algebra by choosing one allowed label at each vertex and collecting all resulting evaluations. Nonemptiness allows arbitrary choices at components removed by reachable restriction. This construction is used for projections that forget extra vertex marks.

    Concept map
    6 concepts; 3 descendants hidden
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

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

    Lean source view on GitHub

    1import Lax369799.PolynomialContexts
    2import Mathlib.Data.Fintype.Powerset
    3
    4/-!
    5---
    6title: Nonempty powerset algebras
    7type: theorem
    8---
    9The nonempty subsets of each sort form an algebra by choosing one allowed
    10label at each vertex and collecting all resulting evaluations. Nonemptiness
    11allows arbitrary choices at components removed by reachable restriction.
    12This construction is used for projections that forget extra vertex marks.
    13-/
    14namespace Lax369799.NonemptyPowersets
    15open RankedSystems Algebras PolynomialContexts
    16
    17abbrev Carrier (B : RankedSet) : RankedSet := fun n => {s : Set (B n) // s.Nonempty}
    18
    19def values {B : RankedSet} (E : Algebra B) {n : ℕ} (S : System (Carrier B) n) : Set (B n) :=
    20 {b | ∃ q : ∀ v, B (S.val.graph.label v).1,
    21 (∀ v, q v ∈ (S.val.graph.label v).2.val) ∧ E.eval n (withLabels S q) = b}
    22
    23noncomputable def evaluate {B : RankedSet} (E : Algebra B) (n : ℕ)
    24 (S : System (Carrier B) n) : Carrier B n :=
    25 ⟨values E S, by
    26 let q := fun v => Classical.choose (S.val.graph.label v).2.property
    27 exact ⟨E.eval n (withLabels S q), q,
    28 fun v => Classical.choose_spec (S.val.graph.label v).2.property, rfl⟩⟩
    29
    30axiom algebra {B : RankedSet} (E : Algebra B) :
    31 ∃ F : Algebra (Carrier B), F.eval = evaluate E
    32
    33axiom finite_carrier {B : RankedSet} (hB : RankwiseFinite B) : RankwiseFinite (Carrier B)
    34
    35end Lax369799.NonemptyPowersets
    36
    Show ProofShow Proof

    Discussion

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

    Loading discussion…