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

Finite approximation of a flattening resolution

Lax369799.FiniteResolutionApproximation · concepts/Lax369799/FiniteResolutionApproximation.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 of a flattening can be reproduced, up to unfolding, using only finitely many direct resolutions of each inner label. The variable maps of the flatten-resolution are retained when selecting and reassembling these components. This is the initial-resolution argument underlying the yield-continuity corollary in Section 2.9.

    Concept map
    35 concepts
    100%
    Algebraic decomposition with boundary dataAlgebras and recognitionDeterministic elements and the earlierreplacement propertyBounded profiles refine finite contextualequivalenceContext decomposition with hole boundarydataRelabelling and deterministic contextsubstitutionSmallification 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

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

    Lean source view on GitHub

    1import Lax369799.FiniteResolutionNormalForms
    2import Lax369799.FlatteningTheorems
    3import Lax369799.ProfileSubstitution
    4
    5/-!
    6---
    7title: Finite approximation of a flattening resolution
    8type: theorem
    9---
    10A direct resolution of a flattening can be reproduced, up to unfolding,
    11using only finitely many direct resolutions of each inner label. The
    12variable maps of the flatten-resolution are retained when selecting and
    13reassembling these components. This is the initial-resolution argument
    14underlying the yield-continuity corollary in Section 2.9.
    15-/
    16namespace Lax369799.FiniteResolutionApproximation
    17open RankedSystems Morphisms Flattening Resolutions FiniteResolutionNormalForms
    18
    19noncomputable def replace {A : RankedSet} {n : ℕ} (S : SetSystem (SetSystem A) n)
    20 (k : S.Vertex → ℕ) (c : ∀ v, Fin (k v) → Component (Inner S v)) : SetSystem (SetSystem A) n :=
    21 { S with graph := { S.graph with label := fun v => ⟨(S.graph.label v).1, trim (family (c v)).graph⟩ } }
    22
    23/-- A finite family of local resolutions suffices for any replacement
    24that still admits those resolutions. -/
    25axiom finite_support {A : RankedSet} {n : ℕ}
    26 (S : SetSystem (SetSystem A) n) (R : System A n)
    27 (hR : DirectResolution (flatten S) R) :
    28 ∃ (k : S.Vertex → ℕ) (c : ∀ v, Fin (k v) → Component (Inner S v)),
    29 (∀ v i, (c v i).rooted = false) ∧
    30 ∀ (Q : ∀ v, SetSystem A (S.graph.label v).1),
    31 (∀ v i, DirectResolution (Q v) (c v i).system) →
    32 ∃ U : System A n,
    33 DirectResolution (flatten (ProfileSubstitution.withLabels S Q)) U ∧
    34 UnfoldsTo R.val U.val
    35
    36axiom direct_approximation {A : RankedSet} {n : ℕ}
    37 (S : SetSystem (SetSystem A) n) (R : System A n)
    38 (hR : DirectResolution (flatten S) R) :
    39 ∃ (k : S.Vertex → ℕ) (c : ∀ v, Fin (k v) → Component (Inner S v)) (U : System A n),
    40 (∀ v i, (c v i).rooted = false) ∧
    41 DirectResolution (flatten (replace S k c)) U ∧ UnfoldsTo R.val U.val
    42
    43end Lax369799.FiniteResolutionApproximation
    44
    Show ProofShow Proof

    Discussion

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

    Loading discussion…