Math 2.0

statement theorem

Universal property of the free group

Statement

Let SS be a set, let FSF_S be the free group on SS, and let GG be a group. For each function f ⁣:S→Gf \colon S \to G, there is exactly one group homomorphism φ ⁣:FS→G\varphi \colon F_S \to G with φ(s)=f(s)\varphi(s) = f(s) for each s∈Ss \in S.

Remarks

Here SS is identified with the set of words of length 11 in FSF_S. The homomorphism is φ(t1⋯tn)=f(t1)±1⋯f(tn)±1\varphi(t_1 \cdots t_n) = f(t_1)^{\pm 1} \cdots f(t_n)^{\pm 1}, with the sign of each letter. This property characterises FSF_S up to isomorphism, so some texts use it as the definition of a free group. If the image of ff generates GG, then φ\varphi is surjective, so GG is a quotient of FSF_S.

Explanations

L1 human

To define a homomorphism out of a free group, you only choose the images of the generators. There are no relations to check. So each choice extends to exactly one homomorphism.

What this node 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 node is. They do not measure its truth.

What this needs

To read this node, read these 6 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Group concept
  2. Reduced word definition
  3. Group homomorphism definition
  4. Group isomorphism definition
  5. Free group definition
  6. Universal property of the free group statement

What depends on this

1 node uses this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Free_group, Universal property
  2. Web https://en.wikipedia.org/wiki/Free_group, Facts and theorems