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

Testing infinite runs on finite branch graphs

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

    A finite branch graph unfolds to an ultimately periodic branch, and every ultimately periodic branch has such a presentation. Thus a parity condition holds on all infinite branches exactly when it holds on the unfoldings of all finite branch graphs.

    Concept map
    76 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 choicesSplitting 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 contextsUltimately periodic witnesses in finite paritygraphsLocally surjective maps of finitepresentationsResolution values of finite presentationsTransfer of resolutions through boundedprofilesRanked sets, set-systems, and systemsTesting infinite runs on finite branch graphsRenaming 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 legalrunsChoice 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 acceptancePeriodic branch test for unfold-automataCompression of variable maps by finiteobservationsRecurring priorities in finite-state runsContinuity of yields in a context
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

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

    Lean source view on GitHub

    1import Lax369799.RunBranchObservations
    2import Lax369799.UnfoldBranches
    3
    4/-!
    5---
    6title: Testing infinite runs on finite branch graphs
    7type: theorem
    8---
    9A finite branch graph unfolds to an ultimately periodic branch, and every
    10ultimately periodic branch has such a presentation. Thus a parity condition
    11holds on all infinite branches exactly when it holds on the unfoldings of
    12all finite branch graphs.
    13-/
    14namespace Lax369799.RegularBranchWords
    15open RankedSystems (RankedSet System)
    16open UnfoldAutomata RunBranchObservations
    17
    18def position {A : RankedSet} {S : System A 0} (b : RegularBranch S) : ℕ → Fin b.size
    19 | 0 => b.start
    20 | n + 1 => b.next (position b n)
    21
    22def trace {A : RankedSet} {S : System A 0} (b : RegularBranch S) : InfiniteBranch S where
    23 vertex := fun n => b.vertex (position b n)
    24 direction := fun n => b.direction (position b n)
    25 starts := b.starts
    26 follows := fun n => b.follows (position b n)
    27
    28axiom periodic {A : RankedSet} {S : System A 0} (b : RegularBranch S) :
    29 UnfoldBranches.Periodic (trace b)
    30
    31axiom represents {A : RankedSet} {S : System A 0} (b : InfiniteBranch S)
    32 (hb : UnfoldBranches.Periodic b) :
    33 ∃ c : RegularBranch S, ∀ n,
    34 (⟨(trace c).vertex n, (trace c).direction n⟩ : (v : S.val.Vertex) × Fin (Rank S v)) =
    35 ⟨b.vertex n, b.direction n⟩
    36
    37axiom regular_test {A : RankedSet} (M : UnfoldAutomaton A) (S : System A 0) (r : Run M S) :
    38 (∀ b : RegularBranch S, M.condition.AcceptsInfinite
    39 (fun n => r.edgeType ((trace b).vertex n) ((trace b).direction n))) ↔
    40 (∀ b : InfiniteBranch S, M.condition.AcceptsInfinite
    41 (fun n => r.edgeType (b.vertex n) (b.direction n)))
    42
    43end Lax369799.RegularBranchWords
    44
    Show 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…