Misplaced Pages

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 ${\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 then the following are equivalent for a cardinal ${\displaystyle \kappa }$:

1. ${\displaystyle \kappa }$ is a regular cardinal.
2. If ${\displaystyle \kappa =\sum _{i\in I}\lambda _{i}}$ and ${\displaystyle \lambda _{i}<\kappa }$ for all ${\displaystyle i}$, then ${\displaystyle |I|\geq \kappa }$.
3. If ${\displaystyle S=\bigcup _{i\in I}S_{i}}$, and if ${\displaystyle |I|<\kappa }$ and ${\displaystyle |S_{i}|<\kappa }$ for all ${\displaystyle i}$, then ${\displaystyle |S|<\kappa }$. That is, every union of fewer than ${\displaystyle \kappa }$ sets smaller than ${\displaystyle \kappa }$ is smaller than ${\displaystyle \kappa }$.
4. The category ${\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 }$.
5. ${\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).

Examples

The ordinals less than ${\displaystyle \omega }$ are finite. A finite sequence of finite ordinals always has a finite maximum, so ${\displaystyle \omega }$ cannot be the limit of any sequence of type less than ${\displaystyle \omega }$ whose elements are ordinals less than ${\displaystyle \omega }$, and is therefore a regular ordinal. ${\displaystyle \aleph _{0}}$ (aleph-null) is a regular cardinal because its initial ordinal, ${\displaystyle \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.

${\displaystyle \omega +1}$ is the next ordinal number greater than ${\displaystyle \omega }$. It is singular, since it is not a limit ordinal. ${\displaystyle \omega +\omega }$ is the next limit ordinal after ${\displaystyle \omega }$. It can be written as the limit of the sequence ${\displaystyle \omega }$, ${\displaystyle \omega +1}$, ${\displaystyle \omega +2}$, ${\displaystyle \omega +3}$, and so on. This sequence has order type ${\displaystyle \omega }$, so ${\displaystyle \omega +\omega }$ is the limit of a sequence of type less than ${\displaystyle \omega +\omega }$ whose elements are ordinals less than ${\displaystyle \omega +\omega }$; therefore it is singular.

${\displaystyle \aleph _{1}}$ is the next cardinal number greater than ${\displaystyle \aleph _{0}}$, so the cardinals less than ${\displaystyle \aleph _{1}}$ are countable (finite or denumerable). Assuming the axiom of choice, the union of a countable set of countable sets is itself countable. So ${\displaystyle \aleph _{1}}$ cannot be written as the sum of a countable set of countable cardinal numbers, and is regular.

${\displaystyle \aleph _{\omega }}$ is the next cardinal number after the sequence ${\displaystyle \aleph _{0}}$, ${\displaystyle \aleph _{1}}$, ${\displaystyle \aleph _{2}}$, ${\displaystyle \aleph _{3}}$, and so on. Its initial ordinal ${\displaystyle \omega _{\omega }}$ is the limit of the sequence ${\displaystyle \omega }$, ${\displaystyle \omega _{1}}$, ${\displaystyle \omega _{2}}$, ${\displaystyle \omega _{3}}$, and so on, which has order type ${\displaystyle \omega }$, so ${\displaystyle \omega _{\omega }}$ is singular, and so is ${\displaystyle \aleph _{\omega }}$. Assuming the axiom of choice, ${\displaystyle \aleph _{\omega }}$ is the first infinite cardinal that is singular (the first infinite ordinal that is singular is ${\displaystyle \omega +1}$, and the first infinite limit ordinal that is singular is ${\displaystyle \omega +\omega }$). Proving the existence of singular cardinals requires the axiom of replacement, and in fact the inability to prove the existence of ${\displaystyle \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 ${\displaystyle \omega }$-sequence ${\displaystyle \aleph _{0},\aleph _{\omega },\aleph _{\omega _{\omega }},...}$ and is therefore singular.

Properties

If the axiom of choice 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, 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 ${\displaystyle \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 ${\displaystyle \omega _{1}}$ be the limit of a countable sequence of countable ordinals as well as the set of real numbers be a countable union of countable sets. Furthermore, it is consistent with ZF when not including AC that every aleph bigger than ${\displaystyle \aleph _{0}}$ is singular (a result proved by Moti Gitik).

If ${\displaystyle \kappa }$ is a limit ordinal, ${\displaystyle \kappa }$ is regular iff the set of ${\displaystyle \alpha <\kappa }$ that are critical points of ${\displaystyle \Sigma _{1}}$-elementary embeddings ${\displaystyle j}$ with ${\displaystyle j(\alpha )=\kappa }$ is club in ${\displaystyle \kappa }$.

For cardinals ${\displaystyle \kappa <\theta }$, say that an elementary embedding ${\displaystyle j:M\to H(\theta )}$ a small embedding if ${\displaystyle M}$ is transitive and ${\displaystyle j({\textrm {crit}}(j))=\kappa }$. A cardinal ${\displaystyle \kappa }$ is uncountable and regular iff there is an ${\displaystyle \alpha >\kappa }$ such that for every ${\displaystyle \theta >\alpha }$, there is a small embedding ${\displaystyle j:M\to H(\theta )}$.

See also

• Inaccessible cardinal

References

1. Maddy, Penelope (1988), "Believing the axioms. I", Journal of Symbolic Logic, 53 (2): 481–511, doi:10.2307/2274520, JSTOR 2274520, MR 0947855, Early hints of the Axiom of Replacement can be found in Cantor's letter to Dedekind and in Mirimanoff . Maddy cites two papers by Mirimanoff, "Les antinomies de Russell et de Burali-Forti et le problème fundamental de la théorie des ensembles" and "Remarques sur la théorie des ensembles et les antinomies Cantorienne", both in L'Enseignement Mathématique (1917).
2. T. Arai, "Bounds on provability in set theories" (2012, p.2). Accessed 4 August 2022.
3. Holy, Lücke, Njegomir, "Small embedding characterizations for large cardinals". Annals of Pure and Applied Logic vol. 170, no. 2 (2019), pp.251--271.

• Herbert B. Enderton, Elements of Set Theory, ISBN 0-12-238440-7
• Kenneth Kunen, Set Theory, An Introduction to Independence Proofs, ISBN 0-444-85401-0

v t e Mathematical logic
General	Axiom list Cardinality First-order logic Formal proof Formal semantics Foundations of mathematics Information theory Lemma Logical consequence Model Theorem Theory Type theory
Theorems (list)  and paradoxes	Gödel's completeness and incompleteness theorems Tarski's undefinability Banach–Tarski paradox Cantor's theorem, paradox and diagonal argument Compactness Halting problem Lindström's Löwenheim–Skolem Russell's paradox
Logics	Traditional Classical logic Logical truth Tautology Proposition Inference Logical equivalence Consistency Equiconsistency Argument Soundness Validity Syllogism Square of opposition Venn diagram Propositional Boolean algebra Boolean functions Logical connectives Propositional calculus Propositional formula Truth tables Many-valued logic 3 finite ∞ Predicate First-order list Second-order Monadic Higher-order Fixed-point Free Quantifiers Predicate Monadic predicate calculus
Set theory	Set hereditary Class (Ur-)Element Ordinal number Extensionality Forcing Relation equivalence partition Set operations: intersection union complement Cartesian product power set identities Types of sets Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann Maps and cardinality Function/Map domain codomain image In/Sur/Bi-jection Schröder–Bernstein theorem Isomorphism Gödel numbering Enumeration Large cardinal inaccessible Aleph number Operation binary Set theories Zermelo–Fraenkel axiom of choice continuum hypothesis General Kripke–Platek Morse–Kelley Naive New Foundations Tarski–Grothendieck Von Neumann–Bernays–Gödel Ackermann Constructive
Formal systems (list), language and syntax	Alphabet Arity Automata Axiom schema Expression ground Extension by definition conservative Relation Formation rule Grammar Formula atomic closed ground open Free/bound variable Language Metalanguage Logical connective ¬ ∨ ∧ → ↔ = Predicate functional variable propositional variable Proof Quantifier ∃ ! ∀ rank Sentence atomic spectrum Signature String Substitution Symbol function logical/constant non-logical variable Term Theory list Example axiomatic systems (list) of arithmetic: Peano second-order elementary function primitive recursive Robinson Skolem of the real numbers Tarski's axiomatization of Boolean algebras canonical minimal axioms of geometry: Euclidean: Elements Hilbert's Tarski's non-Euclidean Principia Mathematica
Proof theory	Formal proof Natural deduction Logical consequence Rule of inference Sequent calculus Theorem Systems axiomatic deductive Hilbert list Complete theory Independence (from ZFC) Proof of impossibility Ordinal analysis Reverse mathematics Self-verifying theories
Model theory	Interpretation function of models Model equivalence finite saturated spectrum submodel Non-standard model of arithmetic Diagram elementary Categorical theory Model complete theory Satisfiability Semantics of logic Strength Theories of truth semantic Tarski's Kripke's T-schema Transfer principle Truth predicate Truth value Type Ultraproduct Validity
Computability theory	Church encoding Church–Turing thesis Computably enumerable Computable function Computable set Decision problem decidable undecidable P NP P versus NP problem Kolmogorov complexity Lambda calculus Primitive recursive function Recursion Recursive set Turing machine Type theory
Related	Abstract logic Algebraic logic Automated theorem proving Category theory Concrete/Abstract category Category of sets History of logic History of mathematical logic timeline Logicism Mathematical object Philosophy of mathematics Supertask
Mathematics portal

v t e Set theory
Overview	Set (mathematics)
Axioms	Adjunction Choice countable dependent global Constructibility (V=L) Determinacy projective Extensionality Infinity Limitation of size Pairing Power set Regularity Union Martin's axiom Axiom schema replacement specification
Operations	Cartesian product Complement (i.e. set difference) De Morgan's laws Disjoint union Identities Intersection Power set Symmetric difference Union
Concepts Methods	Almost Cardinality Cardinal number (large) Class Constructible universe Continuum hypothesis Diagonal argument Element ordered pair tuple Family Forcing One-to-one correspondence Ordinal number Set-builder notation Transfinite induction Venn diagram
Set types	Amorphous Countable Empty Finite (hereditarily) Filter base subbase Ultrafilter Fuzzy Infinite (Dedekind-infinite) Recursive Singleton Subset · Superset Transitive Uncountable Universal
Theories	Alternative Axiomatic Naive Cantor's theorem Zermelo General Principia Mathematica New Foundations Zermelo–Fraenkel von Neumann–Bernays–Gödel Morse–Kelley Kripke–Platek Tarski–Grothendieck
Paradoxes Problems	Russell's paradox Suslin's problem Burali-Forti paradox
Set theorists	Paul Bernays Georg Cantor Paul Cohen Richard Dedekind Abraham Fraenkel Kurt Gödel Thomas Jech John von Neumann Willard Quine Bertrand Russell Thoralf Skolem Ernst Zermelo

• Cardinal numbers
• Ordinal numbers