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

Lifting unfoldings through variable renaming

Lax369799.ResolutionLifting · concepts/Lax369799/ResolutionLifting.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 morphism into a renamed system can be lifted by restoring the variable names dictated by the original system. Renaming the lifted system gives back the source exactly. This preserves variable origins when passing from direct resolutions to resolutions.

    Concept map
    7 concepts; 6 descendants hidden
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

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

    Lean source view on GitHub

    1import Lax369799.Renaming
    2
    3/-!
    4---
    5title: Lifting unfoldings through variable renaming
    6type: theorem
    7---
    8A morphism into a renamed system can be lifted by restoring the variable
    9names dictated by the original system. Renaming the lifted system gives
    10back the source exactly. This preserves variable origins when passing
    11from direct resolutions to resolutions.
    12-/
    13namespace Lax369799.ResolutionLifting
    14open RankedSystems Morphisms Resolutions
    15
    16axiom rename_lift {A : RankedSet} {m n : ℕ} (σ : Fin m → Fin n)
    17 (S : System A m) (R : System A n) (f : Morphism R.val (rename σ S.val)) :
    18 ∃ U : System A m, rename σ U.val = R.val ∧ UnfoldsTo S.val U.val
    19
    20/-- Yield inclusion transfers resolutions while preserving the variable map. -/
    21axiom transfer {A : RankedSet} {m n : ℕ} {S S' : SetSystem A n}
    22 (h : YieldBelow S S') (T : System A m) (σ : Fin m → Fin n)
    23 (hT : IsResolution S T σ) :
    24 ∃ T' : System A m, IsResolution S' T' σ ∧ UnfoldsTo T.val T'.val
    25
    26end Lax369799.ResolutionLifting
    27
    Show ProofShow Proof
    Builds on
    Used by
    From Mathlib

    none

    Discussion

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

    Loading discussion…