Bourbaki

Definition 3

Tag 05CZ, permanent. Cite it as [Bourbaki, Tag 05CZ].

Algebra, chapter I, § 6. Extensions, solvable groups, nilpotent groups

Let GG be a group and xx and yy two elements of GG. The element x−1y−1xyx^{-1}y^{-1}xy of GG is called the commutator of xx and yy.

(x, y) is used to denote the commutator of x and y. Then obviously

(y,x)=(x,y)−1.(y, x) = (x, y)^{-1}.
For x and y to commute it is necessary and sufficient that (x,y)=e(x, y) = e. More generally,
xy=yx(x,y).xy = yx(x, y).
On the other hand we write (3)
xy=y−1xy=x(x,y)=(y,x−1)x.x^y = y^{-1}xy = x(x, y) = (y, x^{-1})x.
As the mapping x↦xyx \mapsto x^y is the inner automorphism Int⁡(y−1)\operatorname{Int}(y^{-1}), (x,y)z=(xz,yz)(x, y)^z = (x^z, y^z) for all x,y,z∈Gx, y, z \in G.

For x,y,z∈Gx, y, z \in G, we prove the following relations: (4)

(x,yz)=(x,z).(x,y)z=(x,z).(z,(y,x)).(x,y)(x, yz) = (x, z).(x, y)^z = (x, z).(z, (y, x)).(x, y)
(4 bis)
(xy,z)=(x,z)y.(y,z)=(x,z).((x,z),y).(y,z)(xy, z) = (x, z)^y.(y, z) = (x, z).((x, z), y).(y, z)
(5)
(xy,(y,z)).(yz,(z,y)).(zx,(x,y))=e(x^y, (y, z)).(y^z, (z, y)).(z^x, (x, y)) = e
(6)
(x,yz).(z,xy).(y,zx)=e(x, yz).(z, xy).(y, zx) = e
(6 bis)
(xy,z).(yz,x).(zx,y)=e.(xy, z).(yz, x).(zx, y) = e.

Now

(x,yz)=x−1z−1y−1xyz=(x,z)z−1x−1y−1xyz=(x,z)(x,y)z=(x,z)(z,(x,y)−1)(x,y) \begin{align*} (x, yz) &= x^{-1}z^{-1}y^{-1}xyz = (x, z)z^{-1}x^{-1}y^{-1}xyz = (x, z)(x, y)^z \\ &= (x, z)(z, (x, y)^{-1})(x, y) \end{align*}
by (3), which proves (4). Formula (4 bis) follows similarly. On the other hand,
(xy,(y,z))=(xy)−1(z,y)(xy)(y,z)=y−1x−1yz−1y−1zyy−1xyy−1z−1yz=(yzy−1xy)−1(zxz−1yz). \begin{align*} (x^y, (y, z)) &= (x^y)^{-1}(z, y)(x^y)(y, z) \\ &= y^{-1}x^{-1}yz^{-1}y^{-1}zyy^{-1}xyy^{-1}z^{-1}yz \\ &= (yzy^{-1}xy)^{-1}(zxz^{-1}yz). \end{align*}
Then writing u=yzy−1xy,v=zxz−1xyu = yzy^{-1}xy, v = zxz^{-1}xy and w=xyx−1zxw = xyx^{-1}zx, we obtain
(xy,(y,z))=u−1v.(x^y, (y, z)) = u^{-1}v.
By cyclically permuting x,y,zx, y, z, we deduce (yz,(z,x))=v−1w(y^z, (z, x)) = v^{-1}w and
(zx,(x,y))=w−1u,(z^x, (x, y)) = w^{-1}u,
which immediately imply (5). Finally, (6) follows by multiplying together the two sides in the three formulae obtained by cyclically permuting x,y,zx, y, z in the formula (x,yz)=x−1z−1y−1xyz=(yzx)−1(xyz)(x, yz) = x^{-1}z^{-1}y^{-1}xyz = (yzx)^{-1}(xyz), and similarly for (6 bis).

If A and B are two subgroups of G, (A, B) denotes the subgroup generated by the commutators (a,b)(a, b) with a∈Aa \in A and b∈Bb \in B.† Then (A,B)={e}(A, B) = \{e\} if and only if A centralizes B. (A,B)⊂A(A, B) \subset A if and only if B normalizes A. If A and B are normal (resp. characteristic), so is (A,B)(A, B).

† We here reject the notational convention made in § 1, no 1 of extending a law of composition to subsets.

Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.

Cited by

Nothing.

Cites

Nothing.

Transcribed from the printed edition, 1998, Springer. Not translated.