Ambiguity in the definition of group objects Given a category $C$ with finite products and a terminal object, the usual definition of a group object $G$ in $C$ specifies certain morphisms along with commutativity of certain diagrams involving these morphisms. For example, we need a multiplication morphism $\mu : G\times G \to G$. But $G \times G$ isn't an object of $C$ as it is only well-defined up to isomorphism. Similarly, there is an ambiguity in the choice of the terminal object. Of course, up to isomorphism we'll end up getting the same thing, but is there a clean way to state this definition of group objects which avoids this ambiguity?
One thing one could do is to fix a choice (ignoring set-theoretical issues if there are any) of finite product object along with the projection maps for every finite collection of objects; then one gets well-defined product multifunctors. Using these choices, the definition of group objects becomes precise, but I assume that there is a better way to do this, without having to make choices.
On the wiki page, an equivalent definition for group objects is given: "Another way to state the above is to say $G$ is a group object in a category $C$ if for every object $X$ in $C$, there is a group structure on the morphisms $\text{hom}(X,G)$ from $X$ to $G$ such that the association of $X$ to $\text{hom}(X,G)$ is a (contravariant) functor from $C$ to the category of groups." This has no ambiguity, but I'm not sure how to translate it to an ambiguity-free definition of the other form.
Thanks.
 A: Write it down as a product-preserving functor from the Lawvere theory of groups, $\mathcal{G}$, a certain category encoding all the data available in a group. This amounts to making a choice of object and projections for all finite powers of $G$ and of all partial multiplication maps, all of which are consistent with each other. This perspective also makes the equivalent characterization clear-to give a functor from $\mathcal{G}$ with base object $X$ is equivalent to giving a functor from $\mathcal{G}$ with base $C(-,X)$ when products of $X$ exist, by the Yoneda lemma in one direction and the fact that the Yoneda embedding preserves products in the other.
Note that if such products don't exist, this equivalence does not hold. Indeed, consider a group object $X$ (in the Lawvere theory sense) in some category $\mathcal C$. If we let $\mathcal X$ denote the full subcategory of $\mathcal C$ spanned by $X$, then $X$ is still a group object in $\mathcal X$, in the representable sense. Indeed, the inclusion of $\mathcal X$ in $\mathcal C$ induces a continuous restriction functor from the category of presheaves on $\mathcal C$ to the category of presheaves on $\mathcal X$, which in particular preserves group objects and sends $\mathcal C(-,X)$ to $\mathcal X(-,X)$ since the functor $\mathcal X\to \mathcal C$ is fully faithful. But $X$ will generally not be a group object in $\mathcal X$ in the Lawvere theory sense, since $\mathcal X$ generally will not have finite products; in particular, it won't have a terminal object as long as $X$ has more than one endomorphism.
A: It suffices to fix once and for all a choice of products in $\text{Set}$; if you aren't willing to do this then I don't know what to tell you, but if you are, then you can define a group object in a category $C$ (no hypotheses on $C$) to be an object $X$ equipped with a group structure as an object $\text{Hom}(-, X)$ in the presheaf category $[C^{op}, \text{Set}]$, where products are determined pointwise and so determined exactly by a choice of products in $\text{Set}$. Explicitly this is a choice of maps
$$e : \text{Hom}(-, 1) \to \text{Hom}(-, X), i : \text{Hom}(-, X) \to \text{Hom}(-, X), m : \text{Hom}(-, X) \times \text{Hom}(-, X) \to \text{Hom}(-, X)$$
satisfying the group theory axioms (which can be checked pointwise). This is basically equivalent to the second definition you gave, but making explicit that the second definition is also slightly ambiguous because, if we're being this nitpicky, it depends on a choice of products in $\text{Set}$ (in fact already the ordinary definition of groups depends on this choice, and also on a choice of how to represent functions, etc).
