A symmetric monoidal category is a category with a product operation – a monoidal category – for which the product is as commutative as possible.
The point is that there are different degrees to which higher categorical products may be commutative. While a bare monoid is either commutative or not, a monoidal category may be a braided monoidal category – which already means that the order of products may be reversed up to some isomorphism – without being symmetric monoidal – which means that changing the order of a product twice, from to back to , indeed does yield a result equal to the original.
For higher monoidal categories there are accordingly ever more shades of the notion of “commutativity” of the monoidal product. This is described in detail at k-tuply monoidal n-category.
In general, the term symmetric monoidal is used for the maximally commutative case. See for instance symmetric monoidal (∞,1)-category. Notably, a symmetric monoidal ∞-groupoid is, under the homotopy hypothesis, the same as a connective spectrum.
A symmetric monoidal category is a braided monoidal category for which the braiding
satisfies an additional axiom:
for all objects . Intuitively this says that switching things twice has no effect.
Expanding this out a bit: a symmetric monoidal category is, to begin with a category equipped with a functor
called the tensor product, an object
called the unit object, a natural isomorphism
called the associator, a natural isomorphism
called the left unitor, a natural isomorphism
called the right unitor, and a natural isomorphism
called the braiding. We then demand that the associator obey the pentagon identity, which says this diagram commutes:
We demand that the associator and unitors obey the triangle identity, which says this diagram commutes:
We demand that the braiding and associator obey the first hexagon identity:
And lastly, we demand that
(The definition of braided monoidal category has two hexagon identities, but either one implies the other given this equation.)
There is a strict 2-category SymmMonCat with:
A symmetric monoidal category is equivalently a category that is equipped with the structure of an algebra over the little k-cubes operad for
Details are in examples 1.2.3 and 1.2.4 of
Every cartesian monoidal category is necessarily symmetric monoidal, due to the essential uniqueness of the categorical product. This includes cases such as Set, Cat.
For some field, the category Vect of -vector spaces carries the standard structure of a monoidal category coming from the tensor product, over , of vector spaces. The standard braiding that identifies with by mapping homogeneous elements to obviously makes Vect into a symmetric monoidal category.
The category of -graded vector spaces, on the other hand, has two different symmetric monoidal extensions of the standard tensor product monoidal structure. One is the trivial one from above, the other is the one that induces a a sign when two odd-graded vectors and are passed past each other : . This non-trivial symmetric monoidal structure on Vect[\mathbb[Z}_2] defines the symmetric monoidal category of super vector spaces.
For definitions of symmetric monoidal categories, symmetric monoidal functors and symmetric monoidal natural transformations, see:
For an elementary introduction to symmetric monoidal categories using string diagrams, see:
Eventually we should include all these definitions and diagrams here! I don’t know a good way to do this yet.