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

Yield continuity for finite-presentation contexts

Lax369799.FiniteYieldContinuity · concepts/Lax369799/FiniteYieldContinuity.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 finite approximation of yields also holds for contexts retaining unreachable vertices. Substitution precedes the final reachable restriction, so roots supplied at an unreachable hole remain observable.

    Concept map
    43 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 deterministiccontextsPlanted normal contexts and deterministicwitnessesYield acceptance of finite presentationsContexts over finite presentationsContextual preorders on finite presentationsMorphisms of unpruned finite presentationsFinite presentations without reachabilitypruningSmall profiles of finite presentationsFinite approximation of a flatteningresolutionNormal forms retaining split-variableresolutionsContextual quotient algebras of finitepresentationsYield continuity for finite-presentationcontextsFlattening 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 ADescendants are omitted for concepts with more than 10 descendants.
    Evidence

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

    Lean source view on GitHub

    1import Lax369799.YieldContinuity
    2import Lax369799.FiniteContexts
    3import Lax369799.InitialResolutionApproximation
    4
    5/-!
    6---
    7title: Yield continuity for finite-presentation contexts
    8type: theorem
    9---
    10The finite approximation of yields also holds for contexts retaining
    11unreachable vertices. Substitution precedes the final reachable
    12restriction, so roots supplied at an unreachable hole remain observable.
    13-/
    14namespace Lax369799.FiniteYieldContinuity
    15open RankedSystems Morphisms
    16
    17noncomputable def insert {A : RankedSet} {k n : ℕ}
    18 (C : FiniteContexts.Context A k n) (S : SetSystem A k) : SetSystem A n :=
    19 trim (FiniteContexts.plug C (FinitePresentations.ofSetSystem S)).graph
    20
    21axiom context_mono {A : RankedSet} {k n : ℕ}
    22 (C : FiniteContexts.Context A k n) (S T : SetSystem A k) (h : YieldBelow S T) :
    23 YieldBelow (insert C S) (insert C T)
    24
    25axiom continuity {A : RankedSet} {k n : ℕ}
    26 (C : FiniteContexts.Context A k n) (S : SetSystem A k) (R : SetSystem A n) :
    27 Yield (insert C S) R ↔
    28 ∃ (m : ℕ) (F : Fin m → SetSystem A k),
    29 (∀ i, Yield S (F i)) ∧ Yield (insert C (YieldContinuity.finiteSum F)) R
    30
    31end Lax369799.FiniteYieldContinuity
    32
    Show ProofShow Proof

    Discussion

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

    Loading discussion…