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

The terminating-word condition for algebraic runs

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

    Encode unary actions and the accepting nullary values as finite types. Combining their finite-word evaluator with a parity condition tests finite run paths exactly by algebraic evaluation and retains the given infinite word condition.

    Concept map
    74 concepts
    100%
    Algebraic decomposition with boundary dataAlgebraic 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 finitepresentationsEvaluation of finite path graphsFinite 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 unarygraphsFinite 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 observationsFinite branch observations of a runUnary presentations associated with legalrunsThe terminating-word condition for algebraicrunsChoice 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 systemsUnfold-automata and regular-tree acceptanceCompression of variable maps by finiteobservationsContinuity of yields in a context
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

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

    Lean source view on GitHub

    1import Lax369799.RunBranchObservations
    2import Lax369799.CombinedWordCondition
    3
    4/-!
    5---
    6title: The terminating-word condition for algebraic runs
    7type: theorem
    8---
    9Encode unary actions and the accepting nullary values as finite types.
    10Combining their finite-word evaluator with a parity condition tests finite
    11run paths exactly by algebraic evaluation and retains the given infinite
    12word condition.
    13-/
    14namespace Lax369799.RunWordCondition
    15open RankedSystems (RankedSet System)
    16open FiniteContextualOrder FiniteAcceptance FiniteSyntacticAlgebra ExpandedSyntacticAlgebra
    17open UnfoldAutomata ExpandedTransitions
    18
    19noncomputable def action {A : RankedSet} (L : Algebras.Language A)
    20 [Fintype (Carrier (Accepting L) 1)] [Fintype (Carrier (Accepting L) 0)]
    21 (E : SyntacticAlgebra L) :
    22 Fin (Fintype.card (Carrier (Accepting L) 1)) →
    23 Fin (Fintype.card (Carrier (Accepting L) 0)) → Fin (Fintype.card (Carrier (Accepting L) 0)) :=
    24 fun b a => (Fintype.equivFin (Carrier (Accepting L) 0)) (FiniteBranchWords.act E.algebra
    25 ((Fintype.equivFin (Carrier (Accepting L) 1)).symm b)
    26 ((Fintype.equivFin (Carrier (Accepting L) 0)).symm a))
    27
    28noncomputable def finalCodes {A : RankedSet} (L : Algebras.Language A)
    29 [Fintype (Carrier (Accepting L) 0)] : Set (Fin (Fintype.card (Carrier (Accepting L) 0))) :=
    30 {a | AcceptingClass (Accepting L) ((Fintype.equivFin (Carrier (Accepting L) 0)).symm a)}
    31
    32noncomputable def condition {A : RankedSet} (L : Algebras.Language A)
    33 [Fintype (Carrier (Accepting L) 1)] [Fintype (Carrier (Accepting L) 0)]
    34 (E : SyntacticAlgebra L)
    35 (D : WordCondition (Fintype.card (Carrier (Accepting L) 1))
    36 (Fintype.card (Carrier (Accepting L) 0))) :=
    37 CombinedWordCondition.combine D (action L E) (finalCodes L)
    38
    39
    40axiom finite_path_iff {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 (condition L E D)) S)
    46 {k : ℕ} (b : FiniteBranch S k) :
    47 (condition L E D).AcceptsFinite
    48 (List.ofFn (fun i => r.edgeType (b.vertex i.castSucc) (b.direction i)))
    49 (r.leafType (b.vertex (Fin.last k)) b.ends) ↔
    50 AcceptingClass (Accepting L)
    51 (E.algebra.eval 0 (RunBranchObservations.path L E (condition L E D) r.toLabelling b))
    52
    53axiom infinite_iff {A : RankedSet} (L : Algebras.Language A)
    54 [Fintype (Carrier (Accepting L) 1)] [Fintype (Carrier (Accepting L) 0)]
    55 (E : SyntacticAlgebra L)
    56 (D : WordCondition (Fintype.card (Carrier (Accepting L) 1))
    57 (Fintype.card (Carrier (Accepting L) 0)))
    58 (w : ℕ → Fin (Fintype.card (Carrier (Accepting L) 1))) :
    59 (condition L E D).AcceptsInfinite w ↔ D.AcceptsInfinite w
    60
    61end Lax369799.RunWordCondition
    62
    Show ProofShow Proof

    Discussion

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

    Loading discussion…