Problem Set Item #4 Proofs

Let 𝑅 be a ring that contains at least two elements. Suppose for each nonzero 𝑎 ∈ 𝑅,
there exists a unique 𝑏 ∈ 𝑅 such that 𝑎𝑏𝑎 = 𝑎.
a. Show that 𝑅 has no zero divisors.
b. Show that 𝑏𝑎𝑏 = 𝑏
c. Show that 𝑅 has unity.
d. Show that 𝑅 is a division ring.

a. Show that 𝑅 has no zero divisors.

Proof: Suppose there are zero divisors, (proof by contradiction)
then ∃ 𝑐𝑎 = 0 for some 𝑐 ∈ 𝑅 where 𝑐 ≠ 0 and 𝑎 ∈ 𝑅 where 𝑎 ≠ 0.

Since ∃ unique 𝑏 ∈ 𝑅, 𝑏 ≠ 0 such that 𝑎𝑏𝑎 = 𝑎.

Also, the right and left distributive laws hold in a ring, we can write,
𝑎(𝑏 + 𝑐)𝑎 = (𝑎𝑏 + 𝑎𝑐)𝑎 = 𝑎𝑏𝑎 + 𝑎𝑐𝑎 = 𝑎𝑏𝑎 + 𝑎0 = 𝑎𝑏𝑎 = 𝑎
For 𝑎(𝑏 + 𝑐)𝑎 = 𝑎𝑏𝑎 = 𝑎
𝑐 must be equal to zero (contradiction to the assumption that 𝑐 ≠ 0)
We have a contradiction.
Thus, there are no zero divisors.

b. Show that 𝑏𝑎𝑏 = 𝑏.

Proof: since 𝑎𝑏𝑎 = 𝑎
𝒂𝒃𝒂 = (𝑎)𝑏𝑎 = (𝑎𝑏𝑎)𝑏𝑎 = 𝑎(𝑏𝑎𝑏)𝑎 = 𝒂
Thus, we have 𝑎𝑏𝑎 = 𝑎(𝑏𝑎𝑏)𝑎
Since, there is no zero divisors, cancellation law holds. (Theorem 4)
Therefore, by cancellation law 𝑏 = 𝑏𝑎𝑏

c. Show that 𝑅 has unity.

Proof: Let 𝑐 ∈ 𝑅, and that 𝑎𝑏𝑎 = 𝑎 and 𝑏𝑎𝑏 = 𝑏, and by cancellation law,
𝑐𝑎 = 𝑐𝑎𝑏𝑎 ⟶ 𝑐 = 𝑐(𝑎𝑏)
𝑏𝑐 = 𝑏𝑎𝑏𝑐 ⟶ 𝑐 = (𝑎𝑏)𝑐
We can see that 𝑎𝑏 is the multiplicative identity for all 𝑎 ∈ 𝑅.
Therefore, 𝑅 is a ring with unity.

d. Show that R is a division ring.

Proof: 𝑎𝑏𝑎 = 𝑎
(𝑎𝑏)𝑎 = 𝑎 ⇒ 𝑎𝑏 = 1
Since 𝑎𝑏 is the multiplicative identity for all 𝑎 ∈ 𝑅,
This implies that 𝑎 always have an inverse 𝑏.
Thus, every element 𝑎 ≠ 0 has an inverse or a unit.
Therefore 𝑅 is a division ring.