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

Full-profile transfer in every output rank

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

    Full local profiles preserve the values of resolutions under substitution. The proof requires no finite bound on local variable maps. Both initial and root observations are covered for arbitrary finite presentations, including unreachable vertices, in every output rank.

    Concept map
    35 concepts
    100%
    Algebraic decomposition with boundary dataAlgebras and recognitionDeterministic elements and the earlierreplacement propertyContext 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 presentationsContextual quotient algebras of finitepresentationsFlattening and contextsMorphisms, 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-resolutionsResolutions and bounded profilesRoot entries in substituted presentationsInitial and root observations underbounded-profile substitutionThe earlier continuity-bearing set-algebrainterfaceSyntactic set-algebras and rankwise finitenessYield-syntactic order and quotientEvaluation and variable renaming inregular-tree algebrasFull-profile transfer in every output rankCompression of variable maps by finiteobservations
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

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

    Lean source view on GitHub

    1import Lax369799.RootProfileSubstitution
    2
    3/-!
    4---
    5title: Full-profile transfer in every output rank
    6type: theorem
    7---
    8Full local profiles preserve the values of resolutions under substitution.
    9The proof requires no finite bound on local variable maps. Both initial
    10and root observations are covered for arbitrary finite presentations,
    11including unreachable vertices, in every output rank.
    12-/
    13
    14namespace Lax369799.UnboundedSubstitution
    15open RankedSystems Morphisms Algebras Flattening Resolutions ProfileSubstitution
    16open ObservedSubstitution PresentationObservations RootExpansion
    17
    18axiom transfer_resolution {A B : RankedSet} (E : Algebra B) (hE : UnfoldInvariant E)
    19 (η : RankedMap A B) {n : ℕ} (P : SetSystem (SetSystem A) n)
    20 (Q : ∀ v, SetSystem A (P.graph.label v).1)
    21 (hQ : ∀ v, Profile
    22 (fun k R => E.eval k (relabelSystem η R)) (Inner P v) =
    23 Profile
    24 (fun k R => E.eval k (relabelSystem η R)) (Q v))
    25 (R : System A n) (hR : DirectResolution (flatten P) R) :
    26 ∃ U : System A n, DirectResolution (flatten (withLabels P Q)) U ∧
    27 E.eval n (relabelSystem η R) = E.eval n (relabelSystem η U)
    28
    29axiom transfer_value {A B : RankedSet} (E : Algebra B) (hE : UnfoldInvariant E)
    30 (η : RankedMap A B) {n : ℕ} {V : Type} [Fintype V]
    31 (P : Presentation (SetSystem A) n V) (Q : ∀ v, SetSystem A (P.label v).1)
    32 (hP : ∀ v, (P.label v).2.graph.root = ∅) (hQ : ∀ v, (Q v).graph.root = ∅)
    33 (h : ∀ v, Profile
    34 (fun k R => E.eval k (relabelSystem η R)) (P.label v).2 =
    35 Profile
    36 (fun k R => E.eval k (relabelSystem η R)) (Q v)) :
    37 values E η (Lax369799.FinitePresentations.flattenPresentation (finiteLabels P)) ⊆
    38 values E η (Lax369799.FinitePresentations.flattenPresentation (finiteLabels (replaceLabels P Q)))
    39
    40axiom transfer_initial_value {A B : RankedSet} (E : Algebra B) (hE : UnfoldInvariant E)
    41 (η : RankedMap A B) {n : ℕ} {V : Type} [Fintype V]
    42 (P : Presentation (SetSystem A) n V) (Q : ∀ v, SetSystem A (P.label v).1)
    43 (hi : ∀ v, Profile
    44 (fun k R => E.eval k (relabelSystem η R)) (P.label v).2 =
    45 Profile
    46 (fun k R => E.eval k (relabelSystem η R)) (Q v)) :
    47 values E η (Lax369799.FinitePresentations.flattenPresentation (finiteLabels P)) ⊆
    48 values E η (Lax369799.FinitePresentations.flattenPresentation (finiteLabels (replaceLabels P Q)))
    49
    50axiom transfer_root_value {A B : RankedSet} (E : Algebra B) (hE : UnfoldInvariant E)
    51 (η : RankedMap A B) {n : ℕ} {V : Type} [Fintype V]
    52 (P : Presentation (SetSystem A) n V) (Q : ∀ v, SetSystem A (P.label v).1)
    53 (hi : ∀ v, Profile
    54 (fun k R => E.eval k (relabelSystem η R)) (P.label v).2 =
    55 Profile
    56 (fun k R => E.eval k (relabelSystem η R)) (Q v))
    57 (hr : ∀ v, Profile
    58 (fun k R => E.eval k (relabelSystem η R)) (uproot (P.label v).2) =
    59 Profile
    60 (fun k R => E.eval k (relabelSystem η R)) (uproot (Q v))) :
    61 values E η (startAtRoots (Lax369799.FinitePresentations.flattenPresentation (finiteLabels P))) ⊆
    62 values E η (startAtRoots (Lax369799.FinitePresentations.flattenPresentation
    63 (finiteLabels (replaceLabels P Q))))
    64
    65end Lax369799.UnboundedSubstitution
    66
    Show ProofShow ProofShow 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…