Documentation

Mathlib.CategoryTheory.Monoidal.Opposite

Monoidal opposites #

We write Cᵐᵒᵖ for the monoidal opposite of a monoidal category C.

structure CategoryTheory.MonoidalOpposite (C : Type u₁) :
Type u₁

The type of objects of the opposite (or "reverse") monoidal category. Use the notation Cᴹᵒᵖ.

Instances For

    The type of objects of the opposite (or "reverse") monoidal category. Use the notation Cᴹᵒᵖ.

    Instances For
      theorem CategoryTheory.MonoidalOpposite.mop_inj_iff {C : Type u₁} (x y : C) :
      { unmop := x } = { unmop := y } x = y
      @[simp]
      theorem CategoryTheory.MonoidalOpposite.unmop_inj_iff {C : Type u₁} (x y : Cᴹᵒᵖ) :
      x.unmop = y.unmop x = y
      @[simp]
      theorem CategoryTheory.MonoidalOpposite.mop_unmop {C : Type u₁} (X : Cᴹᵒᵖ) :
      { unmop := X.unmop } = X
      theorem CategoryTheory.MonoidalOpposite.unmop_mop {C : Type u₁} (X : C) :
      { unmop := X }.unmop = X
      def Quiver.Hom.mop {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y : C} (f : X Y) :
      { unmop := X } { unmop := Y }

      The monoidal opposite of a morphism f : X ⟶ Y is just f, thought of as mop X ⟶ mop Y.

      Instances For

        We can think of a morphism f : mop X ⟶ mop Y as a morphism X ⟶ Y.

        Instances For
          theorem Quiver.Hom.mop_inj {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y : C} :
          Function.Injective mop
          @[simp]
          theorem Quiver.Hom.unmop_mop {C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y : C} {f : X Y} :
          f.mop.unmop = f
          @[simp]
          theorem CategoryTheory.mop_comp {C : Type u₁} [Category.{v₁, u₁} C] {X Y Z : C} {f : X Y} {g : Y Z} :
          theorem CategoryTheory.MonoidalOpposite.hom_ext {C : Type u₁} [Category.{v₁, u₁} C] {x y : Cᴹᵒᵖ} {f g : x y} (h : f.unmop = g.unmop) :
          f = g

          The identity functor on C, viewed as a functor from C to its monoidal opposite.

          Instances For
            @[simp]
            theorem CategoryTheory.mopFunctor_obj (C : Type u₁) [Category.{v₁, u₁} C] (unmop : C) :
            (mopFunctor C).obj unmop = { unmop := unmop }
            @[simp]
            theorem CategoryTheory.mopFunctor_map (C : Type u₁) [Category.{v₁, u₁} C] {X✝ Y✝ : C} (f : X✝ Y✝) :
            (mopFunctor C).map f = f.mop

            The identity functor on C, viewed as a functor from the monoidal opposite of C to C.

            Instances For
              @[simp]
              theorem CategoryTheory.unmopFunctor_map (C : Type u₁) [Category.{v₁, u₁} C] {X✝ Y✝ : Cᴹᵒᵖ} (f : X✝ Y✝) :
              @[reducible, inline]
              abbrev CategoryTheory.Iso.mop {C : Type u₁} [Category.{v₁, u₁} C] {X Y : C} (f : X Y) :
              { unmop := X } { unmop := Y }

              An isomorphism in C gives an isomorphism in Cᴹᵒᵖ.

              Instances For
                @[reducible, inline]
                abbrev CategoryTheory.Iso.unmop {C : Type u₁} [Category.{v₁, u₁} C] {X Y : Cᴹᵒᵖ} (f : X Y) :

                An isomorphism in Cᴹᵒᵖ gives an isomorphism in C.

                Instances For
                  @[simp]
                  theorem CategoryTheory.op_tensorHom {C : Type u₁} [Category.{v₁, u₁} C] [MonoidalCategory C] {X₁ Y₁ X₂ Y₂ : C} (f : X₁ Y₁) (g : X₂ Y₂) :
                  @[simp]
                  theorem CategoryTheory.unop_tensorHom {C : Type u₁} [Category.{v₁, u₁} C] [MonoidalCategory C] {X₁ Y₁ X₂ Y₂ : Cᵒᵖ} (f : X₁ Y₁) (g : X₂ Y₂) :
                  @[simp]
                  theorem CategoryTheory.mop_tensorHom {C : Type u₁} [Category.{v₁, u₁} C] [MonoidalCategory C] {X₁ Y₁ X₂ Y₂ : C} (f : X₁ Y₁) (g : X₂ Y₂) :

                  The (identity) equivalence between C and its monoidal opposite.

                  Instances For

                    The (identity) equivalence between Cᴹᵒᵖ and C.

                    Instances For

                      The equivalence between C and its monoidal opposite's monoidal opposite.

                      Instances For

                        The identification mop X ⊗ - = mop (- ⊗ X) as a natural isomorphism.

                        Instances For

                          The identification - ⊗ X = mop (unmop X ⊗ -) as a natural isomorphism.

                          Instances For

                            The identification - ⊗ mop X = mop (- ⊗ unmop X) as a natural isomorphism.

                            Instances For