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

Parallel replacements in accepting contexts

Lax369799.ParallelReplacement · concepts/Lax369799/ParallelReplacement.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 split extremal witness is a parallel tuple of unary values. It lies below the original value and preserves acceptance in the chosen context. This is an existence result for accepting contexts, not a normal form for all deterministic values.

    Concept map
    56 concepts; 7 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 identitycontinuationsUnary normal form of deterministic elementsDeterministic normal forms with identitycontinuationsUnary continuations of deterministiccontextsContinuity through expanded representativesSyntactic algebras with expanded continuityPlanted normal contexts and deterministicwitnessesYield acceptance of finite presentationsAutomaton 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-resolutionsParallel replacements in accepting contextsLocally 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-algebrainterfaceExtremal witnesses with separate rootedcomponentsSyntactic set-algebras and rankwise finitenessYield-syntactic order and quotientEvaluation and variable renaming inregular-tree algebrasVariable exits of unary systemsCompression of variable maps by finiteobservationsContinuity of yields in a context
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.SplitExtremal
    2import Lax369799.ExpandedSyntacticAlgebra
    3
    4/-!
    5---
    6title: Parallel replacements in accepting contexts
    7type: theorem
    8---
    9The split extremal witness is a parallel tuple of unary values. It lies
    10below the original value and preserves acceptance in the chosen context.
    11This is an existence result for accepting contexts, not a normal form for
    12all deterministic values.
    13-/
    14namespace Lax369799.ParallelReplacement
    15open RankedSystems (RankedSet)
    16open FinitePresentations FiniteContexts FiniteContextualOrder FiniteAcceptance FiniteSyntacticAlgebra
    17open ExpandedSyntacticAlgebra
    18
    19axiom accepting_parallel {A : RankedSet} (L : Algebras.Language A)
    20 (hL : Algebras.UnfoldInvariantLanguage L) (hrec : Algebras.Recognizable L)
    21 (E : SyntacticAlgebra L) {k : ℕ} (hk : 1 ≤ k)
    22 (C : Context (Carrier (Accepting L)) k 0) (a : Carrier (Accepting L) k)
    23 (ha : AcceptingClass (Accepting L) (E.algebra.eval 0 (plug C (atomic a)))) :
    24 ∃ b : Fin k → Carrier (Accepting L) 1,
    25 ClassBelow (Accepting L) (E.algebra.eval k (ofSetSystem (DeterministicElements.parallel b))) a ∧
    26 AcceptingClass (Accepting L) (E.algebra.eval 0 (plug C
    27 (atomic (E.algebra.eval k (ofSetSystem (DeterministicElements.parallel b))))))
    28
    29end Lax369799.ParallelReplacement
    30
    Show Proof

    Discussion

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

    Loading discussion…