Lifting unfoldings through variable renaming
Lax369799.ResolutionLifting · concepts/Lax369799/ResolutionLifting.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural 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
Evidence
Lean source view on GitHub
| 1 | import Lax369799.Renaming |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Lifting unfoldings through variable renaming |
| 6 | type: theorem |
| 7 | --- |
| 8 | A morphism into a renamed system can be lifted by restoring the variable |
| 9 | names dictated by the original system. Renaming the lifted system gives |
| 10 | back the source exactly. This preserves variable origins when passing |
| 11 | from direct resolutions to resolutions. |
| 12 | -/ |
| 13 | namespace Lax369799.ResolutionLifting |
| 14 | open RankedSystems Morphisms Resolutions |
| 15 | |
| 16 | axiom 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. -/ |
| 21 | axiom 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 | |
| 26 | end Lax369799.ResolutionLifting |
| 27 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments