Math 2.0

Group theory and generalizations Proof

Proof of the universal property of the free group

Builds on Free groupReduced wordGroup homomorphism

Proof

We first build φ\varphi on all words, then show that reduction does not change its value.

  1. By the definition of the free group, the elements of FSF_S are the reduced words on SS. To get the product u⋅vu \cdot v, form the concatenation uvuv. Then delete adjacent pairs ss−1s s^{-1} or s−1ss^{-1} s, one pair at a time, until the word is reduced. The identity is the empty word.
  2. Extend ff to the letters by f^(s)=f(s)\hat f(s) = f(s) and f^(s−1)=f(s)−1\hat f(s^{-1}) = f(s)^{-1} for s∈Ss \in S.
  3. For any word w=t1⋯tnw = t_1 \cdots t_n, reduced or not, let Φ(w)=f^(t1)⋯f^(tn)\Phi(w) = \hat f(t_1) \cdots \hat f(t_n) in GG. For the empty word, Φ\Phi gives ee.
  4. For words ww and w′w', the concatenation satisfies Φ(ww′)=Φ(w)Φ(w′)\Phi(ww') = \Phi(w)\Phi(w'), directly from step 3.
  5. Let w′w' arise from ww by deleting one adjacent pair. Write w=a t t′ bw = a\,t\,t'\,b and w′=abw' = ab, where tt′tt' is ss−1ss^{-1} or s−1ss^{-1}s. Then f^(t)f^(t′)=e\hat f(t)\hat f(t') = e, since it is f(s)f(s)−1f(s)f(s)^{-1} or f(s)−1f(s)f(s)^{-1}f(s).
  6. By steps 4 and 5, Φ(w)=Φ(a) f^(t)f^(t′) Φ(b)=Φ(a)Φ(b)=Φ(w′)\Phi(w) = \Phi(a)\,\hat f(t)\hat f(t')\,\Phi(b) = \Phi(a)\Phi(b) = \Phi(w').
  7. By step 6 and induction on the number of deletions, Φ\Phi takes the same value on uvuv and on u⋅vu \cdot v.
  8. Let φ ⁣:FS→G\varphi \colon F_S \to G be the restriction of Φ\Phi to reduced words. For u,v∈FSu, v \in F_S, steps 4 and 7 give φ(u⋅v)=Φ(uv)=φ(u)φ(v)\varphi(u \cdot v) = \Phi(uv) = \varphi(u)\varphi(v). So φ\varphi is a group homomorphism.
  9. For s∈Ss \in S, the word ss of length 11 is reduced, and φ(s)=f^(s)=f(s)\varphi(s) = \hat f(s) = f(s). This proves existence.
  10. For uniqueness, let ψ ⁣:FS→G\psi \colon F_S \to G be a homomorphism with ψ(s)=f(s)\psi(s) = f(s) for each s∈Ss \in S.
  11. For s∈Ss \in S, the product s⋅s−1s \cdot s^{-1} in FSF_S is the empty word, the identity. So s−1s^{-1} is the inverse of ss in FSF_S, and ψ(s−1)=ψ(s)−1=f(s)−1\psi(s^{-1}) = \psi(s)^{-1} = f(s)^{-1}. Hence ψ(t)=f^(t)\psi(t) = \hat f(t) for each letter tt.
  12. Let w=t1⋯tnw = t_1 \cdots t_n be a reduced word with n≥1n \geq 1. The concatenation of t1t_1 and t2⋯tnt_2 \cdots t_n is ww itself, which is reduced. So w=t1⋅(t2⋯tn)w = t_1 \cdot (t_2 \cdots t_n) in FSF_S.
  13. By induction on nn, using step 12, w=t1⋅t2⋯tnw = t_1 \cdot t_2 \cdots t_n is the product of its letters in FSF_S.
  14. Since ψ\psi is a homomorphism, steps 11 and 13 give ψ(w)=f^(t1)⋯f^(tn)=φ(w)\psi(w) = \hat f(t_1) \cdots \hat f(t_n) = \varphi(w). For the empty word, both give ee.
  15. So ψ=φ\psi = \varphi, and φ\varphi is the only such homomorphism.

Idea

The value of a word is forced: send each letter to f(s)f(s) or its inverse and multiply. The only thing to check is that cancelling a pair ss−1ss^{-1} does not change this value. It does not, because f(s)f(s)−1=ef(s)f(s)^{-1} = e in GG.

Reading path

To understand this page from the ground up, read these 6 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Group concept
  2. Reduced word definition
  3. Group homomorphism definition
  4. Group isomorphism definition
  5. Free group definition
  6. Proof of the universal property of the free group proof

Where this leads

3 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Free_group, Universal property
About this page
Tag4EYMSR98ER
URIm2://4EYMSR98ER
Kindproof
WritingW0 stub
MSC20E05
ProvesUniversal property of the free group
UsesFree group, Reduced word, Group homomorphism
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.