In set theory, a regular cardinal is a cardinal number that is equal to its own cofinality. More explicitly, this means that κ {\displaystyle \kappa } is a regular cardinal if and only if every unbounded subset C ⊆ κ {\displaystyle C\subseteq \kappa } has cardinality κ {\displaystyle \kappa } . Infinite well-ordered cardinals that are not regular are called singular cardinals. Finite cardinal numbers are typically not called regular or singular. In the presence of the axiom of choice, any cardinal number can be well-ordered, and so the following are equivalent: κ {\displaystyle \kappa } is a regular cardinal. If κ = ∑ i ∈ I λ i {\displaystyle \kappa =\textstyle \sum _{i\in I}\lambda _{i}} and λ i < κ {\displaystyle \lambda _{i}<\kappa } for all i {\displaystyle i} , then | I | ≥ κ {\displaystyle |I|\geq \kappa } . If S = ⋃ i ∈ I S i {\displaystyle S=\textstyle \bigcup _{i\in I}S_{i}} , and if | I | < κ {\displaystyle |I|<\kappa } and | S i | < κ {\displaystyle |S_{i}|<\kappa } for all i {\displaystyle i} , then | S | < κ {\displaystyle |S|<\kappa } . That is, every union of fewer than κ {\displaystyle \kappa } sets smaller than κ {\displaystyle \kappa } is smaller than κ {\displaystyle \kappa } . The category Set < κ {\displaystyle \operatorname {Set} _{<\kappa }} of sets of cardinality less than κ {\displaystyle \kappa } and all functions between them is closed under colimits of cardinality less than κ {\displaystyle \kappa } . κ {\displaystyle \kappa } is a regular ordinal (see below). Crudely speaking, this means that a regular cardinal is one that cannot be broken down into a small number of smaller parts. The situation is slightly more complicated in contexts where the axiom of choice might fail, as in that case not all cardinals are necessarily the cardinalities of well-ordered sets. In that case, the above equivalence holds for well-orderable cardinals only. An infinite ordinal α {\displaystyle \alpha } is a regular ordinal if it is a limit ordinal that is not the limit of a set of smaller ordinals that as a set has order type less than α {\displaystyle \alpha } . A regular ordinal is always an initial ordinal, though some initial ordinals are not regular, e.g., ω ω {\displaystyle \omega _{\omega }} (see the example below).

History

Hub updates