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

Simultaneous deterministic replacements in finite presentations

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

    Marking a vertex gives a context that retains all its incident edges and boundary marks. Iterating the automaton property over the finite vertex set replaces every label by a deterministic value below it and preserves acceptance. No parallel-unary normal form is used.

    Concept map
    53 concepts
    100%
    Algebraic decomposition with boundary dataAlgebras 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 algebraContexts 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 finitepresentationsSimultaneous deterministic replacements infinite presentationsYield continuity for finite-presentationcontextsFinite sums are contextual meetsFlattening and contextsFlattening, resolutions, and yield congruenceFinite support for initial observationsMorphisms, unfoldings, and yieldsBounded profiles in root-free substitutionpatternsBounded 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 observationsThe earlier continuity-bearing set-algebrainterfaceSyntactic set-algebras and rankwise finitenessYield-syntactic order and quotientEvaluation and variable renaming inregular-tree algebrasCompression of variable maps by finiteobservationsContinuity of yields in a context
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on ADescendants are omitted for concepts with more than 10 descendants.
    Evidence

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

    Lean source view on GitHub

    1import Lax369799.ExpandedSyntacticAlgebra
    2
    3/-!
    4---
    5title: Simultaneous deterministic replacements in finite presentations
    6type: theorem
    7---
    8Marking a vertex gives a context that retains all its incident edges and
    9boundary marks. Iterating the automaton property over the finite vertex
    10set replaces every label by a deterministic value below it and preserves
    11acceptance. No parallel-unary normal form is used.
    12-/
    13namespace Lax369799.FiniteVertexReplacement
    14open RankedSystems (RankedSet)
    15open FinitePresentations FiniteContexts FiniteContextualOrder FiniteAcceptance
    16open FiniteSyntacticAlgebra ExpandedSyntacticAlgebra
    17
    18axiom vertex_context {A B : RankedSet} {n : ℕ} (P : FiniteSystem B n)
    19 (q : ∀ v : P.Vertex, A (P.graph.label v).1) (v : P.Vertex) :
    20 ∃ C : Context A (P.graph.label v).1 n,
    21 ∀ r : ∀ w : P.Vertex, A (P.graph.label w).1,
    22 (∀ w, w ≠ v → q w = r w) →
    23 Isomorphic (plug C (atomic (r v))) (withLabels P r)
    24
    25axiom simultaneous_replacement {A B : RankedSet} (L : Algebras.Language A)
    26 (hL : Algebras.UnfoldInvariantLanguage L) (hrec : Algebras.Recognizable L)
    27 (E : SyntacticAlgebra L) (P : FiniteSystem B 0)
    28 (q : ∀ v : P.Vertex, Carrier (Accepting L) (P.graph.label v).1)
    29 (hq : AcceptingClass (Accepting L) (E.algebra.eval 0 (withLabels P q))) :
    30 ∃ r : ∀ v : P.Vertex, Carrier (Accepting L) (P.graph.label v).1,
    31 (∀ v, FiniteExtremal.Deterministic E.algebra (r v) ∧ ClassBelow (Accepting L) (r v) (q v)) ∧
    32 AcceptingClass (Accepting L) (E.algebra.eval 0 (withLabels P r))
    33
    34end Lax369799.FiniteVertexReplacement
    35
    Show ProofShow Proof

    Discussion

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

    Loading discussion…