Module Iso Piece Squares — coordinate chain dependencies
DefinitionLPCA_Solutions_LPCA_ModuleIsoPieceSquares_SixOne20261024_Defscommutative-algebralocal-cohomologylocalized-persistent-commutative-algebralpca-coordinate-chain-20261024stanley-reisner
This bundle supplies the selected constructions and proved compatibility results for module iso piece squares used in the coordinate Čech chain comparison. Each construction retains the rings, categories, grading indices and hypotheses in its formal declaration.
Definition code
import Mathlib.Algebra.Category.ModuleCat.Basic
import Mathlib.Algebra.Homology.HomologicalComplex
import Definitions.Def_LPCA_Solutions_LPCA_CochainSuccessorIso_SixOne20261024_Defs
set_option autoImplicit false
namespace LPCA
open CategoryTheory CategoryTheory.Limits
universe u v
theorem moduleHom_range_bot_of_subsingleton (R : Type u) [Ring R]
(A N : ModuleCat.{u} R) (f : A ⟶ N) (h : Subsingleton A) : LinearMap.range f.hom = ⊥ := by
apply le_antisymm ?_ bot_le
rintro y ⟨x, rfl⟩
have hx : x = 0 := h.elim x 0
rw [hx, map_zero]
exact Submodule.zero_mem _
theorem moduleIsoPieces_forward_square (R : Type u) [Ring R]
(M₀ M₁ N₀ N₁ : ModuleCat.{u} R) (e₀ : M₀ ≅ N₀) (e₁ : M₁ ≅ N₁)
(d : M₀ ⟶ M₁) (D : N₀ ⟶ N₁)
(P₀ : M₀ → Prop) (P₁ : M₁ → Prop) (Q₀ : N₀ → Prop) (Q₁ : N₁ → Prop)
(h₀ : ∀ x, P₀ x ↔ Q₀ (e₀.hom x)) (h₁ : ∀ x, P₁ x ↔ Q₁ (e₁.hom x))
(hd : ∀ x, P₀ x → P₁ (d x)) (hs : e₀.hom ≫ D = d ≫ e₁.hom)
(y : N₀) (hy : Q₀ y) : Q₁ (D y) := by
obtain ⟨x, rfl⟩ := e₀.toLinearEquiv.surjective y
have hx := hd x ((h₀ x).mpr hy)
have h : D (e₀.hom x) = e₁.hom (d x) := congrArg (fun f => f x) hs
change Q₁ (D (e₀.hom x))
rw [h]
exact (h₁ _).mp hx
theorem isoSquare_factor {C : Type u} [Category.{v} C] {M N P Q : C}
(e : M ≅ N) (f : P ≅ Q) (r : M ⟶ P) (R : N ⟶ Q)
(h : e.hom ≫ R = r ≫ f.hom) : e.inv ≫ r ≫ f.hom = R := by
rw [← h, e.inv_hom_id_assoc]
@[simp] theorem cochainSuccessorIso_inv_f {C : Type u} [Category.{v} C] [HasZeroMorphisms C]
(X Y : CochainComplex C ℕ) (E : ∀ p, X.X p ≅ Y.X p)
(h : ∀ p, (E p).hom ≫ Y.d p (p + 1) = X.d p (p + 1) ≫ (E (p + 1)).hom) (p : ℕ) :
(cochainSuccessorIso X Y E h).inv.f p = (E p).inv := rfl
end LPCA
Source