Given that the ring R with unity has finite number of idempotents. How do we show that the number of idempotents is even?
Parity of idempotent elements of a ring
1
$\begingroup$
abstract-algebra
ring-theory
1 Answers
1
If $e$ is an idempotent, so is $1-e$. This pairs the idempotents off, and so you have an even number of them.
I don't know if you want any more ideas for a formal proof. Basically you could just find a maximal set $S$ of idempotents such that if $e\in S$, and $1-e\notin S$. If $X$ is the full set of idempotents, then you can show there is a bijection between $S$ and $X\setminus S$, and since these are finite sets, it implies $X$ is of order $2n$ where $n$ is the size of $S$.
-
0The map $e\mapsto 1-e$ is its own inverse, you'll notice. – 2012-10-23
-
0Wonderful.Bad that I didnt notice it at once.Thank you ! – 2012-10-23
-
0@Pilot Another trick about idempotents to have in your pocket: $(1-2e)^2=1$! – 2012-10-23
-
1To show the bijection between $S$ and $X\setminus S$ it helps to know $e \neq 1-e$. This is easily shown from $e(1-e) = 0$ but $ee=e$ (and $e=0$ doesn't work unless $R=\{0\}$, which is a counter-example, but presumably is supposed to be ignored). – 2012-10-23
-
0It is required that R has unity as well,that means R has at least 0 and 1 in it. – 2012-10-23
-
0@Pilot Jack's referring to the case of $0=1$ which some people insist on taking seriously :) – 2012-10-23