Regular cardinal

Uses your system voice; voice and rate in settings.

Snapshot

≈ 4 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In set theory, a regular cardinal is a cardinal number that is equal to its own cofinality. More explicitly, this means that \kappa is a regular cardinal if and only if every unbounded subset C \subseteq \kappa has cardinality \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: # \kappa is a regular cardinal. # If \kappa = \textstyle\sum_{i \in I} \lambda_i and \lambda_i for all i , then |I| \ge \kappa . # If S = \textstyle\bigcup_{i \in I} S_i , and if |I| and |S_i| for all i , then |S| . That is, every union of fewer than \kappa sets smaller than \kappa is smaller than \kappa . # The category \operatorname{Set}_{ of sets of cardinality less than \kappa and all functions between them is closed under colimits of cardinality less than \kappa . # \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 set theory, a regular cardinal is a cardinal number that is equal to its own cofinality. More explicitly, this means that \kappa is a regular cardinal if and only if every unbounded subset C \subseteq \kappa has cardinality \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: \kappa is a regular cardinal. If \kappa = \textstyle\sum_{i \in I} \lambda_i and \lambda_i for all i , then |I| \ge \kappa . If S = \textstyle\bigcup_{i \in I} S_i , and if |I| and |S_i| for all i , then |S| . That is, every union of fewer than \kappa sets smaller than \kappa is smaller than \kappa . The category \operatorname{Set}_{ of sets of cardinality less than \kappa and all functions between them is closed under colimits of cardinality less than \kappa . \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 \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 \alpha . A regular ordinal is always an initial ordinal, though some initial ordinals are not regular, e.g., \omega_\omega (see the example below). If \kappa is a limit ordinal, \kappa is regular if the set of \alpha that are critical points of \Sigma_1 -elementary embeddings j with j(\alpha)=\kappa is club in \kappa . For cardinals \kappa , say that an elementary embedding j:M\to H(\theta) a small embedding if M is transitive and j(\textrm{crit}(j))=\kappa . A cardinal \kappa is uncountable and regular iff there is an \alpha>\kappa such that for every \theta>\alpha , there is a small embedding j:M\to H(\theta) . Corollary 2.2

References

, Elements of Set Theory, , Set Theory, An Introduction to Independence Proofs,

Text derived from https://en.wikipedia.org/w/index.php?oldid=1376543907 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

1 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.