The only definition of the free group I have seen thus far (undergraduate) is an explicit construction via reduced words and concatenation.
What I am now trying to do is see if it is possible to define the free group abstractly in terms of the universal property. The definition I think should work is:
A free group $F_S$ on a set $S$ is a group generated by $S$ such that for any group $G$ and any function $f: S \rightarrow G$, $f$ extends to a unique homomorphism $\tilde{f}: F_S \rightarrow G$.
So what I want to do now is prove existence and uniqueness (up to isomorphism?) from this abstract definition, and I'm struggling to make progress, so I'm looking for tips, specifically:
- Is my definition correct, or is there something I'm missing?
- Any tips on how to make progress on existence?
- Any tips on how to make progress on uniqueness?
You actually don't need to specify that $F_S$ is generated by $S$, only that you've equipped $F_S$ with some map $i : S \to F_S$ (which you also don't need to require is injective in case you were thinking about doing that). Generation will turn out to follow from the universal property. Other than that, yes, this is how it goes.
Uniqueness (up to unique isomorphism) follows from the Yoneda lemma; this is a general feature of objects defined by universal properties and is a major reason why using universal properties is so convenient.
Existence is harder. You can show that the concrete definition using reduced words satisfies the universal property; it takes a bit of work but it's a convenient fact to be able to refer to. One possible more abstract argument is the following. We first consider the free monoid on $S$; this is easy to construct explicitly as the monoid
$$\text{List}(S) = \bigsqcup_{n \ge 0} S^n$$
of lists of elements of $S$, or equivalently as the monoid of words on the alphabet $S$, under concatenation, and it's easy to prove the universal property.
To get the free group from here we need to freely adjoin inverses to this monoid. The group obtained by freely adjoining inverses to the free monoid $\text{List}(S)$ can be constructed by starting from $\text{List}(S \sqcup S^{-1})$, where $S^{-1}$ is just another copy of $S$ that stands for the inverses we're adjoining, then quotienting by relations that say that each $s \in S$ actually has the corresponding formal symbol $s^{-1} \in S^{-1}$ as its inverse. How satisfying this is depends on how comfortable you are with taking quotients of monoids, but it does have the benefit that we don't need to talk about reduced words so the universal property is easier to check.
This construction is also a good prototype for how to construct other free objects. The list construction generalizes to constructing, for example, for example, the free $k$-algebra on a $k$-vector space $V$ as the tensor algebra
$$T(V) = \bigoplus_{n \ge 0} V^{\otimes n}.$$
In turn the tensor algebra is an important intermediate step for constructing other objects like the free commutative $k$-algebra on $V$, which is the symmetric algebra.