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

Continuity of yields in a context

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

    Corollary 46 of arXiv v6 (Corollary 50 in the revised manuscript), using the earlier reachable interface: every yield of a substituted context occurs when the hole is replaced by a finite sum of yields of its label. Conversely, every such finite sum gives only yields of the original substitution. The sum stays inside the context, preserving independent choices at different occurrences. Finite indexed families allow repetitions.

    Concept map
    37 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 finitepresentationsFlattening and contextsFlattening, resolutions, and yield congruenceMorphisms, unfoldings, and yieldsBounded optimal flatten-resolutionsLocally surjective maps of finitepresentationsTransfer 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 profilesThe 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

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.ContextResolutionApproximation
    2
    3/-!
    4---
    5title: Continuity of yields in a context
    6type: theorem
    7---
    8Corollary 46 of arXiv v6 (Corollary 50 in the revised manuscript), using
    9the earlier reachable interface: every yield of a substituted context occurs when
    10the hole is replaced by a finite sum of yields of its label. Conversely,
    11every such finite sum gives only yields of the original substitution.
    12The sum stays inside the context, preserving independent choices at
    13different occurrences. Finite indexed families allow repetitions.
    14-/
    15namespace Lax369799.YieldContinuity
    16open RankedSystems Morphisms Flattening
    17
    18def sumGraph {A : RankedSet} {n : ℕ} {I : Type} (F : I → SetSystem A n) :
    19 Presentation A n ((i : I) × (F i).Vertex) where
    20 label := fun v => (F v.1).graph.label v.2
    21 initial := fun v => (F v.1).graph.initial v.2
    22 root := fun v => (F v.1).graph.root v.2
    23 edge := fun v d t => ∃ s, (F v.1).graph.edge v.2 d s ∧ t = Sum.map (Sigma.mk v.1) id s
    24 direction_valid := by rintro v d t ⟨s, hs, _⟩; exact (F v.1).graph.direction_valid v.2 d s hs
    25
    26noncomputable def finiteSum {A : RankedSet} {n : ℕ} {I : Type} [Fintype I]
    27 (F : I → SetSystem A n) : SetSystem A n := trim (sumGraph F)
    28
    29axiom continuity {A : RankedSet} {k n : ℕ}
    30 (C : SetContext A k n) (S : SetSystem A k) (R : SetSystem A n) :
    31 Yield (plug C S) R ↔
    32 ∃ (m : ℕ) (F : Fin m → SetSystem A k),
    33 (∀ i, Yield S (F i)) ∧ Yield (plug C (finiteSum F)) R
    34
    35end Lax369799.YieldContinuity
    36
    Show Proof

    Discussion

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

    Loading discussion…