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

Acceptance from finite families of covering components

Lax369799.FiniteCoverFamilies · concepts/Lax369799/FiniteCoverFamilies.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 finite family of presentation maps jointly covers a target if it covers all vertices and marks and lifts every successor at each source vertex. Acceptance of the components implies acceptance of the target.

    Concept map
    53 concepts
    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 deterministiccontextsContinuity 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 orderAcceptance from finite families of coveringcomponentsContext 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 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-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

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.ExpandedSyntacticAlgebra
    2
    3/-!
    4---
    5title: Acceptance from finite families of covering components
    6type: theorem
    7---
    8A finite family of presentation maps jointly covers a target if it covers
    9all vertices and marks and lifts every successor at each source vertex.
    10Acceptance of the components implies acceptance of the target.
    11-/
    12namespace Lax369799.FiniteCoverFamilies
    13open RankedSystems (RankedSet)
    14open FinitePresentations FiniteSyntacticAlgebra FiniteContextualOrder FiniteAcceptance
    15open ExpandedSyntacticAlgebra
    16
    17structure JointCover {A : RankedSet} {m : ℕ} (T : Fin m → FiniteSystem A 0)
    18 (P : FiniteSystem A 0) where
    19 map : ∀ i, FiniteMorphisms.Morphism (T i) P
    20 edges : ∀ i v d t, P.graph.edge ((map i).toFun v) d t →
    21 ∃ s, (T i).graph.edge v d s ∧ Sum.map (map i).toFun id s = t
    22 vertices : ∀ v : P.Vertex, ∃ i w, (map i).toFun w = v
    23 initials : ∀ v, v ∈ P.graph.initial → ∃ i w, w ∈ (T i).graph.initial ∧ (map i).toFun w = v
    24 roots : ∀ v, v ∈ P.graph.root → ∃ i w, w ∈ (T i).graph.root ∧ (map i).toFun w = v
    25
    26
    27axiom acceptance {A : RankedSet} (L : Algebras.Language A)
    28 [Finite (Carrier (Accepting L) 0)] (E : SyntacticAlgebra L)
    29 {m : ℕ} (hm : 0 < m) (T : Fin m → FiniteSystem (Carrier (Accepting L)) 0)
    30 (P : FiniteSystem (Carrier (Accepting L)) 0) (F : JointCover T P)
    31 (hT : ∀ i, AcceptingClass (Accepting L) (E.algebra.eval 0 (T i))) :
    32 AcceptingClass (Accepting L) (E.algebra.eval 0 P)
    33
    34end Lax369799.FiniteCoverFamilies
    35
    Show Proof
    Builds on
    Used by

    none

    From Mathlib

    none

    Discussion

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

    Loading discussion…