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

Refining runs of the clone table

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

    An accepting run of the recurrent clone table lifts to an accepting run of the original transition table on a system with isomorphic decoding. The direction map is surjective, labels increase along every branch, and the algebraic word condition is monotone.

    Concept map
    71 concepts
    100%
    Algebraic decomposition with boundary dataThe algebraic condition on infinite branchwordsAlgebras and recognitionDeterministic elements and the earlierreplacement propertyClone-automataBounded profiles refine finite contextualequivalenceMonotonicity of algebraic branch conditionsRefining runs of the clone tableCompressed transitions and their cloneclosureContext decomposition with hole boundarydataRelabelling and deterministic contextsubstitutionFinite resolution approximation in a contextSmallification preserving identitycontinuationsDeterministic normal forms with identitycontinuationsUnary continuations of deterministiccontextsContinuity through expanded representativesSyntactic algebras with expanded continuityPlanted normal contexts and deterministicwitnessesYield acceptance of finite presentationsFinite meets in a set-algebraAutomaton 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 presentationsEventual membership in finite familiesFinite 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 congruenceInfinite 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-resolutionsLocally 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 observationsStable factorization with recurrent verticesThe earlier continuity-bearing set-algebrainterfaceSet-algebras with retained verticesSyntactic set-algebras and rankwise finitenessYield-syntactic order and quotientEvaluation and variable renaming inregular-tree algebrasRanked encodings of transition systemsFinite transition systems and bisimulationThe unary semigroup and its actionStable factorization of algebraic branchwordsUnfold-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

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.CloneTransitions
    2import Lax369799.BranchMonotonicity
    3
    4/-!
    5---
    6title: Refining runs of the clone table
    7type: theorem
    8---
    9An accepting run of the recurrent clone table lifts to an accepting run
    10of the original transition table on a system with isomorphic decoding.
    11The direction map is surjective, labels increase along every branch,
    12and the algebraic word condition is monotone.
    13-/
    14namespace Lax369799.CloneRunRefinement
    15open RankedSystems (RankedSet System)
    16open TransitionEncoding UnfoldAutomata SetSystemAlgebras
    17
    18noncomputable def fromTable {P : Type} {Y : RankedSet} [Fintype (Y 1)] [Fintype (Y 0)]
    19 (T : Set P → ∀ n, Set (Fin (n + 1) → Y 1))
    20 (leaves : Set P → Set (Fin (Fintype.card (Y 0))))
    21 (D : WordCondition (Fintype.card (Y 1)) (Fintype.card (Y 0))) :
    22 UnfoldAutomaton (TransitionAlphabet P) where
    23 unary := Fintype.card (Y 1)
    24 nullary := Fintype.card (Y 0)
    25 transition := fun n ν => {b | (fun i => (Fintype.equivFin (Y 1)).symm (b i)) ∈ T ν n}
    26 leafTransition := leaves
    27 condition := D
    28
    29variable {P : Type} {Y : RankedSet} (E : SetAlgebra Y)
    30 [Fintype (Y 1)] [Fintype (Y 0)]
    31 (T : Set P → ∀ n, Set (Fin (n + 1) → Y 1))
    32 (leaves : Set P → Set (Fin (Fintype.card (Y 0))))
    33 (D : WordCondition (Fintype.card (Y 1)) (Fintype.card (Y 0)))
    34 (S : System (TransitionAlphabet P) 0)
    35 (r : Run (CloneTransitions.automaton (CloneTransitions.beta E T) leaves D) S)
    36
    37axiom run_refinement
    38 (hD : Lax369799.BranchMonotonicity.ConditionMonotone E D) (hr : r.Accepting) :
    39 ∃ U : System (TransitionAlphabet P) 0, Isomorphic (decode U) (decode S) ∧
    40 ∃ s : Run (fromTable T leaves D) U, s.Accepting
    41
    42end Lax369799.CloneRunRefinement
    43
    Show 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…