Bourbaki

Theorem 2 (Cantor)

Tag 03R8, permanent. Cite it as [Bourbaki, Tag 03R8].

Theory of Sets, chapter III, § 3. Equipotent sets. Cardinals

— For each cardinal a\mathfrak{a}, we have 2a>a2^\mathfrak{a} > \mathfrak{a}.

We have Card(P(a))=2a\mathrm{Card}(\mathfrak{P}(\mathfrak{a})) = 2^\mathfrak{a} (no. 5, Proposition 12). The mapping x→{x}x \to \{x\} (x∈a)(x \in \mathfrak{a}) is an injection of a\mathfrak{a} into P(a)\mathfrak{P}(\mathfrak{a}), whence a⩽2a\mathfrak{a} \leqslant 2^\mathfrak{a}. Hence it is enough to show that a≠2a\mathfrak{a} \neq 2^\mathfrak{a}, i.e., that for every mapping ff of a\mathfrak{a} into P(a)\mathfrak{P}(\mathfrak{a}), the image f(a)f(\mathfrak{a}) is distinct from P(a)\mathfrak{P}(\mathfrak{a}). Let X be the set of all x∈ax \in \mathfrak{a} such that x∉f(x)x \notin f(x). If x∈Xx \in X, we have x∉f(x)x \notin f(x), whence f(x)≠Xf(x) \neq X; if x∈a−Xx \in \mathfrak{a} - X, we have x∈f(x)x \in f(x) and x∉Xx \notin X, whence f(x)=Xf(x) = X. This shows that X∉f(a)X \notin f(\mathfrak{a}) and proves the theorem.

Bourbaki sets the proof directly after the statement, and the corpus does not separate them, so what is above is the statement and its proof together.

Cited by

Cites

Transcribed from the printed edition, 2004, Springer. Not translated.