Direct Sum Restriction — coordinate chain dependencies
DefinitionLPCA_Solutions_LPCA_DirectSumRestriction_SixOne20261024_Defscommutative-algebralocal-cohomologylocalized-persistent-commutative-algebralpca-coordinate-chain-20261024stanley-reisner
This bundle supplies the selected constructions and proved compatibility results for direct sum restriction used in the coordinate Čech chain comparison. Each construction retains the rings, categories, grading indices and hypotheses in its formal declaration.
Restricting a direct sum to a set of indices is an equivalence whenever all omitted summands are zero. Its forward map is actual coordinate restriction.
Definition code
import Mathlib.Algebra.DirectSum.Module
set_option autoImplicit false
set_option backward.isDefEq.respectTransparency.types false
set_option backward.isDefEq.respectTransparency false
namespace LPCA
universe u
variable (R : Type u) [Ring R]
variable {I : Type u} [DecidableEq I]
variable (A : I → Type u) [∀ i, AddCommGroup (A i)] [∀ i, Module R (A i)]
/-- Restricting a direct sum to a set of indices is an equivalence whenever
all omitted summands are zero. Its forward map is actual coordinate restriction. -/
noncomputable def directSumRestrictionEquiv (p : I → Prop) [DecidablePred p]
(hzero : ∀ i, ¬ p i → Subsingleton (A i)) :
DirectSum I A ≃ₗ[R] DirectSum {i // p i} (fun i => A i.1) := by
let r := DFinsupp.subtypeDomainLinearMap (γ := R) (β := A) p
let inc : DirectSum {i // p i} (fun i => A i.1) →ₗ[R] DirectSum I A :=
DirectSum.toModule R {i // p i} (DirectSum I A)
(fun i => DirectSum.lof R I A i.1)
apply LinearEquiv.ofBijective r
constructor
· intro x y h
apply DFinsupp.ext
intro i
by_cases hi : p i
· exact congrArg (fun z => z ⟨i, hi⟩) h
· exact (hzero i hi).elim _ _
· have hr : r.comp inc = LinearMap.id := by
apply DirectSum.linearMap_ext
intro i
apply LinearMap.ext
intro x
simp only [LinearMap.comp_apply, LinearMap.id_apply]
change r (inc (DirectSum.lof R {i // p i} (fun i => A i.1) i x)) = _
dsimp only [inc]
rw [DirectSum.toModule_lof]
apply DFinsupp.ext
intro j
change (DFinsupp.single (β := A) i.1 x) j.1 =
(DFinsupp.single (β := fun t : {i // p i} => A t.1) i x) j
by_cases hij : i = j
· subst j
simp
· have hv : i.1 ≠ j.1 := fun h => hij (Subtype.ext h)
simp [DFinsupp.single_apply, hij, hv]
intro y
refine ⟨inc y, ?_⟩
exact congrArg (fun f => f y) hr
end LPCA
Source