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

Word acceptance and evaluation of algebraic runs

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

    For the algebraic unfold-automaton, legal runs expand into root-free reachable unary presentations with no blocked unary vertex. Projecting their branches back to the input preserves the run's word labels. The algebraic branch condition therefore makes a run accepting exactly when the evaluated run value is accepted (Lemmas 104–105).

    Concept map
    81 concepts
    100%
    A common condition for finite and infinitealgebraic branch wordsAlgebraic decomposition with boundary dataThe algebraic condition on infinite branchwordsAlgebraic transition tables forunfold-automataAlgebras and recognitionDeterministic elements and the earlierreplacement propertyBounded profiles refine finite contextualequivalenceUnary types preserving explicit choicesCombining finite and infinite branchconditionsSplitting outgoing choices in cyclic unarycontextsContext 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 deterministiccontextsAcceptance certificates retaining expandedresolutionsContinuity through expanded representativesSyntactic algebras with expanded continuityTransition tables for the algebra withexpanded 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 presentationsUnions of initial and root marksMorphisms 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 finitepresentationsSimultaneous deterministic replacements infinite presentationsYield continuity for finite-presentationcontextsFinite sums are contextual meetsFlattening and contextsFlattening, resolutions, and yield congruenceFunctional restrictions of selected unarygraphsInfinite Ramsey theorem for pairsFinite support for initial observationsMorphisms, unfoldings, and yieldsBounded profiles in root-free substitutionpatternsDeterminization of infinite-word automataRegular infinite products of linked pairsBounded 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 observationsWord acceptance and evaluation of algebraicrunsUnary presentations associated with legalrunsChoice preservation of extremally selectedunary typesParallel transitions with selected unarycomponentsStable factorization with recurrent verticesThe earlier continuity-bearing set-algebrainterfaceExtremal witnesses with separate rootedcomponentsSyntactic set-algebras and rankwise finitenessYield-syntactic order and quotientEvaluation and variable renaming inregular-tree algebrasThe unary semigroup and its actionStable factorization of algebraic branchwordsVariable exits of unary systemsUnfold-automata and regular-tree acceptanceCompression of variable maps by finiteobservationsIdempotent factorization of infinite wordsContinuity of yields in a context
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

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

    2 evaluated_run_accepting proven

    Lean source view on GitHub

    1import Lax369799.AlgebraicBranchCondition
    2import Lax369799.RunPresentations
    3
    4/-!
    5---
    6title: Word acceptance and evaluation of algebraic runs
    7type: theorem
    8---
    9For the algebraic unfold-automaton, legal runs expand into root-free
    10reachable unary presentations with no blocked unary vertex. Projecting
    11their branches back to the input preserves the run's word labels. The
    12algebraic branch condition therefore makes a run accepting exactly when
    13the evaluated run value is accepted (Lemmas 104–105).
    14-/
    15
    16namespace Lax369799.RunAcceptance
    17open RankedSystems (RankedSet System)
    18open FinitePresentations FiniteContextualOrder FiniteAcceptance FiniteSyntacticAlgebra
    19open ExpandedSyntacticAlgebra UnfoldAutomata ExpandedTransitions RunPresentations
    20
    21def WordCorrect {A : RankedSet} (L : Algebras.Language A)
    22 [Fintype (Carrier (Accepting L) 1)] [Fintype (Carrier (Accepting L) 0)]
    23 (E : SyntacticAlgebra L)
    24 (D : WordCondition (Fintype.card (Carrier (Accepting L) 1))
    25 (Fintype.card (Carrier (Accepting L) 0))) : Prop :=
    26 (∀ w a, D.AcceptsFinite w a ↔ AcceptingClass (Accepting L)
    27 (FiniteBranchWords.value E.algebra (w.map (Fintype.equivFin (Carrier (Accepting L) 1)).symm)
    28 ((Fintype.equivFin (Carrier (Accepting L) 0)).symm a))) ∧
    29 (∀ w, D.AcceptsInfinite w ↔ AlgebraicOmegaWords.Accepts E.algebra
    30 {a | AcceptingClass (Accepting L) a}
    31 (fun n => (Fintype.equivFin (Carrier (Accepting L) 1)).symm (w n)))
    32
    33axiom exists_condition {A : RankedSet} (L : Algebras.Language A)
    34 [Fintype (Carrier (Accepting L) 1)] [Fintype (Carrier (Accepting L) 0)]
    35 (E : SyntacticAlgebra L) :
    36 ∃ D : WordCondition (Fintype.card (Carrier (Accepting L) 1))
    37 (Fintype.card (Carrier (Accepting L) 0)), WordCorrect L E D
    38
    39section
    40variable {A : RankedSet} (L : Algebras.Language A)
    41 [Fintype (Carrier (Accepting L) 1)] [Fintype (Carrier (Accepting L) 0)]
    42 (E : SyntacticAlgebra L)
    43 (D : WordCondition (Fintype.card (Carrier (Accepting L) 1))
    44 (Fintype.card (Carrier (Accepting L) 0)))
    45 {S : System A 0} (r : Run (automaton L E D) S)
    46
    47axiom shape :
    48 (presentation L E D r.toLabelling).graph.root = ∅ ∧ Reachable (presentation L E D r.toLabelling) ∧
    49 ∀ v, ((presentation L E D r.toLabelling).graph.label v).1 = 1 →
    50 ∃ w, (presentation L E D r.toLabelling).graph.edge v 0 (.inl w)
    51
    52axiom accepting_run_value (hL : Algebras.UnfoldInvariantLanguage L) (hrec : Algebras.Recognizable L)
    53 (hD : WordCorrect L E D) (hr : r.Accepting) :
    54 AcceptingClass (Accepting L) (E.algebra.eval 0
    55 (withLabels (ofSetSystem S.val) (runLabel L E D r.toLabelling)))
    56
    57axiom evaluated_run_accepting (hD : WordCorrect L E D)
    58 (hr : AcceptingClass (Accepting L) (E.algebra.eval 0
    59 (withLabels (ofSetSystem S.val) (runLabel L E D r.toLabelling)))) : r.Accepting
    60
    61axiom evaluated_run_iff (hL : Algebras.UnfoldInvariantLanguage L) (hrec : Algebras.Recognizable L)
    62 (hD : WordCorrect L E D) : r.Accepting ↔
    63 AcceptingClass (Accepting L) (E.algebra.eval 0
    64 (withLabels (ofSetSystem S.val) (runLabel L E D r.toLabelling)))
    65
    66/-- Accepted evaluation implies word acceptance without transition legality. -/
    67axiom labelling_accepting (r : Labelling (Fintype.card (Carrier (Accepting L) 1))
    68 (Fintype.card (Carrier (Accepting L) 0)) S) (hD : WordCorrect L E D)
    69 (hr : AcceptingClass (Accepting L) (E.algebra.eval 0
    70 (withLabels (ofSetSystem S.val) (runLabel L E D r)))) : r.Accepting D
    71
    72end
    73
    74end Lax369799.RunAcceptance
    75
    Show ProofShow ProofShow ProofShow ProofShow 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…