Mathematical logic and foundations Ordinals and cardinals Theorem
Cantor's theorem
Builds on Power setSurjective functionCardinality
Statement
Let be a set and let be a function to the power set of . Then is not surjective. So .
Remarks
Proof: let . If for some , then if and only if , a contradiction. The map is an injection, so , and the inequality is strict. It follows that there is no largest cardinal. The proof is a form of the diagonal argument, and it is close to Russell's paradox.
Reading path
To understand this page from the ground up, read these 21 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
- Power set definition
- Function definition
- Codomain definition
- Injective function definition
- Surjective function definition
- Bijective function definition
- Equinumerous sets definition
- Cardinality definition
- Cantor's theorem statement
Where this leads
2 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Cantor's_theorem, lead section
About this page
| Tag | 0WTEMGYV2C |
|---|---|
| URI | m2://0WTEMGYV2C |
| Kind | statement, theorem |
| Writing | W1 stated |
| MSC | 03E10 |
| Status | This copy of the site has no build data. Run m2 status 0WTEMGYV2C. |
| Uses | Power set, Surjective function, Cardinality |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge about out: the concepts that the statement is about (0 of 1)
- edge proves in: at least one proof node (0 of 1)
- edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
- explanation L2 (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.