AoPSWiki
Looking for a challenging geometry text? Preparing for MATHCOUNTS or the AMC exams? Check out Art of Problem Solving's Introduction to Geometry by Richard Rusczyk.
Personal tools

Commutator (group)

From AoPSWiki

This article refers to commutators of groups, not to be confused with commutator groups.

In a group, the commutator of two elements and , denoted or , is the element . If and commute, then . More generally, , or It then follows that We also have x^y = y^{-1}xy = x(x,y) = (y,x^{-1})x , where denote the image of under the inner automorphism , as usual.

Relations with Commutators

Proposition 1. For all in a group, the following relations hold:

  • (x,yz) = (x,z)(x,y)^z = (x,z)(z,(y,x))(x,y);
  • (xy,z) = (x,z)^y (y,z) = (x,z)((x,z),y)(y,z);
  • (x^y,(y,z))(y^z,(z,x))(z^x,(x,y)) = e;
  • ;
  • .

Proof. For the first equation, we note that (x,yz) = x^{-1}z^{-1}y^{-1}xyz = (x^{-1}z^{-1}xz)z^{-1}(x^{-1}y^{-1}xy)z = (x,z) (x,y)^z . From the earlier relations, (x,y)^z = (z,(x,y)^{-1})(x,y) = (z,(y,x))(x,y) , hence the relation. The second equation follows from the first by passing to inverses.

For the third equation, we define . We then note that \begin{align*}(x^y,(y,z)) &= (x^{-1})^y \cdot (z,y) \cdot x^y \cdot (y,z) \\&= (x^{-1})^y \cdot z^{-1} (z)^y \cdot x^y \cdot (z^{-1})^y \cdot z&= (x^{-1})^y \cdot z^{-1} \cdot y^{-1}(zxz^{-1})y \cdot z \\&= \bigl[(x^{-1})^y \cdot z^{-1}y^{-1}\bigr] zx \cdot y^z \\&= f(z,x,y)^{-1} f(x,y,z) .\end{align*} By cyclic permutation of variables, we thus find \begin{align*}(x^y, (y,z))(y^z, (z,x))(z^x, (x,y)) &= f(z,x,y)^{-1} f(x,y,z) f(x,y,z)^{-1} f(y,z,x) f(y,z,x)^{-1} f(z,x,y) \\&= e. \end{align*}

For the fourth equation, we have (x,yz)(z,xy)(y,zx) = (yzx)^{-1}(xyz)(xyz)^{-1} (zxy) (zxy)^{-1}(yzx) = e . The fifth follows similarly.

Commutators and Subgroups

If and are subgroups of a group , denotes the subgroup generated by the set of commutators of the form , for and .

The group is trivial if and only if centralizes . Also, if and only if normalizes . If and are both normal (or characteristic), then so is , for if is an (inner) automorphism, then Note also that since , .

Lemma. Let be a closed subsets of (not necessarily a subgroups); denote by the subgroup of generated by elements of the form , for , . Then .

Proof. Let be elements of and be an element of . Then (a,b)^{a'} = a'^{-1}a^{-1}b^{-1}aba' = (aa',b)b^{-1}a'^{-1}aba'

Proposition 2. Let be three subgroups of .

  1. The group normalizes the group .
  2. If the group normalizes , then the set of elements , for , , , generates the group .
  3. If , , and are normal subgroups of , then is a subgroup of the group .

Proof. For the first, we note that for any and any , (a,b)^{a'}  = (aa',b) (a',b)^{-1}, by Proposition 1.

For the second, we have for any , , , , \begin{align*}(a,(b,c)x) &= a^{-1}x^{-1}(c,b)a(b,c)x = (a,x)x^{-1}a^{-1}(c,b)a(b,c)x \\&= (a,x) (x,((b,c),a)) (a,(b,c)) .\end{align*} Since normalizes , the element lies in . It then follows from induction on that for all , , the element \biggl( a, \prod_{i=1}^n (b_i,c_i) \biggr) lies in the subgroup generated by elements of the form . Similarly, \begin{align*}(a,(b,c)) &= (a, (c,b) \cdot (b,c)^2) \\&= (a,(b,c)^2)\Bigl( (b,c)^2,\bigl((c,b),a \bigr) \Bigr) \cdot (a,(c,b)) ,\end{align*} lies in the subgroup generated by elements of the form ; it then follows that does. Then using the observation (a,(c,b)x) = (a,x)(x, ((c,b),a)) (a,(c,b)), we prove by induction on that the element \biggl(a, \prod_{i=1}^n (b_i,c_i)^{\pm 1} \biggr) lies in the subgroup generated by elements of the form . This proves the second result.

For the third part, we first note that since are normal subgroups, so are , , and ; in particular, (C,(B,A)) \cdot (B,(C,A)) = (B,(C,A)) \cdot (C,(B,A)) is a group. From the previous result of this proposition, it suffices to show that lies in this group, for all , , and . To that end, we note that since is normal, there exists such that . Then by the third result of Proposition 1, (a'^b , (b,c)) \cdot (b^c , (c,a')) \cdot (c^{a'} , (a',b)) = e, or (a,(b,c)) = \bigl[ (b^c, (c,a')) \cdot (c^{a'}} , (a',b)) \bigr]^{-1} \in (B,(C,A)) \cdot (C, (B,A)) , as desired.

See also

Add a glimpse of the Art of Problem Solving Forum to your own site!
Click here for details!
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us