# What good are free groups?

In Algebra: Chapter 0, one learns two definitions of Free Groups associating with sets.

Let $A$ be a set, the free group of $A$, $F(A)$ is the initial object in the category $\mathcal{C}$, where $$\operatorname{Obj}(\mathcal{C})=\{A\xrightarrow{g}G\},$$where the codomain $G$ are groups, and $$\operatorname{Hom}(\mathcal{C})=\{\text{Commutative Diagrams } A\xrightarrow{g_1}G_1\xrightarrow{\phi}G_2\xleftarrow{g_2}A\}$$ where $\phi$ are group homomorphisms.

Also $F(A)$ has the concrete construction with elements being non-redundant words with alphabet $A$, and the group multiplication being juxtaposition and reduction.

But what good are free groups? Why are they useful? Wiki says it is useful in topology but does not make that explicit.

Can someone give some examples that an undergraduate can understand? I am asking about examples that can show the usefulness of this abstract construction. So I guess the identification of $\mathbb{Z}=F({a})$ does not really count.

Thanks!

ps: How can I draw those beautiful diagrams here?

-
What good is a free dinner? Really, do you have to ask? –  Graphth Nov 17 '12 at 16:00
Well, I'm personally a big fan of the integers--a.k.a. the free group with one generator. –  Cameron Buie Nov 17 '12 at 16:01
Have you ever stopped to think what it means to give a presentation of a group by generators and relations? You'll find that you will need the concept of free group in order to make sense of this rigorously. –  Zhen Lin Nov 17 '12 at 16:02
@ZhenLin That is a good point! But this is actually only a technicality. Is there some good examples that we use free groups to solve problems? –  Hui Yu Nov 17 '12 at 16:09
@HuiYu, Just knowing what a free group wont solve any complicated problems. It's just a natural concept that arises in group theory. –  sperners lemma Nov 17 '12 at 16:12

Usually, for algebraic structures,

Any structure is a quotient of a free such structure.

If we are given abstractly operation symbols $\mu,\nu,+,\cdot,...$, and a positive number as the arity of the operation (e.g. '$+$' is a binary symbol), then one can define formal terms, built up by pregiven variables (associated to the elements of the given set $A$) and these operation symbols. Basically these terms are just 'strings' like $\mu(a+b,c\cdot d, e)$ if $\mu$ is ternary operation symbol.

The main thing is, that the set of terms naturally admits a structure of the given type, the operation symbols act just formally. And this is the free algebra of the given type.

If, in addition, some rules are present (axioms for the given structures, like associativity for groups) , then these rules should also be applied to the set of the terms, considering a quotient of it, e.g. where the strings $(a\cdot b)\cdot c$ and $a\cdot (b\cdot c)$ are identified with each other. (Hence, if associativity of the operation is imposed, it is enough to consider the finite sequences like $(a,b,c,a,a,c)$.)

So, free groups, in this sense, are so general, that every group is 'contained' (as a quotient) of them. On the other hand, every group can be embedded to a symmetric group. So, symmetric groups have similar important role (at least, in this view).

In topology, for example, the fundamental group of $n$ circles glued together at one point is the free group on $n$ generators.

Free groups also may provide easy counterexamples of statements like 'identities $P,Q$ on groups imply identity $R$'. If this is not true, then the quotient 'by $P$ and $Q$' of a suitable free group must be a counterexample.

-

As an example of whar @Berci noted; we know that:

Every group $G$ is a quotient of a free group.

Theorem above let us to identified $G$ with $\frac{F}{R}$ where in $F$ is a free group and $R$ is a normal subgroup of it. Now if we denote $X$ as a base for $F$ and $\delta$ as a family of words (like a sequence of alphabets above), then $X$ is known as the generators of $G$ and $\delta$ as its relations. Here, we propose a new symbol as $G=\langle X|R \rangle$ and we call it a presentation of $G$. As I have worked some problems in this kind of structures, without knowing a presentation of a group some beautiful facts about that group may be neglected. How can we introduce $A_4$ easier. How can we work with $S_3$ when a student forget its certain permutations? The Free groups and their great theorems help us to work with such these groups easier. Indeed $A_4=\langle a,b|a^2=b^3=(ab)^3=1\rangle$ and $S_3=\langle a,b|a^2=b^3=(ab)^2=1\rangle$. It is easy to memorize, at least for me.

-