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

Unions of initial and root marks

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

    For three presentations with the same labels and edges, union of their initial and root marks evaluates to the meet of the two separate values. The covering map folds the two copies of each vertex together.

    Concept map
    53 concepts; 7 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 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 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-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: Unions of initial and root marks
    6type: theorem
    7---
    8For three presentations with the same labels and edges, union of their
    9initial and root marks evaluates to the meet of the two separate values.
    10The covering map folds the two copies of each vertex together.
    11-/
    12namespace Lax369799.FiniteMarkUnion
    13open RankedSystems (RankedSet Presentation)
    14open FinitePresentations FiniteSyntacticAlgebra FiniteContextualOrder FiniteAcceptance
    15
    16axiom evaluation_union {A : RankedSet} (L : Algebras.Language A)
    17 (E : ExpandedSyntacticAlgebra.SyntacticAlgebra L) {n : ℕ} {V : Type} [Fintype V]
    18 (G H K : Presentation (Carrier (Accepting L)) n V)
    19 (hl : ∀ v, G.label v = K.label v ∧ H.label v = K.label v)
    20 (hi : ∀ v, K.initial v ↔ G.initial v ∨ H.initial v)
    21 (hr : ∀ v, K.root v ↔ G.root v ∨ H.root v)
    22 (he : ∀ v d t, (G.edge v d t ↔ K.edge v d t) ∧ (H.edge v d t ↔ K.edge v d t)) :
    23 E.algebra.eval n (enumerate K) = sumValue E.algebra
    24 (E.algebra.eval n (enumerate G)) (E.algebra.eval n (enumerate H))
    25
    26end Lax369799.FiniteMarkUnion
    27
    Show Proof

    Discussion

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

    Loading discussion…