Proving the uncountability of $[a,b]$ and $(a,b)$

Question

I am trying to prove that $[a,b]$ and $(a,b)$ are uncountable for $a,b\in \mathbb{R}$. I looked up Rudin and I am not too inclined to read the chapter on topology, for his proof involves perfect sets. Can anyone please point me to a proof of the above facts without point-set topology?

I am thinking along these lines:

$\mathbb{R}$ is uncountable.If we can show that there exists a bijection between $(a,b)$ ad $\mathbb{R}$ we can prove $(a,b)$ is uncountable.But I am not sure how to construct such a bijection.

Answer 1

Yes, you need only find a bijection from each interval to the Reals to prove the intervals are uncountable.

There are many bijections from an open interval $(a, b)\to \mathbb{R}$, e.g.

$g(x) = \cot\left(\large\frac{\pi}{2}x\right)$ is a bijection $g: (0, 1)\to \mathbb{R} $.

Now, we need to find a bijection from the closed interval $[a, b]\to \mathbb{R}$, and we can do this by first showing that there exists a bijection from the closed interval $[a, b]$ to the open interval $(a, b)$.

Taking the interval: $[0,1]$. Define $f(x)$ as following: $$f(x) = \left\{ \begin{array}{1 1} \frac{1}{2} & \mbox{if } x = 0\\ \frac{1}{2^{n+2}} & \mbox{if } x = \frac{1}{2^n}\\ x & \mbox{otherwise} \end{array} \right.$$

Then $f: [0, 1] \to (0, 1)$ is a bijection.

Now, compose: $g\circ f = g(f(x)): [1, 0] \to \mathbb{R}$, and you have your bijection.

Answer 2

I would consider using Cantor's diagonalization argument. It is a pretty efficient proof and not too difficult to understand.

Answer 3

If you're willing to accept that $\Bbb{R}$ is uncountable, finding a bijection between $(a, b)$ and $\Bbb{R}$ is actually overkill. It suffices to note that $\Bbb{R}$ may be written as the union of countably many intervals of length $b-a$, and countable unions of countable sets are countable.

Answer 4

If (a, b) is countable, then we have a bijection between Q and (a, b). Q bijects with any infinite set of rational numbers (c, d). Thus, we can encode all points of (a, b) by a countably infinite list of all rational numbers as follows:

1-x.kfj...

2-y.fli...

3-i.opq... . . .

Find the first non-zero digit of "a" in its infinite decimal expansion. Put 0s down on paper until you reach this digit position. Then choose the numeral from the next digit position from rational number 1 and use it basically as follows... if we have a=.00700... and the first rational number on our list is 1.234000..., then we choose 0, since 7 comes in the third position after the decimal point, and 0 lies in the fourth position. So, our number so far is .0000. Then choose the numeral in the next digit position from rational number 2, suppose it's .00005454... Then we have .00005, and so on. We end up with a number greater than "a", yet less than "b", nowhere on our list of rational numbers. Thus, there exists no bijection from Q to (a, b), and thus (a, b) is uncountable. Since (a, b) is uncountable, [a, b] is uncountable also.

Answer 5

$$\tan \left( \frac{\pi}{(b-a)} (x-\frac{a+b}{2})\right)$$

Basically $f(x)=\frac{\pi}{(b-a)} (x-\frac{a+b}{2})$ is the linear function such that $f(a)=-\frac{\pi}{2}$ and $f(b)=\frac{\pi}{2}$.

Answer 6

We could do this conventionally by using Cantor's diagonal slash argument. This is almost certainly the best way for those new to (un)countability to understand why it's true. But once you have a little more familiarity with the subject matter, I think that the following proof is both unusual and entertaining.

Let's prove this by playing a game! Actually, let's let Bob and Alice play a game, using the interval $[a,b]$. (although it works equally well if they play with $(a,b)$

Suppose we have the interval $[a,b]$ and a set $S$. In the game, Alice begins, and she chooses some $a_1 \in(a,b)$ to act as a new lower bound and tells Bob what it is. Bob then chooses some $b_1 \in (a_1,b)$ to act as a new upper bound and tells Alice. Alice then picks $a_2 \in (a_1,b_1)$, and they carry on taking turns in this manner, producing smaller and smaller intervals.

Now, $a_n$ is an increasing, bounded sequence in $\mathbb{R}$ so we know it converges, say to $a' \in (a,b)$.We say that Alice wins the game if $a'\in S$ and Bob wins otherwise. A question arises, given a set $S$, is it possibly for Alice or Bob to find a winning strategy so that they always win?

Suppose $S$ is countable. Then we can enumerate $S = \{s_1,s_2,s_3,...\}$. In this case, Bob can always win (I'll let you think about why he can always find a winning strategy! It's a little tricky but should be do-able with a little familliartiy with countability).

But what if $S = [a,b]$? Well then clearly Alice wins, because $a' \in(a,b) \subset [a,b]$.

So $[a,b]$ cannot be countable!