Proof of abelian-ness if every element is also its own inverse

Juanriq
Messages
39
Reaction score
0
Salutations! I just want to make sure I am on the right track...

Homework Statement



Let G be a group. Prove that if every element in a group is equal to its own inverse, then G is abelian

2. The attempt at a solution

Pick two elements a, b \in \thinspace G. By assumption, a = a^{-1} and b = b^{-1}. Our goal is to show that ab = ba. By our assumption, the following holds
<br /> ab = a^{-1}b^{-1} <br />
Since G is a group, it is closed under inverses, therefore we can take the inverse of both sides
<br /> (ab)^{-1} = \bigl (a^{-1} b^{-1} \bigl )^{-1} = \bigl (b^{-1} \bigl )^{-1} \bigl (a^{-1} \bigl )^{-1} = ba<br />

Thanks!
 
Last edited:
Physics news on Phys.org
ab is an element of G, what does that mean (ab)^-1 is by assumption?
 
Oh! By assumption ab = (ab)^{-1} [\latex] as well. That definitely makes this a simple one-liner when I apply the inverse and initial assumpition to the right side. Thanks!
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top