Free Groups

Let G be a group. If S is a subset o fG such that the subgroup ⟨S⟩ generated by G is all of G, then S is said to generate G, and the elements of S are called generators for G.

Given any object σ, we can form an infinite cyclic group generated by σ, called the free group generated by σ and denoted by F(σ), as follows: F(σ) is the set {σ}×Z with the operation being (σ,m)(σ,n):=(σ,k+m). We identify σ with the element (σ,1), and we use the notation σn for elements of F(σ).

We degine the free group on S denoted by F(S), to be the free product of all infinite cyclic groups generated by elements of S: $$F(S) := \coprod_{\sigma \in S} F(\sigma).$$There is a natural injection ι:S↪F(S), defined by sending each σ∈S to the word σ∈F(S). In the case S={σ1,…,σn} is a finte set, we often denote F(S) as F(σ1,…,σn).

Characteristic Property of the Free Group: Let S be a set. For any group φ:S→H, there exists a unique homomorphism Φ:F(S)→H extending φ

\usepackage{tikz-cd}
\usepackage{amsfonts, amsmath, amssymb}

\begin{document}
\begin{tikzcd}[row sep=2cm, column sep=2cm]
F(S) \arrow[dr, dashed, "\Phi"] & \\
S \arrow[u, hook,"\iota_\alpha"] \arrow[r, "\varphi"'] & H
\end{tikzcd}
\end{document}

Cor: the Free group on S is the unique group (up to isomorphism) satisfying the characteristic property

Any group G is said to be a free group if there is some subset S⊆G such that the homomorphism F(S)→G induced by the inclusion S↪G is an isomorphism.

Prop: A group G is free iff it has a generating set S⊆G such that every element g∈G other than the identity has a unique expression asa product of the form $$g = \sigma_1^{n_1}\dots, \sigma_k^{n_k},$$ where σi∈S, ni∈N, and σi≠σi+1 for each i=1,…,k−1.