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

Finite yield approximation with supported witnesses

Lax369799.SupportedYieldContinuity · concepts/Lax369799/SupportedYieldContinuity.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 50 for unpruned contexts. Each approximating component records a fully supported system, its variable map, and its initial or root yield witness. The disjoint sum realizes those maps before insertion. Both initial and root target yields retain their original variable map.

    Concept map
    50 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 presentationsVariable renaming and inverse renamingwithout pruningFinite approximation of a flatteningresolutionNormal forms retaining split-variableresolutionsComposition and pullbacks withoutreachability pruningContextual 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 resolutionsLifting unfoldings through variable renamingResolutions and bounded profilesRoot entries in substituted presentationsFinite support for root observationsThe earlier continuity-bearing set-algebrainterfaceSelection and common unfoldings of fullysupported systemsSystems with all output variables reachableFinite yield approximation with supportedwitnessesYields with explicit variable maps and fullsupportSyntactic 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

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

    Lean source view on GitHub

    1import Lax369799.SupportedYields
    2import Lax369799.FiniteYieldContinuity
    3
    4/-!
    5---
    6title: Finite yield approximation with supported witnesses
    7type: theorem
    8---
    9Corollary 50 for unpruned contexts. Each approximating component records
    10a fully supported system, its variable map, and its initial or root
    11yield witness. The disjoint sum realizes those maps before insertion.
    12Both initial and root target yields retain their original variable map.
    13-/
    14
    15namespace Lax369799.SupportedYieldContinuity
    16open RankedSystems FinitePresentations SupportedMorphisms SupportedYields
    17
    18structure Component {A : RankedSet} {n : ℕ} (S : FiniteSystem A n) where
    19 arity : ℕ
    20 system : SupportedSystems.System A arity
    21 variableMap : Fin arity → Fin n
    22 rooted : Bool
    23 yields : if rooted then RootYield S system variableMap else InitialYield S system variableMap
    24
    25def Component.realize {A : RankedSet} {n : ℕ} {S : FiniteSystem A n} (c : Component S) : SetSystem A n :=
    26 if c.rooted then RankedSystems.plant (Renaming.renameSystem c.variableMap c.system.val).val
    27 else (Renaming.renameSystem c.variableMap c.system.val).val
    28
    29noncomputable def realizationSum {A : RankedSet} {n m : ℕ} {S : FiniteSystem A n}
    30 (F : Fin m → Component S) : FiniteSystem A n :=
    31 ofSetSystem (YieldContinuity.finiteSum (fun i => (F i).realize))
    32
    33
    34open FiniteContexts
    35
    36axiom initial_continuity {A : RankedSet} {k n r : ℕ} (C : Context A k n)
    37 (S : FiniteSystem A k) (U : SupportedSystems.System A r) (σ : Fin r → Fin n) :
    38 InitialYield (plug C S) U σ ↔
    39 ∃ (m : ℕ) (F : Fin m → Component S), InitialYield (plug C (realizationSum F)) U σ
    40
    41axiom root_continuity {A : RankedSet} {k n r : ℕ} (C : Context A k n)
    42 (S : FiniteSystem A k) (U : SupportedSystems.System A r) (σ : Fin r → Fin n) :
    43 RootYield (plug C S) U σ ↔
    44 ∃ (m : ℕ) (F : Fin m → Component S), RootYield (plug C (realizationSum F)) U σ
    45
    46end Lax369799.SupportedYieldContinuity
    47
    Show ProofShow 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…