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

Splitting outgoing choices in cyclic unary contexts

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

    Restrict the outgoing edges of the hole to a set of target vertices. For a selected unary value, acceptance for a union of targets is equivalent to acceptance for both restrictions. The context may contain feedback, roots, and a self-loop at the hole; every vertex is retained.

    Concept map
    58 concepts; 6 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 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-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 3 statements. Each proof establishes one of them relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.ExtremalUnaryTypes
    2import Lax369799.FiniteMarkUnion
    3
    4/-!
    5---
    6title: Splitting outgoing choices in cyclic unary contexts
    7type: theorem
    8---
    9Restrict the outgoing edges of the hole to a set of target vertices.
    10For a selected unary value, acceptance for a union of targets is
    11equivalent to acceptance for both restrictions. The context may contain
    12feedback, roots, and a self-loop at the hole; every vertex is retained.
    13-/
    14namespace Lax369799.ContextChoices
    15open RankedSystems (RankedSet)
    16open FinitePresentations FiniteContexts FiniteContextualOrder FiniteAcceptance
    17open FiniteDecomposition FiniteSyntacticAlgebra ExpandedSyntacticAlgebra
    18
    19noncomputable def restrict {A : RankedSet} {k : ℕ} (C : Context A k 0)
    20 (p : Set C.system.Vertex) : Context A k 0 where
    21 system := {
    22 size := C.system.size
    23 graph := { C.system.graph with
    24 edge := fun v d t => C.system.graph.edge v d t ∧
    25 (v = holeVertex C → match t with | .inl w => p w | .inr _ => False)
    26 direction_valid := fun v d t h => C.system.graph.direction_valid v d t h.1 } }
    27 one_hole := C.one_hole
    28
    29axiom accepting_union {A : RankedSet} (L : Algebras.Language A)
    30 (E : SyntacticAlgebra L) (b : Carrier (Accepting L) 1)
    31 (hb : ExtremalUnaryTypes.Selected L E b)
    32 (C : Context (Carrier (Accepting L)) 1 0) (p q : Set C.system.Vertex) :
    33 AcceptingClass (Accepting L) (E.algebra.eval 0 (plug (restrict C (p ∪ q)) (atomic b))) ↔
    34 AcceptingClass (Accepting L) (E.algebra.eval 0 (plug (restrict C p) (atomic b))) ∧
    35 AcceptingClass (Accepting L) (E.algebra.eval 0 (plug (restrict C q) (atomic b)))
    36
    37axiom accepting_finite {A : RankedSet} (L : Algebras.Language A)
    38 (E : SyntacticAlgebra L) (b : Carrier (Accepting L) 1)
    39 (hb : ExtremalUnaryTypes.Selected L E b)
    40 (C : Context (Carrier (Accepting L)) 1 0) (s : Finset C.system.Vertex) (hs : s.Nonempty) :
    41 AcceptingClass (Accepting L) (E.algebra.eval 0 (plug (restrict C (↑s)) (atomic b))) ↔
    42 ∀ v ∈ s, AcceptingClass (Accepting L)
    43 (E.algebra.eval 0 (plug (restrict C {v}) (atomic b)))
    44
    45axiom accepting_all_choices {A : RankedSet} (L : Algebras.Language A)
    46 (E : SyntacticAlgebra L) (b : Carrier (Accepting L) 1)
    47 (hb : ExtremalUnaryTypes.Selected L E b)
    48 (C : Context (Carrier (Accepting L)) 1 0) :
    49 AcceptingClass (Accepting L) (E.algebra.eval 0 (plug C (atomic b))) ↔
    50 ∀ v : C.system.Vertex, AcceptingClass (Accepting L)
    51 (E.algebra.eval 0 (plug (restrict C {v}) (atomic b)))
    52
    53end Lax369799.ContextChoices
    54
    Show ProofShow ProofShow Proof

    Discussion

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

    Loading discussion…