PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Very high Entry average rating: Very high
[parent] proof of Cantor's theorem (Proof)

The proof of this theorem is fairly simple using the following construction, which is central to Cantor's diagonal argument.

Consider a function $F\colon X\to \P(X)$ from a set $X$ to its power set. Then we define the set $Z\sse X$ as follows: $$ Z = \{x\in X \mid x\not\in F(x)\ $$

Suppose that $F$ is a bijection. Then there must exist an $x\in X$ such that $F(x)=Z$ . Then we have the following contradiction: $$ x\in Z \equiv x\not\in F(x) \equiv x\not\in $$

Hence, $F$ cannot be a bijection between $X$ and $\P(X)$ .




"proof of Cantor's theorem" is owned by Wkbj79. [ full author list (2) | owner history (1) ]
(view preamble | get metadata)

View style:

Keywords:  diagonal argument

This object's parent.
Log in to rate this entry.
(view current ratings)

Cross-references: contradiction, bijection, power set, function, Cantor's diagonal argument, theorem, proof
There are 3 references to this entry.

This is version 4 of proof of Cantor's theorem, born on 2002-06-05, modified 2007-08-08.
Object id is 3053, canonical name is ProofOfCantorsTheorem.
Accessed 14925 times total.

Classification:
AMS MSC03E17 (Mathematical logic and foundations :: Set theory :: Cardinal characteristics of the continuum)
 03E10 (Mathematical logic and foundations :: Set theory :: Ordinal and cardinal numbers)

Pending Errata and Addenda
None.
[ View all 1 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add example | add (any)