Topper Copies

Let $R$ be a ring with unity $1 \in R$. Further, Let for $x(\neq 0) \in R, \exists$ a unique $y \in R$ s.t. $xyx = x$. prove that $xy = yx = 1$, that is, $x$ is invertible in $R$.

Aryan Yadav, AIR 31, 2025

i) If R has no zero divisors => Cancellation laws apply

$xyx = x \cdot 1 \Rightarrow yx = 1$

$xyx = 1 \cdot x \Rightarrow xy = 1$

=> $xy = yx = 1$

ii) If R has zero divisors

=> $\exists$ $a, b \in R$ s/t $ab = 0$ & $a \neq 0, b \neq 0$

=> $\exists$ $y \in R$ s/t $aya = a$

$a(y+b)a = aya + aba = aya$ (as $ab = 0$)

=> $a(y+b)a = a$

but y must be unique

=> $y = y+b$ => $b = 0$

Which is a contradiction => R has No 0 Divisors