[Merged by Bors] - feat(CategoryTheory/Monoidal): left action of monoidal categories#25761
Conversation
PR summary db52f0992dImport changes for modified filesNo significant changes to the import graph Import changes for all files
|
Co-authored-by: Joël Riou <37772949+joelriou@users.noreply.github.com>
|
Since apparently we’re changing the notation for the tensor product of morphisms, I’ve changed the notation for |
|
Thanks! bors merge |
…5761) Define (left) actions of a monoidal category on a category: a `MonoidalLeftAction` of a monoidal category `C` on a category `D` consists of an action bifunctor `- ⊙ₗ - : C ⥤ D ⥤ D`, equipped with structural natural isomorphisms `(- ⊗ -) ⊙ₗ - ≅ - ⊙ₗ - ⊙ₗ -` and `𝟙_ C ⊙ₗ - ≅ -`, subject to coherence conditions. The code in this PR is parallel to the existing code for monoidal category. We provide a battery of basic `simp` lemmas to ease working with this type class, and show that every monoidal category acts on itself via its tensor product. The code is put in a new subdirectory `CategoryTheory/Monoidal/Action`. Future wok on the subject includes - Providing a constructor for `MonoidalLeftAction` taking a monoidal functor from `C` to `D ⥤ D`, where the latter has the "composition" monoidal structure. - Constructing the action of `C ⥤ C` on `C`. - Extending the notion of module objects internal to a monoidal category to allow the `Mon_ ` object to be in `C`, and the module to be in `D` where `D` has a monoidal left action of `C`. - Using the two previous points, show that given a monad `M`, there is an equivalence of categories between `Algebra M` and modules in `C` over the monoid `M.toMon : Mon_ (C ⥤ C)̀`.
|
Pull request successfully merged into master. Build succeeded: |
We introduce the notion of a right action of a monoidal category `C` on a category `D`. This notion is formally conjugate to that of a left action introduced in #25761, and so are every results in this PR. Please refer to #25761 for a more detailed overview of the notion. The notion comes with its set of notations. We show basic simp lemmas for these objects, and we show that any monoidal category acts on the right on itself.
We introduce the notion of a right action of a monoidal category `C` on a category `D`. This notion is formally conjugate to that of a left action introduced in #25761, and so are every results in this PR. Please refer to #25761 for a more detailed overview of the notion. The notion comes with its set of notations. We show basic simp lemmas for these objects, and we show that any monoidal category acts on the right on itself.
…anprover-community#25761) Define (left) actions of a monoidal category on a category: a `MonoidalLeftAction` of a monoidal category `C` on a category `D` consists of an action bifunctor `- ⊙ₗ - : C ⥤ D ⥤ D`, equipped with structural natural isomorphisms `(- ⊗ -) ⊙ₗ - ≅ - ⊙ₗ - ⊙ₗ -` and `𝟙_ C ⊙ₗ - ≅ -`, subject to coherence conditions. The code in this PR is parallel to the existing code for monoidal category. We provide a battery of basic `simp` lemmas to ease working with this type class, and show that every monoidal category acts on itself via its tensor product. The code is put in a new subdirectory `CategoryTheory/Monoidal/Action`. Future wok on the subject includes - Providing a constructor for `MonoidalLeftAction` taking a monoidal functor from `C` to `D ⥤ D`, where the latter has the "composition" monoidal structure. - Constructing the action of `C ⥤ C` on `C`. - Extending the notion of module objects internal to a monoidal category to allow the `Mon_ ` object to be in `C`, and the module to be in `D` where `D` has a monoidal left action of `C`. - Using the two previous points, show that given a monad `M`, there is an equivalence of categories between `Algebra M` and modules in `C` over the monoid `M.toMon : Mon_ (C ⥤ C)̀`.
…ver-community#25840) We introduce the notion of a right action of a monoidal category `C` on a category `D`. This notion is formally conjugate to that of a left action introduced in leanprover-community#25761, and so are every results in this PR. Please refer to leanprover-community#25761 for a more detailed overview of the notion. The notion comes with its set of notations. We show basic simp lemmas for these objects, and we show that any monoidal category acts on the right on itself.
…ver-community#25840) We introduce the notion of a right action of a monoidal category `C` on a category `D`. This notion is formally conjugate to that of a left action introduced in leanprover-community#25761, and so are every results in this PR. Please refer to leanprover-community#25761 for a more detailed overview of the notion. The notion comes with its set of notations. We show basic simp lemmas for these objects, and we show that any monoidal category acts on the right on itself.
…anprover-community#25761) Define (left) actions of a monoidal category on a category: a `MonoidalLeftAction` of a monoidal category `C` on a category `D` consists of an action bifunctor `- ⊙ₗ - : C ⥤ D ⥤ D`, equipped with structural natural isomorphisms `(- ⊗ -) ⊙ₗ - ≅ - ⊙ₗ - ⊙ₗ -` and `𝟙_ C ⊙ₗ - ≅ -`, subject to coherence conditions. The code in this PR is parallel to the existing code for monoidal category. We provide a battery of basic `simp` lemmas to ease working with this type class, and show that every monoidal category acts on itself via its tensor product. The code is put in a new subdirectory `CategoryTheory/Monoidal/Action`. Future wok on the subject includes - Providing a constructor for `MonoidalLeftAction` taking a monoidal functor from `C` to `D ⥤ D`, where the latter has the "composition" monoidal structure. - Constructing the action of `C ⥤ C` on `C`. - Extending the notion of module objects internal to a monoidal category to allow the `Mon_ ` object to be in `C`, and the module to be in `D` where `D` has a monoidal left action of `C`. - Using the two previous points, show that given a monad `M`, there is an equivalence of categories between `Algebra M` and modules in `C` over the monoid `M.toMon : Mon_ (C ⥤ C)̀`.
…ver-community#25840) We introduce the notion of a right action of a monoidal category `C` on a category `D`. This notion is formally conjugate to that of a left action introduced in leanprover-community#25761, and so are every results in this PR. Please refer to leanprover-community#25761 for a more detailed overview of the notion. The notion comes with its set of notations. We show basic simp lemmas for these objects, and we show that any monoidal category acts on the right on itself.
Define (left) actions of a monoidal category on a category: a
MonoidalLeftActionof a monoidal categoryCon a categoryDconsists of an action bifunctor- ⊙ₗ - : C ⥤ D ⥤ D, equipped with structural natural isomorphisms(- ⊗ -) ⊙ₗ - ≅ - ⊙ₗ - ⊙ₗ -and𝟙_ C ⊙ₗ - ≅ -, subject to coherence conditions.The code in this PR is parallel to the existing code for monoidal category.
We provide a battery of basic
simplemmas to ease working with this type class, and show that every monoidal category acts on itself via its tensor product.The code is put in a new subdirectory
CategoryTheory/Monoidal/Action.Future wok on the subject includes
MonoidalLeftActiontaking a monoidal functor fromCtoD ⥤ D, where the latter has the "composition" monoidal structure.C ⥤ ConC.Mon_object to be inC, and the module to be inDwhereDhas a monoidal left action ofC.M, there is an equivalence of categories betweenAlgebra Mand modules inCover the monoidM.toMon : Mon_ (C ⥤ C)̀.This PR continues the work from #25499.
Original PR: #25499