Home page for accesible maths 6 Equivalence relations and their applications

Style control - access keys in brackets

Font (2 3) - + Letter spacing (4 5) - + Word spacing (6 7) - + Line spacing (8 9) - +

6.4 Constructing number systems

In this section we shall see how it is possible to begin with \mathbb{N}, the simplest number system we know, and from it build larger and larger ones, at each stage in an attempt to overcome a particular shortcoming of the system so far created. We shall present three such constructions; equivalence relations will be very useful in the first two, but first we need a new concept.

Definition 6.4.1

If AA and BB are sets, we define an ordered pair of elements of AA and BB to be an object (a,b)(a,b), where aAa\in A and bBb\in B; two such ordered pairs (a,b)(a,b) and (c,d)(c,d) are equal if and only if a=ca=c and b=db=d. We call the set of all such ordered pairs the direct product, or the Cartesian product, of AA and BB, and we denote it by A×BA\times B; in symbols,

A×B={(a,b):aA, bB}.A\times B=\bigl\{(a,b):a\in A,\,b\in B\bigr\}.

If A=BA=B we may write A2A^{2} instead of A×BA\times B.

Example 6.4.2
  1. (i)

    If A={1,2,3,4,5}A=\{1,2,3,4,5\}, we have the ordered pairs (1,3)(1,3), (2,5)(2,5) and (3,1)(3,1) in A2A^{2}, and (1,3)(3,1).(1,3)\neq(3,1).

  2. (ii)

    If A={1,2,3,4,5}A=\{1,2,3,4,5\} and B={1,2}B=\{1,2\}, then the ordered pair (3,1)(3,1) is in A×BA\times B, but the ordered pairs (1,3)(1,3) and (2,5)(2,5) are not in A×BA\times B.

We are now ready to begin our constructions. For the first one we start with \mathbb{N}; here we have addition and multiplication, but we cannot solve the equation x+5=3x+5=3, for example. We define a relation \sim on 2\mathbb{N}^{2} by

(a,b)(c,d)ifa+d=b+c.(a,b)\sim(c,d)\quad\hbox{if}\quad a+d=b+c.

Thus for example (3,1)(4,2)(3,1)\sim(4,2), as 3+2=1+43+2=1+4. We show that this is an equivalence relation.

  1. (i)

    For all (a,b)2(a,b)\in\mathbb{N}^{2} we have a+b=b+aa+b=b+a, i.e., (a,b)(a,b)(a,b)\sim(a,b); so \sim is reflexive.

  2. (ii)

    If (a,b)(c,d)(a,b)\sim(c,d) then a+d=b+ca+d=b+c, so c+b=d+ac+b=d+a, i.e., (c,d)(a,b);(c,d)\sim(a,b); so \sim is symmetric.

  3. (iii)

    If (a,b)(c,d)(a,b)\sim(c,d) and (c,d)(e,f)(c,d)\sim(e,f) then a+d=b+ca+d=b+c and c+f=d+e,c+f=d+e, so a+d+f=b+c+f=b+d+ea+d+f=b+c+f=b+d+e; cancelling dd from both sides, we obtain a+f=b+ea+f=b+e, i.e., (a,b)(e,f)(a,b)\sim(e,f); so \sim is transitive.

Thus we have an equivalence relation, and so equivalence classes; we may identify the class (a,b)^\widehat{(a,b)} with the integer a-ba-b (which may be positive, negative or zero), because if (a,b)^=(c,d)^\widehat{(a,b)}=\widehat{(c,d)} then a+d=b+ca+d=b+c, so a-b=c-da-b=c-d. There is a copy of \mathbb{N} in the new system (nn corresponds to (n+1,1)^\widehat{(n+1,1)}), and we can define addition and multiplication in it by

(a,b)^+(c,d)^=(a+c,b+d)^  and  (a,b)^(c,d)^=(ac+bd,ad+bc)^\widehat{(a,b)}+\widehat{(c,d)}=\widehat{(a+c,b+d)}\qquad\hbox{and}\qquad% \widehat{(a,b)}\cdot\widehat{(c,d)}=\widehat{(ac+bd,ad+bc)}

(the second of these arises from considering what (a-b)(c-d)(a-b)(c-d) should be). Moreover, setting -(a,b)^=(b,a)^-\widehat{(a,b)}=\widehat{(b,a)}, we have negation and thus subtraction; so we can solve all equations x+b=ax+b=a because we can always form x=a-bx=a-b. After checking that everything works, we have thus built the number system \mathbb{Z} from \mathbb{N}.

The construction above no doubt seems very artificial; certainly we would never write integers as equivalence classes of ordered pairs. The point is that the construction can be done, using only what is available in \mathbb{N}.

Now let us turn to our second construction, which proceeds in a rather similar fashion to the first, but should end up seeming less unnatural than it. This time we start with the newly-created \mathbb{Z} (but written by now in the usual manner); here we have addition, subtraction and multiplication, but we cannot solve an equation like 5x=35x=3. Define *={0}\mathbb{Z}^{*}=\mathbb{Z}\setminus\{0\}, and consider the direct product ×*\mathbb{Z}\times\mathbb{Z}^{*}; its elements are pairs of integers (a,b)(a,b) with b0b\neq 0. We define a relation \sim on ×*\mathbb{Z}\times\mathbb{Z}^{*} by

(a,b)(c,d)ifad=bc.(a,b)\sim(c,d)\quad\hbox{if}\quad ad=bc.

Thus for example (2,3)(6,9)(2,3)\sim(6,9) as 29=362\cdot 9=3\cdot 6. We show this is an equivalence relation.

  1. (i)

    For all (a,b)×*(a,b)\in\mathbb{Z}\times\mathbb{Z}^{*} we have ab=baab=ba, i.e., (a,b)(a,b)(a,b)\sim(a,b); so \sim is reflexive.

  2. (ii)

    If (a,b)(c,d)(a,b)\sim(c,d) then ad=bcad=bc, so cb=dacb=da, i.e., (c,d)(a,b)(c,d)\sim(a,b); so \sim is symmetric.

  3. (iii)

    If (a,b)(c,d)(a,b)\sim(c,d) and (c,d)(e,f)(c,d)\sim(e,f) then we have ad=bcad=bc and cf=decf=de, so adf=bcf=bdeadf=bcf=bde; cancelling dd from both sides (which we may because d0d\neq 0), we obtain af=beaf=be, i.e., (a,b)(e,f)(a,b)\sim(e,f); so \sim is transitive.

Thus we have an equivalence relation, and so equivalence classes; we may identify the class (a,b)^\widehat{(a,b)} with the rational number a/ba/b, because if (a,b)^=(c,d)^\widehat{(a,b)}=\widehat{(c,d)} then ad=bcad=bc and b,d0b,d\neq 0, so a/b=c/da/b=c/d.

There is a copy of \mathbb{Z} in the new system (nn corresponds to (n,1)^\widehat{(n,1)}), and we can define addition, multiplication and negation (and therefore subtraction) in it by

(a,b)^+(c,d)^=(ad+bc,bd)^,  (a,b)^(c,d)^=(ac,bd)^  and  -(a,b)^=(-a,b)^.\widehat{(a,b)}+\widehat{(c,d)}=\widehat{(ad+bc,bd)},\qquad\widehat{(a,b)}% \cdot\widehat{(c,d)}=\widehat{(ac,bd)}\qquad\hbox{and}\qquad-\widehat{(a,b)}=% \widehat{(-a,b)}.

(The first of these arises from considering what (a/b)+(c/d)(a/b)+(c/d) should be.) Moreover, setting

(a,b)^-1=(b,a)^{\widehat{(a,b)}\,}^{-1}=\widehat{(b,a)}

if a0a\neq 0, we have inversion of non-zero elements and thus division (since x/y=xy-1x/y=xy^{-1}); so we can solve all equations bx=abx=a (as long as b0b\neq 0) because we can always form x=a/bx=a/b. After checking that everything works, we have thus built the number system \mathbb{Q} from \mathbb{Z}.

This time, although the notation is a little strange, things look reasonably familiar; after all, we do denote rational numbers by pairs of integers, the second of which is non-zero, except that instead of writing them horizontally, separated by a comma, we write them vertically, separated by a line. Moreover, we are quite used to the idea that a given rational number may be expressed in different ways, e.g.,

23=46=69=,\frac{2}{3}=\frac{4}{6}=\frac{6}{9}=\dots,

corresponding to different choices of representative pair within the equivalence class (2,3)^\widehat{(2,3)}. Again, we observe that the construction has only used what is available in \mathbb{Z}.

Note: The remainder of this chapter is not examinable.

The next step would be to begin with \mathbb{Q} (where we have addition, subtraction, multiplication and division, but cannot solve the equation x2=2x^{2}=2, for example) and build \mathbb{R} from it. This is, however, significantly harder than the previous two constructions, reflecting the fact that the system \mathbb{R} is considerably more complicated than its predecessors; it requires material which you will only meet later this year, namely convergence of infinite sequences. It does use an equivalence relation on an appropriate set, though.

Instead, our final construction will start from \mathbb{R}; here we have addition, subtraction, multiplication and division, and can solve many equations, but we cannot solve x2=-1x^{2}=-1 since the square of any real number is non-negative.

We form the set 2\mathbb{R}^{2}; this time, for a change, we shall not require an equivalence relation. Nevertheless, we proceed much as before. There is a copy of \mathbb{R} in the new system (xx corresponds to (x,0)(x,0)), and we can define addition, negation (and therefore subtraction), multiplication and inversion of non-zero elements (and therefore division) in it by

(a,b)+(c,d)=(a+c,b+d),-(a,b)=(-a,-b),(a,b)(c,d)=(ac-bd,ad+bc),(a,b)-1=(aa2+b2,-ba2+b2).\begin{array}[]{rlrl}(a,b)+(c,d)&\!\!\!=(a+c,b+d),&-(a,b)&\!\!\!=(-a,-b),\\ (a,b)\cdot(c,d)&\!\!\!=(ac-bd,ad+bc),&(a,b)^{-1}&\!\!\!=\biggl(\displaystyle{% \frac{a}{a^{2}+b^{2}},-\frac{b}{a^{2}+b^{2}}}\biggr).\end{array}

(The third and fourth of these are not at all obvious, but note that a2+b2>0a^{2}+b^{2}>0 for (a,b)(0,0)(a,b)\neq(0,0), so the formula for inversion does at least make sense.) The formula for multiplication shows that

(0,1)2=(0,1)(0,1)=(-1,0).(0,1)^{2}=(0,1)\cdot(0,1)=(-1,0).

In other words, x=(0,1)x=(0,1) solves the equation x2=-1x^{2}=-1. After checking that everything works, we have thus built a new number system from \mathbb{R}; we call it \mathbb{C}, the complex numbers.

In practice, we do not use exactly this notation for the elements of \mathbb{C}. Instead we write i\mathrm{i} for (0,1)(0,1), and recalling that we have identified the real numbers aa and bb with (a,0)(a,0) and (b,0)(b,0), respectively, we find

a+bi=(a,0)+(b,0)(0,1)=(a,0)+(b0-01,b1+00)=(a,0)+(0,b)=(a,b).\displaystyle a+b\,\mathrm{i}=(a,0)+(b,0)\cdot(0,1)=(a,0)+(b\cdot 0-0\cdot 1,b% \cdot 1+0\cdot 0)=(a,0)+(0,b)=(a,b).

The formulæ above then become

(a+bi)+(c+di)\displaystyle(a+b\,\mathrm{i})+(c+d\,\mathrm{i}) =(a+c)+(b+d)i,\displaystyle=(a+c)+(b+d)\,\mathrm{i}, -(a+bi)\displaystyle-(a+b\,\mathrm{i}) =(-a)+(-b)i,\displaystyle=(-a)+(-b)\,\mathrm{i},
(a+bi)(c+di)\displaystyle(a+b\,\mathrm{i})\cdot(c+d\,\mathrm{i}) =(ac-bd)+(ad+bc)i,\displaystyle=(ac-bd)+(ad+bc)\,\mathrm{i}, (a+bi)-1\displaystyle(a+b\,\mathrm{i})^{-1} =aa2+b2-ba2+b2i.\displaystyle=\frac{a}{a^{2}+b^{2}}-\frac{b}{a^{2}+b^{2}}\,\mathrm{i}.

Note that

(a+bi)(aa2+b2-ba2+b2i)=aa-b(-b)a2+b2+a(-b)+baa2+b2i=1,(a+b\,\mathrm{i})\biggl(\frac{a}{a^{2}+b^{2}}-\frac{b}{a^{2}+b^{2}}\,\mathrm{i% }\biggr)=\frac{aa-b(-b)}{a^{2}+b^{2}}+\frac{a(-b)+ba}{a^{2}+b^{2}}\,\mathrm{i}% =1,

so the formula for (a+bi)-1(a+b\,\mathrm{i})^{-1} is correct.

Example 6.4.3

In the new notation, we have (2,-3)=2-3i(2,-3)=2-3\mathrm{i} and (-1,2)=-1+2i(-1,2)=-1+2\mathrm{i}, and

(2-3i)+(-1+2i)\displaystyle(2-3\mathrm{i})+(-1+2\mathrm{i}) =(2-1)+(-3+2)i=1-i,\displaystyle=(2-1)+(-3+2)\mathrm{i}=1-\mathrm{i},
-(2-3i)\displaystyle-(2-3\mathrm{i}) =(-2)+(-(-3))i=-2+3i.\displaystyle=(-2)+(-(-3))\mathrm{i}=-2+3\mathrm{i}.

The formula for the product of two complex numbers looks complicated. Fortunately, there is no need to memorize it, as there is an easier way to multiply complex numbers: first expand the brackets, then use the fact that i2=-1\mathrm{i}^{2}=-1, and finally gather together like terms. For instance, we have

(2-3i)(-1+2i)\displaystyle(2-3\mathrm{i})(-1+2\mathrm{i}) =2(-1)+22i+(-3)(-1)i+(-3)2i2\displaystyle=2(-1)+2\cdot 2\mathrm{i}+(-3)(-1)\mathrm{i}+(-3)2\mathrm{i}^{2}
=-2+4i+3i+(-6)(-1)=4+7i.\displaystyle=-2+4\mathrm{i}+3\mathrm{i}+(-6)(-1)=4+7\mathrm{i}.

Likewise, there is a trick to avoid memorizing the formula for inversion: multiply the fraction 1/(a+bi)1/(a+b\,\mathrm{i}) by a-bia-b\,\mathrm{i} in both numerator and denominator, and expand the brackets; the fact that

(a+bi)(a-bi)=a2-(bi)2=a2+b2(a+b\,\mathrm{i})(a-b\,\mathrm{i})=a^{2}-(b\,\mathrm{i})^{2}=a^{2}+b^{2}

ensures that the denominator is real and non-zero (because aa and bb are not both zero). The following example illustrates this procedure:

12-3i=2+3i(2-3i)(2+3i)=2+3i22-(3i)2=2+3i4+9=213+313i.\frac{1}{2-3\mathrm{i}}=\frac{2+3\mathrm{i}}{(2-3\mathrm{i})(2+3\mathrm{i})}={% \frac{2+3\mathrm{i}}{2^{2}-(3\mathrm{i})^{2}}}={\frac{2+3\mathrm{i}}{4+9}}={% \frac{2}{13}+\frac{3}{13}\,\mathrm{i}.}
Remark 6.4.4

Sometimes we do in fact regard the elements of \mathbb{C} as ordered pairs, namely when it comes to ‘‘picturing’’ them; we consider a plane with horizontal and vertical axes, and identify the point having coordinates (a,b)(a,b) with the complex number a+bia+b\,\mathrm{i}.

There is of course much more to be said about \mathbb{C}, but that will be covered elsewhere. We conclude this section by mentioning that, perhaps surprisingly, we find there is in fact no need to build any larger system to enable us to solve equations; the process stops here.