Theorems · Theorem · category theory

CategoryTheory.Functor.preservesCoequalizer_of_preservesCokernels

∀ {C : Type u₁} [inst : CategoryTheory.Category.{v₁, u₁} C] [inst_1 : CategoryTheory.Preadditive C] {D : Type u₂}
  [inst_2 : CategoryTheory.Category.{v₂, u₂} D] [inst_3 : CategoryTheory.Preadditive D] (F : CategoryTheory.Functor C D)
  [F.PreservesZeroMorphisms] [CategoryTheory.Limits.HasBinaryBiproducts C]
  [∀ {X Y : C} (f : X ⟶ Y), CategoryTheory.Limits.PreservesColimit (CategoryTheory.Limits.parallelPair f 0) F] {X Y : C}
  (f g : X ⟶ Y), CategoryTheory.Limits.PreservesColimit (CategoryTheory.Limits.parallelPair f g) F

A functor between preadditive categories preserves the coequalizer of two morphisms if it preserves all cokernels.

Defined in

Mathlib.CategoryTheory.Preadditive.LeftExact

Cited by

1 results in Mathlib

Foundations

Depth 41 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

CategoryTheory.CategoryCategoryTheory.PreadditiveCategoryTheory.CategoryCategoryTheory.PreadditiveCategoryTheory.Functor.PreservesZeroMorphismsCategoryTheory.Limits.HasBinaryBiproductsCategoryTheory.Limits.PreservesColimit