Documentation

Mathlib.CategoryTheory.Preadditive.Opposite

If C is preadditive, Cᵒᵖ has a natural preadditive structure. #

source
instance CategoryTheory.instPreadditiveOpposite (C : Type u_1) [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Preadditive C] :
CategoryTheory.Preadditive Cᵒᵖ
Equations
source
instance CategoryTheory.moduleEndLeft (C : Type u_1) [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Preadditive C] {X : Cᵒᵖ} {Y : C} :
Module (CategoryTheory.End X) (Opposite.unop X ⟶ Y)
Equations
source
@[simp]
theorem CategoryTheory.unop_add (C : Type u_1) [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Preadditive C] {X Y : Cᵒᵖ} (f g : X ⟶ Y) :
(f + g).unop = f.unop + g.unop
source
@[simp]
theorem CategoryTheory.unop_zsmul (C : Type u_1) [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Preadditive C] {X Y : Cᵒᵖ} (k : ℤ) (f : X ⟶ Y) :
(k • f).unop = k • f.unop
source
@[simp]
theorem CategoryTheory.unop_neg (C : Type u_1) [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Preadditive C] {X Y : Cᵒᵖ} (f : X ⟶ Y) :
(-f).unop = -f.unop
source
@[simp]
theorem CategoryTheory.op_add (C : Type u_1) [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Preadditive C] {X Y : C} (f g : X ⟶ Y) :
(f + g).op = f.op + g.op
source
@[simp]
theorem CategoryTheory.op_zsmul (C : Type u_1) [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Preadditive C] {X Y : C} (k : ℤ) (f : X ⟶ Y) :
(k • f).op = k • f.op
source
@[simp]
theorem CategoryTheory.op_neg (C : Type u_1) [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Preadditive C] {X Y : C} (f : X ⟶ Y) :
(-f).op = -f.op
source
def CategoryTheory.unopHom {C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Preadditive C] (X Y : Cᵒᵖ) :
(X ⟶ Y) →+ (Opposite.unop Y ⟶ Opposite.unop X)

unop induces morphisms of monoids on hom groups of a preadditive category

Equations
Instances For
    source
    @[simp]
    theorem CategoryTheory.unopHom_apply {C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Preadditive C] (X Y : Cᵒᵖ) (f : X ⟶ Y) :
    (CategoryTheory.unopHom X Y) f = f.unop
    source
    @[simp]
    theorem CategoryTheory.unop_sum {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] (X Y : Cᵒᵖ) {ι : Type u_2} (s : Finset ι) (f : ι → (X ⟶ Y)) :
    (s.sum f).unop = ∑ i ∈ s, (f i).unop
    source
    def CategoryTheory.opHom {C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Preadditive C] (X Y : C) :
    (X ⟶ Y) →+ (Opposite.op Y ⟶ Opposite.op X)

    op induces morphisms of monoids on hom groups of a preadditive category

    Equations
    Instances For
      source
      @[simp]
      theorem CategoryTheory.opHom_apply {C : Type u_1} [CategoryTheory.Category.{u_2, u_1} C] [CategoryTheory.Preadditive C] (X Y : C) (f : X ⟶ Y) :
      (CategoryTheory.opHom X Y) f = f.op
      source
      @[simp]
      theorem CategoryTheory.op_sum {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] (X Y : C) {ι : Type u_2} (s : Finset ι) (f : ι → (X ⟶ Y)) :
      (s.sum f).op = ∑ i ∈ s, (f i).op
      source
      instance CategoryTheory.Functor.op_additive {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {D : Type u_2} [CategoryTheory.Category.{u_4, u_2} D] [CategoryTheory.Preadditive D] (F : CategoryTheory.Functor C D) [F.Additive] :
      F.op.Additive
      Equations
      • ⋯ = ⋯
      source
      instance CategoryTheory.Functor.rightOp_additive {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {D : Type u_2} [CategoryTheory.Category.{u_4, u_2} D] [CategoryTheory.Preadditive D] (F : CategoryTheory.Functor Cᵒᵖ D) [F.Additive] :
      F.rightOp.Additive
      Equations
      • ⋯ = ⋯
      source
      instance CategoryTheory.Functor.leftOp_additive {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {D : Type u_2} [CategoryTheory.Category.{u_4, u_2} D] [CategoryTheory.Preadditive D] (F : CategoryTheory.Functor C Dᵒᵖ) [F.Additive] :
      F.leftOp.Additive
      Equations
      • ⋯ = ⋯
      source
      instance CategoryTheory.Functor.unop_additive {C : Type u_1} [CategoryTheory.Category.{u_3, u_1} C] [CategoryTheory.Preadditive C] {D : Type u_2} [CategoryTheory.Category.{u_4, u_2} D] [CategoryTheory.Preadditive D] (F : CategoryTheory.Functor Cᵒᵖ Dᵒᵖ) [F.Additive] :
      F.unop.Additive
      Equations
      • ⋯ = ⋯