Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

No subset of the real numbers is countable. True or false.

In looking at the wikipedia article for real numbers, I'm not really clear on the answer to this. They use the words computable and countable, and I'm not sure of the difference. Also, I dont think I fully understand the term countable. The definition states that a set is countable if it has the same cardinality as some subset of the natural numbers, but I'm not sure what that means.

share|cite|improve this question
Take a finite subset of $\mathbb{R}$ or consider $\mathbb{N} \subset \mathbb{R}$. – user17762 Nov 27 '10 at 17:56
up vote 4 down vote accepted

A set is said to be countable if there is bijection between a subset of natural numbers (or even integers) and that set.

Cantor's diagonalization argument shows that the set of reals is uncountable. So, there are uncountably many subsets of real numbers that are countable. For example the set consisting of any single real number.

Computability has nothing to do with counting the number of elements in a set. This is related to the idea of computable functions.

A real number is computable if there is finite algorithm that can yield it's digits to any desired level of accuracy.

share|cite|improve this answer
Cantor's diagonalisation argument shows that the reals are uncountable and it is certainly not suited to showing that anything is countable. One proves the countability of the rationals by explicitly establishing a bijection between $\mathbb{Q}$ and $\mathbb{N}$. – Alex B. Nov 27 '10 at 17:58
Sorry, my bad. i have edited that part. – Timothy Wagner Nov 27 '10 at 18:00
@Alex So the reals are uncountable, but there is a subset of the reals that is countable, correct? So for a set to be countable, does it have to be finite? Is the set of all natural numbers countable? – maq Nov 27 '10 at 18:01
@fprime From wikipedia: "A set S is called countable if there exists an injective function f from S to the natural numbers". The identity is an injective function from $\mathbb{N}$ to themselves, so yes, the natural numbers are countable. – Alex B. Nov 27 '10 at 18:05

It is false, because you can always pick a countable subset of your choice (e.g. {1, 2}). A set is countable if it can be put into one-to-one correspondence with the set of Natural numbers or some subset of Natural numbers. Since Natural numbers are contained in Real numbers, you can always pick a subset (like the one mentioned above) that would be countable.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.