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

Transfer of resolutions through bounded profiles

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

    An inner set-system can be replaced by another with the same bounded profile. A resolution of the closed flattening then has a resolution of the replacement with the same value in the observing algebra. The proof uses factorisation into local resolutions followed by bounded optimal flatten-resolution replacement.

    Concept map
    30 concepts
    100%
    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.OptimalResolutions
    2import Lax369799.FiniteProfiles
    3
    4/-!
    5---
    6title: Transfer of resolutions through bounded profiles
    7type: theorem
    8---
    9An inner set-system can be replaced by another with the same bounded
    10profile. A resolution of the closed flattening then has a resolution of
    11the replacement with the same value in the observing algebra. The proof
    12uses factorisation into local resolutions followed by bounded optimal
    13flatten-resolution replacement.
    14-/
    15namespace Lax369799.ProfileSubstitution
    16open RankedSystems Flattening Morphisms Algebras
    17
    18def withLabels {A B : RankedSet} {n : ℕ} (S : SetSystem A n)
    19 (f : ∀ v, B (S.graph.label v).1) : SetSystem B n where
    20 size := S.size
    21 graph := { S.graph with label := fun v => ⟨(S.graph.label v).1, f v⟩ }
    22 reachable := S.reachable
    23
    24axiom transfer_resolution {A B : RankedSet} (E : Algebra B) (hE : UnfoldInvariant E)
    25 [Finite (B 1)] (η : RankedMap A B) (P : SetSystem (SetSystem A) 0)
    26 (Q : ∀ v, SetSystem A (P.graph.label v).1)
    27 (hQ : ∀ v, FiniteProfiles.BoundedProfile (Nat.card (B 1) + 1)
    28 (fun k R => E.eval k (relabelSystem η R)) (Inner P v) =
    29 FiniteProfiles.BoundedProfile (Nat.card (B 1) + 1)
    30 (fun k R => E.eval k (relabelSystem η R)) (Q v))
    31 (R : System A 0) (hR : DirectResolution (flatten P) R) :
    32 ∃ U : System A 0, DirectResolution (flatten (withLabels P Q)) U ∧
    33 E.eval 0 (relabelSystem η R) = E.eval 0 (relabelSystem η U)
    34
    35end Lax369799.ProfileSubstitution
    36
    Show Proof

    Discussion

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

    Loading discussion…