Mathematics Atlas

How Proof Is Made
Theorems

Cantor's Theorem

KAN-tor
Also Known As Cantor's Power Set Theorem
Logic and Foundations

Citation Formats

General Reference

APA Style

BibTeX

Set Within Its Larger Power Set

Cantor's theorem is a fundamental result of set theory stating that for any set A, the power set of A, the set of all its subsets, has a strictly greater cardinality than A itself. More concisely, every set is smaller than its power set.

Facts
Statement
For any set, the collection of all of its subsets always has strictly more elements, in the cardinality sense, than the original set itself. 1
Proof Year
1891 1
Cross-Tradition Connections

Associated With

In Branch

Proved By

Sources
1. Cantor's Theorem (Wikipedia)
Wikimedia Foundationlead
Quote, lead
Every set is smaller than its power set
View the Source
1. Cantor's Theorem (Wikipedia)
Wikimedia Foundationopening sentence
Quote, opening sentence
for any set A, the set of all subsets of A, known as the power set of A, has a strictly greater cardinality than A itself
View the Source
1. Cantor's Theorem (Wikipedia)
Wikimedia Foundationproof and attribution section
Quote, proof and attribution section
the diagonal argument for the uncountability of the reals also first appears
View the Source
Wikipedia: Cantor's Diagonal Argument
Wikimedia FoundationAssociated With: Cantor's Diagonal Argument, Cantor's theorem section
Quote, Associated With: Cantor's Diagonal Argument, Cantor's theorem section
A generalized form of the diagonal argument was used by Cantor to prove Cantor's theorem: for every set S, the power set of S, that is, the set of all subsets of S, cannot be in bijection with S itself.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0 open reader challenges)
No disputes yet. Spotted an error or a better source? Open the first one.

View At A Past Year

The atlas records no dated fact of its own for this entry, so there is no other year to choose.