edited by
7,108 views
40 votes
40 votes
If $G$ is a group of even order, then show that there exists an element $a≠e$, the identity in $G$, such that $a^2 = e$.
edited by

4 Answers

Best answer
82 votes
82 votes

I will proove it using contradiction. Assuming no element has order $2.$ i.e., $a^2 \neq e$ for any non-identity element $a,$ means 

$a \neq a^{-1}$ for any (non-identity element) $a.$

Rewriting the statement: the inverse of any element is not that element itself, it is something else.

But I want to somehow show that at least one element has inverse as its own. I am trying a method lets see if it works :).

I will select each element from the set and will check inverse of each element, and in this process, as soon as I encounter any element having  $a^2 \neq e$ then I am done.

My Goal: to show $G$ has at least $1$ element as its own inverse.

Let $|G| = 2n$. Then we take out the identity and have  $2n-1$ elements to choose from.

Step 1: Select an element, if it is its own inverse then I am done.

Step 2 (otherwise): If inverse of $a$ is not $a$ and is $b,$  throw $a$ and $b$ out. $(\because$ if $a$ inverse is $b$ then $b$ inverse is $a$, and inverse of an element is unique$)$                  

(Notice we always throw one pair) 

In worst case I will end up throwing all but one element, because total number of elements is odd $(2n-1)$ and we always throw a pair of two (even).

Now question is, what is the inverse of that element? 

It has to be its own inverse, it can not map to inverse of any other element because inverse is unique. And moreover it can not be inverse of identity element because inverse of identity is identity itself.

Finally, I can say there exist one non-identity element $a$ of order $2.$

Yes, it worked !

Hence Proved !

edited by
10 votes
10 votes

Now what i can say for group of even order has even no. of elemnt in it at-east one time identity elemnet come to diagonal place exept for identity element itself, at that time a2 = e is happen .

Point -1: Identity element has its own inverse but we cannot take it.[ Given in question  a≠e]

Point-2 : since even numbers total but we left with odd numbers (2n-1). an we know if a is inverse of b then b is also inverse of a.

So 2n-2 elements are got pairing with thier inverse so 1 left element is its own inverse.

In image 4 is that element.

edited by
2 votes
2 votes

Think of this like the theorem in Graph Theory that the number of vertices with odd degree must be even.


 

To prove: If G is a group of even order, then there exists an element a, such that order of a is 2. And, a can't be the identity.

 

We know that if an element is its own inverse, its order is 2.

ie, if $a=a^{-1}$ then $a^2=e$

 

Say the group has 2n elements, (hence always even order).

The inverse of the first element is the last element.

The inverse of the second element is the second last element.

The inverse of the third element is the third last element.

So on...

We know, we can make pairs out of even numbers easily. For 2n numbers, we can have n pairs.

BUT

Somewhere in this sequence, we'll encounter the identity element. The inverse of the identity element is the identity element itself!

That means all the pairs aside, we have a standalone element a, and an identity element.

 

Since every element must have an inverse in a group, and no two elements have the same inverse => a must be it's own inverse.

So, order of a is 2.

 

Proved.

1 votes
1 votes

Given: |G| = even.

Approach: here I am using non-isomorphic group structure concept to prove that if the given group is of even order then there exists an element ‘a’ such that  a^2 = e or a^-1 = e

here a^-1 means inverse of element ‘a’
and ‘e’ means identity element

let’s take a group of |G| = 4 = even order:
then there are only two non-isomorphic group structures of order 4 possible:

1st structure template:- G = ({e, x, y, z}, *) where, x^-1 = x, y^-1 = y, z^-1 = z and obviously e^-1 = e

note that here inverse of ‘x’ is ‘x’ this means x^2 = e. And similarly:
y^2 = e
z^2 = e
so, in this structure (group of order 4) other than ‘e’ we have three more elements such that a^2 = e

2nd structure template):- G = ({e, x, y, z}, *) where x^-1 = y, y^-1 = x, z^-1 = z and e-1 = e

note that here also the inverse of ‘z’ is ‘z’ i.e; z^2 = e
so, this structure (group of order 4) also has an element ‘z’ other than ‘e’ such that a^2 = e

now let’s take |G| = 2 = even order:
here only one non-isomorphic group structure of order 2 is possible: 

structure template:- G = ({e, x}, *) here x^-1 = e and of course e^-1 = e
so, here also apart from identity element ‘e’ there exists an element ‘x’ such that x^2 = e

so, similarly for any other even order group, there will exist at least one element other than identity element ‘e’ such that a^2 = e.

https://math.stackexchange.com/questions/961286/non-isomorphic-groups

Related questions

33 votes
33 votes
1 answer
1
Kathleen asked Sep 13, 2014
8,515 views
Which of the following three statements are true? Prove your answer.The union of two recursive languages is recursive.The language $\{O^n \mid n\text{ is a prime} \}$ is ...
7 votes
7 votes
2 answers
2
go_editor asked Apr 24, 2016
3,281 views
Let $S$ be the set of all integers and let $n 1$ be a fixed integer. Define for $a,b \in S, a R b$ iff $a-b$ is a multiple of $n$. Show that $R$ is an equivalence relat...
27 votes
27 votes
5 answers
3
Kathleen asked Oct 8, 2014
6,465 views
Let $G_1$ and $G_2$ be subgroups of a group $G$.Show that $G_1 \cap G_2$ is also a subgroup of $G$.Is $G_1 \cup G_2$ always a subgroup of $G$?.
26 votes
26 votes
3 answers
4
go_editor asked Apr 24, 2016
4,563 views
Consider the set of integers $\{1,2,3,4,6,8,12,24\}$ together with the two binary operations LCM (lowest common multiple) and GCD (greatest common divisor). Which of the ...