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

Evaluation of closed contexts through extended unary pieces

Lax369799.ExtendedContextDecomposition · concepts/Lax369799/ExtendedContextDecomposition.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 unary pieces of a closed context, together with their immediate initial/root markers, determine its evaluation for every hole label. This is the algebraic form of context decomposition (Lemmas 44 and 66). Initial and root marks remain distinct, and every vertex of each piece is retained. It applies to arbitrary set-algebras without an assumption that planting preserves acceptance.

    Concept map
    62 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 identitycontinuationsUnary normal form of deterministic elementsDeterministic normal forms with identitycontinuationsUnary continuations of deterministiccontextsContinuity through expanded representativesSyntactic algebras with expanded continuityEvaluation of closed contexts throughextended unary piecesFormal unary pieces and extremal acceptedsituationsPlanted normal contexts and deterministicwitnessesExtremal accepted situations in the syntacticalgebraUnary types selected by extremal refinementYield 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 presentationsFinite iteration of context-preserving localchoicesMorphisms 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-algebrainterfaceSet-algebras with retained verticesExtremal witnesses with separate rootedcomponentsSyntactic set-algebras and rankwise finitenessYield-syntactic order and quotientEvaluation and variable renaming inregular-tree algebrasVariable exits of unary systemsCompression 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.ExtendedContexts
    2import Lax369799.SetSystemAlgebras
    3
    4/-!
    5---
    6title: Evaluation of closed contexts through extended unary pieces
    7type: theorem
    8---
    9The unary pieces of a closed context, together with their immediate
    10initial/root markers, determine its evaluation for every hole label.
    11This is the algebraic form of context decomposition (Lemmas 44 and 66).
    12Initial and root marks remain distinct, and every vertex of each piece
    13is retained. It applies to arbitrary set-algebras without an assumption
    14that planting preserves acceptance.
    15-/
    16
    17namespace Lax369799.ExtendedContextDecomposition
    18open RankedSystems (RankedSet)
    19open FinitePresentations FiniteContexts
    20
    21axiom context_decomposition {A : RankedSet} (E : SetSystemAlgebras.SetAlgebra A)
    22 {k : ℕ} (C : Context A k 0) :
    23 ∃ p : ExtendedContexts.Pieces A k, ∀ a : A k,
    24 E.eval 0 (plug (ExtendedContexts.context p) (atomic a)) = E.eval 0 (plug C (atomic a))
    25
    26end Lax369799.ExtendedContextDecomposition
    27
    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…