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

Finite support for root observations

Lax369799.RootResolutionApproximation · concepts/Lax369799/RootResolutionApproximation.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 root observation of a substitution uses finitely many initial or root resolutions of its labels. Retaining these resolutions preserves the observation. Starting copies distinguish entry through an inner root from ordinary transitions into an inner initial vertex.

    Concept map
    39 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 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 finiteobservations
    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.FiniteResolutionApproximation
    2import Lax369799.ObservedSubstitution
    3import Lax369799.RootExpansion
    4
    5/-!
    6---
    7title: Finite support for root observations
    8type: theorem
    9---
    10A root observation of a substitution uses finitely many initial or root
    11resolutions of its labels. Retaining these resolutions preserves the
    12observation. Starting copies distinguish entry through an inner root
    13from ordinary transitions into an inner initial vertex.
    14-/
    15namespace Lax369799.RootResolutionApproximation
    16open RankedSystems Morphisms FiniteResolutionNormalForms ObservedSubstitution
    17
    18axiom finite_support {A : RankedSet} {n : ℕ} {V : Type} [Fintype V]
    19 (P : Presentation (SetSystem A) n V) (R : System A n)
    20 (hR : InitYield (trim (RootExpansion.startAtRoots
    21 (FinitePresentations.flattenPresentation (finiteLabels P)))) R) :
    22 ∃ (m : ℕ) (v : Fin m → V) (c : ∀ i, Component (P.label (v i)).2),
    23 ∀ (Q : ∀ v, SetSystem A (P.label v).1),
    24 (∀ i, DirectResolution (if (c i).rooted then uproot (Q (v i)) else Q (v i)) (c i).system) →
    25 InitYield (trim (RootExpansion.startAtRoots
    26 (FinitePresentations.flattenPresentation (finiteLabels (replaceLabels P Q))))) R
    27
    28end Lax369799.RootResolutionApproximation
    29
    Show Proof

    Discussion

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

    Loading discussion…