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

Transition tables for the algebra with expanded continuity

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

    The split extremal construction supplies parallel transitions in accepting contexts, after rank-one refinement of every component. Legal transitions require these selected unary types, which preserve binary choices of closed continuations. A run assigns their values to the input vertices. Pointwise comparison then transfers acceptance of that evaluated run to the input. Every accepted input also admits a legal run with an accepted evaluated value. The separate implication from a word condition to acceptance of the run value is not assumed here.

    Concept map
    66 concepts; 5 descendants hidden
    100%
    Algebraic decomposition with boundary dataAlgebraic transition tables forunfold-automataAlgebras and recognitionDeterministic elements and the earlierreplacement propertyBounded profiles refine finite contextualequivalenceUnary types preserving explicit choicesContext 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 deterministiccontextsAcceptance certificates retaining expandedresolutionsContinuity through expanded representativesSyntactic algebras with expanded continuityTransition tables for the algebra withexpanded continuityPlanted normal contexts and deterministicwitnessesUnary types selected by extremal refinementYield 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 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-resolutionsParallel replacements in accepting contextsLocally 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 observationsChoice preservation of extremally selectedunary typesParallel transitions with selected unarycomponentsThe 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 systemsUnfold-automata and regular-tree acceptanceCompression of variable maps by finiteobservationsContinuity of yields in a context
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

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

    Lean source view on GitHub

    1import Lax369799.SelectedParallel
    2import Lax369799.AlgebraicTransitions
    3import Lax369799.ExpandedCertificates
    4
    5/-!
    6---
    7title: Transition tables for the algebra with expanded continuity
    8type: theorem
    9---
    10The split extremal construction supplies parallel transitions in accepting
    11contexts, after rank-one refinement of every component. Legal transitions
    12require these selected unary types, which preserve binary choices of closed
    13continuations. A run assigns their values to the input vertices. Pointwise
    14comparison then transfers acceptance of that evaluated run to the input.
    15Every accepted input also admits a legal run with an accepted evaluated
    16value. The separate implication from a word condition to acceptance of
    17the run value is not assumed here.
    18-/
    19namespace Lax369799.ExpandedTransitions
    20open RankedSystems (RankedSet RankedMap System)
    21open FinitePresentations FiniteContextualOrder FiniteAcceptance FiniteSyntacticAlgebra
    22open ExpandedSyntacticAlgebra UnfoldAutomata
    23
    24noncomputable def automaton {A : RankedSet} (L : Algebras.Language A)
    25 [Fintype (Carrier (Accepting L) 1)] [Fintype (Carrier (Accepting L) 0)]
    26 (E : SyntacticAlgebra L)
    27 (D : WordCondition (Fintype.card (Carrier (Accepting L) 1))
    28 (Fintype.card (Carrier (Accepting L) 0))) : UnfoldAutomaton A where
    29 unary := Fintype.card (Carrier (Accepting L) 1)
    30 nullary := Fintype.card (Carrier (Accepting L) 0)
    31 transition := fun n a => {b |
    32 (∀ i, ExtremalUnaryTypes.Selected L E (AlgebraicTransitions.decodeTypes b i)) ∧
    33 ClassBelow (Accepting L)
    34 (E.algebra.eval (n + 1) (ofSetSystem (DeterministicElements.parallel
    35 (AlgebraicTransitions.decodeTypes b)))) (quotientMap (Accepting L) _ (atomic a))}
    36 leafTransition := fun a => {(Fintype.equivFin (Carrier (Accepting L) 0))
    37 (quotientMap (Accepting L) 0 (atomic a))}
    38 condition := D
    39
    40noncomputable def runLabel {A : RankedSet} (L : Algebras.Language A)
    41 [Fintype (Carrier (Accepting L) 1)] [Fintype (Carrier (Accepting L) 0)]
    42 (E : SyntacticAlgebra L)
    43 (D : WordCondition (Fintype.card (Carrier (Accepting L) 1))
    44 (Fintype.card (Carrier (Accepting L) 0)))
    45 {S : System A 0} (r : Labelling (Fintype.card (Carrier (Accepting L) 1))
    46 (Fintype.card (Carrier (Accepting L) 0)) S) (v : S.val.Vertex) :
    47 Carrier (Accepting L) (Rank S v) :=
    48 if h : Rank S v = 0 then h.symm ▸
    49 (Fintype.equivFin (Carrier (Accepting L) 0)).symm (r.leafType v h)
    50 else E.algebra.eval _ (ofSetSystem (DeterministicElements.parallel
    51 (fun i => (Fintype.equivFin (Carrier (Accepting L) 1)).symm (r.edgeType v i))))
    52
    53axiom accepting_transition {A : RankedSet} (L : Algebras.Language A)
    54 (hL : Algebras.UnfoldInvariantLanguage L) (hrec : Algebras.Recognizable L)
    55 [Fintype (Carrier (Accepting L) 1)] [Fintype (Carrier (Accepting L) 0)]
    56 (E : SyntacticAlgebra L)
    57 (D : WordCondition (Fintype.card (Carrier (Accepting L) 1))
    58 (Fintype.card (Carrier (Accepting L) 0)))
    59 (n : ℕ) (a : A (n + 1)) (C : FiniteContexts.Context (Carrier (Accepting L)) (n + 1) 0)
    60 (ha : AcceptingClass (Accepting L) (E.algebra.eval 0 (FiniteContexts.plug C
    61 (atomic (quotientMap (Accepting L) _ (atomic a)))))) :
    62 ∃ b ∈ (automaton L E D).transition n a,
    63 AcceptingClass (Accepting L) (E.algebra.eval 0 (FiniteContexts.plug C
    64 (atomic (E.algebra.eval (n + 1) (ofSetSystem
    65 (DeterministicElements.parallel (AlgebraicTransitions.decodeTypes b)))))))
    66
    67axiom run_label_below {A : RankedSet} (L : Algebras.Language A)
    68 [Fintype (Carrier (Accepting L) 1)] [Fintype (Carrier (Accepting L) 0)]
    69 (E : SyntacticAlgebra L)
    70 (D : WordCondition (Fintype.card (Carrier (Accepting L) 1))
    71 (Fintype.card (Carrier (Accepting L) 0)))
    72 {S : System A 0} (r : Run (automaton L E D) S) (v : S.val.Vertex) :
    73 ClassBelow (Accepting L) (runLabel L E D r.toLabelling v)
    74 (quotientMap (Accepting L) _ (atomic (S.val.graph.label v).2))
    75
    76axiom evaluated_run_sound {A : RankedSet} (L : Algebras.Language A)
    77 (hL : Algebras.UnfoldInvariantLanguage L)
    78 [Fintype (Carrier (Accepting L) 1)] [Fintype (Carrier (Accepting L) 0)]
    79 (E : SyntacticAlgebra L)
    80 (D : WordCondition (Fintype.card (Carrier (Accepting L) 1))
    81 (Fintype.card (Carrier (Accepting L) 0)))
    82 {S : System A 0} (r : Run (automaton L E D) S)
    83 (hr : AcceptingClass (Accepting L)
    84 (E.algebra.eval 0 (withLabels (ofSetSystem S.val) (runLabel L E D r.toLabelling)))) : S ∈ L
    85
    86axiom evaluated_run_exists {A : RankedSet} (L : Algebras.Language A)
    87 (hL : Algebras.UnfoldInvariantLanguage L) (hrec : Algebras.Recognizable L)
    88 [Fintype (Carrier (Accepting L) 1)] [Fintype (Carrier (Accepting L) 0)]
    89 (E : SyntacticAlgebra L)
    90 (D : WordCondition (Fintype.card (Carrier (Accepting L) 1))
    91 (Fintype.card (Carrier (Accepting L) 0)))
    92 (S : System A 0) (hS : S ∈ L) :
    93 ∃ r : Run (automaton L E D) S, AcceptingClass (Accepting L)
    94 (E.algebra.eval 0 (withLabels (ofSetSystem S.val) (runLabel L E D r.toLabelling)))
    95
    96axiom edge_preserves_choices {A : RankedSet} (L : Algebras.Language A)
    97 [Fintype (Carrier (Accepting L) 1)] [Fintype (Carrier (Accepting L) 0)]
    98 (E : SyntacticAlgebra L)
    99 (D : WordCondition (Fintype.card (Carrier (Accepting L) 1))
    100 (Fintype.card (Carrier (Accepting L) 0)))
    101 {S : System A 0} (r : Run (automaton L E D) S) (v : S.val.Vertex) (i : Fin (Rank S v)) :
    102 ChoicePreservingUnary.PreservesChoices E.algebra
    103 ((Fintype.equivFin (Carrier (Accepting L) 1)).symm (r.edgeType v i))
    104
    105end Lax369799.ExpandedTransitions
    106
    Show ProofShow ProofShow ProofShow ProofShow Proof

    Discussion

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

    Loading discussion…