Documentation

Mathlib.Algebra.Homology.ShortComplex.Exact

Exact short complexes #

When S : ShortComplex C, this file defines a structure S.Exact which expresses the exactness of S, i.e. there exists a homology data h : S.HomologyData such that h.left.H is zero. When [S.HasHomology], it is equivalent to the assertion IsZero S.homology.

Almost by construction, this notion of exactness is self dual, see Exact.op and Exact.unop.

structure CategoryTheory.ShortComplex.Exact {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] (S : CategoryTheory.ShortComplex C) :

The assertion that the short complex S : ShortComplex C is exact.

condition : ∃ (h : S.HomologyData), CategoryTheory.Limits.IsZero h.left.H
the condition that there exists an homology data whose left.H field is zero

Instances For

theorem CategoryTheory.ShortComplex.Exact.hasHomology {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {S : CategoryTheory.ShortComplex C} (h : S.Exact) :

S.HasHomology

theorem CategoryTheory.ShortComplex.Exact.hasZeroObject {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {S : CategoryTheory.ShortComplex C} (h : S.Exact) :

CategoryTheory.Limits.HasZeroObject C

theorem CategoryTheory.ShortComplex.exact_iff_isZero_homology {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] (S : CategoryTheory.ShortComplex C) [S.HasHomology] :

S.Exact ↔ CategoryTheory.Limits.IsZero S.homology

theorem CategoryTheory.ShortComplex.LeftHomologyData.exact_iff {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {S : CategoryTheory.ShortComplex C} [S.HasHomology] (h : S.LeftHomologyData) :

S.Exact ↔ CategoryTheory.Limits.IsZero h.H

theorem CategoryTheory.ShortComplex.RightHomologyData.exact_iff {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {S : CategoryTheory.ShortComplex C} [S.HasHomology] (h : S.RightHomologyData) :

S.Exact ↔ CategoryTheory.Limits.IsZero h.H

theorem CategoryTheory.ShortComplex.exact_iff_isZero_leftHomology {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] (S : CategoryTheory.ShortComplex C) [S.HasHomology] :

S.Exact ↔ CategoryTheory.Limits.IsZero S.leftHomology

theorem CategoryTheory.ShortComplex.exact_iff_isZero_rightHomology {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] (S : CategoryTheory.ShortComplex C) [S.HasHomology] :

S.Exact ↔ CategoryTheory.Limits.IsZero S.rightHomology

theorem CategoryTheory.ShortComplex.HomologyData.exact_iff {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {S : CategoryTheory.ShortComplex C} (h : S.HomologyData) :

S.Exact ↔ CategoryTheory.Limits.IsZero h.left.H

theorem CategoryTheory.ShortComplex.HomologyData.exact_iff' {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {S : CategoryTheory.ShortComplex C} (h : S.HomologyData) :

S.Exact ↔ CategoryTheory.Limits.IsZero h.right.H

theorem CategoryTheory.ShortComplex.exact_iff_homology_iso_zero {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] (S : CategoryTheory.ShortComplex C) [S.HasHomology] [CategoryTheory.Limits.HasZeroObject C] :

S.Exact ↔ Nonempty (S.homology ≅ 0)

theorem CategoryTheory.ShortComplex.exact_of_iso {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {S₁ S₂ : CategoryTheory.ShortComplex C} (e : S₁ ≅ S₂) (h : S₁.Exact) :

S₂.Exact

theorem CategoryTheory.ShortComplex.exact_iff_of_iso {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {S₁ S₂ : CategoryTheory.ShortComplex C} (e : S₁ ≅ S₂) :

S₁.Exact ↔ S₂.Exact

theorem CategoryTheory.ShortComplex.exact_and_mono_f_iff_of_iso {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {S₁ S₂ : CategoryTheory.ShortComplex C} (e : S₁ ≅ S₂) :

S₁.Exact ∧ CategoryTheory.Mono S₁.f ↔ S₂.Exact ∧ CategoryTheory.Mono S₂.f

theorem CategoryTheory.ShortComplex.exact_and_epi_g_iff_of_iso {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {S₁ S₂ : CategoryTheory.ShortComplex C} (e : S₁ ≅ S₂) :

S₁.Exact ∧ CategoryTheory.Epi S₁.g ↔ S₂.Exact ∧ CategoryTheory.Epi S₂.g

theorem CategoryTheory.ShortComplex.exact_of_isZero_X₂ {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] (S : CategoryTheory.ShortComplex C) (h : CategoryTheory.Limits.IsZero S.X₂) :

S.Exact

theorem CategoryTheory.ShortComplex.exact_iff_of_epi_of_isIso_of_mono {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {S₁ S₂ : CategoryTheory.ShortComplex C} (φ : S₁ ⟶ S₂) [CategoryTheory.Epi φ.τ₁] [CategoryTheory.IsIso φ.τ₂] [CategoryTheory.Mono φ.τ₃] :

S₁.Exact ↔ S₂.Exact

theorem CategoryTheory.ShortComplex.HomologyData.exact_iff_i_p_zero {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {S : CategoryTheory.ShortComplex C} (h : S.HomologyData) :

S.Exact ↔ CategoryTheory.CategoryStruct.comp h.left.i h.right.p = 0

theorem CategoryTheory.ShortComplex.exact_iff_i_p_zero {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] (S : CategoryTheory.ShortComplex C) [S.HasHomology] (h₁ : S.LeftHomologyData) (h₂ : S.RightHomologyData) :

S.Exact ↔ CategoryTheory.CategoryStruct.comp h₁.i h₂.p = 0

theorem CategoryTheory.ShortComplex.exact_iff_iCycles_pOpcycles_zero {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] (S : CategoryTheory.ShortComplex C) [S.HasHomology] :

S.Exact ↔ CategoryTheory.CategoryStruct.comp S.iCycles S.pOpcycles = 0

theorem CategoryTheory.ShortComplex.exact_iff_kernel_ι_comp_cokernel_π_zero {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] (S : CategoryTheory.ShortComplex C) [S.HasHomology] [CategoryTheory.Limits.HasKernel S.g] [CategoryTheory.Limits.HasCokernel S.f] :

S.Exact ↔ CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.kernel.ι S.g) (CategoryTheory.Limits.cokernel.π S.f) = 0

theorem CategoryTheory.ShortComplex.Exact.op {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {S : CategoryTheory.ShortComplex C} (h : S.Exact) :

S.op.Exact

theorem CategoryTheory.ShortComplex.Exact.unop {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {S : CategoryTheory.ShortComplex Cᵒᵖ} (h : S.Exact) :

S.unop.Exact

@[simp]

theorem CategoryTheory.ShortComplex.exact_op_iff {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] (S : CategoryTheory.ShortComplex C) :

S.op.Exact ↔ S.Exact

@[simp]

theorem CategoryTheory.ShortComplex.exact_unop_iff {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] (S : CategoryTheory.ShortComplex Cᵒᵖ) :

S.unop.Exact ↔ S.Exact

theorem CategoryTheory.ShortComplex.LeftHomologyData.exact_map_iff {C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Category.{u_4, u_2} D] [CategoryTheory.Limits.HasZeroMorphisms C] [CategoryTheory.Limits.HasZeroMorphisms D] {S : CategoryTheory.ShortComplex C} (h : S.LeftHomologyData) (F : CategoryTheory.Functor C D) [F.PreservesZeroMorphisms] [h.IsPreservedBy F] [(S.map F).HasHomology] :

(S.map F).Exact ↔ CategoryTheory.Limits.IsZero (F.obj h.H)

theorem CategoryTheory.ShortComplex.RightHomologyData.exact_map_iff {C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Category.{u_4, u_2} D] [CategoryTheory.Limits.HasZeroMorphisms C] [CategoryTheory.Limits.HasZeroMorphisms D] {S : CategoryTheory.ShortComplex C} (h : S.RightHomologyData) (F : CategoryTheory.Functor C D) [F.PreservesZeroMorphisms] [h.IsPreservedBy F] [(S.map F).HasHomology] :

(S.map F).Exact ↔ CategoryTheory.Limits.IsZero (F.obj h.H)

theorem CategoryTheory.ShortComplex.Exact.map_of_preservesLeftHomologyOf {C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Category.{u_4, u_2} D] [CategoryTheory.Limits.HasZeroMorphisms C] [CategoryTheory.Limits.HasZeroMorphisms D] {S : CategoryTheory.ShortComplex C} (h : S.Exact) (F : CategoryTheory.Functor C D) [F.PreservesZeroMorphisms] [F.PreservesLeftHomologyOf S] [(S.map F).HasHomology] :

(S.map F).Exact

theorem CategoryTheory.ShortComplex.Exact.map_of_preservesRightHomologyOf {C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Category.{u_4, u_2} D] [CategoryTheory.Limits.HasZeroMorphisms C] [CategoryTheory.Limits.HasZeroMorphisms D] {S : CategoryTheory.ShortComplex C} (h : S.Exact) (F : CategoryTheory.Functor C D) [F.PreservesZeroMorphisms] [F.PreservesRightHomologyOf S] [(S.map F).HasHomology] :

(S.map F).Exact

theorem CategoryTheory.ShortComplex.Exact.map {C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Category.{u_4, u_2} D] [CategoryTheory.Limits.HasZeroMorphisms C] [CategoryTheory.Limits.HasZeroMorphisms D] {S : CategoryTheory.ShortComplex C} (h : S.Exact) (F : CategoryTheory.Functor C D) [F.PreservesZeroMorphisms] [F.PreservesLeftHomologyOf S] [F.PreservesRightHomologyOf S] :

(S.map F).Exact

theorem CategoryTheory.ShortComplex.exact_map_iff_of_faithful {C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Category.{u_4, u_2} D] [CategoryTheory.Limits.HasZeroMorphisms C] [CategoryTheory.Limits.HasZeroMorphisms D] (S : CategoryTheory.ShortComplex C) [S.HasHomology] (F : CategoryTheory.Functor C D) [F.PreservesZeroMorphisms] [F.PreservesLeftHomologyOf S] [F.PreservesRightHomologyOf S] [F.Faithful] :

(S.map F).Exact ↔ S.Exact

theorem CategoryTheory.ShortComplex.Exact.comp_eq_zero {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {S : CategoryTheory.ShortComplex C} (h : S.Exact) {X Y : C} {a : X ⟶ S.X₂} (ha : CategoryTheory.CategoryStruct.comp a S.g = 0) {b : S.X₂ ⟶ Y} (hb : CategoryTheory.CategoryStruct.comp S.f b = 0) :

CategoryTheory.CategoryStruct.comp a b = 0

theorem CategoryTheory.ShortComplex.Exact.comp_eq_zero_assoc {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {S : CategoryTheory.ShortComplex C} (h : S.Exact) {X Y : C} {a : X ⟶ S.X₂} (ha : CategoryTheory.CategoryStruct.comp a S.g = 0) {b : S.X₂ ⟶ Y} (hb : CategoryTheory.CategoryStruct.comp S.f b = 0) {Z : C} (h✝ : Y ⟶ Z) :

CategoryTheory.CategoryStruct.comp a (CategoryTheory.CategoryStruct.comp b h✝) = CategoryTheory.CategoryStruct.comp 0 h✝

theorem CategoryTheory.ShortComplex.Exact.isZero_of_both_zeros {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] {S : CategoryTheory.ShortComplex C} (ex : S.Exact) (hf : S.f = 0) (hg : S.g = 0) :

CategoryTheory.Limits.IsZero S.X₂

theorem CategoryTheory.ShortComplex.exact_iff_mono {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] (S : CategoryTheory.ShortComplex C) [CategoryTheory.Limits.HasZeroObject C] (hf : S.f = 0) :

S.Exact ↔ CategoryTheory.Mono S.g

theorem CategoryTheory.ShortComplex.exact_iff_epi {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] (S : CategoryTheory.ShortComplex C) [CategoryTheory.Limits.HasZeroObject C] (hg : S.g = 0) :

S.Exact ↔ CategoryTheory.Epi S.f

theorem CategoryTheory.ShortComplex.Exact.epi_f' {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) (h : S.LeftHomologyData) :

CategoryTheory.Epi h.f'

theorem CategoryTheory.ShortComplex.Exact.mono_g' {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) (h : S.RightHomologyData) :

CategoryTheory.Mono h.g'

theorem CategoryTheory.ShortComplex.Exact.epi_toCycles {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) [S.HasLeftHomology] :

CategoryTheory.Epi S.toCycles

theorem CategoryTheory.ShortComplex.Exact.mono_fromOpcycles {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) [S.HasRightHomology] :

CategoryTheory.Mono S.fromOpcycles

theorem CategoryTheory.ShortComplex.LeftHomologyData.exact_iff_epi_f' {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [S.HasHomology] (h : S.LeftHomologyData) :

S.Exact ↔ CategoryTheory.Epi h.f'

theorem CategoryTheory.ShortComplex.RightHomologyData.exact_iff_mono_g' {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [S.HasHomology] (h : S.RightHomologyData) :

S.Exact ↔ CategoryTheory.Mono h.g'

noncomputable def CategoryTheory.ShortComplex.Exact.leftHomologyDataOfIsLimitKernelFork {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) [CategoryTheory.Limits.HasZeroObject C] (kf : CategoryTheory.Limits.KernelFork S.g) (hkf : CategoryTheory.Limits.IsLimit kf) :

S.LeftHomologyData

Given an exact short complex S and a limit kernel fork kf for S.g, this is the left homology data for S with K := kf.pt and H := 0.

Equations

One or more equations did not get rendered due to their size.

Instances For

@[simp]

theorem CategoryTheory.ShortComplex.Exact.leftHomologyDataOfIsLimitKernelFork_H {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) [CategoryTheory.Limits.HasZeroObject C] (kf : CategoryTheory.Limits.KernelFork S.g) (hkf : CategoryTheory.Limits.IsLimit kf) :

(hS.leftHomologyDataOfIsLimitKernelFork kf hkf).H = 0

@[simp]

theorem CategoryTheory.ShortComplex.Exact.leftHomologyDataOfIsLimitKernelFork_i {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) [CategoryTheory.Limits.HasZeroObject C] (kf : CategoryTheory.Limits.KernelFork S.g) (hkf : CategoryTheory.Limits.IsLimit kf) :

(hS.leftHomologyDataOfIsLimitKernelFork kf hkf).i = CategoryTheory.Limits.Fork.ι kf

@[simp]

theorem CategoryTheory.ShortComplex.Exact.leftHomologyDataOfIsLimitKernelFork_K {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) [CategoryTheory.Limits.HasZeroObject C] (kf : CategoryTheory.Limits.KernelFork S.g) (hkf : CategoryTheory.Limits.IsLimit kf) :

(hS.leftHomologyDataOfIsLimitKernelFork kf hkf).K = kf.pt

@[simp]

theorem CategoryTheory.ShortComplex.Exact.leftHomologyDataOfIsLimitKernelFork_π {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) [CategoryTheory.Limits.HasZeroObject C] (kf : CategoryTheory.Limits.KernelFork S.g) (hkf : CategoryTheory.Limits.IsLimit kf) :

(hS.leftHomologyDataOfIsLimitKernelFork kf hkf).π = 0

noncomputable def CategoryTheory.ShortComplex.Exact.rightHomologyDataOfIsColimitCokernelCofork {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) [CategoryTheory.Limits.HasZeroObject C] (cc : CategoryTheory.Limits.CokernelCofork S.f) (hcc : CategoryTheory.Limits.IsColimit cc) :

S.RightHomologyData

Given an exact short complex S and a colimit cokernel cofork cc for S.f, this is the right homology data for S with Q := cc.pt and H := 0.

Equations

One or more equations did not get rendered due to their size.

Instances For

@[simp]

theorem CategoryTheory.ShortComplex.Exact.rightHomologyDataOfIsColimitCokernelCofork_ι {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) [CategoryTheory.Limits.HasZeroObject C] (cc : CategoryTheory.Limits.CokernelCofork S.f) (hcc : CategoryTheory.Limits.IsColimit cc) :

(hS.rightHomologyDataOfIsColimitCokernelCofork cc hcc).ι = 0

@[simp]

theorem CategoryTheory.ShortComplex.Exact.rightHomologyDataOfIsColimitCokernelCofork_Q {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) [CategoryTheory.Limits.HasZeroObject C] (cc : CategoryTheory.Limits.CokernelCofork S.f) (hcc : CategoryTheory.Limits.IsColimit cc) :

(hS.rightHomologyDataOfIsColimitCokernelCofork cc hcc).Q = cc.pt

@[simp]

theorem CategoryTheory.ShortComplex.Exact.rightHomologyDataOfIsColimitCokernelCofork_p {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) [CategoryTheory.Limits.HasZeroObject C] (cc : CategoryTheory.Limits.CokernelCofork S.f) (hcc : CategoryTheory.Limits.IsColimit cc) :

(hS.rightHomologyDataOfIsColimitCokernelCofork cc hcc).p = CategoryTheory.Limits.Cofork.π cc

@[simp]

theorem CategoryTheory.ShortComplex.Exact.rightHomologyDataOfIsColimitCokernelCofork_H {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) [CategoryTheory.Limits.HasZeroObject C] (cc : CategoryTheory.Limits.CokernelCofork S.f) (hcc : CategoryTheory.Limits.IsColimit cc) :

(hS.rightHomologyDataOfIsColimitCokernelCofork cc hcc).H = 0

theorem CategoryTheory.ShortComplex.exact_iff_epi_toCycles {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] (S : CategoryTheory.ShortComplex C) [S.HasHomology] :

S.Exact ↔ CategoryTheory.Epi S.toCycles

theorem CategoryTheory.ShortComplex.exact_iff_mono_fromOpcycles {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] (S : CategoryTheory.ShortComplex C) [S.HasHomology] :

S.Exact ↔ CategoryTheory.Mono S.fromOpcycles

theorem CategoryTheory.ShortComplex.exact_iff_epi_kernel_lift {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] (S : CategoryTheory.ShortComplex C) [S.HasHomology] [CategoryTheory.Limits.HasKernel S.g] :

S.Exact ↔ CategoryTheory.Epi (CategoryTheory.Limits.kernel.lift S.g S.f ⋯)

theorem CategoryTheory.ShortComplex.exact_iff_mono_cokernel_desc {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] (S : CategoryTheory.ShortComplex C) [S.HasHomology] [CategoryTheory.Limits.HasCokernel S.f] :

S.Exact ↔ CategoryTheory.Mono (CategoryTheory.Limits.cokernel.desc S.f S.g ⋯)

theorem CategoryTheory.ShortComplex.QuasiIso.exact_iff {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S₁ S₂ : CategoryTheory.ShortComplex C} (φ : S₁ ⟶ S₂) [S₁.HasHomology] [S₂.HasHomology] [CategoryTheory.ShortComplex.QuasiIso φ] :

S₁.Exact ↔ S₂.Exact

theorem CategoryTheory.ShortComplex.exact_of_f_is_kernel {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] (S : CategoryTheory.ShortComplex C) (hS : CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.KernelFork.ofι S.f ⋯)) [S.HasHomology] :

S.Exact

theorem CategoryTheory.ShortComplex.exact_of_g_is_cokernel {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] (S : CategoryTheory.ShortComplex C) (hS : CategoryTheory.Limits.IsColimit (CategoryTheory.Limits.CokernelCofork.ofπ S.g ⋯)) [S.HasHomology] :

S.Exact

theorem CategoryTheory.ShortComplex.Exact.mono_g {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) (hf : S.f = 0) :

CategoryTheory.Mono S.g

theorem CategoryTheory.ShortComplex.Exact.epi_f {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) (hg : S.g = 0) :

CategoryTheory.Epi S.f

theorem CategoryTheory.ShortComplex.Exact.mono_g_iff {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) :

CategoryTheory.Mono S.g ↔ S.f = 0

theorem CategoryTheory.ShortComplex.Exact.epi_f_iff {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) :

CategoryTheory.Epi S.f ↔ S.g = 0

theorem CategoryTheory.ShortComplex.Exact.isZero_X₂ {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) (hf : S.f = 0) (hg : S.g = 0) :

CategoryTheory.Limits.IsZero S.X₂

theorem CategoryTheory.ShortComplex.Exact.isZero_X₂_iff {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) :

CategoryTheory.Limits.IsZero S.X₂ ↔ S.f = 0 ∧ S.g = 0

structure CategoryTheory.ShortComplex.Splitting {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] (S : CategoryTheory.ShortComplex C) :

Type u_3

A splitting for a short complex S consists of the data of a retraction r : X₂ ⟶ X₁ of S.f and section s : X₃ ⟶ X₂ of S.g which satisfy r ≫ S.f + S.g ≫ s = 𝟙 _

r : S.X₂ ⟶ S.X₁
a retraction of S.f
s : S.X₃ ⟶ S.X₂
a section of S.g
f_r : CategoryTheory.CategoryStruct.comp S.f self.r = CategoryTheory.CategoryStruct.id S.X₁
the condition that r is a retraction of S.f
s_g : CategoryTheory.CategoryStruct.comp self.s S.g = CategoryTheory.CategoryStruct.id S.X₃
the condition that s is a section of S.g
id : CategoryTheory.CategoryStruct.comp self.r S.f + CategoryTheory.CategoryStruct.comp S.g self.s = CategoryTheory.CategoryStruct.id S.X₂
the compatibility between the given section and retraction

Instances For

@[simp]

theorem CategoryTheory.ShortComplex.Splitting.s_g_assoc {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (self : S.Splitting) {Z : C} (h : S.X₃ ⟶ Z) :

CategoryTheory.CategoryStruct.comp self.s (CategoryTheory.CategoryStruct.comp S.g h) = h

@[simp]

theorem CategoryTheory.ShortComplex.Splitting.f_r_assoc {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (self : S.Splitting) {Z : C} (h : S.X₁ ⟶ Z) :

CategoryTheory.CategoryStruct.comp S.f (CategoryTheory.CategoryStruct.comp self.r h) = h

theorem CategoryTheory.ShortComplex.Splitting.r_f {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (s : S.Splitting) :

CategoryTheory.CategoryStruct.comp s.r S.f = CategoryTheory.CategoryStruct.id S.X₂ - CategoryTheory.CategoryStruct.comp S.g s.s

theorem CategoryTheory.ShortComplex.Splitting.r_f_assoc {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (s : S.Splitting) {Z : C} (h : S.X₂ ⟶ Z) :

CategoryTheory.CategoryStruct.comp s.r (CategoryTheory.CategoryStruct.comp S.f h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.id S.X₂ - CategoryTheory.CategoryStruct.comp S.g s.s) h

theorem CategoryTheory.ShortComplex.Splitting.g_s {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (s : S.Splitting) :

CategoryTheory.CategoryStruct.comp S.g s.s = CategoryTheory.CategoryStruct.id S.X₂ - CategoryTheory.CategoryStruct.comp s.r S.f

theorem CategoryTheory.ShortComplex.Splitting.g_s_assoc {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (s : S.Splitting) {Z : C} (h : S.X₂ ⟶ Z) :

CategoryTheory.CategoryStruct.comp S.g (CategoryTheory.CategoryStruct.comp s.s h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.id S.X₂ - CategoryTheory.CategoryStruct.comp s.r S.f) h

def CategoryTheory.ShortComplex.Splitting.splitMono_f {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (s : S.Splitting) :

CategoryTheory.SplitMono S.f

Given a splitting of a short complex S, this shows that S.f is a split monomorphism.

Equations

s.splitMono_f = { retraction := s.r, id := ⋯ }

Instances For

@[simp]

theorem CategoryTheory.ShortComplex.Splitting.splitMono_f_retraction {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (s : S.Splitting) :

s.splitMono_f.retraction = s.r

theorem CategoryTheory.ShortComplex.Splitting.isSplitMono_f {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (s : S.Splitting) :

CategoryTheory.IsSplitMono S.f

theorem CategoryTheory.ShortComplex.Splitting.mono_f {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (s : S.Splitting) :

CategoryTheory.Mono S.f

def CategoryTheory.ShortComplex.Splitting.splitEpi_g {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (s : S.Splitting) :

CategoryTheory.SplitEpi S.g

Given a splitting of a short complex S, this shows that S.g is a split epimorphism.

Equations

s.splitEpi_g = { section_ := s.s, id := ⋯ }

Instances For

@[simp]

theorem CategoryTheory.ShortComplex.Splitting.splitEpi_g_section_ {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (s : S.Splitting) :

s.splitEpi_g.section_ = s.s

theorem CategoryTheory.ShortComplex.Splitting.isSplitEpi_g {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (s : S.Splitting) :

CategoryTheory.IsSplitEpi S.g

theorem CategoryTheory.ShortComplex.Splitting.epi_g {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (s : S.Splitting) :

CategoryTheory.Epi S.g

@[simp]

theorem CategoryTheory.ShortComplex.Splitting.s_r {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (s : S.Splitting) :

CategoryTheory.CategoryStruct.comp s.s s.r = 0

@[simp]

theorem CategoryTheory.ShortComplex.Splitting.s_r_assoc {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (s : S.Splitting) {Z : C} (h : S.X₁ ⟶ Z) :

CategoryTheory.CategoryStruct.comp s.s (CategoryTheory.CategoryStruct.comp s.r h) = CategoryTheory.CategoryStruct.comp 0 h

theorem CategoryTheory.ShortComplex.Splitting.ext_r {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (s s' : S.Splitting) (h : s.r = s'.r) :

s = s'

theorem CategoryTheory.ShortComplex.Splitting.ext_s {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (s s' : S.Splitting) (h : s.s = s'.s) :

s = s'

noncomputable def CategoryTheory.ShortComplex.Splitting.leftHomologyData {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Limits.HasZeroObject C] (s : S.Splitting) :

S.LeftHomologyData

The left homology data on a short complex equipped with a splitting.

Equations

One or more equations did not get rendered due to their size.

Instances For

@[simp]

theorem CategoryTheory.ShortComplex.Splitting.leftHomologyData_i {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Limits.HasZeroObject C] (s : S.Splitting) :

s.leftHomologyData.i = S.f

@[simp]

theorem CategoryTheory.ShortComplex.Splitting.leftHomologyData_K {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Limits.HasZeroObject C] (s : S.Splitting) :

s.leftHomologyData.K = S.X₁

@[simp]

theorem CategoryTheory.ShortComplex.Splitting.leftHomologyData_π {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Limits.HasZeroObject C] (s : S.Splitting) :

s.leftHomologyData.π = 0

@[simp]

theorem CategoryTheory.ShortComplex.Splitting.leftHomologyData_H {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Limits.HasZeroObject C] (s : S.Splitting) :

s.leftHomologyData.H = 0

noncomputable def CategoryTheory.ShortComplex.Splitting.rightHomologyData {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Limits.HasZeroObject C] (s : S.Splitting) :

S.RightHomologyData

The right homology data on a short complex equipped with a splitting.

Equations

One or more equations did not get rendered due to their size.

Instances For

@[simp]

theorem CategoryTheory.ShortComplex.Splitting.rightHomologyData_ι {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Limits.HasZeroObject C] (s : S.Splitting) :

s.rightHomologyData.ι = 0

@[simp]

theorem CategoryTheory.ShortComplex.Splitting.rightHomologyData_p {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Limits.HasZeroObject C] (s : S.Splitting) :

s.rightHomologyData.p = S.g

@[simp]

theorem CategoryTheory.ShortComplex.Splitting.rightHomologyData_H {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Limits.HasZeroObject C] (s : S.Splitting) :

s.rightHomologyData.H = 0

@[simp]

theorem CategoryTheory.ShortComplex.Splitting.rightHomologyData_Q {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Limits.HasZeroObject C] (s : S.Splitting) :

s.rightHomologyData.Q = S.X₃

noncomputable def CategoryTheory.ShortComplex.Splitting.homologyData {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Limits.HasZeroObject C] (s : S.Splitting) :

S.HomologyData

The homology data on a short complex equipped with a splitting.

Equations

s.homologyData = { left := s.leftHomologyData, right := s.rightHomologyData, iso := CategoryTheory.Iso.refl 0, comm := ⋯ }

Instances For

@[simp]

theorem CategoryTheory.ShortComplex.Splitting.homologyData_iso {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Limits.HasZeroObject C] (s : S.Splitting) :

s.homologyData.iso = CategoryTheory.Iso.refl 0

@[simp]

theorem CategoryTheory.ShortComplex.Splitting.homologyData_right {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Limits.HasZeroObject C] (s : S.Splitting) :

s.homologyData.right = s.rightHomologyData

@[simp]

theorem CategoryTheory.ShortComplex.Splitting.homologyData_left {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Limits.HasZeroObject C] (s : S.Splitting) :

s.homologyData.left = s.leftHomologyData

theorem CategoryTheory.ShortComplex.Splitting.exact {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Limits.HasZeroObject C] (s : S.Splitting) :

S.Exact

A short complex equipped with a splitting is exact.

noncomputable def CategoryTheory.ShortComplex.Splitting.fIsKernel {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Limits.HasZeroObject C] (s : S.Splitting) :

CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.KernelFork.ofι S.f ⋯)

If a short complex S is equipped with a splitting, then S.X₁ is the kernel of S.g.

Equations

s.fIsKernel = s.homologyData.left.hi

Instances For

noncomputable def CategoryTheory.ShortComplex.Splitting.gIsCokernel {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Limits.HasZeroObject C] (s : S.Splitting) :

CategoryTheory.Limits.IsColimit (CategoryTheory.Limits.CokernelCofork.ofπ S.g ⋯)

If a short complex S is equipped with a splitting, then S.X₃ is the cokernel of S.f.

Equations

s.gIsCokernel = s.homologyData.right.hp

Instances For

def CategoryTheory.ShortComplex.Splitting.map {C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Category.{u_4, u_2} D] [CategoryTheory.Preadditive C] [CategoryTheory.Preadditive D] {S : CategoryTheory.ShortComplex C} (s : S.Splitting) (F : CategoryTheory.Functor C D) [F.Additive] :

(S.map F).Splitting

If a short complex S has a splitting and F is an additive functor, then S.map F also has a splitting.

Equations

s.map F = { r := F.map s.r, s := F.map s.s, f_r := ⋯, s_g := ⋯, id := ⋯ }

Instances For

@[simp]

theorem CategoryTheory.ShortComplex.Splitting.map_s {C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Category.{u_4, u_2} D] [CategoryTheory.Preadditive C] [CategoryTheory.Preadditive D] {S : CategoryTheory.ShortComplex C} (s : S.Splitting) (F : CategoryTheory.Functor C D) [F.Additive] :

(s.map F).s = F.map s.s

@[simp]

theorem CategoryTheory.ShortComplex.Splitting.map_r {C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Category.{u_4, u_2} D] [CategoryTheory.Preadditive C] [CategoryTheory.Preadditive D] {S : CategoryTheory.ShortComplex C} (s : S.Splitting) (F : CategoryTheory.Functor C D) [F.Additive] :

(s.map F).r = F.map s.r

def CategoryTheory.ShortComplex.Splitting.ofIso {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S₁ S₂ : CategoryTheory.ShortComplex C} (s : S₁.Splitting) (e : S₁ ≅ S₂) :

S₂.Splitting

A splitting on a short complex induces splittings on isomorphic short complexes.

Equations

One or more equations did not get rendered due to their size.

Instances For

@[simp]

theorem CategoryTheory.ShortComplex.Splitting.ofIso_r {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S₁ S₂ : CategoryTheory.ShortComplex C} (s : S₁.Splitting) (e : S₁ ≅ S₂) :

(s.ofIso e).r = CategoryTheory.CategoryStruct.comp e.inv.τ₂ (CategoryTheory.CategoryStruct.comp s.r e.hom.τ₁)

@[simp]

theorem CategoryTheory.ShortComplex.Splitting.ofIso_s {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S₁ S₂ : CategoryTheory.ShortComplex C} (s : S₁.Splitting) (e : S₁ ≅ S₂) :

(s.ofIso e).s = CategoryTheory.CategoryStruct.comp e.inv.τ₃ (CategoryTheory.CategoryStruct.comp s.s e.hom.τ₂)

noncomputable def CategoryTheory.ShortComplex.Splitting.ofHasBinaryBiproduct {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] (X₁ X₂ : C) [CategoryTheory.Limits.HasBinaryBiproduct X₁ X₂] :

(CategoryTheory.ShortComplex.mk CategoryTheory.Limits.biprod.inl CategoryTheory.Limits.biprod.snd ⋯).Splitting

The obvious splitting of the short complex X₁ ⟶ X₁ ⊞ X₂ ⟶ X₂.

Equations

CategoryTheory.ShortComplex.Splitting.ofHasBinaryBiproduct X₁ X₂ = { r := CategoryTheory.Limits.biprod.fst, s := CategoryTheory.Limits.biprod.inr, f_r := ⋯, s_g := ⋯, id := ⋯ }

Instances For

noncomputable def CategoryTheory.ShortComplex.Splitting.ofIsZeroOfIsIso {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] (S : CategoryTheory.ShortComplex C) (hf : CategoryTheory.Limits.IsZero S.X₁) (hg : CategoryTheory.IsIso S.g) :

S.Splitting

The obvious splitting of a short complex when S.X₁ is zero and S.g is an isomorphism.

Equations

CategoryTheory.ShortComplex.Splitting.ofIsZeroOfIsIso S hf hg = { r := 0, s := CategoryTheory.inv S.g, f_r := ⋯, s_g := ⋯, id := ⋯ }

Instances For

noncomputable def CategoryTheory.ShortComplex.Splitting.ofIsIsoOfIsZero {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] (S : CategoryTheory.ShortComplex C) (hf : CategoryTheory.IsIso S.f) (hg : CategoryTheory.Limits.IsZero S.X₃) :

S.Splitting

The obvious splitting of a short complex when S.f is an isomorphism and S.X₃ is zero.

Equations

CategoryTheory.ShortComplex.Splitting.ofIsIsoOfIsZero S hf hg = { r := CategoryTheory.inv S.f, s := 0, f_r := ⋯, s_g := ⋯, id := ⋯ }

Instances For

def CategoryTheory.ShortComplex.Splitting.op {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (h : S.Splitting) :

S.op.Splitting

The splitting of the short complex S.op deduced from a splitting of S.

Equations

h.op = { r := h.s.op, s := h.r.op, f_r := ⋯, s_g := ⋯, id := ⋯ }

Instances For

@[simp]

theorem CategoryTheory.ShortComplex.Splitting.op_s {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (h : S.Splitting) :

h.op.s = h.r.op

@[simp]

theorem CategoryTheory.ShortComplex.Splitting.op_r {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (h : S.Splitting) :

h.op.r = h.s.op

def CategoryTheory.ShortComplex.Splitting.unop {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex Cᵒᵖ} (h : S.Splitting) :

S.unop.Splitting

The splitting of the short complex S.unop deduced from a splitting of S.

Equations

h.unop = { r := h.s.unop, s := h.r.unop, f_r := ⋯, s_g := ⋯, id := ⋯ }

Instances For

@[simp]

theorem CategoryTheory.ShortComplex.Splitting.unop_s {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex Cᵒᵖ} (h : S.Splitting) :

h.unop.s = h.r.unop

@[simp]

theorem CategoryTheory.ShortComplex.Splitting.unop_r {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex Cᵒᵖ} (h : S.Splitting) :

h.unop.r = h.s.unop

noncomputable def CategoryTheory.ShortComplex.Splitting.isoBinaryBiproduct {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (h : S.Splitting) [CategoryTheory.Limits.HasBinaryBiproduct S.X₁ S.X₃] :

S.X₂ ≅ S.X₁ ⊞ S.X₃

The isomorphism S.X₂ ≅ S.X₁ ⊞ S.X₃ induced by a splitting of the short complex S.

Equations

h.isoBinaryBiproduct = { hom := CategoryTheory.Limits.biprod.lift h.r S.g, inv := CategoryTheory.Limits.biprod.desc S.f h.s, hom_inv_id := ⋯, inv_hom_id := ⋯ }

Instances For

@[simp]

theorem CategoryTheory.ShortComplex.Splitting.isoBinaryBiproduct_inv {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (h : S.Splitting) [CategoryTheory.Limits.HasBinaryBiproduct S.X₁ S.X₃] :

h.isoBinaryBiproduct.inv = CategoryTheory.Limits.biprod.desc S.f h.s

@[simp]

theorem CategoryTheory.ShortComplex.Splitting.isoBinaryBiproduct_hom {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} (h : S.Splitting) [CategoryTheory.Limits.HasBinaryBiproduct S.X₁ S.X₃] :

h.isoBinaryBiproduct.hom = CategoryTheory.Limits.biprod.lift h.r S.g

theorem CategoryTheory.ShortComplex.Exact.isIso_f' {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Balanced C] (hS : S.Exact) (h : S.LeftHomologyData) [CategoryTheory.Mono S.f] :

CategoryTheory.IsIso h.f'

theorem CategoryTheory.ShortComplex.Exact.isIso_toCycles {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Balanced C] (hS : S.Exact) [CategoryTheory.Mono S.f] [S.HasLeftHomology] :

CategoryTheory.IsIso S.toCycles

theorem CategoryTheory.ShortComplex.Exact.isIso_g' {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Balanced C] (hS : S.Exact) (h : S.RightHomologyData) [CategoryTheory.Epi S.g] :

CategoryTheory.IsIso h.g'

theorem CategoryTheory.ShortComplex.Exact.isIso_fromOpcycles {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Balanced C] (hS : S.Exact) [CategoryTheory.Epi S.g] [S.HasRightHomology] :

CategoryTheory.IsIso S.fromOpcycles

noncomputable def CategoryTheory.ShortComplex.Exact.fIsKernel {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Balanced C] (hS : S.Exact) [CategoryTheory.Mono S.f] :

CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.KernelFork.ofι S.f ⋯)

In a balanced category, if a short complex S is exact and S.f is a mono, then S.X₁ is the kernel of S.g.

Equations

hS.fIsKernel = S.cyclesIsKernel.ofIsoLimit (CategoryTheory.Limits.Fork.ext (CategoryTheory.asIso S.toCycles).symm ⋯)

Instances For

theorem CategoryTheory.ShortComplex.Exact.map_of_mono_of_preservesKernel {C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Category.{u_4, u_2} D] [CategoryTheory.Preadditive C] [CategoryTheory.Preadditive D] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Balanced C] (hS : S.Exact) (F : CategoryTheory.Functor C D) [F.PreservesZeroMorphisms] [(S.map F).HasHomology] :

CategoryTheory.Mono S.f → CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.parallelPair S.g 0) F → (S.map F).Exact

noncomputable def CategoryTheory.ShortComplex.Exact.gIsCokernel {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Balanced C] (hS : S.Exact) [CategoryTheory.Epi S.g] :

CategoryTheory.Limits.IsColimit (CategoryTheory.Limits.CokernelCofork.ofπ S.g ⋯)

In a balanced category, if a short complex S is exact and S.g is an epi, then S.X₃ is the cokernel of S.g.

Equations

hS.gIsCokernel = S.opcyclesIsCokernel.ofIsoColimit (CategoryTheory.Limits.Cofork.ext (CategoryTheory.asIso S.fromOpcycles) ⋯)

Instances For

theorem CategoryTheory.ShortComplex.Exact.map_of_epi_of_preservesCokernel {C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Category.{u_4, u_2} D] [CategoryTheory.Preadditive C] [CategoryTheory.Preadditive D] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Balanced C] (hS : S.Exact) (F : CategoryTheory.Functor C D) [F.PreservesZeroMorphisms] [(S.map F).HasHomology] :

CategoryTheory.Epi S.g → CategoryTheory.Limits.PreservesColimit (CategoryTheory.Limits.parallelPair S.f 0) F → (S.map F).Exact

noncomputable def CategoryTheory.ShortComplex.Exact.lift {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Balanced C] (hS : S.Exact) {A : C} (k : A ⟶ S.X₂) (hk : CategoryTheory.CategoryStruct.comp k S.g = 0) [CategoryTheory.Mono S.f] :

A ⟶ S.X₁

If a short complex S in a balanced category is exact and such that S.f is a mono, then a morphism k : A ⟶ S.X₂ such that k ≫ S.g = 0 lifts to a morphism A ⟶ S.X₁.

Equations

hS.lift k hk = hS.fIsKernel.lift (CategoryTheory.Limits.KernelFork.ofι k hk)

Instances For

@[simp]

theorem CategoryTheory.ShortComplex.Exact.lift_f {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Balanced C] (hS : S.Exact) {A : C} (k : A ⟶ S.X₂) (hk : CategoryTheory.CategoryStruct.comp k S.g = 0) [CategoryTheory.Mono S.f] :

CategoryTheory.CategoryStruct.comp (hS.lift k hk) S.f = k

@[simp]

theorem CategoryTheory.ShortComplex.Exact.lift_f_assoc {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Balanced C] (hS : S.Exact) {A : C} (k : A ⟶ S.X₂) (hk : CategoryTheory.CategoryStruct.comp k S.g = 0) [CategoryTheory.Mono S.f] {Z : C} (h : S.X₂ ⟶ Z) :

CategoryTheory.CategoryStruct.comp (hS.lift k hk) (CategoryTheory.CategoryStruct.comp S.f h) = CategoryTheory.CategoryStruct.comp k h

theorem CategoryTheory.ShortComplex.Exact.lift' {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Balanced C] (hS : S.Exact) {A : C} (k : A ⟶ S.X₂) (hk : CategoryTheory.CategoryStruct.comp k S.g = 0) [CategoryTheory.Mono S.f] :

∃ (l : A ⟶ S.X₁), CategoryTheory.CategoryStruct.comp l S.f = k

noncomputable def CategoryTheory.ShortComplex.Exact.desc {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Balanced C] (hS : S.Exact) {A : C} (k : S.X₂ ⟶ A) (hk : CategoryTheory.CategoryStruct.comp S.f k = 0) [CategoryTheory.Epi S.g] :

S.X₃ ⟶ A

If a short complex S in a balanced category is exact and such that S.g is an epi, then a morphism k : S.X₂ ⟶ A such that S.f ≫ k = 0 descends to a morphism S.X₃ ⟶ A.

Equations

hS.desc k hk = hS.gIsCokernel.desc (CategoryTheory.Limits.CokernelCofork.ofπ k hk)

Instances For

@[simp]

theorem CategoryTheory.ShortComplex.Exact.g_desc {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Balanced C] (hS : S.Exact) {A : C} (k : S.X₂ ⟶ A) (hk : CategoryTheory.CategoryStruct.comp S.f k = 0) [CategoryTheory.Epi S.g] :

CategoryTheory.CategoryStruct.comp S.g (hS.desc k hk) = k

@[simp]

theorem CategoryTheory.ShortComplex.Exact.g_desc_assoc {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Balanced C] (hS : S.Exact) {A : C} (k : S.X₂ ⟶ A) (hk : CategoryTheory.CategoryStruct.comp S.f k = 0) [CategoryTheory.Epi S.g] {Z : C} (h : A ⟶ Z) :

CategoryTheory.CategoryStruct.comp S.g (CategoryTheory.CategoryStruct.comp (hS.desc k hk) h) = CategoryTheory.CategoryStruct.comp k h

theorem CategoryTheory.ShortComplex.Exact.desc' {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {S : CategoryTheory.ShortComplex C} [CategoryTheory.Balanced C] (hS : S.Exact) {A : C} (k : S.X₂ ⟶ A) (hk : CategoryTheory.CategoryStruct.comp S.f k = 0) [CategoryTheory.Epi S.g] :

∃ (l : S.X₃ ⟶ A), CategoryTheory.CategoryStruct.comp S.g l = k

theorem CategoryTheory.ShortComplex.mono_τ₂_of_exact_of_mono {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Balanced C] {S₁ S₂ : CategoryTheory.ShortComplex C} (φ : S₁ ⟶ S₂) (h₁ : S₁.Exact) [CategoryTheory.Mono S₁.f] [CategoryTheory.Mono S₂.f] [CategoryTheory.Mono φ.τ₁] [CategoryTheory.Mono φ.τ₃] :

CategoryTheory.Mono φ.τ₂

theorem CategoryTheory.ShortComplex.epi_τ₂_of_exact_of_epi {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Balanced C] {S₁ S₂ : CategoryTheory.ShortComplex C} (φ : S₁ ⟶ S₂) (h₂ : S₂.Exact) [CategoryTheory.Epi S₁.g] [CategoryTheory.Epi S₂.g] [CategoryTheory.Epi φ.τ₁] [CategoryTheory.Epi φ.τ₃] :

CategoryTheory.Epi φ.τ₂

theorem CategoryTheory.ShortComplex.exact_and_mono_f_iff_f_is_kernel {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] (S : CategoryTheory.ShortComplex C) [CategoryTheory.Balanced C] [S.HasHomology] :

S.Exact ∧ CategoryTheory.Mono S.f ↔ Nonempty (CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.KernelFork.ofι S.f ⋯))

theorem CategoryTheory.ShortComplex.exact_and_epi_g_iff_g_is_cokernel {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] (S : CategoryTheory.ShortComplex C) [CategoryTheory.Balanced C] [S.HasHomology] :

S.Exact ∧ CategoryTheory.Epi S.g ↔ Nonempty (CategoryTheory.Limits.IsColimit (CategoryTheory.Limits.CokernelCofork.ofπ S.g ⋯))

theorem CategoryTheory.ShortComplex.quasiIso_iff_of_zeros {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Abelian C] {S₁ S₂ : CategoryTheory.ShortComplex C} (φ : S₁ ⟶ S₂) (hf₁ : S₁.f = 0) (hg₁ : S₁.g = 0) (hf₂ : S₂.f = 0) :

CategoryTheory.ShortComplex.QuasiIso φ ↔ (CategoryTheory.ShortComplex.mk φ.τ₂ S₂.g ⋯).Exact ∧ CategoryTheory.Mono φ.τ₂

Given a morphism of short complexes φ : S₁ ⟶ S₂ in an abelian category, if S₁.f and S₁.g are zero (e.g. when S₁ is of the form 0 ⟶ S₁.X₂ ⟶ 0) and S₂.f = 0 (e.g when S₂ is of the form 0 ⟶ S₂.X₂ ⟶ S₂.X₃), then φ is a quasi-isomorphism iff the obvious short complex S₁.X₂ ⟶ S₂.X₂ ⟶ S₂.X₃ is exact and φ.τ₂ is a mono).

theorem CategoryTheory.ShortComplex.quasiIso_iff_of_zeros' {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Abelian C] {S₁ S₂ : CategoryTheory.ShortComplex C} (φ : S₁ ⟶ S₂) (hg₁ : S₁.g = 0) (hf₂ : S₂.f = 0) (hg₂ : S₂.g = 0) :

CategoryTheory.ShortComplex.QuasiIso φ ↔ (CategoryTheory.ShortComplex.mk S₁.f φ.τ₂ ⋯).Exact ∧ CategoryTheory.Epi φ.τ₂

Given a morphism of short complexes φ : S₁ ⟶ S₂ in an abelian category, if S₁.g = 0 (e.g when S₁ is of the form S₁.X₁ ⟶ S₁.X₂ ⟶ 0) and both S₂.f and S₂.g are zero (e.g when S₂ is of the form 0 ⟶ S₂.X₂ ⟶ 0), then φ is a quasi-isomorphism iff the obvious short complex S₁.X₂ ⟶ S₁.X₂ ⟶ S₂.X₂ is exact and φ.τ₂ is an epi).

noncomputable def CategoryTheory.ShortComplex.Exact.descToInjective {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Abelian C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) {J : C} (f : S.X₂ ⟶ J) [CategoryTheory.Injective J] (hf : CategoryTheory.CategoryStruct.comp S.f f = 0) :

S.X₃ ⟶ J

If S is an exact short complex and f : S.X₂ ⟶ J is a morphism to an injective object J such that S.f ≫ f = 0, this is a morphism φ : S.X₃ ⟶ J such that S.g ≫ φ = f.

Equations

hS.descToInjective f hf = CategoryTheory.Injective.factorThru (S.descOpcycles f hf) S.fromOpcycles

Instances For

@[simp]

theorem CategoryTheory.ShortComplex.Exact.comp_descToInjective {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Abelian C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) {J : C} (f : S.X₂ ⟶ J) [CategoryTheory.Injective J] (hf : CategoryTheory.CategoryStruct.comp S.f f = 0) :

CategoryTheory.CategoryStruct.comp S.g (hS.descToInjective f hf) = f

@[simp]

theorem CategoryTheory.ShortComplex.Exact.comp_descToInjective_assoc {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Abelian C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) {J : C} (f : S.X₂ ⟶ J) [CategoryTheory.Injective J] (hf : CategoryTheory.CategoryStruct.comp S.f f = 0) {Z : C} (h : J ⟶ Z) :

CategoryTheory.CategoryStruct.comp S.g (CategoryTheory.CategoryStruct.comp (hS.descToInjective f hf) h) = CategoryTheory.CategoryStruct.comp f h

noncomputable def CategoryTheory.ShortComplex.Exact.liftFromProjective {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Abelian C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) {P : C} (f : P ⟶ S.X₂) [CategoryTheory.Projective P] (hf : CategoryTheory.CategoryStruct.comp f S.g = 0) :

P ⟶ S.X₁

If S is an exact short complex and f : P ⟶ S.X₂ is a morphism from a projective object P such that f ≫ S.g = 0, this is a morphism φ : P ⟶ S.X₁ such that φ ≫ S.f = f.

Equations

hS.liftFromProjective f hf = CategoryTheory.Projective.factorThru (S.liftCycles f hf) S.toCycles

Instances For

@[simp]

theorem CategoryTheory.ShortComplex.Exact.liftFromProjective_comp {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Abelian C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) {P : C} (f : P ⟶ S.X₂) [CategoryTheory.Projective P] (hf : CategoryTheory.CategoryStruct.comp f S.g = 0) :

CategoryTheory.CategoryStruct.comp (hS.liftFromProjective f hf) S.f = f

@[simp]

theorem CategoryTheory.ShortComplex.Exact.liftFromProjective_comp_assoc {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Abelian C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) {P : C} (f : P ⟶ S.X₂) [CategoryTheory.Projective P] (hf : CategoryTheory.CategoryStruct.comp f S.g = 0) {Z : C} (h : S.X₂ ⟶ Z) :

CategoryTheory.CategoryStruct.comp (hS.liftFromProjective f hf) (CategoryTheory.CategoryStruct.comp S.f h) = CategoryTheory.CategoryStruct.comp f h

@[deprecated CategoryTheory.ShortComplex.Exact.liftFromProjective]

def CategoryTheory.Exact.lift {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Abelian C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) {P : C} (f : P ⟶ S.X₂) [CategoryTheory.Projective P] (hf : CategoryTheory.CategoryStruct.comp f S.g = 0) :

P ⟶ S.X₁

Alias of CategoryTheory.ShortComplex.Exact.liftFromProjective.

If S is an exact short complex and f : P ⟶ S.X₂ is a morphism from a projective object P such that f ≫ S.g = 0, this is a morphism φ : P ⟶ S.X₁ such that φ ≫ S.f = f.

Equations

@CategoryTheory.Exact.lift = @CategoryTheory.ShortComplex.Exact.liftFromProjective

Instances For

@[deprecated CategoryTheory.ShortComplex.Exact.liftFromProjective_comp]

theorem CategoryTheory.Exact.lift_comp {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Abelian C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) {P : C} (f : P ⟶ S.X₂) [CategoryTheory.Projective P] (hf : CategoryTheory.CategoryStruct.comp f S.g = 0) :

CategoryTheory.CategoryStruct.comp (hS.liftFromProjective f hf) S.f = f

Alias of CategoryTheory.ShortComplex.Exact.liftFromProjective_comp.

@[deprecated CategoryTheory.ShortComplex.Exact.descToInjective]

def CategoryTheory.Injective.Exact.desc {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Abelian C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) {J : C} (f : S.X₂ ⟶ J) [CategoryTheory.Injective J] (hf : CategoryTheory.CategoryStruct.comp S.f f = 0) :

S.X₃ ⟶ J

Alias of CategoryTheory.ShortComplex.Exact.descToInjective.

If S is an exact short complex and f : S.X₂ ⟶ J is a morphism to an injective object J such that S.f ≫ f = 0, this is a morphism φ : S.X₃ ⟶ J such that S.g ≫ φ = f.

Equations

@CategoryTheory.Injective.Exact.desc = @CategoryTheory.ShortComplex.Exact.descToInjective

Instances For

@[deprecated CategoryTheory.ShortComplex.Exact.comp_descToInjective]

theorem CategoryTheory.Injective.Exact.comp_desc {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Abelian C] {S : CategoryTheory.ShortComplex C} (hS : S.Exact) {J : C} (f : S.X₂ ⟶ J) [CategoryTheory.Injective J] (hf : CategoryTheory.CategoryStruct.comp S.f f = 0) :

CategoryTheory.CategoryStruct.comp S.g (hS.descToInjective f hf) = f

Alias of CategoryTheory.ShortComplex.Exact.comp_descToInjective.

instance CategoryTheory.Functor.instPreservesMonomorphisms {C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Category.{u_4, u_2} D] (F : CategoryTheory.Functor C D) [CategoryTheory.Preadditive C] [CategoryTheory.Preadditive D] [CategoryTheory.Limits.HasZeroObject C] [CategoryTheory.Limits.HasZeroObject D] [F.PreservesZeroMorphisms] [F.PreservesHomology] :

F.PreservesMonomorphisms

Equations

⋯ = ⋯

instance CategoryTheory.Functor.instPreservesEpimorphisms {C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Category.{u_4, u_2} D] (F : CategoryTheory.Functor C D) [CategoryTheory.Preadditive C] [CategoryTheory.Preadditive D] [CategoryTheory.Limits.HasZeroObject C] [CategoryTheory.Limits.HasZeroObject D] [F.PreservesZeroMorphisms] [F.PreservesHomology] :

F.PreservesEpimorphisms

Equations

⋯ = ⋯

noncomputable def CategoryTheory.ShortComplex.Splitting.ofExactOfSection {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Balanced C] (S : CategoryTheory.ShortComplex C) (hS : S.Exact) (s : S.X₃ ⟶ S.X₂) (s_g : CategoryTheory.CategoryStruct.comp s S.g = CategoryTheory.CategoryStruct.id S.X₃) (hf : CategoryTheory.Mono S.f) :

S.Splitting

This is the splitting of a short complex S in a balanced category induced by a section of the morphism S.g : S.X₂ ⟶ S.X₃

Equations

One or more equations did not get rendered due to their size.

Instances For

noncomputable def CategoryTheory.ShortComplex.Splitting.ofExactOfRetraction {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] [CategoryTheory.Balanced C] (S : CategoryTheory.ShortComplex C) (hS : S.Exact) (r : S.X₂ ⟶ S.X₁) (f_r : CategoryTheory.CategoryStruct.comp S.f r = CategoryTheory.CategoryStruct.id S.X₁) (hg : CategoryTheory.Epi S.g) :

S.Splitting

This is the splitting of a short complex S in a balanced category induced by a retraction of the morphism S.f : S.X₁ ⟶ S.X₂

Equations

One or more equations did not get rendered due to their size.

Instances For