Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Cantor's diagonal argument can be used to show that a set $S$ is always smaller than its power set $\wp(S)$. The proof works by showing that no function $f : S \rightarrow \wp(S)$ can be surjective by constructing the explicit set $D = \{ x \in S | x \notin f(s) \}$ from a function $f$ and showing that no element of $S$ maps to $D$.

This proof works because all bijections are surjections, so if no surjection from $S$ to $\wp(S)$ exists, then there cannot be a bijection between $S$ and $\wp(S)$.

My question is whether it is possible to run a "reverse diagonalization" that works by instead showing that there is no injection from $\wp(S)$ to $S$. I am curious about this because I have never seen Cantor's theorem proved this way (or, more generally, any diagonal argument structured like this).

Is it possible to take Cantor's diagonal argument and "reverse" it to show that there cannot be an injection from $\wp(S)$ to $S$, rather than showing that there can be no surjection from $S$ to $\wp(S)$?


share|cite|improve this question
I suppose you don't want to use the following argument: If $f : \mathcal{P} ( S ) \to S$ is injective then, $f^{-1} : \mathrm{im} ( f ) \to \mathcal{P} (S)$ is surjective and you can then apply Cantor's argument to this function. – arjafi Jan 23 '13 at 6:06
@ArthurFischer- I was hoping to avoid something like that if possible. I'm aware that this argument absolutely works, but I was curious if there was a fundamentally different line of reasoning we could use here. – templatetypedef Jan 23 '13 at 6:16
up vote 11 down vote accepted

Suppose $f : \mathcal{P}(S) \to S$ were an injection. Consider the following recursive construction:

  • $s_0 = f(\emptyset)$
  • $s_\alpha = f(\{s_\beta\}_{\beta < \alpha})$

Because $f$ is injective, all the $s_\alpha$ are distinct. But this can't be otherwise we have an injection $\mathrm{Ord} \to S$, where $S$ is a set.

EDIT: Or, if we want to be frugal and not mention injections from $\mathrm{Ord}$, we can say that the fact that the $s_\alpha$ are all distinct contradicts Hartog's Lemma.

share|cite|improve this answer
That's a beautiful construction, thanks! Could you eliminate the explicit dependence on $Ord$ by just picking an arbitrary ordinal larger than $|S|$, or would that be circular reasoning? – templatetypedef Jan 23 '13 at 7:02
This holds without choice, so it may not make sense to talk about "an ordinal larger than $|S|$". Of course the reference to $\mathrm{Ord}$ is overkill, this is just the way I like to think about things instead of thinking about Hartog's Lemma. – Amit Kumar Gupta Jan 23 '13 at 7:06
To supplement Amit's answer: This proof is due to Zermelo, and it has the additional advantage of not being a diagonal argument, and explicitly producing a pair of sets witnessing the failure of injectivity. One can also give a diagonal argument, but then (surprisingly?), it is in general not possible to exhibit the witnesses, even though we know they exist. See… for the reverse diagonal argument, and for the definability issue. – Andrés E. Caicedo Jan 23 '13 at 22:00
(Oh, and Zermelo argues explicitly in terms of well-orderings of subsets of $S$ rather than ordinals, so the issue mentioned on the first two comments is not essential -- and the proof is formalizable in Zermelo's set theory $\mathsf Z$, without needing replacement.) – Andrés E. Caicedo Jan 23 '13 at 22:54

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.