a group of even order contains an element of order 2
Proposition.
Every group of even order contains an element of order 2.
Proof.
Let G be a group of even order, and consider the set S={g∈G:g≠g-1}. We claim that |S| is even; to see this, let a∈S, so that a≠a-1; since (a-1)-1=a≠a-1, we see that a-1∈S as well. Thus the elements of S may be exhausted by repeatedly selecting an element and it with its inverse, from which it follows that |S| is a multiple (http://planetmath.org/Divisibility) of 2 (i.e., is even). Now, because S∩(G∖S)=∅ and S∪(G∖S)=G, it must be that |S|+|G∖S|=|G|, which, because |G| is even, implies that |G∖S| is also even. The identity element
e of G is in G∖S, being its own inverse, so the set G∖S is nonempty, and consequently must contain at least two distinct elements; that is, there must exist some b≠e∈G∖S, and because b∉S, we have b=b-1, hence b2=1. Thus b is an element of order 2 in G.
∎
Notice that the above is logically equivalent to the assertion that a group of even order has a non-identity element that is its own inverse.
Title | a group of even order contains an element of order 2 |
---|---|
Canonical name | AGroupOfEvenOrderContainsAnElementOfOrder2 |
Date of creation | 2013-03-22 17:11:37 |
Last modified on | 2013-03-22 17:11:37 |
Owner | azdbacks4234 (14155) |
Last modified by | azdbacks4234 (14155) |
Numerical id | 20 |
Author | azdbacks4234 (14155) |
Entry type | Theorem |
Classification | msc 20A05 |