# Intuitive way to explain |Q| = aleph zero?

Homework Helper

## Main Question or Discussion Point

What is an intuitive, calculus-grade way to explain that rationals have the same cardinality as N? (Same question for perfect squares.)

Related Set Theory, Logic, Probability, Statistics News on Phys.org
LeonhardEuler
Gold Member
I'm not trying to be difficult, but aren't the standard proofs pretty inuitive? Especially for the perfect squares. To every element of the set of perfect squares you can correspond exactly on element of the set of naturals: its square root. The same goes for the other way around. So you have a one to one correspondance between the squares and naturals, so they have the same cardinality. The proof is nearly identical for the rationals, except that the bijection is somewhat more complicated

Look at http://home.att.net/~numericana/answer/sets.htm [Broken] in the section called "The countability of rational numbers".

Last edited by a moderator:
cristo
Staff Emeritus
Heres a pictorial way to show it for the rationals. Start with the positive rationals and start listing them like so
1/1 1/2 1/3 1/4 1/5......
2/1 2/2 2/3 2/4 2/5 .......
3/1 3/2 3/3 3/4 3/5 ....

Now, to count, follow this sequence: 1/2, 1/2, 2/1, 3/1, 2/2, 1/3, 1/4, 2/3,.... (I hope you can see what I'm doing). Now, it should be clear that this list is countable. Now, insert the negative rationals just before their positive counterparts, i.e. -1/1, 1/1, -1/2,..., and just put zero at the top left. Now, using the same arguement, the full set of Q is countable.

I'm not sure whether this was something like what you were after, but it seems quite intuitive!

matt grime
Homework Helper
Ah, diagonal method - possibly because a proof that Q is countable is called diagonal, and that R isn't yet has the same adjective, people have wrong impressions.

One way is a standard method using prime decomposition.

Send a/b to 2^a*3^b (for a and b >0) or 2^a*3^b*5 for negative rationals. This is a bijection from Q onto a subset of N. This proof shows that any finite product of countable sets is countable, and shows an important difference between union and product (in the categorical sense, perhaps).