category with duals (list of them)
dualizable object (what they have)
n-category = (n,n)-category
n-groupoid = (n,0)-category
Every diagram in a free monoidal category made up of associators and unitors commutes.
The free monoidal category on some given data is equivalent to the free strict monoidal category on the same data.
Every monoidal category is monoidally equivalent to a strict monoidal category.
Every monoidal category is equivalent to an unbiased monoidal category?.
The forgetful 2-functor has a strict left adjoint and the components of the unit are equivalences in .
(I plan to get back to this and make emendations, but for now I’ve just pasted in some discussion from the nForum – Todd.)
Most people, when they first hear about strictifications, imagine that strictifying a monoidal category is like taking a quotient, in order to identify associativities with identities. That’s actually the wrong picture, and it leads to a lot of confusion. The right picture is that a monoidal category can be monoidally embedded in a strict monoidal category , in which associativity and unit isomorphisms of are assembled into what Joyal calls “contractible networks”, or cliques (aka anaobjects). The cliques that so arise are then the objects of the strictification.
So, for example, a 4-fold tensor product like is a vertex in a clique which consists of all five ways of bracketing and the groupoid of associativities between them. Or more precisely, it consists of the infinitely many such bracketings with units inserted (e.g., ), as objects of the groupoid generated by associativity and unit isomorphisms between them. By Mac Lane’s coherence theorem (“all diagrams commute”), there is exactly one morphism between any two vertices in the clique, meaning that the groupoid is equivalent to a terminal groupoid, and therefore contractible.
Formally, a clique in a category consists of a contractible groupoid and a functor . A morphism between two cliques , is a collection of morphisms , where ranges over , making all triangles in sight commute. (In fact, by contractibility, any one of the uniquely determines all the rest.) To form the monoidal strictification , we take as objects those cliques in the monoidal category which arise by application of the “all diagrams commute” formulation of Mac Lane’s coherence theorem (which specifies the structure of the free monoidal category on one generator as a disjoint sum of contractible groupoids), and the morphisms in are defined to be morphisms of cliques. The precise description is laid out here, where it is indicated that the evident embedding is an equivalence in .
In any case, because is embedded in , any diagram we are trying to prove commutative in is physically there in , but any associativities and units in the diagram get absorbed into cliques, or rather: any such associativity is one of the components of, and uniquely determines, an identity morphism of cliques. Therefore any such associativity in is reinterpreted as an identity in , and the diagram we are trying to prove commutative in uniquely generates a corresponding “larger” diagram of cliques in the strict monoidal category . So it is enough to prove the diagram commutes when interpreted in a strict monoidal category: we can then interpret the result in , and the original diagram in , which is embedded in the clique diagram, is then automatically commutative as well.
One may have to practice visualizing this before it all sinks in, but it’s a tremendously potent principle.