Show that a group has exactly one idempotent element

  • Thread starter Thread starter Mr Davis 97
  • Start date Start date
  • Tags Tags
    Element Group
Mr Davis 97
Messages
1,461
Reaction score
44

Homework Statement


Prove that a group has exactly one idempotent element.

Homework Equations

The Attempt at a Solution


So we need to show that the identity element is the unique idempotent element in a group.

First, we know that by definition of a group there is at least one element, e, such that ##e * e = e##.

Second, we need to show that there is at most one idempotent element. We do this by showing that if ##x*x=x## and ##y*y=y## then ##x=y##... This is as far as I get. Am I on the right track?
 
Physics news on Phys.org
Mr Davis 97 said:

Homework Statement


Prove that a group has exactly one idempotent element.

Homework Equations

The Attempt at a Solution


So we need to show that the identity element is the unique idempotent element in a group.

First, we know that by definition of a group there is at least one element, e, such that ##e * e = e##.

Second, we need to show that there is at most one idempotent element. We do this by showing that if ##x*x=x## and ##y*y=y## then ##x=y##... This is as far as I get. Am I on the right track?
What does it mean for ##x\cdot x = x^2=x\,##? Any idea to get rid of one ##x\,##?
 
fresh_42 said:
What does it mean for ##x\cdot x = x^2=x\,##? Any idea to get rid of one ##x\,##?
I can use the cancellation law. But how does that logically show that e is the unique element in the group that is idempotent?
 
Mr Davis 97 said:
I can use the cancellation law. But how does that logically show that e is the unique element in the group that is idempotent?
If ##x## is any idempotent element, i.e. ##x^2=x## then you can multiply (as in school on both sides) the whole equation with ##x^{-1}##, which is probably what you meant by cancellation. You can do this, because all elements of a group have an inverse. Then - if you want to be very rigorous and pedantic - you can apply associativity and the existence and definition of ##e##. Write it down and see what it says.
 
  • Like
Likes Mr Davis 97
Mr Davis 97 said:
First, we know that by definition of a group there is at least one element, e, such that ##e * e = e##.
You know more than that about e. You know x*e=x. Use that. The fact that e*e = e should tell you that you need to prove that x=e.
 
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