If C
is preadditive, Cᵒᵖ
has a natural preadditive structure. #
instance
CategoryTheory.instPreadditiveOppositeOpposite
(C : Type u_1)
[CategoryTheory.Category.{u_2, u_1} C]
[CategoryTheory.Preadditive C]
:
Equations
- CategoryTheory.instPreadditiveOppositeOpposite C = CategoryTheory.Preadditive.mk
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) (X.unop ⟶ Y)
Equations
- One or more equations did not get rendered due to their size.
@[simp]
theorem
CategoryTheory.unop_add
(C : Type u_1)
[CategoryTheory.Category.{u_2, u_1} C]
[CategoryTheory.Preadditive C]
{X : Cᵒᵖ}
{Y : Cᵒᵖ}
(f : X ⟶ Y)
(g : X ⟶ Y)
:
@[simp]
theorem
CategoryTheory.unop_zsmul
(C : Type u_1)
[CategoryTheory.Category.{u_2, u_1} C]
[CategoryTheory.Preadditive C]
{X : Cᵒᵖ}
{Y : Cᵒᵖ}
(k : ℤ)
(f : X ⟶ Y)
:
@[simp]
theorem
CategoryTheory.unop_neg
(C : Type u_1)
[CategoryTheory.Category.{u_2, u_1} C]
[CategoryTheory.Preadditive C]
{X : Cᵒᵖ}
{Y : Cᵒᵖ}
(f : X ⟶ Y)
:
@[simp]
theorem
CategoryTheory.op_add
(C : Type u_1)
[CategoryTheory.Category.{u_2, u_1} C]
[CategoryTheory.Preadditive C]
{X : C}
{Y : C}
(f : X ⟶ Y)
(g : X ⟶ Y)
:
@[simp]
theorem
CategoryTheory.op_zsmul
(C : Type u_1)
[CategoryTheory.Category.{u_2, u_1} C]
[CategoryTheory.Preadditive C]
{X : C}
{Y : C}
(k : ℤ)
(f : X ⟶ Y)
:
@[simp]
theorem
CategoryTheory.op_neg
(C : Type u_1)
[CategoryTheory.Category.{u_2, u_1} C]
[CategoryTheory.Preadditive C]
{X : C}
{Y : C}
(f : X ⟶ Y)
:
@[simp]
theorem
CategoryTheory.unopHom_apply
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
[CategoryTheory.Preadditive C]
(X : Cᵒᵖ)
(Y : Cᵒᵖ)
(f : X ⟶ Y)
:
(CategoryTheory.unopHom X Y) f = f.unop
def
CategoryTheory.unopHom
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
[CategoryTheory.Preadditive C]
(X : Cᵒᵖ)
(Y : Cᵒᵖ)
:
unop
induces morphisms of monoids on hom groups of a preadditive category
Equations
- CategoryTheory.unopHom X Y = AddMonoidHom.mk' (fun (f : X ⟶ Y) => f.unop) (_ : ∀ (f g : X ⟶ Y), (f + g).unop = f.unop + g.unop)
Instances For
@[simp]
theorem
CategoryTheory.unop_sum
{C : Type u_1}
[CategoryTheory.Category.{u_3, u_1} C]
[CategoryTheory.Preadditive C]
(X : Cᵒᵖ)
(Y : Cᵒᵖ)
{ι : Type u_2}
(s : Finset ι)
(f : ι → (X ⟶ Y))
:
(Finset.sum s f).unop = Finset.sum s fun (i : ι) => (f i).unop
@[simp]
theorem
CategoryTheory.opHom_apply
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
[CategoryTheory.Preadditive C]
(X : C)
(Y : C)
(f : X ⟶ Y)
:
(CategoryTheory.opHom X Y) f = f.op
def
CategoryTheory.opHom
{C : Type u_1}
[CategoryTheory.Category.{u_2, u_1} C]
[CategoryTheory.Preadditive C]
(X : C)
(Y : C)
:
(X ⟶ Y) →+ (Opposite.op Y ⟶ Opposite.op X)
op
induces morphisms of monoids on hom groups of a preadditive category
Equations
- CategoryTheory.opHom X Y = AddMonoidHom.mk' (fun (f : X ⟶ Y) => f.op) (_ : ∀ (f g : X ⟶ Y), (f + g).op = f.op + g.op)
Instances For
@[simp]
theorem
CategoryTheory.op_sum
{C : Type u_1}
[CategoryTheory.Category.{u_3, u_1} C]
[CategoryTheory.Preadditive C]
(X : C)
(Y : C)
{ι : Type u_2}
(s : Finset ι)
(f : ι → (X ⟶ Y))
:
(Finset.sum s f).op = Finset.sum s fun (i : ι) => (f i).op
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)
[CategoryTheory.Functor.Additive F]
:
Equations
- (_ : CategoryTheory.Functor.Additive F.op) = (_ : CategoryTheory.Functor.Additive F.op)
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)
[CategoryTheory.Functor.Additive F]
:
CategoryTheory.Functor.Additive F.rightOp
Equations
- (_ : CategoryTheory.Functor.Additive F.rightOp) = (_ : CategoryTheory.Functor.Additive F.rightOp)
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ᵒᵖ)
[CategoryTheory.Functor.Additive F]
:
CategoryTheory.Functor.Additive F.leftOp
Equations
- (_ : CategoryTheory.Functor.Additive F.leftOp) = (_ : CategoryTheory.Functor.Additive F.leftOp)
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ᵒᵖ)
[CategoryTheory.Functor.Additive F]
: