TITLE: Skeleton of a braided monoidal category
QUESTION [9 upvotes]: Does every (lax) braided monoidal category  have a braided monoidal skeleton? That is, I want to define  a (lax) braided monoidal structure on a skeleton so that it is braided monoidal equivalent to the original category. If this is always possible, how does one accomplish it?
An extreme case of this question (which I most interested in) is this: suppose the original braided monoidal category was strict, in the sense that the associators were trivial. I would like to replace this category with its skeleton, perhaps at the expense of making it nonstrict (generating nontrivial associators).

REPLY [12 votes]: Yes. This follows from two simple facts:

If $F:C \simeq D$ is an equivalence of categories, and $D$ has a braided monoidal structure, then there exists a braided monoidal structure on $C$ and an enhancement of $F$ to a braided monoidal functor such that $F$ is an equivalence of braided monoidal categories. 
Every category is equivalent to a skeletal category. 

Number 2 is standard, so I won't dwell on it. If you don't believe number 1, try proving it. It is a great exercise. Here is a sketch of how to go about proving it. 

Replace $F$ by an adjoint equivalence, i.e. pick an adjoint inverse equivalence to $F$. You'll need this to transfer the structure from D to C. 
Now transfer the structure from D to C. There is not much to say here. Just follow your nose. For example the tensor product in C is defined by
$$ x \otimes_C y := G(F(x) \otimes_D F(y))$$
There is an associator because we have chosen F and G to be adjoint equivalences to each other. The braiding is similar. It is given by,
$$G(\beta_{F(x), F(Y)}): G(F(x) \otimes_DF(y)) \to G(F(y) \otimes_DF(x)). $$
It is tedious to verify, but this does actually satisfy the hexagon identities. 
Thus we've constructed a braided monoidal structure on C. To show that this new braided monoidal category C is equivalent as a braided monoidal category to D, we need to augment F and G to braided monoidal functors. To do this we just keep playing the same game. For example we need an equivalence $$F(x) \otimes_D F(y) \to F(x \otimes_C y) = FG(F(x) \otimes_D F(y)).$$
This is given by the inverse of the unit/counit of the adjoint equivalence between F and G. Constructing the other structure is no different. 

This is morally the strategy advocated by Benjamin Enriquez. He tried to do this with less then an equivalence and ran into trouble. For the question as stated, you really only need the case that C and D are equivalent. Notice also that this still works when the monoidal structures are just lax. It still produces a strong monoidal equivalence between C and D.