math / data /lean /OAI /Algebra /Finitistic /Rectification /ColumnProperties.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
7.52 kB
import OAI.Algebra.Finitistic.Rectification.InducedDiagram
import Mathlib.Algebra.Category.ModuleCat.Projective
import Mathlib.Algebra.Category.ModuleCat.ChangeOfRings
import Mathlib.Algebra.Homology.HomologicalComplexBiprod
namespace OAI
open CategoryTheory CategoryTheory.Limits HomologicalComplex
open scoped TensorProduct ModuleCat.Algebra
noncomputable section
namespace ExternalTensor.Section4
universe u
variable (k B : Type u) [Field k] [Ring B] [Algebra k B]
attribute [local instance] ExternalTensor.bimodule ExternalTensor.rightModule
/-- Restrict genuine bimodules to right B-modules. -/
def forgetRight : ModuleCat.{u} (Enveloping k B) β₯€ ModuleCat.{u} Bᡐᡒᡖ :=
ModuleCat.restrictScalars (Algebra.TensorProduct.includeRight :
Bᡐᡒᡖ →ₐ[k] Enveloping k B).toRingHom
instance forgetRight_additive : (forgetRight k B).Additive := by
dsimp [forgetRight]
infer_instance
/-- The restricted action is the right action already verified for the actual tensor. -/
def columnRightIso (e : B) (N : ModuleCat.{u} Bᡐᡒᡖ) :
(forgetRight k B).obj ((columnFunctor k B e).obj N) β‰…
ModuleCat.of Bᡐᡒᡖ (Column k B N e) :=
(show ((forgetRight k B).obj ((columnFunctor k B e).obj N)) ≃ₗ[Bᡐᡒᡖ]
(ModuleCat.of Bᡐᡒᡖ (Column k B N e)) from
{ toFun := id
invFun := id
left_inv := fun _ => rfl
right_inv := fun _ => rfl
map_add' := fun _ _ => rfl
map_smul' := fun c x => by
change ((1 βŠ—β‚œ[k] c : Enveloping k B) β€’ (show Column k B N e from x)) =
c β€’ (show Column k B N e from x)
exact (right_eq_enveloping k B (leftIdeal B e) N c x).symm }).toModuleIso
theorem column_right_projective (e : B) (N : ModuleCat.{u} Bᡐᡒᡖ)
[Module.Projective Bᡐᡒᡖ N] :
Projective ((forgetRight k B).obj ((columnFunctor k B e).obj N)) := by
let := column_projective k B N e
exact Projective.of_iso (columnRightIso k B e N).symm (by infer_instance)
/-- Exact boundedness transfer for each induced column. -/
theorem column_isZero (e : B) (D : RightComplex B) (i : β„€)
(hi : IsZero (D.X i)) : IsZero (((columnComplex k B e).obj D).X i) :=
(columnFunctor k B e).map_isZero hi
instance rightFiniteBiproducts : HasFiniteBiproducts (ModuleCat.{u} Bᡐᡒᡖ) :=
HasFiniteBiproducts.of_hasFiniteProducts
instance rightBinaryBiproducts : HasBinaryBiproducts (ModuleCat.{u} Bᡐᡒᡖ) :=
HasBinaryBiproducts.of_hasBinaryProducts
abbrev termRight (n : β„€) : BiComplex k B β₯€ ModuleCat.{u} Bᡐᡒᡖ :=
eval _ _ n β‹™ forgetRight k B
theorem sum_right_projective {I : Type} [Fintype I] (K : I β†’ BiComplex k B)
(n : β„€) (hK : βˆ€ i, Projective ((termRight k B n).obj (K i))) :
Projective ((termRight k B n).obj (⨁ K)) := by
let (i : I) : Projective ((termRight k B n).obj (K i)) := hK i
apply Projective.of_iso ((termRight k B n).mapBiproduct K).symm
refine ⟨fun f e _ => ⟨biproduct.desc (fun i => by
letI : Projective (((termRight k B n).obj ∘ K) i) := hK i
exact Projective.factorThru (biproduct.ΞΉ ((termRight k B n).obj ∘ K) i ≫ f) e), ?_⟩⟩
apply biproduct.hom_ext'
intro i
let : Projective (((termRight k B n).obj ∘ K) i) := hK i
simp only [biproduct.ΞΉ_desc_assoc, Projective.factorThru_comp]
theorem biprod_right_projective (K L : BiComplex k B) (n : β„€)
(hK : Projective ((termRight k B n).obj K))
(hL : Projective ((termRight k B n).obj L)) :
Projective ((termRight k B n).obj (K ⊞ L)) := by
let := hK
let := hL
let := preservesBinaryBiproducts_of_preservesBiproducts (termRight k B n)
exact Projective.of_iso ((termRight k B n).mapBiprod K L).symm (by infer_instance)
theorem sum_isZero {C : Type*} [Category C] [HasZeroMorphisms C]
{I : Type} (K : I β†’ C) [HasBiproduct K] (hK : βˆ€ i, IsZero (K i)) :
IsZero (⨁ K) := by
apply (IsZero.iff_id_eq_zero _).2
apply biproduct.hom_ext
intro i
simp only [Category.id_comp, zero_comp]
exact (hK i).eq_zero_of_tgt _
theorem sum_term_isZero {I : Type} [Fintype I] (K : I β†’ BiComplex k B)
(n : β„€) (hK : βˆ€ i, IsZero ((K i).X n)) : IsZero ((⨁ K).X n) := by
apply ((eval _ _ n).mapBiproduct K).isZero_iff.mpr
exact sum_isZero _ hK
theorem biprod_term_isZero (K L : BiComplex k B) (n : β„€)
(hK : IsZero (K.X n)) (hL : IsZero (L.X n)) : IsZero ((K ⊞ L).X n) := by
let := preservesBinaryBiproducts_of_preservesBiproducts (eval (ModuleCat (Enveloping k B)) (ComplexShape.up β„€) n)
apply ((eval _ _ n).mapBiprod K L).isZero_iff.mpr
exact (biprod_isZero_iff _ _).mpr ⟨hK, hL⟩
variable {k B}
variable {A J R : Type} [Fintype A] [Fintype J] [Fintype R]
variable (s : Quadratic k B (A := A) (J := J) (R := R))
variable (Dβ‚€ D₁ Dβ‚‚ : RightComplex B)
variable (f : A β†’ (Dβ‚€ ⟢ D₁)) (g : J β†’ (D₁ ⟢ Dβ‚‚))
/-- Exactly the three right-projectivity inputs to RectificationTotal.total_projective_after. -/
theorem columns_right_projective
(hβ‚€ : βˆ€ n, Module.Projective Bᡐᡒᡖ (Dβ‚€.X n))
(h₁ : βˆ€ n, Module.Projective Bᡐᡒᡖ (D₁.X n))
(hβ‚‚ : βˆ€ n, Module.Projective Bᡐᡒᡖ (Dβ‚‚.X n)) (n : β„€) :
Projective ((forgetRight k B).obj ((L0Prime s Dβ‚€ D₁ Dβ‚‚ f g).X n)) ∧
Projective ((forgetRight k B).obj ((L1Prime s Dβ‚€ D₁ Dβ‚‚ f g).X n)) ∧
Projective ((forgetRight k B).obj ((L2Prime s Dβ‚€ D₁ Dβ‚‚ f g).X n)) := by
let := hβ‚€ n
let := h₁ n
let := hβ‚‚ n
refine ⟨?_, ?_, ?_⟩
Β· apply biprod_right_projective
Β· exact column_right_projective k B s.eβ‚€ (Dβ‚€.X n)
Β· apply biprod_right_projective
Β· exact column_right_projective k B s.e₁ (D₁.X n)
Β· exact column_right_projective k B s.eβ‚‚ (Dβ‚‚.X n)
Β· apply biprod_right_projective
Β· apply sum_right_projective
intro a
exact column_right_projective k B s.e₁ (Dβ‚€.X n)
Β· apply sum_right_projective
intro b
exact column_right_projective k B s.eβ‚‚ (D₁.X n)
Β· apply sum_right_projective
intro r
exact column_right_projective k B s.eβ‚‚ (Dβ‚€.X n)
theorem columns_isZero (n : β„€) (hβ‚€ : IsZero (Dβ‚€.X n))
(h₁ : IsZero (D₁.X n)) (hβ‚‚ : IsZero (Dβ‚‚.X n)) :
IsZero ((L0Prime s Dβ‚€ D₁ Dβ‚‚ f g).X n) ∧
IsZero ((L1Prime s Dβ‚€ D₁ Dβ‚‚ f g).X n) ∧
IsZero ((L2Prime s Dβ‚€ D₁ Dβ‚‚ f g).X n) := by
refine ⟨?_, ?_, ?_⟩
Β· apply biprod_term_isZero
Β· exact column_isZero k B s.eβ‚€ Dβ‚€ n hβ‚€
Β· apply biprod_term_isZero
Β· exact column_isZero k B s.e₁ D₁ n h₁
Β· exact column_isZero k B s.eβ‚‚ Dβ‚‚ n hβ‚‚
Β· apply biprod_term_isZero
Β· apply sum_term_isZero
intro a
exact column_isZero k B s.e₁ Dβ‚€ n hβ‚€
Β· apply sum_term_isZero
intro b
exact column_isZero k B s.eβ‚‚ D₁ n h₁
Β· apply sum_term_isZero
intro r
exact column_isZero k B s.eβ‚‚ Dβ‚€ n hβ‚€
/-- Uniform bounds on the input complexes give the same bounds on all three columns. -/
theorem columns_bounded (lo hi : β„€)
(hβ‚€ : βˆ€ n, n < lo ∨ hi < n β†’ IsZero (Dβ‚€.X n))
(h₁ : βˆ€ n, n < lo ∨ hi < n β†’ IsZero (D₁.X n))
(hβ‚‚ : βˆ€ n, n < lo ∨ hi < n β†’ IsZero (Dβ‚‚.X n)) :
βˆ€ n, n < lo ∨ hi < n β†’
IsZero ((L0Prime s Dβ‚€ D₁ Dβ‚‚ f g).X n) ∧
IsZero ((L1Prime s Dβ‚€ D₁ Dβ‚‚ f g).X n) ∧
IsZero ((L2Prime s Dβ‚€ D₁ Dβ‚‚ f g).X n) :=
fun n hn => columns_isZero s Dβ‚€ D₁ Dβ‚‚ f g n (hβ‚€ n hn) (h₁ n hn) (hβ‚‚ n hn)
end ExternalTensor.Section4
end
end OAI