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

Evaluation of finite unary branch graphs

Lax369799.UnaryGraphEvaluation · concepts/Lax369799/UnaryGraphEvaluation.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 unary graph generated by its initial vertex evaluates like any lasso obtained by cutting its path at a repeated vertex and composing the two nonempty words. Stable factorization proves that its value is accepted exactly when its unfolded word satisfies the algebraic omega condition.

    Concept map
    65 concepts; 1 descendant hidden
    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 finitepresentationsFinite 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 graphsUnfold-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 2 statements. Each proof establishes one of them relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.SetSystemAlgebras
    2import Lax369799.AlgebraicOmegaWords
    3import Lax369799.UnaryChains
    4
    5/-!
    6---
    7title: Evaluation of finite unary branch graphs
    8type: theorem
    9---
    10A finite unary graph generated by its initial vertex evaluates like any
    11lasso obtained by cutting its path at a repeated vertex and composing the
    12two nonempty words. Stable factorization proves that its value is accepted
    13exactly when its unfolded word satisfies the algebraic omega condition.
    14-/
    15
    16namespace Lax369799.UnaryGraphEvaluation
    17open RankedSystems (RankedSet Presentation)
    18open FinitePresentations FiniteSyntacticAlgebra UnaryFactorization SetSystemAlgebras
    19
    20def trace {V : Type} (next : V → V) (start : V) : ℕ → V
    21 | 0 => start
    22 | n + 1 => next (trace next start n)
    23
    24def graph {A : RankedSet} {V : Type} (next : V → V) (start : V) (b : V → A 1) :
    25 Presentation A 0 V where
    26 label := fun v => ⟨1, b v⟩
    27 initial := {start}
    28 root := ∅
    29 edge := fun v d t => d = 0 ∧ t = .inl (next v)
    30 direction_valid := by rintro v d t ⟨rfl, _⟩; exact Nat.zero_lt_one
    31
    32axiom cycle_folding {A : RankedSet} (E : SetAlgebra A)
    33 {V : Type} [Fintype V] (next : V → V) (start : V) (b : V → A 1)
    34 (hreach : ∀ v, ∃ n, trace next start n = v) (m k : ℕ)
    35 (hclose : trace next start (m + k + 2) = trace next start (m + 1)) :
    36 E.eval 0 (enumerate (graph next start b)) = E.eval 0 (lasso
    37 (block E.toAlgebra (b ∘ trace next start) 0 (m + 1))
    38 (block E.toAlgebra (b ∘ trace next start) (m + 1) (m + k + 2)))
    39
    40axiom agreement {A : RankedSet} (E : SetAlgebra A)
    41 (F : Set (A 0)) [Finite (A 1)] {V : Type} [Fintype V]
    42 (next : V → V) (start : V) (b : V → A 1) (hreach : ∀ v, ∃ n, trace next start n = v) :
    43 E.eval 0 (enumerate (graph next start b)) ∈ F ↔
    44 AlgebraicOmegaWords.Accepts E.toAlgebra F (b ∘ trace next start)
    45
    46end Lax369799.UnaryGraphEvaluation
    47
    Show ProofShow Proof

    Discussion

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

    Loading discussion…