**Addition and multiplication of natural numbers.**

For , we define inductively their sum inductively:

a) and (b)

The above two are enough to define the sum for any m and . Indeed, if , we have since is defined to be set .

Now, if . We can now verify (Exercise):

(i) and (ii)

It is easy to verify that (Exercise)

(iii) for all .

(iv) for all .

(v) , for all

For , we say that m is less than n, written as , if there exists such that .

After we have defined natural numbers, we are in a position to define what is called a * finite set*. A non-empty set is called a finite set if there is a natural number n such that there is a bijection

—- **Equation 2.1**

The empty set is taken to be finite set by convention. A set which is non-finite set is called an * infinite set*. This means that for a set A to be infinite, one has to show that we cannot construct a bijection f as in Equation 2.1 above. This may be incovenient to actually implement in practice. The following criterion, due to Dedekind, gives a more convenient way of deciding if a set is infinite or not.

**Theorem. **

A set is an infinite set if and only if it has a proper subset to which it is equivalent or equivalent.

(I am not presenting the formal proof here).

It is easily seen that **N **is equinumerous to . Indeed, the bijection defined below shows this:

, that is, so 1 is mapped to 2, 2 is mapped to 3, is mapped to 4, and so on, so forth.

The bijection is interestingly put as follows: There was a hotel with a room corresponding to each natural number. That is to say, there are rooms with numbers and so on. Once, when all the rooms were occupied by guests, a new customer arrived and wanted a room badly. How did the manager manage to accommodate the new customer without evicting any of the already existing guests from the hotel?

The manager knew mathematics. He simply requested the customer of room number 1 to move to room number 2, customer of room number 2 to move to room number 3 and so on. Now each customer has been accommodated without duplication where as room number 1 is vacant. He can now accommodate the new customer in that room. Thus, we have been able to show that **N **is equivalent or equinumerous to a proper subset of itself. Hence, it must be an infinite set. A set is said to be countably infinite or just, countable, if it is equivalent to **N.**

**Integers**

We have already seen that we can add and multiply two elements of **N. **We can also “subtract” an element of **N **from another provided the element from which we are subtracting is greater than or equal to the element we are subtracting. If , , then there is a unique number such that , and we write .

This operation is what is called *subtraction* as we had learnt in our elementary school. But, as we have seen, we can subtract a number only from larger numbers and not the other way round. This is the same situation as when I have Rs. 10000 in my bank account and I write a cheque for Rs. 9000 , the bank *honours* the cheque and pays the payee Rs. 9000 deducting it from my account leaving a balance of Rs. 1000. On the other hand, if I write a cheque for Rs. 15000, the bank will usually *dishonour* the cheque. But, sometimes, depending on my creditworthiness, the bank obliges me by allowing an overdraft, that is, the bank remembers that I owe the bank Rs. 5000 and yet allows me to maintain my account. This is sometimes called an account with a “negative” balance.

Let us assume that the banker decides to designate deposits in natural numbers and withdrawals in** bold face** **numbers**. While bringing the account up-to-date, if the withdrawals total less than deposits, then the balance is entered in natural numbers. If the withdrawals total more than deposits, then the excess of the withdrawals over the deposits (what is called the overdraft) is entered in the balance column in **bold face numbers**, meaning that the account holder, meaning that the account holder owes the amount entered in bold face, to the bank. When he deposits some amount next time, the balance is entered after deducting the overdraft from the deposit. Thus, the banker introduces a new set of numbers which he writes in **bold face**. Similarly, he writes 0 when the balance is nil. But, the rules of addition and subtraction are more general than those for the natural numbers. For example,

meaning that if one has a balance of Rs. 5/- and withdraws Rs. 4/- then the balance of Re. 1/- remains. Similarly, one writes

implying that if one withdraws Rs. 150/- out of a total deposit of Rs. 100/-, then one is left with an overdraft of Rs. 50/-, or

meaning that if one has an overdraft of Rs. 250/- and deposits Rs. 300/-, then his net balance is Rs. 50/-. Also,

and

meaning that if the balance is 180 and nothing is deposited nor withdrawn, then the balance is still Rs. 180 and if the entire balance (of Rs. 70) is withdrawn, then the balance becomes nil.

Thus, we observe that the banker, by augmenting the natural numbers with a new set of numbers which are written in bold face, is able to add and subtract at will without any restriction. The banker’s numbers now consist of the natural numbers and a set of new numbers which he writes in bold face. So his number system now is

It should be now be clear that the operations of subtraction which was earlier of restricted applicability can now be used in this new augmented number system by setting , where .

We may use the notation

where each bold face number is replaced by a number with a negative sign prefixed. Now our augmented number system is .

We denote this changed set of numbers by , (which is the first of the German word Zahlen for integers).

Clearly, and we would expect to be amenable to at least the operations we could perform on Let us take the operation of addition first. For

there is a unique number written such that

a) for all ,

b) for all

c) for all

d) for every there is a number such that .

One can show that this number is unique and we write . We have automatically

This leads to an even more interesting property for all .

Indeed, for every , there is a unique such that .

Again, by the same argument, there is such that , adding m to both sides, we get

But, by associativity, we have

This gives which is the same as

Next, consider multiplication. For all we should have a unique having the following properties:

1) for all

2) for all

Besides, where it involves addition and multiplication, the *distributive* rule:

3) for all should be satisfied.

We can now demonstrate:

i) for all

ii) for all

iii) for all

iv) for all

v) for all

Part (i) is clear because we have the relation . Multiplying by , we get

implying the required result.

ii)

Now, prove the rest and test your mettle for math!

The elements of are called **integers.**

More later,

Nalin Pithwa