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

Yield acceptance of finite presentations

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

    Definition

    Acceptance tests the yields starting at initial or root vertices. For an ordinary finite presentation this is computed on its reachable restriction. This final observation does not prune intermediate substitution patterns. The resulting isomorphism-invariant property has a contextual quotient algebra for unpruned substitution.

    Concept map
    11 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on ADescendants are omitted for concepts with more than 10 descendants.
    Evidence

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

    Lean source view on GitHub

    1import Lax369799.FiniteSyntacticAlgebra
    2import Lax369799.SyntacticOrder
    3
    4/-!
    5---
    6title: Yield acceptance of finite presentations
    7type: definition
    8---
    9Acceptance tests the yields starting at initial or root vertices. For an
    10ordinary finite presentation this is computed on its reachable restriction.
    11This final observation does not prune intermediate substitution patterns.
    12The resulting isomorphism-invariant property has a contextual quotient
    13algebra for unpruned substitution.
    14-/
    15
    16namespace Lax369799.FiniteAcceptance
    17open RankedSystems (RankedSet)
    18open FinitePresentations FiniteContextualOrder
    19
    20def Accepting {A : RankedSet} (L : Algebras.Language A) (S : FiniteSystem A 0) : Prop :=
    21 SyntacticOrder.Accepting L (RankedSystems.trim S.graph)
    22
    23axiom accepting_isomorphic {A : RankedSet} (L : Algebras.Language A) :
    24 IsoInvariant (Accepting L)
    25
    26axiom syntactic_substitution_algebra {A : RankedSet} (L : Algebras.Language A) :
    27 ∃ E : FiniteSyntacticAlgebra.Algebra (Carrier (Accepting L)),
    28 ∀ n (S : FiniteSystem (FiniteSystem A) n),
    29 E.eval n (relabel (quotientMap (Accepting L)) S) =
    30 quotientMap (Accepting L) n (flatten S)
    31
    32axiom accepting_sum {A : RankedSet} (L : Algebras.Language A) (S T : FiniteSystem A 0) :
    33 Accepting L (sum S T) ↔ Accepting L S ∧ Accepting L T
    34
    35axiom accepting_system {A : RankedSet} (L : Algebras.Language A)
    36 (hL : Algebras.UnfoldInvariantLanguage L) (S : RankedSystems.System A 0) :
    37 Accepting L (ofSetSystem S.val) ↔ S ∈ L
    38
    39axiom accepting_empty {A : RankedSet} (L : Algebras.Language A) :
    40 Accepting L (empty A 0)
    41
    42end Lax369799.FiniteAcceptance
    43
    Show ProofShow ProofShow ProofShow ProofShow Proof

    Discussion

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

    Loading discussion…