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

Parallel transitions with selected unary components

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

    Refine the components of an accepting parallel tuple one at a time. Rank-one extremal replacement preserves acceptance and decreases each component. Consequently the parallel transition inequality is retained, and every resulting component preserves binary choices of closed continuations.

    Concept map
    61 concepts; 6 descendants hidden
    100%
    Algebraic decomposition with boundary dataAlgebras and recognitionDeterministic elements and the earlierreplacement propertyBounded profiles refine finite contextualequivalenceUnary types preserving explicit choicesContext 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 deterministicwitnessesUnary types selected by extremal refinementYield acceptance of finite presentationsAutomaton property of the unprunedsyntactic algebraFinite-state evaluation of terminating branchwordsContexts 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 observationsChoice preservation of extremally selectedunary typesParallel transitions with selected unarycomponentsThe 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.SelectedChoicePreservation
    2import Lax369799.ParallelReplacement
    3
    4/-!
    5---
    6title: Parallel transitions with selected unary components
    7type: theorem
    8---
    9Refine the components of an accepting parallel tuple one at a time.
    10Rank-one extremal replacement preserves acceptance and decreases each
    11component. Consequently the parallel transition inequality is retained,
    12and every resulting component preserves binary choices of closed
    13continuations.
    14-/
    15namespace Lax369799.SelectedParallel
    16open RankedSystems (RankedSet)
    17open FinitePresentations FiniteContexts FiniteContextualOrder FiniteAcceptance
    18open FiniteSyntacticAlgebra ExpandedSyntacticAlgebra
    19
    20axiom accepting_parallel {A : RankedSet} (L : Algebras.Language A)
    21 (hL : Algebras.UnfoldInvariantLanguage L) (hrec : Algebras.Recognizable L)
    22 (E : SyntacticAlgebra L) {k : ℕ} (hk : 1 ≤ k)
    23 (C : Context (Carrier (Accepting L)) k 0) (a : Carrier (Accepting L) k)
    24 (ha : AcceptingClass (Accepting L) (E.algebra.eval 0 (plug C (atomic a)))) :
    25 ∃ b : Fin k → Carrier (Accepting L) 1,
    26 (∀ i, ExtremalUnaryTypes.Selected L E (b i)) ∧
    27 ClassBelow (Accepting L) (E.algebra.eval k (ofSetSystem (DeterministicElements.parallel b))) a ∧
    28 AcceptingClass (Accepting L) (E.algebra.eval 0 (plug C
    29 (atomic (E.algebra.eval k (ofSetSystem (DeterministicElements.parallel b))))))
    30
    31end Lax369799.SelectedParallel
    32
    Show Proof

    Discussion

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

    Loading discussion…