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

Unary presentations associated with legal runs

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

    Replace each internal vertex by its chosen parallel tuple and each leaf by its nullary value, then flatten. The resulting unary/nullary presentation has the value of the evaluated run. Its path and cycle observations inherit acceptance through presentation morphisms.

    Concept map
    70 concepts; 4 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 choicesSplitting 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 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 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 finitepresentationsSimultaneous deterministic replacements infinite presentationsYield 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-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 observationsUnary presentations associated with legalrunsChoice 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.ExpandedTransitions
    2import Lax369799.GraphChoices
    3
    4/-!
    5---
    6title: Unary presentations associated with legal runs
    7type: theorem
    8---
    9Replace each internal vertex by its chosen parallel tuple and each leaf by
    10its nullary value, then flatten. The resulting unary/nullary presentation
    11has the value of the evaluated run. Its path and cycle observations inherit
    12acceptance through presentation morphisms.
    13-/
    14namespace Lax369799.RunPresentations
    15open RankedSystems (RankedSet System)
    16open FinitePresentations FiniteContextualOrder FiniteAcceptance FiniteSyntacticAlgebra
    17open ExpandedSyntacticAlgebra UnfoldAutomata ExpandedTransitions
    18
    19noncomputable def piece {A : RankedSet} (L : Algebras.Language A)
    20 [Fintype (Carrier (Accepting L) 1)] [Fintype (Carrier (Accepting L) 0)]
    21 (E : SyntacticAlgebra L)
    22 (D : WordCondition (Fintype.card (Carrier (Accepting L) 1))
    23 (Fintype.card (Carrier (Accepting L) 0)))
    24 {S : System A 0} (r : Labelling (Fintype.card (Carrier (Accepting L) 1))
    25 (Fintype.card (Carrier (Accepting L) 0)) S) (v : S.val.Vertex) :
    26 FiniteSystem (Carrier (Accepting L)) (Rank S v) :=
    27 if Rank S v = 0 then atomic (runLabel L E D r v)
    28 else ofSetSystem (DeterministicElements.parallel
    29 (fun i => (Fintype.equivFin (Carrier (Accepting L) 1)).symm (r.edgeType v i)))
    30
    31noncomputable def presentation {A : RankedSet} (L : Algebras.Language A)
    32 [Fintype (Carrier (Accepting L) 1)] [Fintype (Carrier (Accepting L) 0)]
    33 (E : SyntacticAlgebra L)
    34 (D : WordCondition (Fintype.card (Carrier (Accepting L) 1))
    35 (Fintype.card (Carrier (Accepting L) 0)))
    36 {S : System A 0} (r : Labelling (Fintype.card (Carrier (Accepting L) 1))
    37 (Fintype.card (Carrier (Accepting L) 0)) S) : FiniteSystem (Carrier (Accepting L)) 0 :=
    38 flatten (withLabels (ofSetSystem S.val) (piece L E D r))
    39
    40axiom evaluation {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) :
    47 E.algebra.eval 0 (presentation L E D r) =
    48 E.algebra.eval 0 (withLabels (ofSetSystem S.val) (runLabel L E D r))
    49
    50axiom unary {A : RankedSet} (L : Algebras.Language A)
    51 [Fintype (Carrier (Accepting L) 1)] [Fintype (Carrier (Accepting L) 0)]
    52 (E : SyntacticAlgebra L)
    53 (D : WordCondition (Fintype.card (Carrier (Accepting L) 1))
    54 (Fintype.card (Carrier (Accepting L) 0)))
    55 {S : System A 0} (r : Labelling (Fintype.card (Carrier (Accepting L) 1))
    56 (Fintype.card (Carrier (Accepting L) 0)) S) :
    57 ∀ v, ((presentation L E D r).graph.label v).1 ≤ 1
    58
    59axiom observation_accepting {A : RankedSet} (L : Algebras.Language A)
    60 [Fintype (Carrier (Accepting L) 1)] [Fintype (Carrier (Accepting L) 0)]
    61 (E : SyntacticAlgebra L)
    62 (D : WordCondition (Fintype.card (Carrier (Accepting L) 1))
    63 (Fintype.card (Carrier (Accepting L) 0)))
    64 {S : System A 0} (r : Labelling (Fintype.card (Carrier (Accepting L) 1))
    65 (Fintype.card (Carrier (Accepting L) 0)) S)
    66 (hr : AcceptingClass (Accepting L) (E.algebra.eval 0
    67 (withLabels (ofSetSystem S.val) (runLabel L E D r))))
    68 (T : FiniteSystem (Carrier (Accepting L)) 0)
    69 (f : FiniteMorphisms.Morphism T (presentation L E D r)) :
    70 AcceptingClass (Accepting L) (E.algebra.eval 0 T)
    71
    72axiom selected {A : RankedSet} (L : Algebras.Language A)
    73 [Fintype (Carrier (Accepting L) 1)] [Fintype (Carrier (Accepting L) 0)]
    74 (E : SyntacticAlgebra L)
    75 (D : WordCondition (Fintype.card (Carrier (Accepting L) 1))
    76 (Fintype.card (Carrier (Accepting L) 0)))
    77 {S : System A 0} (r : Run (automaton L E D) S) :
    78 ∀ v (h : ((presentation L E D r.toLabelling).graph.label v).1 = 1),
    79 ExtremalUnaryTypes.Selected L E (h ▸ ((presentation L E D r.toLabelling).graph.label v).2)
    80
    81axiom functional_test {A : RankedSet} (L : Algebras.Language A)
    82 [Fintype (Carrier (Accepting L) 1)] [Fintype (Carrier (Accepting L) 0)]
    83 (E : SyntacticAlgebra L)
    84 (D : WordCondition (Fintype.card (Carrier (Accepting L) 1))
    85 (Fintype.card (Carrier (Accepting L) 0)))
    86 {S : System A 0} (r : Run (automaton L E D) S) :
    87 AcceptingClass (Accepting L) (E.algebra.eval 0
    88 (withLabels (ofSetSystem S.val) (runLabel L E D r.toLabelling))) ↔
    89 ∀ f : (presentation L E D r.toLabelling).Vertex → (presentation L E D r.toLabelling).Vertex,
    90 GraphChoices.Admissible (presentation L E D r.toLabelling) f →
    91 AcceptingClass (Accepting L) (E.algebra.eval 0
    92 (GraphChoices.chooseRows (presentation L E D r.toLabelling) Finset.univ f))
    93
    94end Lax369799.RunPresentations
    95
    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…