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

Acceptance certificates retaining expanded resolutions

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

    A certificate chooses a deterministic value below each vertex label and representatives for the chosen values. It requires acceptance of all yields of the expanded presentation. This is a characterization of acceptance, not yet a finite-state branch condition.

    Concept map
    54 concepts; 6 descendants hidden
    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 deterministiccontextsAcceptance certificates retaining expandedresolutionsContinuity 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 A
    Evidence

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

    Lean source view on GitHub

    1import Lax369799.FiniteVertexReplacement
    2
    3/-!
    4---
    5title: Acceptance certificates retaining expanded resolutions
    6type: theorem
    7---
    8A certificate chooses a deterministic value below each vertex label and
    9representatives for the chosen values. It requires acceptance of all yields
    10of the expanded presentation. This is a characterization of acceptance,
    11not yet a finite-state branch condition.
    12-/
    13namespace Lax369799.ExpandedCertificates
    14open RankedSystems (RankedSet System trim)
    15open FinitePresentations FiniteContextualOrder FiniteAcceptance FiniteSyntacticAlgebra
    16open ExpandedSyntacticAlgebra ExpandedContinuity
    17
    18structure Certificate {A B : RankedSet} (L : Algebras.Language A)
    19 (E : SyntacticAlgebra L) (P : FiniteSystem B 0)
    20 (q : ∀ v : P.Vertex, Carrier (Accepting L) (P.graph.label v).1) where
    21 labels : ∀ v : P.Vertex, Carrier (Accepting L) (P.graph.label v).1
    22 local_choice : ∀ v, FiniteExtremal.Deterministic E.algebra (labels v) ∧
    23 ClassBelow (Accepting L) (labels v) (q v)
    24 representatives : Representatives L (withLabels P labels)
    25 represents : Represents L (withLabels P labels) representatives
    26 accepts : ∀ T, Morphisms.Yield (trim (expansion L (withLabels P labels) representatives).graph) T →
    27 Admissible L T
    28
    29axiom acceptance_iff_certificate {A B : RankedSet} (L : Algebras.Language A)
    30 (hL : Algebras.UnfoldInvariantLanguage L) (hrec : Algebras.Recognizable L)
    31 (E : SyntacticAlgebra L) (P : FiniteSystem B 0)
    32 (q : ∀ v : P.Vertex, Carrier (Accepting L) (P.graph.label v).1) :
    33 AcceptingClass (Accepting L) (E.algebra.eval 0 (withLabels P q)) ↔
    34 Nonempty (Certificate L E P q)
    35
    36axiom input_evaluation {A : RankedSet} (L : Algebras.Language A)
    37 (E : SyntacticAlgebra L) {n : ℕ} (S : FiniteSystem A n) :
    38 E.algebra.eval n (relabel (fun k a => quotientMap (Accepting L) k (atomic a)) S) =
    39 quotientMap (Accepting L) n S
    40
    41axiom language_iff_certificate {A : RankedSet} (L : Algebras.Language A)
    42 (hL : Algebras.UnfoldInvariantLanguage L) (hrec : Algebras.Recognizable L)
    43 (E : SyntacticAlgebra L) (S : System A 0) :
    44 S ∈ L ↔ Nonempty (Certificate L E (ofSetSystem S.val)
    45 (fun v => quotientMap (Accepting L) _ (atomic (S.val.graph.label v).2)))
    46
    47end Lax369799.ExpandedCertificates
    48
    Show ProofShow ProofShow Proof

    Discussion

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

    Loading discussion…