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

Functional restrictions of selected unary graphs

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

    In a finite unary/nullary presentation, selected unary labels allow each outgoing target set to be split independently. Acceptance is equivalent to acceptance of all functional restrictions, including in the presence of cycles. Restrictions retain all vertices and all initial/root marks.

    Concept map
    59 concepts; 5 descendants hidden
    100%
    Algebraic decomposition with boundary dataAlgebras and recognitionDeterministic elements and the earlierreplacement propertyBounded profiles refine finite contextualequivalenceSplitting 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 deterministiccontextsContinuity through expanded representativesSyntactic algebras with expanded continuityPlanted normal contexts and deterministicwitnessesUnary types selected by extremal refinementYield 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 presentationsUnions of initial and root marksMorphisms 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 congruenceFunctional restrictions of selected unarygraphsFinite 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-algebrainterfaceExtremal witnesses with separate rootedcomponentsSyntactic set-algebras and rankwise finitenessYield-syntactic order and quotientEvaluation and variable renaming inregular-tree algebrasVariable exits of unary systemsCompression of variable maps by finiteobservationsContinuity of yields in a context
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

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

    Lean source view on GitHub

    1import Lax369799.ContextChoices
    2
    3/-!
    4---
    5title: Functional restrictions of selected unary graphs
    6type: theorem
    7---
    8In a finite unary/nullary presentation, selected unary labels allow each
    9outgoing target set to be split independently. Acceptance is equivalent
    10to acceptance of all functional restrictions, including in the presence
    11of cycles. Restrictions retain all vertices and all initial/root marks.
    12-/
    13namespace Lax369799.GraphChoices
    14open RankedSystems (RankedSet)
    15open FinitePresentations FiniteContexts FiniteContextualOrder FiniteAcceptance
    16open FiniteSyntacticAlgebra ExpandedSyntacticAlgebra
    17
    18noncomputable def restrictRow {A : RankedSet} (P : FiniteSystem A 0)
    19 (v : P.Vertex) (p : Set P.Vertex) : FiniteSystem A 0 where
    20 size := P.size
    21 graph := { P.graph with
    22 edge := fun w d t => P.graph.edge w d t ∧
    23 (w = v → match t with | .inl u => p u | .inr _ => False)
    24 direction_valid := fun w d t h => P.graph.direction_valid w d t h.1 }
    25
    26
    27noncomputable def chooseRows {A : RankedSet} (P : FiniteSystem A 0)
    28 (s : Finset P.Vertex) (f : P.Vertex → P.Vertex) : FiniteSystem A 0 where
    29 size := P.size
    30 graph := { P.graph with
    31 edge := fun v d t => P.graph.edge v d t ∧ (v ∈ s → t = .inl (f v))
    32 direction_valid := fun v d t h => P.graph.direction_valid v d t h.1 }
    33
    34
    35axiom row_choices {A : RankedSet} (L : Algebras.Language A)
    36 (E : SyntacticAlgebra L) (P : FiniteSystem (Carrier (Accepting L)) 0)
    37 (v : P.Vertex) (hv : (P.graph.label v).1 = 1)
    38 (hs : ExtremalUnaryTypes.Selected L E (hv ▸ (P.graph.label v).2)) :
    39 AcceptingClass (Accepting L) (E.algebra.eval 0 P) ↔
    40 ∀ w : P.Vertex, AcceptingClass (Accepting L)
    41 (E.algebra.eval 0 (restrictRow P v {w}))
    42
    43axiom finite_choices {A : RankedSet} (L : Algebras.Language A)
    44 (E : SyntacticAlgebra L) (P : FiniteSystem (Carrier (Accepting L)) 0)
    45 (hu : ∀ v, (P.graph.label v).1 ≤ 1)
    46 (hs : ∀ v (h : (P.graph.label v).1 = 1),
    47 ExtremalUnaryTypes.Selected L E (h ▸ (P.graph.label v).2))
    48 (s : Finset P.Vertex) :
    49 AcceptingClass (Accepting L) (E.algebra.eval 0 P) ↔
    50 ∀ f : P.Vertex → P.Vertex, AcceptingClass (Accepting L) (E.algebra.eval 0 (chooseRows P s f))
    51
    52axiom chosen_functional {A : RankedSet} (P : FiniteSystem A 0)
    53 (f : P.Vertex → P.Vertex) (v : P.Vertex) (d : ℕ) (t u : P.Vertex ⊕ Fin 0)
    54 (ht : (chooseRows P Finset.univ f).graph.edge v d t)
    55 (hu : (chooseRows P Finset.univ f).graph.edge v d u) : t = u
    56
    57def Admissible {A : RankedSet} (P : FiniteSystem A 0) (f : P.Vertex → P.Vertex) : Prop :=
    58 ∀ v, (∃ d w, P.graph.edge v d (.inl w)) → ∃ d, P.graph.edge v d (.inl (f v))
    59
    60
    61axiom admissible_test {A : RankedSet} (L : Algebras.Language A)
    62 (E : SyntacticAlgebra L) (P : FiniteSystem (Carrier (Accepting L)) 0)
    63 (hu : ∀ v, (P.graph.label v).1 ≤ 1)
    64 (hs : ∀ v (h : (P.graph.label v).1 = 1),
    65 ExtremalUnaryTypes.Selected L E (h ▸ (P.graph.label v).2)) :
    66 AcceptingClass (Accepting L) (E.algebra.eval 0 P) ↔
    67 ∀ f : P.Vertex → P.Vertex, Admissible P f →
    68 AcceptingClass (Accepting L) (E.algebra.eval 0 (chooseRows P Finset.univ f))
    69
    70end Lax369799.GraphChoices
    71
    Show ProofShow ProofShow ProofShow Proof
    Builds on
    Used by
    From Mathlib

    none

    Discussion

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

    Loading discussion…