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

Algebraic evaluation and the words of a regular branch

Lax369799.UnarySystemEvaluation · concepts/Lax369799/UnarySystemEvaluation.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 closed deterministic system with only unary and nullary labels follows one branch. Its value is accepted exactly when its terminating branch word, or its infinite branch word, satisfies the corresponding algebraic word condition. This includes both chains ending at a nullary vertex and infinite branches represented by finite graphs.

    Concept map
    67 concepts
    100%
    Algebraic decomposition with boundary dataThe algebraic condition on infinite branchwordsAlgebras and recognitionDeterministic elements and the earlierreplacement propertyBounded profiles refine finite contextualequivalenceContext 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 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 finitepresentationsEvaluation of finite path graphsFinite 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 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 algebrasEvaluation of unary chains in every sortThe unary semigroup and its actionStable factorization of algebraic branchwordsEvaluation of finite unary branch graphsAlgebraic evaluation and the words of aregular branchUnfold-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.UnaryGraphEvaluation
    2import Lax369799.UnfoldAutomata
    3import Lax369799.FinitePathEvaluation
    4
    5/-!
    6---
    7title: Algebraic evaluation and the words of a regular branch
    8type: theorem
    9---
    10A closed deterministic system with only unary and nullary labels follows
    11one branch. Its value is accepted exactly when its terminating branch
    12word, or its infinite branch word, satisfies the corresponding algebraic
    13word condition. This includes both chains ending at a nullary vertex and
    14infinite branches represented by finite graphs.
    15-/
    16
    17namespace Lax369799.UnarySystemEvaluation
    18open RankedSystems (RankedSet System)
    19open FinitePresentations FiniteSyntacticAlgebra UnfoldAutomata SetSystemAlgebras
    20
    21def Unary {A : RankedSet} (S : System A 0) : Prop := ∀ v, Rank S v ≤ 1
    22
    23def unaryLabel {A : RankedSet} {S : System A 0} (hu : Unary S)
    24 (v : S.val.Vertex) (d : Fin (Rank S v)) : A 1 := by
    25 have h : Rank S v = 1 := by have := hu v; have := d.isLt; omega
    26 exact h ▸ (S.val.graph.label v).2
    27
    28def finiteWord {A : RankedSet} {S : System A 0} (hu : Unary S)
    29 {k : ℕ} (b : FiniteBranch S k) : List (A 1) :=
    30 List.ofFn (fun i => unaryLabel hu (b.vertex i.castSucc) (b.direction i))
    31
    32def leafValue {A : RankedSet} {S : System A 0} {k : ℕ} (b : FiniteBranch S k) : A 0 :=
    33 b.ends ▸ (S.val.graph.label (b.vertex (Fin.last k))).2
    34
    35def infiniteWord {A : RankedSet} {S : System A 0} (hu : Unary S)
    36 (b : InfiniteBranch S) : ℕ → A 1 := fun n => unaryLabel hu (b.vertex n) (b.direction n)
    37
    38axiom agreement {A : RankedSet} (E : SetAlgebra A)
    39 (F : Set (A 0)) [Finite (A 1)] (S : System A 0) (hu : Unary S) :
    40 E.eval 0 (ofSetSystem S.val) ∈ F ↔
    41 (∀ k (b : FiniteBranch S k), FiniteBranchWords.value E.toAlgebra (finiteWord hu b) (leafValue b) ∈ F) ∧
    42 (∀ b : InfiniteBranch S, AlgebraicOmegaWords.Accepts E.toAlgebra F (infiniteWord hu b))
    43
    44end Lax369799.UnarySystemEvaluation
    45
    Show Proof

    Discussion

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

    Loading discussion…