Intuitive way to explain |Q| = aleph zero?

  • Context: Undergrad 
  • Thread starter Thread starter EnumaElish
  • Start date Start date
  • Tags Tags
    Explain Zero
Click For Summary

Discussion Overview

The discussion centers on intuitive explanations for the cardinality of the rational numbers and perfect squares, specifically addressing how both sets can be shown to have the same cardinality as the natural numbers (denoted as aleph zero). The scope includes conceptual reasoning and mathematical demonstrations.

Discussion Character

  • Exploratory
  • Technical explanation
  • Conceptual clarification
  • Debate/contested

Main Points Raised

  • Some participants seek intuitive, calculus-grade explanations for the cardinality of rationals and perfect squares.
  • One participant argues that standard proofs are intuitive, particularly for perfect squares, as there is a clear one-to-one correspondence between perfect squares and natural numbers via square roots.
  • A suggestion is made to refer to an external resource that discusses the countability of rational numbers.
  • Another participant provides a pictorial method to demonstrate the countability of positive rationals by listing them in a specific sequence and inserting negative rationals and zero, asserting this method is intuitive.
  • One participant mentions the diagonal method and its association with the countability of Q and the uncountability of R, suggesting that misunderstandings may arise from this terminology.
  • A bijection is proposed using prime decomposition to illustrate the countability of rational numbers, emphasizing the difference between finite products of countable sets and unions.
  • Another participant describes a cross-tabulation approach to visualize perfect squares and rational numbers, expressing initial uncertainty about counting the latter but gaining clarity through the discussion.

Areas of Agreement / Disagreement

Participants express varying degrees of agreement on the intuitiveness of standard proofs, with some finding them clear while others seek alternative explanations. Multiple approaches to demonstrating the countability of both sets are presented, indicating that no single consensus exists on the best method.

Contextual Notes

Some methods rely on specific assumptions about the nature of counting and bijections, and there may be limitations in the clarity of visual representations or the understanding of diagonal arguments. The discussion does not resolve these nuances.

EnumaElish
Science Advisor
Messages
2,346
Reaction score
124
What is an intuitive, calculus-grade way to explain that rationals have the same cardinality as N? (Same question for perfect squares.)
 
Physics news on Phys.org
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 in the section called "The countability of rational numbers".
 
Last edited by a moderator:
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 argument, 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!
 
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).
 
I thought both the "perfect squares" and the "rationals" demonstration can use the cross-tabulation square where row and column headings are the natural numbers. For the perfect squares, each cell holds the product "row # * column #"; all perfect squares are on the diagonal, which you can count linearly.

For the rationals, each cell is row #/column # (or the inverse), but I wasn't sure how to count them. Now I know. Thanks.
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 19 ·
Replies
19
Views
4K
  • · Replies 114 ·
4
Replies
114
Views
7K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 69 ·
3
Replies
69
Views
12K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 48 ·
2
Replies
48
Views
3K