Documentation

Mathlib.CategoryTheory.Monoidal.Free.Basic

The free monoidal category over a type #

Given a type C, the free monoidal category over C has as objects formal expressions built from (formal) tensor products of terms of C and a formal unit. Its morphisms are compositions and tensor products of identities, unitors and associators.

In this file, we construct the free monoidal category and prove that it is a monoidal category. If D is a monoidal category, we construct the functor FreeMonoidalCategory C ⥤ D associated to a function C → D.

The free monoidal category has two important properties: it is a groupoid and it is thin. The former is obvious from the construction, and the latter is what is commonly known as the monoidal coherence theorem. Both of these properties are proved in the file Coherence.lean.

source
inductive CategoryTheory.FreeMonoidalCategory (C : Type u) :
Type u

Given a type C, the free monoidal category over C has as objects formal expressions built from (formal) tensor products of terms of C and a formal unit. Its morphisms are compositions and tensor products of identities, unitors and associators.

Instances For
    source
    instance CategoryTheory.instInhabitedFreeMonoidalCategory :
    {a : Type u_1} → Inhabited (CategoryTheory.FreeMonoidalCategory a)
    Equations
    • CategoryTheory.instInhabitedFreeMonoidalCategory = { default := CategoryTheory.FreeMonoidalCategory.unit }
    source
    inductive CategoryTheory.FreeMonoidalCategory.Hom {C : Type u} :
    CategoryTheory.FreeMonoidalCategory C → CategoryTheory.FreeMonoidalCategory C → Type u

    Formal compositions and tensor products of identities, unitors and associators. The morphisms of the free monoidal category are obtained as a quotient of these formal morphisms by the relations defining a monoidal category.

    Instances For
      source
      inductive CategoryTheory.FreeMonoidalCategory.HomEquiv {C : Type u} {X : CategoryTheory.FreeMonoidalCategory C} {Y : CategoryTheory.FreeMonoidalCategory C} :
      X.Hom Y → X.Hom Y → Prop

      The morphisms of the free monoidal category satisfy 21 relations ensuring that the resulting category is in fact a category and that it is monoidal.

      Instances For
        source
        instance CategoryTheory.FreeMonoidalCategory.setoidHom {C : Type u} (X : CategoryTheory.FreeMonoidalCategory C) (Y : CategoryTheory.FreeMonoidalCategory C) :
        Setoid (X.Hom Y)

        We say that two formal morphisms in the free monoidal category are equivalent if they become equal if we apply the relations that are true in a monoidal category. Note that we will prove that there is only one equivalence class -- this is the monoidal coherence theorem.

        Equations
        • X.setoidHom Y = { r := CategoryTheory.FreeMonoidalCategory.HomEquiv, iseqv := ⋯ }
        source
        instance CategoryTheory.FreeMonoidalCategory.categoryFreeMonoidalCategory {C : Type u} :
        CategoryTheory.Category.{u, u} (CategoryTheory.FreeMonoidalCategory C)
        Equations
        source
        instance CategoryTheory.FreeMonoidalCategory.instMonoidalCategory {C : Type u} :
        CategoryTheory.MonoidalCategory (CategoryTheory.FreeMonoidalCategory C)
        Equations
        source
        @[simp]
        theorem CategoryTheory.FreeMonoidalCategory.mk_comp {C : Type u} {X : CategoryTheory.FreeMonoidalCategory C} {Y : CategoryTheory.FreeMonoidalCategory C} {Z : CategoryTheory.FreeMonoidalCategory C} (f : X.Hom Y) (g : Y.Hom Z) :
        ⟦f.comp g⟧ = CategoryTheory.CategoryStruct.comp ⟦f⟧ ⟦g⟧
        source
        @[simp]
        theorem CategoryTheory.FreeMonoidalCategory.mk_tensor {C : Type u} {X₁ : CategoryTheory.FreeMonoidalCategory C} {Y₁ : CategoryTheory.FreeMonoidalCategory C} {X₂ : CategoryTheory.FreeMonoidalCategory C} {Y₂ : CategoryTheory.FreeMonoidalCategory C} (f : X₁.Hom Y₁) (g : X₂.Hom Y₂) :
        ⟦f.tensor g⟧ = CategoryTheory.MonoidalCategory.tensorHom ⟦f⟧ ⟦g⟧
        source
        @[simp]
        theorem CategoryTheory.FreeMonoidalCategory.mk_whiskerLeft {C : Type u} (X : CategoryTheory.FreeMonoidalCategory C) {Y₁ : CategoryTheory.FreeMonoidalCategory C} {Y₂ : CategoryTheory.FreeMonoidalCategory C} (f : Y₁.Hom Y₂) :
        ⟦CategoryTheory.FreeMonoidalCategory.Hom.whiskerLeft X f⟧ = CategoryTheory.MonoidalCategory.whiskerLeft X ⟦f⟧
        source
        @[simp]
        theorem CategoryTheory.FreeMonoidalCategory.mk_whiskerRight {C : Type u} {X₁ : CategoryTheory.FreeMonoidalCategory C} {X₂ : CategoryTheory.FreeMonoidalCategory C} (f : X₁.Hom X₂) (Y : CategoryTheory.FreeMonoidalCategory C) :
        ⟦f.whiskerRight Y⟧ = CategoryTheory.MonoidalCategory.whiskerRight ⟦f⟧ Y
        source
        @[simp]
        theorem CategoryTheory.FreeMonoidalCategory.mk_id {C : Type u} {X : CategoryTheory.FreeMonoidalCategory C} :
        ⟦CategoryTheory.FreeMonoidalCategory.Hom.id X⟧ = CategoryTheory.CategoryStruct.id X
        source
        @[simp]
        theorem CategoryTheory.FreeMonoidalCategory.mk_α_hom {C : Type u} {X : CategoryTheory.FreeMonoidalCategory C} {Y : CategoryTheory.FreeMonoidalCategory C} {Z : CategoryTheory.FreeMonoidalCategory C} :
        ⟦CategoryTheory.FreeMonoidalCategory.Hom.α_hom X Y Z⟧ = (CategoryTheory.MonoidalCategory.associator X Y Z).hom
        source
        @[simp]
        theorem CategoryTheory.FreeMonoidalCategory.mk_α_inv {C : Type u} {X : CategoryTheory.FreeMonoidalCategory C} {Y : CategoryTheory.FreeMonoidalCategory C} {Z : CategoryTheory.FreeMonoidalCategory C} :
        ⟦CategoryTheory.FreeMonoidalCategory.Hom.α_inv X Y Z⟧ = (CategoryTheory.MonoidalCategory.associator X Y Z).inv
        source
        @[simp]
        theorem CategoryTheory.FreeMonoidalCategory.mk_ρ_hom {C : Type u} {X : CategoryTheory.FreeMonoidalCategory C} :
        ⟦CategoryTheory.FreeMonoidalCategory.Hom.ρ_hom X⟧ = (CategoryTheory.MonoidalCategory.rightUnitor X).hom
        source
        @[simp]
        theorem CategoryTheory.FreeMonoidalCategory.mk_ρ_inv {C : Type u} {X : CategoryTheory.FreeMonoidalCategory C} :
        ⟦CategoryTheory.FreeMonoidalCategory.Hom.ρ_inv X⟧ = (CategoryTheory.MonoidalCategory.rightUnitor X).inv
        source
        @[simp]
        theorem CategoryTheory.FreeMonoidalCategory.mk_l_hom {C : Type u} {X : CategoryTheory.FreeMonoidalCategory C} :
        ⟦CategoryTheory.FreeMonoidalCategory.Hom.l_hom X⟧ = (CategoryTheory.MonoidalCategory.leftUnitor X).hom
        source
        @[simp]
        theorem CategoryTheory.FreeMonoidalCategory.mk_l_inv {C : Type u} {X : CategoryTheory.FreeMonoidalCategory C} :
        ⟦CategoryTheory.FreeMonoidalCategory.Hom.l_inv X⟧ = (CategoryTheory.MonoidalCategory.leftUnitor X).inv
        source
        @[simp]
        theorem CategoryTheory.FreeMonoidalCategory.tensor_eq_tensor {C : Type u} {X : CategoryTheory.FreeMonoidalCategory C} {Y : CategoryTheory.FreeMonoidalCategory C} :
        X.tensor Y = CategoryTheory.MonoidalCategory.tensorObj X Y
        source
        @[simp]
        theorem CategoryTheory.FreeMonoidalCategory.unit_eq_unit {C : Type u} :
        CategoryTheory.FreeMonoidalCategory.unit = 𝟙_ (CategoryTheory.FreeMonoidalCategory C)
        source
        @[reducible, inline]
        abbrev CategoryTheory.FreeMonoidalCategory.homMk {C : Type u} {X : CategoryTheory.FreeMonoidalCategory C} {Y : CategoryTheory.FreeMonoidalCategory C} (f : X.Hom Y) :
        X ⟶ Y

        The abbreviation for ⟦f⟧.

        Equations
        Instances For
          source
          theorem CategoryTheory.FreeMonoidalCategory.Hom.inductionOn {C : Type u} {motive : {X Y : CategoryTheory.FreeMonoidalCategory C} → (X ⟶ Y) → Prop} {X : CategoryTheory.FreeMonoidalCategory C} {Y : CategoryTheory.FreeMonoidalCategory C} (t : X ⟶ Y) (id : ∀ (X : CategoryTheory.FreeMonoidalCategory C), motive (CategoryTheory.CategoryStruct.id X)) (α_hom : ∀ (X Y Z : CategoryTheory.FreeMonoidalCategory C), motive (CategoryTheory.MonoidalCategory.associator X Y Z).hom) (α_inv : ∀ (X Y Z : CategoryTheory.FreeMonoidalCategory C), motive (CategoryTheory.MonoidalCategory.associator X Y Z).inv) (l_hom : ∀ (X : CategoryTheory.FreeMonoidalCategory C), motive (CategoryTheory.MonoidalCategory.leftUnitor X).hom) (l_inv : ∀ (X : CategoryTheory.FreeMonoidalCategory C), motive (CategoryTheory.MonoidalCategory.leftUnitor X).inv) (ρ_hom : ∀ (X : CategoryTheory.FreeMonoidalCategory C), motive (CategoryTheory.MonoidalCategory.rightUnitor X).hom) (ρ_inv : ∀ (X : CategoryTheory.FreeMonoidalCategory C), motive (CategoryTheory.MonoidalCategory.rightUnitor X).inv) (comp : ∀ {X Y Z : CategoryTheory.FreeMonoidalCategory C} (f : X ⟶ Y) (g : Y ⟶ Z), motive f → motive g → motive (CategoryTheory.CategoryStruct.comp f g)) (whiskerLeft : ∀ (X : CategoryTheory.FreeMonoidalCategory C) {Y Z : CategoryTheory.FreeMonoidalCategory C} (f : Y ⟶ Z), motive f → motive (CategoryTheory.MonoidalCategory.whiskerLeft X f)) (whiskerRight : ∀ {X Y : CategoryTheory.FreeMonoidalCategory C} (f : X ⟶ Y) (Z : CategoryTheory.FreeMonoidalCategory C), motive f → motive (CategoryTheory.MonoidalCategory.whiskerRight f Z)) :
          motive t
          source
          def CategoryTheory.FreeMonoidalCategory.projectObj {C : Type u} {D : Type u'} [CategoryTheory.Category.{v', u'} D] [CategoryTheory.MonoidalCategory D] (f : C → D) :
          CategoryTheory.FreeMonoidalCategory C → D

          Auxiliary definition for free_monoidal_category.project.

          Equations
          Instances For
            source
            def CategoryTheory.FreeMonoidalCategory.projectMapAux {C : Type u} {D : Type u'} [CategoryTheory.Category.{v', u'} D] [CategoryTheory.MonoidalCategory D] (f : C → D) {X : CategoryTheory.FreeMonoidalCategory C} {Y : CategoryTheory.FreeMonoidalCategory C} :
            X.Hom Y → (CategoryTheory.FreeMonoidalCategory.projectObj f X ⟶ CategoryTheory.FreeMonoidalCategory.projectObj f Y)

            Auxiliary definition for FreeMonoidalCategory.project.

            Equations
            Instances For
              source
              def CategoryTheory.FreeMonoidalCategory.projectMap {C : Type u} {D : Type u'} [CategoryTheory.Category.{v', u'} D] [CategoryTheory.MonoidalCategory D] (f : C → D) (X : CategoryTheory.FreeMonoidalCategory C) (Y : CategoryTheory.FreeMonoidalCategory C) :
              (X ⟶ Y) → (CategoryTheory.FreeMonoidalCategory.projectObj f X ⟶ CategoryTheory.FreeMonoidalCategory.projectObj f Y)

              Auxiliary definition for FreeMonoidalCategory.project.

              Equations
              Instances For
                source
                def CategoryTheory.FreeMonoidalCategory.project {C : Type u} {D : Type u'} [CategoryTheory.Category.{v', u'} D] [CategoryTheory.MonoidalCategory D] (f : C → D) :
                CategoryTheory.MonoidalFunctor (CategoryTheory.FreeMonoidalCategory C) D

                If D is a monoidal category and we have a function C → D, then we have a functor from the free monoidal category over C to the category D.

                Equations
                • One or more equations did not get rendered due to their size.
                Instances For