If a.a=a prove R is commutative

  • Thread starter gottfried
  • Start date
In summary, the conversation discusses proving that a given ring R is commutative if a.a = a for all elements of R. The participants also discuss the structure of R, with one suggesting it may be a group or a commutative ring. It is ultimately determined that R is a Boolean ring, and a proof is provided to show that any element in R satisfies a+a = 0.
  • #1
gottfried
119
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
  • #2
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?
 
  • #3
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).
 
  • #4
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)
 
  • #5
(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.
 

1. What does it mean for a group to be commutative?

In mathematics, a group is commutative if its binary operation, typically denoted as "x * y" or "xy", satisfies the commutative law "x * y = y * x" for all elements x and y in the group. This means that the order in which the elements are combined does not affect the result.

2. How does the equation a.a = a prove that a group is commutative?

The equation a.a = a, also known as the idempotent law, is a property of commutative groups. It states that any element multiplied by itself will always equal that same element. This property, along with other group axioms, can be used to prove that the group is commutative.

3. Can a group be commutative if it does not follow the equation a.a = a?

No, a group cannot be commutative if it does not follow the equation a.a = a. This equation is a fundamental property of commutative groups and if it is not satisfied, the group is not commutative.

4. What are some examples of commutative groups?

Some examples of commutative groups include the group of integers under addition, the group of real numbers under addition, and the group of positive real numbers under multiplication. These groups all satisfy the commutative law and are therefore commutative.

5. Why is proving that a group is commutative important in mathematics?

Proving that a group is commutative is important in mathematics because it allows us to simplify calculations and make generalizations about the behavior of a group. Commutative groups have special properties that can be used to solve problems and make predictions in various fields of mathematics, such as algebra, geometry, and number theory.

Similar threads

  • Calculus and Beyond Homework Help
2
Replies
40
Views
3K
  • Calculus and Beyond Homework Help
Replies
2
Views
2K
  • Calculus and Beyond Homework Help
Replies
5
Views
983
  • Introductory Physics Homework Help
Replies
3
Views
468
  • Linear and Abstract Algebra
Replies
1
Views
626
  • Calculus and Beyond Homework Help
Replies
6
Views
970
  • Calculus and Beyond Homework Help
Replies
5
Views
1K
Replies
11
Views
2K
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Linear and Abstract Algebra
Replies
5
Views
1K
Back
Top