If a.a=a prove R is commutative

  • Thread starter Thread starter gottfried
  • Start date Start date
gottfried
Messages
118
Reaction score
0

Homework Statement


If a.a=a for all elements of R, prove R is commutative.

The Attempt at a Solution



(a+b)2=a+b=a2+ba+ab+b2=a+ba+ab+b

Then -ba=ab

Any suggestions of how to show that -b=b?
 
Physics news on Phys.org
Are we to assume, here, that R is a group? Then it is always true that ae= a (e is the identity) so if it is also true that aa= a, then we have aa= ae and, multiplying on the left by the inverse of a, a= e. So we have only the "trivial" group containing only the identity.

If R is not a group, what sort of algebraic entity is it?
 
Sorry I should have been more clear but R is ring. So we are trying to show that . is a commutative operation and therefore making (R,+,.) a commutative ring.(At least that is my understanding of a commutative ring)

If I understand correctly I don't think we can assume that R has a multiplicative identity(1).
 
The structure in your OP is called a Boolean ring. You can prove that any element a in your Boolean ring satisfies a+a=0.

Prove this by considering (a+a)(a+a)
 
(a+a)(a+a)=a+a
a2+a2+a2+a2=a+a
a+a+a+a=a+a
a+a=0
a=-a for all a in R

Thanks, that makes sense.
 
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