Cantors diagonals Listable vs. countable

  • Context: Graduate 
  • Thread starter Thread starter jVincent
  • Start date Start date
Click For Summary
SUMMARY

The discussion centers on Cantor's diagonal argument and its implications for the concepts of listability and countability. Participants clarify that a set is countable if it can be put into a one-to-one correspondence with natural numbers, while Cantor's diagonal method demonstrates that the natural numbers themselves cannot be fully listed. The key takeaway is that a proper list requires a first and a next member, but not a last member, highlighting the finite nature of natural numbers despite their infinite quantity.

PREREQUISITES
  • Understanding of Cantor's diagonal argument
  • Familiarity with the concepts of countable and uncountable sets
  • Knowledge of natural numbers and their properties
  • Basic principles of mathematical proofs and rigor
NEXT STEPS
  • Study the implications of Cantor's diagonal argument on set theory
  • Explore the definitions and examples of countable vs. uncountable sets
  • Learn about the concept of infinite sequences in mathematics
  • Investigate the role of rigor in mathematical proofs and how it applies to set theory
USEFUL FOR

Mathematicians, students of set theory, educators teaching mathematical concepts, and anyone interested in the foundations of mathematics and the nature of infinity.

jVincent
Messages
20
Reaction score
0
So I'm familier with cantos diagonals, but fail to see how something being unlistable makes it uncountable. Now a set being countable is to say it has a one to one corrospondance to the natural numbers, but using the diagonal method one can prove that the natural numbers are themselves unlistable.

Given any table of all the natural numbers, one can construct a number not in the table, simply by chosing something other then the n'th character in each number given, (ofcause chosing anything when no character apears).

Can someone clearify this for me? So far my conclusion is that either my textbooks are not being rigid enough in their proofs or the only thing cantors diagonal proof really proves is that it's absurd to talk about a complete list of even a countable set.
 
Physics news on Phys.org
jVincent said:
So I'm familier with cantos diagonals, but fail to see how something being unlistable makes it uncountable. Now a set being countable is to say it has a one to one corrospondance to the natural numbers, but using the diagonal method one can prove that the natural numbers are themselves unlistable.

Given any table of all the natural numbers, one can construct a number not in the table, simply by chosing something other then the n'th character in each number given, (ofcause chosing anything when no character apears).

Can someone clearify this for me? So far my conclusion is that either my textbooks are not being rigid enough in their proofs or the only thing cantors diagonal proof really proves is that it's absurd to talk about a complete list of even a countable set.
A "list" means to have a "first", a "second" etc. A list is precisely a one-to-one correspondence with the natural numbers.

I can't speak to whether your textbooks are not being rigid (did you mean "rigorous"?) enough but your "proof" that the natural numbers are unlistable doesn't work.
"Choosing something other than the nth character in each number given" will, since there are an infinite number of natural numbers, result in a resulting infinite sequence of digits. That is NOT "a number not in the table" because it is NOT a natural number. All natural numbers have a finite number of digits.
 
What do you think a list is?
 
Well as they refere to a list in my textbook, they refere to "imaginary" listings like on a blackboard, and while this implies a ordering, it also requires both a first element and a last element, which the natural numbers have not.

But thank you HallsofIvy for the answer, I understand now that the key point isn't the existence of a diagonal, but that the natural numbers are finite sequences, even though there are infinite many such sequences.
 
A list must always have a "first member" and there must always be a "next" member. But there does not have to be a "last" member.
 

Similar threads

  • · Replies 18 ·
Replies
18
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 55 ·
2
Replies
55
Views
8K
  • · Replies 21 ·
Replies
21
Views
3K
Replies
4
Views
2K
  • · Replies 43 ·
2
Replies
43
Views
6K
  • · Replies 22 ·
Replies
22
Views
4K
  • · Replies 86 ·
3
Replies
86
Views
9K
Replies
2
Views
3K