Proofs of elementary ring properties

From HandWiki

The following proofs of elementary ring properties use only the axioms that define a mathematical ring:

Basics

Multiplication by zero

Theorem: 0a=a0=0

(Click "show" at right to see the proof of this theorem or "hide" to hide it.)

0a=(0+0)a=(0a)+(0a)

By subtracting (i.e. adding the additive inverse of) 0a on both sides of the equation, we get the desired result. The proof that a0=0 is similar.

Unique identity element per binary operation

Theorem: The identity element e for a binary opertaion (addition or multiplication) of a ring is unique.

(Click "show" at right to see the proof of this theorem or "hide" to hide it.)
If there is another identity element e for the binary operation, then ea=ae=a, and when a=e, ee=ee=e=e where ab is the binary operation on ring elements a and b.

Unique additive inverse element

Theorem: - a as the additive inverse element for a is unique.

(Click "show" at right to see the proof of this theorem or "hide" to hide it.)
If there is another inverse element a for a, then a=a+0=a+aa=0a=a.

Unique multiplicative inverse element

Theorem: a-1 as the multiplicative inverse element for a is unique.

(Click "show" at right to see the proof of this theorem or "hide" to hide it.)
If there is another inverse element a1 for a, then a1=a1×1=a1×a×a1=1×a1=a1.

Zero ring

Theorem: A ring (R,+,) is the zero ring (that is, consists of precisely one element) if and only if 0=1.

(Click "show" at right to see the proof of this theorem or "hide" to hide it.)
Suppose that 1=0. Let a be any element in R; then a=a1=a0=0. Therefore, (R,+,) is the zero ring. Conversely, if (R,+,) is the zero ring, it must contain precisely one element by its definition. Therefore, 0 and 1 is the same element, i.e. 0=1.

Multiplication by negative one

Theorem: (1)a=a

(Click "show" at right to see the proof of this theorem or "hide" to hide it.)

(1)a+a=(1)a+1a=((1)+1)a=0a=0

Therefore (1)a=(1)a+0=(1)a+(a+(a))=((1)a+a)+(a)=0+(a)=(a).

Multiplication by additive inverse

Theorem: (a)b=a(b)=(ab)

(Click "show" at right to see the proof of this theorem or "hide" to hide it.)

To prove that the first expression equals the second one, (a)b=((1)a)b=(a(1))b=a((1)b)=a(b).

To prove that the first expression equals the third one, (a)b=((1)a)b=(1)(ab).

A pseudo-ring does not necessarily have a multiplicative identity element. To prove that the first expression equals the third one without assuming the existence of a multiplicative identity, we show that (a)b is indeed the inverse of (ab) by showing that adding them up results in the additive identity element,

(ab)+(a)b=(aa)b=0b=0.