### Overview on Mediation

Jul 17,2020

Infinity is not a number, and trying to treat it as one tends to be a pretty bad idea. At best you're likely to come away with a headache, at worst with the firm belief that 1 = 0.

Ã‚Â

You may have met various ''paradoxes'' that play on this fact (and our instinct to ignore it) before. An infinitely long line, for instance, is surely infinitely many centimetres long. It's also, equally surely, infinitely many miles long. But each centimetre is a great deal shorter than each mile, so does this mean an infinitely long line is two different lengths at once?

Ã‚Â

The answer, of course, is to assert confidently that the question is meaningless (and, if you're in the mood to be unkind, just shows how little the asker knows aboutÃ‚Â properÃ‚Â mathematics) and then go back about your business untroubled by such silly quibbles.

Ã‚Â

Or, as I will hopefully convince you over the course of this article, the answer is a simple ''No.''

Ã‚Â

Counting the natural numbers

Ã‚Â

We shouldn't treat infinity as a number. We can't count up to it, and if we have an infinitely large set we will never be able to count all of the objects in it. A set is a collection of objects. They can be any sort of objects, although generally mathematicians use them to talk about mathematical objects, such as numbers. An infinitely large set is, of course, one containing infinitely many objects. It seems strange, therefore, to talk about certain infinitely large sets being ''countably infinite'', but that is indeed what I'm about to do.

Ã‚Â

Consider the natural numbers (the positive, whole numbers: 1, 2, 3, ...).

Ã‚Â

There are infinitely many natural numbers (if there were only a finite number of them, there would have to be a largest natural number - what would happen if we added 1 to that number?) so the set containing all the natural numbers must be infinitely large. We'll never be able to count them all. However, weÃ‚Â canÃ‚Â list them in such a way that if we counted forever, we'd be sure not to miss any out.

Ã‚Â

The natural numbers are what we use for counting anyway, so we can think of them as coming ready-listed. There is an obvious starting point (1) and a sensible order (1, 2, 3, ...).

Ã‚Â

To illustrate what I mean by a sensible order, imagine what would happen if we tried to count the natural numbers randomly. However long we counted, we'd never be sure we'd counted them all - we could check for individual numbers in our random list, but we'd never know if they were all there, or when (if ever) we were going to reach a particular one.

Ã‚Â

Now imagine what would happen if we tried to count the natural numbers by counting the odd numbers first and then the even ones. We'd count forever, and never start counting the even numbers.

Ã‚Â

However, if we count them in the order given, we'll know once we've reached 100 that we've counted everything between 1 and 100 once and only once. We might never reach the end (in a finite time, at least) but we'll know we've not missed anything on the way and that it's just a matter of time before we reach any given number.

Ã‚Â

That is, the only thing stopping us from counting them all is that we'll run out of breath before we run out of numbers. The proposed method of counting them all is sound, just impractical. This is what we mean by saying the natural numbers are countably infinite.

Ã‚Â

In much the same way,Ã‚Â anyÃ‚Â infinite set of numbers that can be put in a sensible, systematic order with a clear beginning such that we're sure to get everything if we count forever is thought of as countable.

Ã‚Â

Counting other sets

Ã‚Â

When we talk about comparing the sizes of two sets that contain finite numbers of objects (a set,Ã‚Â C, containing some cats and a set,Ã‚Â M, containing some baby mice, say) then one way to do so is to match each object in one set with exactly one object in another set and see if we have any left over. For the setsÃ‚Â CÃ‚Â andÃ‚Â M, we can instruct each cat to catch exactly one baby mouse - no sharing allowed, nor hogging more than one mouse, nor letting one escape if the cat doesn't already have another one.

Ã‚Â

If each cat does catch exactly one baby mouse - no more, no fewer - we know there are (or, at least, were) the same number of cats as mice. That is, the setsÃ‚Â CÃ‚Â andÃ‚Â MÃ‚Â were the same size. If any cats go hungry, there were more cats than mice (CÃ‚Â was larger thanÃ‚Â M) and if any mice go free, there were more baby mice than cats (MÃ‚Â was larger thanÃ‚Â C).

Ã‚Â

This is called putting the objects into one-to-one correspondence, and the same can be done when comparing the sizes of infinite sets.

Ã‚Â

Another way of thinking about countably infinite sets is that they are those sets whose objects can be put in a one-to-one correspondence with the set containing the natural numbers only. That is, if for each element in the set of the natural numbers there isÃ‚Â exactly oneÃ‚Â - no more, no fewer - element in the set we're trying to count, then the set is the same size as the set containing the natural numbers: countably infinite.

Ã‚Â

Putting the elements of an infinite set in sensible, systematic order with a clear beginning such that it's just a matter of time before we reach any particular element is, in fact, the same thing as putting those elements in one-to-one correspondence with the natural numbers.

Ã‚Â

If the natural numbers are the cats from the above illustration and the elements to be counted are the baby mice, then the cats already have an order to line up in. Lining the mice up next to them so none escape and none are eaten together (putting them in a sensible order) is the same as allotting the cats their dinner (putting the elements of the two sets into one-to-one correspondence).

Ã‚Â

Are the integers (all the whole numbers: ..., -2, -1, 0, 1, 2, 3, ...), therefore, countable?

Ã‚Â

At first, you might think not. First we need to find a sensible beginning, and that may not be obvious. With the natural numbers, we just started at the smallest and worked up. But the integers don't have a smallest number (just as before, when showing there was no largest natural number, think to yourself: if there were a smallest integer, what would happen when we subtracted 1 from it?), so where can we begin?

Ã‚Â

Say we start at 1 and work up, as before with the natural numbers. Then we count 1, 2, 3, ..., putting them into one-to-one correspondence as follows:

Ã‚Â

Natural numbers | 1 | 2 | 3 | ... |

Integers | 1 | 2 | 3 | ... |

Here, the problem is however long we count for, we'll never start on the negative numbers. We'll never even get to zero.

Ã‚Â

It is possible to do. Before reading on, try to think how. It may help to remember the problem we would have had counting the natural numbers if we had tried to count all the odd ones first.

Ã‚Â

How to count the integers

Ã‚Â

Consider the following table:

Ã‚Â

Natural numbers | 1 | 2 | 3 | 4 | 5 | 6 | 7 | ... |

Integers | 0 | -1 | 1 | -2 | 2 | -3 | 3 | ... |

Ã‚Â

Will each integer be listed once and only once?

Ã‚Â

It may help (or it may not - don't dwell on this if it just confuses you) to visualise the integers as distinct points on an infinitely long line. Think of 0 as the centre of the line, and imagine a circle, centre 0, which increases in diameter as we count up, covering the numbers we've counted. After we've counted to the seventh integer on the list, say, the circle has a diameter of 6, and covers every number from -3 to 3.

Ã‚Â

In other words, yes.

Ã‚Â

Once we reach any integer on the list (p, say), any integer with the absolute value (that is,Ã‚Â +nÃ‚Â ifÃ‚Â nÃ‚Â is positive andÃ‚Â Ã¢Ë†â€™nÃ‚Â ifÃ‚Â nÃ‚Â is negative) smaller than the absolute value ofÃ‚Â pÃ‚Â will have been counted exactly once, and any number with a modulus larger than it will be yet to count. WhetherÃ‚Â Ã¢Ë†â€™pÃ‚Â has been counted obviously depends on whetherÃ‚Â pÃ‚Â is greater or less than 0.

Ã‚Â

So, while at first glance it might seem that there are more integers than natural numbers, this is not the case.

Ã‚Â

This is exactly what happens in the so-called paradox I mentioned at the start of this article. You might at first think that for each natural number,Ã‚Â n, there are two integers,Ã‚Â Ã‚Â±nÃ‚Â and so there are twice as many integers as naturals, which is not the case. In the same way, you might think an infinite number of miles takes you further than an infinite number of centimetres. In fact, the centimetres that go to make up the infinitely many miles can be put into one-to-one correspondence with the centimetres that go to make up the infinitely many centimeteres, so both take you the same distance.

Ã‚Â

Counting the rationals

Ã‚Â

How about the rational numbers? (all the numbers that can be written as one integer divided by another: ..., -2/3, 0/1, 1/1, 1/2, ...)

Ã‚Â

In the case of the natural numbers and the integers, it was easy to check we'd counted every number in a given range. To check we'd counted all the natural numbers less thanÃ‚Â n, we merely needed to have counted up toÃ‚Â n. To check we'd counted all the integers betweenÃ‚Â nÃ‚Â andÃ‚Â m, we needed to check we'd counted as far as the absolute value ofÃ‚Â nÃ‚Â orÃ‚Â m, whichever is the largest.

Ã‚Â

However, we can't count all the rational numbers in a given range, however small the range is.

Ã‚Â

This is because between any two rationals, there is another rational. (If you're unconvinced, imagineÃ‚Â xandÃ‚Â yÃ‚Â are two rationals between which thereÃ‚Â isn'tÃ‚Â another rational. How canÃ‚Â (x+y)/2Ã‚Â not be rational?) Between -2 and 4 there are seven integers (including -2 and 4) and four natural numbers. There are, however, infinitely many rationals.

Ã‚Â

How, then, could we possibly count them? We can never get anything in a given range, and there are infinitely many (non-overlapping) ranges we could be given. In fact, if there are infinitely many naturals (which there are) and infinitely many integers (which, again, there are) then surely there must be infinity-squared many rationals, because to get all the rationals you take each integer in turn and divide it by each natural number in turn, as in the following table:

Ã‚Â

11 | 12 | 13 | 14 | 15 | 16 | ... |

21 | 22 | 23 | 24 | 25 | ... | Ã‚Â |

31 | 32 | 33 | 34 | ... | Ã‚Â | Ã‚Â |

41 | 42 | 43 | ... | Ã‚Â | Ã‚Â | Ã‚Â |

51 | 51 | ... | Ã‚Â | Ã‚Â | Ã‚Â | Ã‚Â |

61 | ... | Ã‚Â | Ã‚Â | Ã‚Â | Ã‚Â | Ã‚Â |

... | Ã‚Â | Ã‚Â | Ã‚Â | Ã‚Â | Ã‚Â | Ã‚Â |

Ã‚Â

How can infinity-squared possibly be countable, and therefore the same as infinity?

Ã‚Â

The first thing to do is to take a deep breath and remember thatÃ‚Â infinity is not a numberÃ‚Â . In fact, the rationals are countable. To prove this, consider the a

The graph shows how relevant this story is on social networks real-time.

User Type: |
Tutor Verified |

Name: |
Daniel |

Uploaded Date: |
Apr 12,2014 |

I am an undergraduate student studying at the London School of Economics (LSE) and I am an experienced tutor for Geography, Mathematics and Chemistry at A level and lower. I tutor students aged 12-18 and I have successfully improved or maintained the grades of all my students and I have.... Read More