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

Finite yield approximation of contextual acceptance and order

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

    Acceptance in a context is determined by all finite sums of yields of the inserted presentation. Consequently, comparison in the contextual order is determined by comparison with these finite sums. The yields are taken over the base alphabet after expansion.

    Concept map
    44 concepts
    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 deterministiccontextsPlanted normal contexts and deterministicwitnessesYield acceptance of finite presentationsContexts over finite presentationsContextual preorders on finite presentationsFinite yield approximation of contextualacceptance and orderMorphisms of unpruned finite presentationsFinite presentations without reachabilitypruningSmall profiles of finite presentationsFinite approximation of a flatteningresolutionNormal forms retaining split-variableresolutionsContextual quotient algebras of finitepresentationsYield continuity for finite-presentationcontextsFlattening 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-algebrainterfaceSyntactic 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 ADescendants are omitted for concepts with more than 10 descendants.
    Evidence

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

    Lean source view on GitHub

    1import Lax369799.FiniteYieldContinuity
    2import Lax369799.FiniteAcceptance
    3
    4/-!
    5---
    6title: Finite yield approximation of contextual acceptance and order
    7type: theorem
    8---
    9Acceptance in a context is determined by all finite sums of yields of
    10the inserted presentation. Consequently, comparison in the contextual
    11order is determined by comparison with these finite sums. The yields
    12are taken over the base alphabet after expansion.
    13-/
    14namespace Lax369799.FiniteContinuityOrder
    15open RankedSystems (RankedSet SetSystem trim)
    16open FinitePresentations FiniteContexts FiniteContextualOrder FiniteAcceptance
    17
    18axiom accepting_approximation {A : RankedSet} (L : Algebras.Language A) {k : ℕ}
    19 (C : Context A k 0) (S : FiniteSystem A k) :
    20 Accepting L (plug C S) ↔
    21 ∀ (m : ℕ) (F : Fin m → SetSystem A k),
    22 (∀ i, Morphisms.Yield (trim S.graph) (F i)) →
    23 Accepting L (plug C (ofSetSystem (YieldContinuity.finiteSum F)))
    24
    25axiom order_approximation {A : RankedSet} (L : Algebras.Language A) {n : ℕ}
    26 (R S : FiniteSystem A n) :
    27 Below (Accepting L) R S ↔
    28 ∀ (m : ℕ) (F : Fin m → SetSystem A n),
    29 (∀ i, Morphisms.Yield (trim S.graph) (F i)) →
    30 Below (Accepting L) R (ofSetSystem (YieldContinuity.finiteSum F))
    31
    32end Lax369799.FiniteContinuityOrder
    33
    Show ProofShow Proof

    Discussion

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

    Loading discussion…