Consider the $2$-categories


* $\mathsf{MonCat}$ of monoidal categories, with strong monoidal functors and monoidal transformations,
* $\mathsf{SymMonCat}$ of symmetric monoidal categories, with strong symmetric monoidal functors and symmetric monoidal transformations.


There is a forgetful functor $\mathsf{SymMonCat} \to \mathsf{MonCat}$, which probably has a left adjoint. I.e. for a given monoidal category $C$ there should be a free symmetric monoidal category $C\_{\text{sym}}$ over $C$. Now my question is: How does this symmetric monoidal category look like explicitly? I would like to know an explicit description of its objects and its morphisms (not just some general construction etc. which produces it somehow).


For example, if $C$ is the free monoidal category on one object, which is discrete and given by $C=\{1,X,X^2,\dotsc\}$, then $C\_{\mathrm{sym}}$ is the free symmetric monoidal category on one object, i.e. the [permutation groupoid](http://ncatlab.org/nlab/show/permutation+groupoid), where we have the same objects, but $$\mathrm{Hom}(X^n,X^m)=\left\{\begin{array}{cc} \Sigma\_n & n = m, \\ \emptyset & \text{else}. \end{array}\right.$$


The decategorified analog is the forgetful functor $\mathsf{CMon} \to \mathsf{Mon}$ which has left adjoint $M \mapsto M\_{\mathrm{sym}}:=M / \langle xy = yx : x,y \in M\rangle$. Two elements of $M$ become equal in $M\_{\mathrm{sym}}$ iff they have the form $x\_1 \cdot \dotsc \cdot x\_n$ and $x\_{\sigma(1)} \cdot \dotsc \cdot x\_{\sigma(n)}$ for some $\sigma \in \Sigma\_n$. Essentially the same works with *strict* (symmetric) monoidal categories. As for the general case, I think that one has to "impose a reason" why $X \otimes Y$ and $Y \otimes X$ become isomorphic in $C\_{\text{sym}}$, for $X,Y \in C$.



Free symmetric monoidal category on a monoidal category
First, having seen the edited version of Martin's question, let's quickly dispose of the construction of the free symmetric monoidal category generated by a category $C$. Objects are tuples $(x\_1, \ldots, x\_n)$ of objects of $C$. Morphisms are labeled permutations, where permutations are conveniently visualized as string diagrams, each string being labeled by a morphism in $C$. To compose such labeled diagrams, just compose the string diagrams, composing the labels of strings in $C$ along the way. 


The free symmetric monoidal category $Sym(M)$ on a monoidal category $M$ is formed from the free symmetric monoidal category $S (U M)$ on the underlying category $U M$ by adjoining isomorphisms $\phi\_{x\_1, \ldots, x\_n}: (x\_1, \ldots, x\_n) \to x\_1 \otimes \ldots \otimes x\_n$, where the $x\_i$ are objects of $M$, the expression $(x\_1, \ldots, x\_n)$ is the formal monoidal product in $S(UM)$, and $x\_1 \otimes \ldots \otimes x\_n$ is the tensor product in $M$. 


More precisely, define the objects of $Sym(M)$ to be tuples $(x\_1, \ldots, x\_n)$ of objects of $M$. Define morphisms $(x\_1, \ldots, x\_n) \to (y\_1, \ldots, y\_m)$ to be equivalence classes of pairs $(p, f)$ where $p$ is a permutation on $n$ elements, and $f$ is an $M$-labeled *planar forest* of $m$ rooted trees. (You should think here of the free multicategory generated by a category.) Formally, a planar forest can be described as a functor $[n]^{op} \to \Delta$ where $n$ is the category $1 \leq \ldots \leq n$ and $\Delta$ is the category of finite (possibly empty) ordinals. Under the obvious way of drawing such forests, the ordered list of leaves of the forest is labeled by $(x\_{p(1)}, \ldots, x\_{p(n)})$, and the ordered list of roots by $(y\_1, \ldots, y\_m)$. Edges are labeled by objects of $M$, and each internal node with $k$ inputs labeled (in order) by $m\_1, \ldots, m\_k$ and output $m$ is labeled by a morphism $f: m\_1 \otimes \ldots \otimes m\_k \to m$. 


There is an evident way, using the monoidal structure of $M$, of evaluating such a labeled forest $f$ as a morphism $ev(f): x\_{p(1)} \otimes \ldots \otimes x\_{p(n)} \to y\_1 \otimes \ldots \otimes y\_m$ in $M$. We consider two arrows $(p, f)$ and $(p', f')$ to be equivalent if $p = p'$ as permutations and $ev(f) = ev(f')$. 


Now we define composition of pairs. The main idea is to rewrite the composition of a forest followed by a permutation, 


$$(x\_1, \ldots, x\_n) \stackrel{(1, f)}{\to} (y\_1, \ldots, y\_m) \stackrel{(q, 1)}{\to} (y\_{q(1)}, \ldots, y\_{q(m)}),$$ 


into a form $(p, f')$ forced by the naturality requirement of the symmetry isomorphism. Namely, if $\bar{x}\_i$ is the tuple of leaves of the tree whose root is $y\_i$, then we have a block permutation $bl(q)$ taking $(\bar{x}\_1, \ldots, \bar{x}\_m)$ to $(\bar{x}\_{q(1)}, \ldots, \bar{x}\_{q(m)})$. The permutation $q$ can also be applied to the $m$ trees of the forest by reordering the trees, yielding a new forest $\mathrm{perm}\_q(f)$, and the composition $(q, 1) \circ (1, f)$ is defined to be $(bl(q), \mathrm{perm}\_q(f))$. Then, if we have $(p, f): (x\_1, \ldots, x\_n) \to (y\_1, \ldots, y\_m)$ and $(q, g): (y\_1, \ldots, y\_m) \to (z\_1, \ldots, z\_p)$, we define their composite to be 


$$(bl(q) \circ p, g \circ \mathrm{perm}\_q(f))$$ 


where the first component is by composing permutations and the second is by the usual way of composing forests by plugging in roots of one planar forest of trees into leaves of another. 


Remaining details that all this works will be left to the reader. I will remark that the key rewriting procedure above is an instance of a kind of distributive law; there are some more details to this effect in some notes on my nLab web; see [here](http://ncatlab.org/toddtrimble/show/Notes+on+predicate+logic#operadic_presentation_9). 


