HOME

TheInfoList



OR:

In
set theory Set theory is the branch of mathematical logic that studies Set (mathematics), sets, which can be informally described as collections of objects. Although objects of any kind can be collected into a set, set theory – as a branch of mathema ...
, a regular cardinal is a
cardinal number In mathematics, a cardinal number, or cardinal for short, is what is commonly called the number of elements of a set. In the case of a finite set, its cardinal number, or cardinality is therefore a natural number. For dealing with the cas ...
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-order In mathematics, a well-order (or well-ordering or well-order relation) on a set is a total ordering on with the property that every non-empty subset of has a least element in this ordering. The set together with the ordering is then calle ...
ed 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 In mathematics, the axiom of choice, abbreviated AC or AoC, is an axiom of set theory. Informally put, the axiom of choice says that given any collection of non-empty sets, it is possible to construct a new set by choosing one element from e ...
, any cardinal number can be well-ordered, and so the following are equivalent: # \kappa is a regular cardinal. # If \kappa = \textstyle\sum_ \lambda_i and \lambda_i < \kappa for all i, then , I, \ge \kappa. # If S = \textstyle\bigcup_ S_i, and if , I, < \kappa and , S_i, < \kappa for all i, then , S, < \kappa. That is, every union of fewer than \kappa sets smaller than \kappa is smaller than \kappa. # The category \operatorname_ 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 In mathematics, the axiom of choice, abbreviated AC or AoC, is an axiom of set theory. Informally put, the axiom of choice says that given any collection of non-empty sets, it is possible to construct a new set by choosing one element from e ...
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 In set theory, a limit ordinal is an ordinal number that is neither zero nor a successor ordinal. Alternatively, an ordinal λ is a limit ordinal if there is an ordinal less than λ, and whenever β is an ordinal less than λ, then there exists a ...
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).


Examples

The ordinals less than \omega are finite. A finite sequence of finite ordinals always has a finite maximum, so \omega cannot be the limit of any sequence of type less than \omega whose elements are ordinals less than \omega, and is therefore a regular ordinal. \aleph_0 ( aleph-null) is a regular cardinal because its initial ordinal, \omega, is regular. It can also be seen directly to be regular, as the cardinal sum of a finite number of finite cardinal numbers is itself finite. \omega+1 is the next ordinal number greater than \omega. It is singular, since it is not a limit ordinal. \omega+\omega is the next limit ordinal after \omega. It can be written as the limit of the sequence \omega, \omega+1, \omega+2, \omega+3, and so on. This sequence has order type \omega, so \omega+\omega is the limit of a sequence of type less than \omega+\omega whose elements are ordinals less than \omega+\omega; therefore it is singular. \aleph_1 is the next cardinal number greater than \aleph_0, so the cardinals less than \aleph_1 are
countable In mathematics, a Set (mathematics), set is countable if either it is finite set, finite or it can be made in one to one correspondence with the set of natural numbers. Equivalently, a set is ''countable'' if there exists an injective function fro ...
(finite or denumerable). Assuming the axiom of choice, the union of a countable set of countable sets is itself countable. So \aleph_1 cannot be written as the sum of a countable set of countable cardinal numbers, and is regular. \aleph_\omega is the next cardinal number after the sequence \aleph_0, \aleph_1, \aleph_2, \aleph_3, and so on. Its initial ordinal \omega_\omega is the limit of the sequence \omega, \omega_1, \omega_2, \omega_3, and so on, which has order type \omega, so \omega_\omega is singular, and so is \aleph_\omega. Assuming the axiom of choice, \aleph_\omega is the first infinite cardinal that is singular (the first infinite ''ordinal'' that is singular is \omega+1, and the first infinite ''limit ordinal'' that is singular is \omega+\omega). Proving the existence of singular cardinals requires the axiom of replacement, and in fact the inability to prove the existence of \aleph_\omega in Zermelo set theory is what led Fraenkel to postulate this axiom. Uncountable (weak) limit cardinals that are also regular are known as (weakly) inaccessible cardinals. They cannot be proved to exist within ZFC, though their existence is not known to be inconsistent with ZFC. Their existence is sometimes taken as an additional axiom. Inaccessible cardinals are necessarily fixed points of the aleph function, though not all fixed points are regular. For instance, the first fixed point is the limit of the \omega-sequence \aleph_0, \aleph_, \aleph_, ... and is therefore singular.


Properties

If the
axiom of choice In mathematics, the axiom of choice, abbreviated AC or AoC, is an axiom of set theory. Informally put, the axiom of choice says that given any collection of non-empty sets, it is possible to construct a new set by choosing one element from e ...
holds, then every successor cardinal is regular. Thus the regularity or singularity of most aleph numbers can be checked depending on whether the cardinal is a successor cardinal or a limit cardinal. Some cardinalities cannot be proven to be equal to any particular aleph, for instance the
cardinality of the continuum In set theory, the cardinality of the continuum is the cardinality or "size" of the set of real numbers \mathbb R, sometimes called the continuum. It is an infinite cardinal number and is denoted by \bold\mathfrak c (lowercase Fraktur "c") or \ ...
, whose value in ZFC may be any uncountable cardinal of uncountable cofinality (see Easton's theorem). The continuum hypothesis postulates that the cardinality of the continuum is equal to \aleph_1, which is regular assuming choice. Without the axiom of choice: there would be cardinal numbers that were not well-orderable. Moreover, the cardinal sum of an arbitrary collection could not be defined. Therefore, only the aleph numbers could meaningfully be called regular or singular cardinals.Furthermore, a successor aleph would need not be regular. For instance, the union of a countable set of countable sets would not necessarily be countable. It is consistent with ZF that \omega_1 be the limit of a countable sequence of countable ordinals as well as the set of
real number In mathematics, a real number is a number that can be used to measure a continuous one- dimensional quantity such as a duration or temperature. Here, ''continuous'' means that pairs of values can have arbitrarily small differences. Every re ...
s be a countable union of countable sets. Furthermore, it is consistent with ZF when not including AC that every aleph bigger than \aleph_0 is singular (a result proved by Moti Gitik). If \kappa is a limit ordinal, \kappa is regular iff the set of \alpha<\kappa that are critical points of \Sigma_1- elementary embeddings j with j(\alpha)=\kappa is club in \kappa. For cardinals \kappa<\theta, say that an elementary embedding j:M\to H(\theta) a ''small embedding'' if M is transitive and j(\textrm(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).Holy, Lücke, Njegomir,
Small embedding characterizations for large cardinals
. Annals of Pure and Applied Logic vol. 170, no. 2 (2019), pp.251--271.
Corollary 2.2


See also

*
Inaccessible cardinal In set theory, a cardinal number is a strongly inaccessible cardinal if it is uncountable, regular, and a strong limit cardinal. A cardinal is a weakly inaccessible cardinal if it is uncountable, regular, and a weak limit cardinal. Since abou ...


References

* , ''Elements of Set Theory'', * , ''Set Theory, An Introduction to Independence Proofs'', {{Set theory Cardinal numbers Ordinal numbers