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

Finite resolution approximation in a context

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

    A direct resolution in a context needs only a finite family of direct resolutions at its hole. Keeping their sum inside the context permits independent choices at different occurrences. This is the approximation behind Corollary 46 of arXiv v6 (Corollary 50 in the revised manuscript), and its consequence for initial yields, using the earlier reachable interface.

    Concept map
    36 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 finiteobservations
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on ADescendants are omitted for concepts with more than 10 descendants.
    Evidence

    Lean source view on GitHub

    1import Lax369799.FiniteResolutionApproximation
    2
    3/-!
    4---
    5title: Finite resolution approximation in a context
    6type: theorem
    7---
    8A direct resolution in a context needs only a finite family of direct
    9resolutions at its hole. Keeping their sum inside the context permits
    10independent choices at different occurrences. This is the approximation
    11behind Corollary 46 of arXiv v6 (Corollary 50 in the revised manuscript),
    12and its consequence for initial yields, using the earlier reachable interface.
    13-/
    14namespace Lax369799.ContextResolutionApproximation
    15open RankedSystems Morphisms Flattening FiniteResolutionNormalForms
    16
    17axiom direct_approximation {A : RankedSet} {k n : ℕ}
    18 (C : SetContext A k n) (S : SetSystem A k) (R : System A n)
    19 (hR : DirectResolution (plug C S) R) :
    20 ∃ (m : ℕ) (c : Fin m → Component S) (U : System A n),
    21 (∀ i, (c i).rooted = false) ∧
    22 DirectResolution (plug C (trim (family c).graph)) U ∧ UnfoldsTo R.val U.val
    23
    24axiom initial_yields {A : RankedSet} {k n : ℕ}
    25 (C : SetContext A k n) (S : SetSystem A k) (R : System A n) :
    26 InitYield (plug C S) R ↔
    27 ∃ (m : ℕ) (c : Fin m → Component S),
    28 (∀ i, (c i).rooted = false) ∧ InitYield (plug C (trim (family c).graph)) R
    29
    30axiom root_yields {A : RankedSet} {k n : ℕ}
    31 (C : SetContext A k n) (S : SetSystem A k) (R : System A n) :
    32 InitYield (uproot (plug C S)) R ↔
    33 ∃ (m : ℕ) (c : Fin m → Component S),
    34 InitYield (uproot (plug C (trim (family c).graph))) R
    35
    36axiom yields {A : RankedSet} {k n : ℕ}
    37 (C : SetContext A k n) (S : SetSystem A k) (R : SetSystem A n) :
    38 Yield (plug C S) R ↔
    39 ∃ (m : ℕ) (c : Fin m → Component S),
    40 Yield (plug C (trim (family c).graph)) R
    41
    42end Lax369799.ContextResolutionApproximation
    43
    Show ProofShow ProofShow ProofShow Proof

    Discussion

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

    Loading discussion…