Monoidal category

In mathematics, a monoidal category (or tensor category) is a category C equipped with a bifunctor

⊗ : C × C → C

which is associative (up to a natural isomorphism), and an object I which is both a left and right identity for ⊗, (again, up to natural isomorphism). The associated natural isomorphisms are subject to certain coherence conditions which ensure that all the relevant diagrams commute. Monoidal categories are, therefore, a loose categorical analog of monoids in abstract algebra.

The ordinary tensor product between vector spaces, abelian groups, R-modules, or R-algebras serves to turn the associated categories into monoidal categories. Monoidal categories can be seen as a generalization of these and other examples.

In category theory, monoidal categories can be used to define the concept of a monoid object and an associated action on the objects of the category. They are also used in the definition of an enriched category.

Monoidal categories have numerous applications outside of category theory proper. They are used to define models for the multiplicative fragment of intuitionistic linear logic. They also form the mathematical foundation for the topological order in condensed matter. Braided monoidal categories have applications in quantum field theory and string theory.

Formal definition

A monoidal category is a category Failed to parse (Missing texvc executable; please see math/README to configure.): \mathbf C

equipped with

• a bifunctor Failed to parse (Missing texvc executable; please see math/README to configure.): \otimes \colon \mathbf C\times\mathbf C\to\mathbf C

called the tensor product or monoidal product,

• an object Failed to parse (Missing texvc executable; please see math/README to configure.): I

called the unit object,

• three natural isomorphisms subject to certain coherence conditions expressing the fact that the tensor operation
  • is associative: there is a natural isomorphism Failed to parse (Missing texvc executable; please see math/README to configure.): \alpha

, called associativity, with components Failed to parse (Missing texvc executable; please see math/README to configure.): \alpha_{A,B,C} \colon (A\otimes B)\otimes C \to A\otimes(B\otimes C) ,

• • has Failed to parse (Missing texvc executable; please see math/README to configure.): I

as left and right identity: there are two natural isomorphisms Failed to parse (Missing texvc executable; please see math/README to configure.): \lambda
and Failed to parse (Missing texvc executable; please see math/README to configure.): \rho

, respectively called left and right identity, with components Failed to parse (Missing texvc executable; please see math/README to configure.): \lambda_A \colon I\otimes A\to A

and Failed to parse (Missing texvc executable; please see math/README to configure.): \rho_A \colon A\otimes I\to A

.

The coherence conditions for these natural transformations follow:

• for all Failed to parse (Missing texvc executable; please see math/README to configure.): A

, Failed to parse (Missing texvc executable; please see math/README to configure.): B , Failed to parse (Missing texvc executable; please see math/README to configure.): C

and Failed to parse (Missing texvc executable; please see math/README to configure.): D
in Failed to parse (Missing texvc executable; please see math/README to configure.): \mathbf C

, the diagram

commutes;

• for all Failed to parse (Missing texvc executable; please see math/README to configure.): A

and Failed to parse (Missing texvc executable; please see math/README to configure.): B
in Failed to parse (Missing texvc executable; please see math/README to configure.): \mathbf C

, the diagram

commutes;

It follows from these three conditions that any such diagram (i.e. a diagram whose morphisms are built using Failed to parse (Missing texvc executable; please see math/README to configure.): \alpha , Failed to parse (Missing texvc executable; please see math/README to configure.): \lambda , Failed to parse (Missing texvc executable; please see math/README to configure.): \rho , identities and tensor product) commutes: this is Mac Lane's "coherence theorem".

A strict monoidal category is one for which the natural isomorphisms α, λ and ρ are identities. Every monoidal category is monoidally equivalent to a strict monoidal category.

Examples

• Any category with finite products is monoidal with the product as the monoidal product and the terminal object as the unit. Such a category is called a cartesian monoidal category.
• Any category with finite coproducts is monoidal with the coproduct as the monoidal product and the initial object as the unit.
• R-Mod, the category of modules over a commutative ring R, is a monoidal category with the tensor product of modules ⊗_R serving as the monoidal product and the ring R (thought of as a module over itself) serving as the unit. As special cases one has:
  • K-Vect, the category of vector spaces over a field K, with the one-dimensional vector space K serving as the unit.
  • Ab, the category of abelian groups, with the group of integers Z serving as the unit.
• For any commutative ring R, the category of R-algebras is monoidal with the tensor product of algebras as the product and R as the unit.
• The category of pointed spaces is monoidal with the smash product serving as the product and the pointed 0-sphere (a two-point discrete space) serving as the unit.
• The category of all endofunctors on a category C is a strict monoidal category with the composition of functors as the product and the identity functor as the unit.
• Bounded-above meet semilattices are strict symmetric monoidal categories: the product is meet and the identity is the top element.

Free strict monoidal category

For every category C, the free strict monoidal category Σ(C) can be constructed as follows:

• its objects are lists (finite sequences) A₁, ..., A_n of objects of C;
• there are arrows between two objects A₁, ..., A_m and B₁, ..., B_n if and only if m = n, and then the arrows are lists (finite sequences) of arrows f₁: A₁ → B₁, ..., f_n: A_n → B_n of C;
• the tensor product of two objects A₁, ..., A_n and B₁, ..., B_m is the concatenation A₁, ..., A_n, B₁, ..., B_m of the two lists, and, similarly, the tensor product of two morphisms is given by the concatenation of lists.

This operation Σ mapping category C to Σ(C) can be extended to a strict 2-monad on Cat.

See also

• Many monoidal categories have additional structure such as braiding, symmetry or closure: the references describe this in detail.
• Monoidal functors are the functors between monoidal categories which preserve the tensor product and monoidal natural transformations are the natural transformations, between those functors, which are "compatible" with the tensor product.
• There is a general notion of monoid object in a monoidal category, which generalizes the ordinary notion of monoid. In particular, a strict monoidal category can be seen as a monoid object in the category of categories Cat (equipped with the monoidal structure induced by the cartesian product).
• A monoidal category can also be seen as the category B(□, □) of a bicategory B with only one object, denoted □.

References

• Joyal, André; Street, Ross (1993). "Braided Tensor Categories". Advances in Mathematics 102, 20–78.
• Kelly, G. Max (1964). "On MacLane's Conditions for Coherence of Natural Associativities, Commutativities, etc." Journal of Algebra 1, 397–402
• Kelly, G. Max (1982). Basic Concepts of Enriched Category Theory, London Mathematical Society Lecture Note Series No. 64. Cambridge University Press. 
• Mac Lane, Saunders (1963). "Natural Associativity and Commutativity". Rice University Studies 49, 28–46.
• Mac Lane, Saunders (1998), Categories for the Working Mathematician (2nd ed.). New York: Springer-Verlag.

Category theory Portal

de:Monoidale Kategorie zh-yue:幺半範疇