Math 2.0

Mathematical logic and foundations Concept

Cantor's diagonal argument

Builds on Uncountable setCountable set

Summary

Cantor's diagonal argument shows that some infinite sets are uncountable. Given a list s0,s1,s2,…s_0, s_1, s_2, \dots of infinite sequences of 00 and 11, define a sequence tt by t(n)=1−sn(n)t(n) = 1 - s_n(n). Then tt differs from each sns_n at position nn, so tt is not in the list. So the set of all such sequences is not countable.

Remarks

Georg Cantor published the argument in 1891. His first proof that ℝ\mathbb{R} is uncountable, from 1874, used another method. The same idea proves Cantor's theorem for every set. Diagonal arguments also appear in the proofs of the halting problem and of Gödel's incompleteness theorems.

Reading path

To understand this page from the ground up, read these 17 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Element definition
  2. Proposition concept
  3. Set definition
  4. Implication definition
  5. Predicate definition
  6. Ordered pair definition
  7. Existential quantifier definition
  8. Universal quantifier definition
  9. Cartesian product definition
  10. Subset definition
  11. Uniqueness quantifier definition
  12. Binary relation definition
  13. Function definition
  14. Injective function definition
  15. Countable set definition
  16. Uncountable set definition
  17. Cantor's diagonal argument concept

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Cantor's_diagonal_argument, lead section
About this page
Tag0XCH8QVDCQ
URIm2://0XCH8QVDCQ
Aliasesdiagonal-argument, diagonalization
Kindconcept
WritingW1 stated
MSC03E10
Part ofProof methods
UsesUncountable set, Countable set
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge defines in: at least one definition (0 of 1)
  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by