Maths Olympiad Prep

Library / /35 of 45

Algebra Difficulty 6.3 National olympiad Prove it Romania

Let RR be a ring with only finitely many invertible elements. Prove that the two statements below are equivalent:
(a) For every non-invertible element xx of RR, there exists a non-invertible element yy of RR such that xy=x+yxy = x + y.
(b) Every non-invertible element of RR is nilpotent.
(An element zz of RR is called *nilpotent* if zk=0z^k = 0 for some positive integer kk.)

Solution

We show that (a) implies (b). Let xRU(R)x \in R \setminus U(R), where U(R)U(R) is the set of invertible elements of RR, and let yRU(R)y \in R \setminus U(R) be such that xy=x+yxy = x + y, i.e., (x1)(y1)=1(x - 1)(y - 1) = 1. Similarly, (y1)(z1)=1(y - 1)(z - 1) = 1 for some zRU(R)z \in R \setminus U(R). Write
x1=(x1)1=(x1)(y1)(z1)=1(z1)=z1, x - 1 = (x - 1) \cdot 1 = (x - 1)(y - 1)(z - 1) = 1 \cdot (z - 1) = z - 1,
to infer that x=zx = z. Hence x1U(R)x - 1 \in U(R), showing that {t1:tRU(R)}U(R)\{t - 1 : t \in R \setminus U(R)\} \subseteq U(R).
Since xRU(R)x \in R \setminus U(R), its powers are all different from 11, and finiteness of the multiplicative group U(R)U(R) then forces them all in RU(R)R \setminus U(R). Hence xn1U(R)x^n - 1 \in U(R) for all positive integers nn, by the set inclusion in the previous paragraph. With reference again to finiteness of U(R)U(R), xp1=xq1x^p - 1 = x^q - 1 for some distinct positive integers pp and qq, say, p<qp < q. Then xp(xqp1)=0x^p(x^{q-p} - 1) = 0, so xp=0x^p = 0, on account of xqp1U(R)x^{q-p} - 1 \in U(R). Consequently, xx is indeed nilpotent.

We now show that (b) implies (a). Let xRU(R)x \in R \setminus U(R) and choose an integer p3p \ge 3 such that xp=0x^p = 0. Write 1=1xp=(1x)(1+x+x2++xp1)1 = 1 - x^p = (1-x)(1+x+x^2+\cdots+x^{p-1}) and let y=(x+x2++xp1)=x(1+x++xp2)y = -(x+x^2+\cdots+x^{p-1}) = -x(1+x+\cdots+x^{p-2}). Then yp=0y^p = 0, so yRU(R)y \in R \setminus U(R). Clearly, (1x)(1y)=1(1-x)(1-y) = 1, i.e., xy=x+yxy = x+y. This completes the proof.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.