Skip to Content
Math4302Modern Algebra (Lecture 24)

Math4302 Modern Algebra (Lecture 24)

Rings

Definition of ring

A ring is a set RR with binary operation ++ and \cdot such that:

  • (R,+)(R,+) is an abelian group.
  • Multiplication is associative: (ab)c=a(bc)(a\cdot b)\cdot c=a\cdot (b\cdot c).
  • Distribution property: a(b+c)=ab+aca\cdot (b+c)=a\cdot b+a\cdot c, (b+c)a=ba+ca(b+c)\cdot a=b\cdot a+c\cdot a. (Note that \cdot may not be abelian, may not even be a group, therefore we need to distribute on both sides.)
Note

ab=aba\cdot b=ab will be used for the rest of the sections.

Examples of rings

(Z,+,)(\mathbb{Z},+,*), (R,+,)(\mathbb{R},+,*) are rings.


(2Z,+,)(2\mathbb{Z},+,\cdot) is a ring.


(Mn(R),+,)(M_n(\mathbb{R}),+,\cdot) is a ring.


(Zn,+,)(\mathbb{Z}_n,+,\cdot) is a ring, where ab=abmodna\cdot b=a*b\mod n.

e.g. in Z12,48=8\mathbb{Z}_{12}, 4\cdot 8=8.

Tip

If (R+,)(R+,\cdot) is a ring, then (R,)(R,\cdot) may not be necessarily a group.

Properties of rings

Let 00 denote the identity of addition of RR. a-a denote the additive inverse of aa.

  • 0a=a0=00\cdot a=a\cdot 0=0
  • (a)b=a(b)=(ab)(-a)b=a(-b)=-(ab), a,bR\forall a,b\in R
  • (a)(b)=ab(-a)(-b)=ab, a,bR\forall a,b\in R

Proof

  1. 0a=(0+0)a=0a+0a0\cdot a=(0+0)\cdot a=0\cdot a+0\cdot a, by cancellation, 0a=00\cdot a=0.
    Similarly, a0=0a=0a\cdot 0=0\cdot a=0.

  2. (a+(a))b=0b=0(a+(-a))\cdot b=0\cdot b=0 by (1), So ab+(a)b=0a\cdot b +(-a)\cdot b=0, (a)b=(ab)(-a)\cdot b=-(ab). Similarly, a(b)=(ab)a\cdot (-b)=-(ab).

  3. (a)(b)=(a(b))(-a)(-b)=(a(-b)) by (2), apply (2) again, ((ab))=ab-(-(ab))=ab.

Definition of commutative ring

A ring (R,+,)(R,+,\cdot) is commutative if ab=baa\cdot b=b\cdot a, a,bR\forall a,b\in R.

Example of non commutative ring

(Mn(R),+,)(M_n(\mathbb{R}),+,\cdot) is not commutative.

Definition of unity element

A ring RR has unity element if there is an element 1R1\in R such that a1=1a=aa\cdot 1=1\cdot a=a, aR\forall a\in R.

Note

Unity element is unique.

Suppose 1,11,1' are unity elements, then 11=11=11\cdot 1'=1'\cdot 1=1, 1=11=1'.

Example of field have no unity element

(2Z,+,)(2\mathbb{Z},+,\cdot) does not have unity element.

Definition of unit

Suppose RR is a ring with unity element. An element aRa\in R is called a unit if there is bRb\in R such that ab=ba=1a\cdot b=b\cdot a=1.

In this case bb is called the inverse of aa.

Tip

If aa is a unit, then its inverse is unique. If b,bb,b' are inverses of aa, then b=1b=bab=b1=bb'=1b'=bab'=b1=b.

We use a1a^{-1} or 1a\frac{1}{a} to represent the inverse of aa.

Let RR be a ring with unity, then 00 is not a unit. (identity of addition has no multiplicative inverse)

If 0b=b0=10b=b0=1, then aR\forall a\in R, a=1a=0a=0a=1a=0a=0.

Definition of division ring

If every a0a\neq 0 in RR has a multiplicative inverse (is a unit), then RR is called a division ring.

Definition of field

A commutative division ring is called a field.

Example of field

(R,+,)(\mathbb{R},+,\cdot) is a field.


(Zp,+,)(\mathbb{Z}_p,+,\cdot) is a field, where pp is a prime number.

Lemma Zp\mathbb{Z}_p is a field

Zp\mathbb{Z}_p is a field if and only if pp is prime.

Proof

If Zn\mathbb{Z}_n is a field, then nn is prime.

We proceed by contradiction. Suppose nn is not a prime, then dnd|n for some 2dn12\leq d\leq n-1, then [d][d] does not have inverse.

If [d][x]=[1][d][x]=[1], then dx1modndx\equiv 1\mod n, so dx1=nydx-1=ny for some yZy\in \mathbb{Z}, but ddxd|dx, and dnyd|ny, so d1d|1 which is impossible.

Therefore, nn is prime.


If pp is prime, then Zp\mathbb{Z}_p is a field.

Since pp is a prime, then gcd(m,n)=1\operatorname{gcd}(m,n)=1 for 1mn11\leq m\leq n-1. So 1=mx+ny1=mx+ny for some x,yZpx,y\in \mathbb{Z}_p. Then [x][x] (the remainder of xx when divided by pp) is the multiplicative inverse of [m][m]. [m][x]=[mx]=[1ny]=[1][m][x]=[mx]=[1-ny]=[1].

Last updated on