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

Substitution closure of deterministic values

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

    Values generated by unary and nullary labels are closed under substitution. Choose a generating presentation for each label and flatten them together. The resulting presentation still has only unary and nullary labels, although its vertices may have several edges in the same direction.

    Concept map
    21 concepts
    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.FiniteExtremal
    2
    3/-!
    4---
    5title: Substitution closure of deterministic values
    6type: theorem
    7---
    8Values generated by unary and nullary labels are closed under substitution.
    9Choose a generating presentation for each label and flatten them together.
    10The resulting presentation still has only unary and nullary labels,
    11although its vertices may have several edges in the same direction.
    12-/
    13namespace Lax369799.FiniteDeterministicElements
    14open RankedSystems (RankedSet)
    15open FinitePresentations FiniteSyntacticAlgebra FiniteExtremal
    16
    17axiom realization {A B : RankedSet} (E : Algebra A) {n : ℕ} (P : FiniteSystem B n)
    18 (q : ∀ v : P.Vertex, A (P.graph.label v).1) (hq : ∀ v, Deterministic E (q v)) :
    19 ∃ D : ∀ v : P.Vertex, FiniteSystem A (P.graph.label v).1,
    20 (∀ v, (∀ w, ((D v).graph.label w).1 ≤ 1) ∧ E.eval _ (D v) = q v) ∧
    21 (∀ w, ((flatten (withLabels P D)).graph.label w).1 ≤ 1) ∧
    22 E.eval n (flatten (withLabels P D)) = E.eval n (withLabels P q)
    23
    24axiom substitution_closed {A B : RankedSet} (E : Algebra A) {n : ℕ} (P : FiniteSystem B n)
    25 (q : ∀ v : P.Vertex, A (P.graph.label v).1) (hq : ∀ v, Deterministic E (q v)) :
    26 Deterministic E (E.eval n (withLabels P q))
    27
    28end Lax369799.FiniteDeterministicElements
    29
    Show 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…