Largest remainder method

In the theory of cardinal numbers, we can define a successor operation similar to that in the ordinal numbers. This coincides with the ordinal successor operation for finite cardinals, but in the infinite case they diverge because every infinite ordinal and its successor have the same cardinality (a bijection can be set up between the two by simply sending the last element of the successor to 0, 0 to 1, etc., and fixing ω and all the elements above; in the style of Hilbert's Hotel Infinity). Using the von Neumann cardinal assignment and the axiom of choice (AC), this successor operation is easy to define: for a cardinal number κ we have

${\kappa }^{+}=|\inf \{\lambda \in ON|\kappa <|\lambda |\}|$ ,

where ON is the class of ordinals. That is, the successor cardinal is the cardinality of the least ordinal into which a set of the given cardinality can be mapped one-to-one, but which cannot be mapped one-to-one back into that set.

That the set above is nonempty follows from Hartogs' theorem, which says that for any well-orderable cardinal, a larger such cardinal is constructible. The minimum actually exists because the ordinals are well-ordered. It is therefore immediate that there is no cardinal number in between κ and κ⁺. A successor cardinal is a cardinal which is κ⁺ for some cardinal κ. In the infinite case, the successor operation skips over many ordinal numbers; in fact, every infinite cardinal is a limit ordinal. Therefore, the successor operation on cardinals gains a lot of power in the infinite case (relative the ordinal successorship operation), and consequently the cardinal numbers are a very "sparse" subclass of the ordinals. We define the sequence of alephs (via the axiom of replacement) via this operation, through all the ordinal numbers as follows:

${\mathrm{\aleph }}_0=\omega$

${\mathrm{\aleph }}_{\alpha +1}={\mathrm{\aleph }}_{\alpha }^{+}$

and for λ an infinite limit ordinal,

${\mathrm{\aleph }}_{\lambda }=\bigcup _{\beta <\lambda }{\mathrm{\aleph }}_{\beta }$

If β is a successor ordinal, then ${\mathrm{\aleph }}_{\beta }$ is a successor cardinal. Cardinals which are not successor cardinals are called limit cardinals; and by the above definition, if λ is a limit ordinal, then ${\mathrm{\aleph }}_{\lambda }$ is a limit cardinal.

The standard definition above is restricted to the case when the cardinal can be well-ordered, i.e. is finite or an aleph. Without the axiom of choice, there are cardinals which cannot be well-ordered. Some mathematicians have defined the successor of such a cardinal as the cardinality of the least ordinal which cannot be mapped one-to-one into a set of the given cardinality. That is:

${\kappa }^{+}=|\inf \{\lambda \in ON\left|\right|\lambda |\nleqq \kappa \}|$ .

See also

• Cardinal assignment

References

• Paul Halmos, Naive set theory. Princeton, NJ: D. Van Nostrand Company, 1960. Reprinted by Springer-Verlag, New York, 1974. ISBN 0-387-90092-6 (Springer-Verlag edition).
• Jech, Thomas, 2003. Set Theory: The Third Millennium Edition, Revised and Expanded. Springer. ISBN 3-540-44085-2.
• Kunen, Kenneth, 1980. Set Theory: An Introduction to Independence Proofs. Elsevier. ISBN 0-444-86839-9.