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 of infinite sequences of and , define a sequence by . Then differs from each at position , so 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 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
- no evidence level
- Element definition
- Proposition concept
- Set definition
- Implication definition
- Predicate definition
- Ordered pair definition
- Existential quantifier definition
- Universal quantifier definition
- Cartesian product definition
- Subset definition
- Uniqueness quantifier definition
- Binary relation definition
- Function definition
- Injective function definition
- Countable set definition
- Uncountable set definition
- Cantor's diagonal argument concept
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | 0XCH8QVDCQ |
|---|---|
| URI | m2://0XCH8QVDCQ |
| Aliases | diagonal-argument, diagonalization |
| Kind | concept |
| Writing | W1 stated |
| MSC | 03E10 |
| Part of | Proof methods |
| Uses | Uncountable 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.