Proof Even Order Groups Have Element of Order 2

  • Context: Graduate 
  • Thread starter Thread starter clkt
  • Start date Start date
  • Tags Tags
    even Groups
Click For Summary

Discussion Overview

The discussion revolves around proving that groups of even order must contain an element of order 2. Participants explore the properties of group elements, their inverses, and how these relate to the concept of pairing elements to demonstrate the existence of such an element.

Discussion Character

  • Exploratory
  • Mathematical reasoning

Main Points Raised

  • One participant questions how to prove that groups of even order must have an element of order 2, suggesting that an odd number of elements implies one element must multiply with itself to yield the identity.
  • Another participant agrees with the reasoning presented but seeks clarification on how to establish the necessity for elements to pair up and cancel out.
  • A participant inquires about the property of groups that requires every element to have a "partner" for cancellation.
  • Another participant states that every element in a group has a unique inverse, which allows for the formation of pairs as described.

Areas of Agreement / Disagreement

Participants generally agree on the idea that elements in a group can be paired with their inverses, but the discussion remains unresolved regarding the specific proof of the existence of an element of order 2 in groups of even order.

Contextual Notes

The discussion does not fully resolve the mathematical steps necessary to prove the initial claim, and assumptions about the properties of group elements and their inverses are not explicitly detailed.

Who May Find This Useful

Readers interested in group theory, particularly those studying properties of group elements and their orders, may find this discussion relevant.

clkt
Messages
6
Reaction score
0
How do I proof that groups of an even order must have an element of order 2? I have a vague idea, but I don't know how to put my idea together.
Aside from identity, there are an odd number of elements in my group. So one element will not have a partner and will have to be multiplied by itself to cancel out. That element must have an order of 2 such that its square = identity. But how can I create the scenario where all elements have to pair up and cancel out? Thanks in advance.
 
Physics news on Phys.org
Aside from identity, there are an odd number of elements in my group. So one element will not have a partner and will have to be multiplied by itself to cancel out. That element must have an order of 2 such that its square = identity.
This is correct. Although the wording is informal, I'd consider this an adequate proof.
But how can I create the scenario where all elements have to pair up and cancel out?
Huh?
 
I guess my question is, what is the property of a group that dictates that every element must have a "partner" to cancel out with?
 
Every element in a group has an inverse. Although not specified explicitly, it's easy to show this inverse is unique, and that the inverse of the inverse is the original element, which allows you to form pairs like you did above.
 
ahhhh, thank you!
 
can you prove a group whose order is divisible by three has an element of order 3?
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 17 ·
Replies
17
Views
10K
  • · Replies 26 ·
Replies
26
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K