Hubbry Logo
search
logo

Inaccessible cardinal

logo
Community Hub0 Subscribers
Read side by side
from Wikipedia

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 about 1950, "inaccessible cardinal" has typically meant "strongly inaccessible cardinal" whereas before it had meant "weakly inaccessible cardinal". Weakly inaccessible cardinals were introduced by Hausdorff (1908). Strongly inaccessible cardinals were introduced by Sierpiński & Tarski (1930) and Zermelo (1930); in the latter they were referred to along with as Grenzzahlen (English "limit numbers").[1]

Every strongly inaccessible cardinal is a weakly inaccessible cardinal. The generalized continuum hypothesis implies that all weakly inaccessible cardinals are strongly inaccessible as well.

The two notions of an inaccessible cardinal describe a cardinality which can not be obtained as the cardinality of a result of typical set-theoretic operations involving only sets of cardinality less than . Hence the word "inaccessible". By mandating that inaccessible cardinals are uncountable, they turn out to be very large.

In particular, inaccessible cardinals need not exist at all. That is, it is believed that there are models of Zermelo-Fraenkel set theory, even with the axiom of choice (ZFC), for which no inaccessible cardinals exist[2]. On the other hand, it also believed that there are models of ZFC for which even strongly inaccessible cardinals do exist. That ZFC can accommodate these large sets, but does not necessitate them, provides an introduction to the large cardinal axioms. See also Models and consistency.

The existence of a strongly inaccessible cardinal is equivalent to the existence of a Grothendieck universe. If is a strongly inaccessible cardinal then the von Neumann stage is a Grothendieck universe. Conversely, if is a Grothendieck universe then there is a strongly inaccessible cardinal such that . As expected from their correspondence with strongly inaccessible cardinals, Grothendieck universes are very well-closed under set-theoretic operations.

An ordinal is a weakly inaccessible cardinal if and only if it is a regular ordinal and it is a limit of regular ordinals. (Zero, one, and ω are regular ordinals, but not limits of regular ordinals.)

From some perspectives, the requirement that a weakly or strongly inaccessible cardinal be uncountable is unnatural or unnecessary. Even though is countable, it is regular and is a strong limit cardinal. is also the smallest weak limit regular cardinal. Assuming the axiom of choice, every other infinite cardinal number is either regular or a weak limit cardinal. However, only a rather large cardinal number can be both. Since a cardinal larger than is necessarily uncountable, if is also regular and a weak limit cardinal then must be a weakly inaccessible cardinal.

Models and consistency

[edit]

Suppose that is a cardinal number. Zermelo–Fraenkel set theory with Choice (ZFC) implies that the th level of the Von Neumann universe is a model of ZFC whenever is strongly inaccessible. Furthermore, ZF implies that the Gödel universe is a model of ZFC whenever is weakly inaccessible. Thus, ZF together with "there exists a weakly inaccessible cardinal" implies that ZFC is consistent. Therefore, inaccessible cardinals are a type of large cardinal.

If is a standard model of ZFC and is an inaccessible in , then

  1. is one of the intended models of Zermelo–Fraenkel set theory;
  2. is one of the intended models of Mendelson's version of Von Neumann–Bernays–Gödel set theory which excludes global choice, replacing limitation of size by replacement and ordinary choice;
  3. and is one of the intended models of Morse–Kelley set theory.

Here, is the set of Δ0-definable subsets of X (see constructible universe). It is worth pointing out that the first claim can be weakened: does not need to be inaccessible, or even a cardinal number, in order for to be a standard model of ZF (see below).

Suppose is a model of ZFC. Either contains no strong inaccessible or, taking to be the smallest strong inaccessible in , is a standard model of ZFC which contains no strong inaccessibles. Thus, the consistency of ZFC implies consistency of ZFC+"there are no strong inaccessibles". Similarly, either V contains no weak inaccessible or, taking to be the smallest ordinal which is weakly inaccessible relative to any standard sub-model of , then is a standard model of ZFC which contains no weak inaccessibles. So consistency of ZFC implies consistency of ZFC+"there are no weak inaccessibles". This shows that ZFC cannot prove the existence of an inaccessible cardinal, so ZFC is consistent with the non-existence of any inaccessible cardinals.

The issue whether ZFC is consistent with the existence of an inaccessible cardinal is more subtle. The proof sketched in the previous paragraph that the consistency of ZFC implies the consistency of ZFC + "there is not an inaccessible cardinal" can be formalized in ZFC. However, assuming that ZFC is consistent, no proof that the consistency of ZFC implies the consistency of ZFC + "there is an inaccessible cardinal" can be formalized in ZFC. This follows from Gödel's second incompleteness theorem, which shows that if ZFC + "there is an inaccessible cardinal" is consistent, then it cannot prove its own consistency. Because ZFC + "there is an inaccessible cardinal" does prove the consistency of ZFC, if ZFC proved that its own consistency implies the consistency of ZFC + "there is an inaccessible cardinal" then this latter theory would be able to prove its own consistency, which is impossible if it is consistent.

There are arguments for the existence of inaccessible cardinals that cannot be formalized in ZFC. One such argument, presented by Hrbáček & Jech (1999, p. 279), is that the class of all ordinals of a particular model M of set theory would itself be an inaccessible cardinal if there was a larger model of set theory extending M and preserving powerset of elements of M.

Existence of a proper class of inaccessibles

[edit]

There are many important axioms in set theory which assert the existence of a proper class of cardinals which satisfy a predicate of interest. In the case of inaccessibility, the corresponding axiom is the assertion that for every cardinal μ, there is an inaccessible cardinal κ which is strictly larger, μ < κ. Thus, this axiom guarantees the existence of an infinite tower of inaccessible cardinals (and may occasionally be referred to as the inaccessible cardinal axiom). As is the case for the existence of any inaccessible cardinal, the inaccessible cardinal axiom is unprovable from the axioms of ZFC. Assuming ZFC, the inaccessible cardinal axiom is equivalent to the universe axiom of Grothendieck and Verdier: every set is contained in a Grothendieck universe. The axioms of ZFC along with the universe axiom (or equivalently the inaccessible cardinal axiom) are denoted ZFCU (not to be confused with ZFC with urelements). This axiomatic system is useful to prove for example that every category has an appropriate Yoneda embedding.

This is a relatively weak large cardinal axiom since it amounts to saying that ∞ is 1-inaccessible in the language of the next section, where ∞ denotes the least ordinal not in V, i.e. the class of all ordinals in your model.

α-inaccessible cardinals and hyper-inaccessible cardinals

[edit]

The term "α-inaccessible cardinal" is ambiguous and different authors use inequivalent definitions. One definition is that a cardinal κ is called α-inaccessible, for any ordinal α, if κ is inaccessible and for every ordinal β < α, the set of β-inaccessibles less than κ is unbounded in κ (and thus of cardinality κ, since κ is regular). In this case the 0-inaccessible cardinals are the same as strongly inaccessible cardinals. Another possible definition is that a cardinal κ is called α-weakly inaccessible if κ is regular and for every ordinal β < α, the set of β-weakly inaccessibles less than κ is unbounded in κ. In this case the 0-weakly inaccessible cardinals are the regular cardinals and the 1-weakly inaccessible cardinals are the weakly inaccessible cardinals.

The α-inaccessible cardinals can also be described as fixed points of functions which count the lower inaccessibles. For example, denote by ψ0(λ) the λth inaccessible cardinal, then the fixed points of ψ0 are the 1-inaccessible cardinals. Then letting ψβ(λ) be the λth β-inaccessible cardinal, the fixed points of ψβ are the (β+1)-inaccessible cardinals (the values ψβ+1(λ)). If α is a limit ordinal, an α-inaccessible is a fixed point of every ψβ for β < α (the value ψα(λ) is the λth such cardinal). This process of taking fixed points of functions generating successively larger cardinals is commonly encountered in the study of large cardinal numbers.

The term hyper-inaccessible is ambiguous and has at least three incompatible meanings. Many authors use it to mean a regular limit of strongly inaccessible cardinals (1-inaccessible). Other authors use it to mean that κ is κ-inaccessible. (It can never be κ+1-inaccessible.) It is occasionally used to mean Mahlo cardinal.

The term α-hyper-inaccessible is also ambiguous. Some authors use it to mean α-inaccessible. Other authors use the definition that for any ordinal α, a cardinal κ is α-hyper-inaccessible if and only if κ is hyper-inaccessible and for every ordinal β < α, the set of β-hyper-inaccessibles less than κ is unbounded in κ.

Hyper-hyper-inaccessible cardinals and so on can be defined in similar ways, and as usual this term is ambiguous.

Using "weakly inaccessible" instead of "inaccessible", similar definitions can be made for "weakly α-inaccessible", "weakly hyper-inaccessible", and "weakly α-hyper-inaccessible".

Mahlo cardinals are inaccessible, hyper-inaccessible, hyper-hyper-inaccessible, ... and so on.

Two model-theoretic characterisations of inaccessibility

[edit]

Firstly, a cardinal κ is inaccessible if and only if κ has the following reflection property: for all subsets , there exists such that is an elementary substructure of . (In fact, the set of such α is closed unbounded in κ.) Therefore, is -indescribable for all n ≥ 0. On the other hand, there is not necessarily an ordinal such that , and if this holds, then must be the th inaccessible cardinal.[3]

It is provable in ZF that has a somewhat weaker reflection property, where the substructure is only required to be 'elementary' with respect to a finite set of formulas. Ultimately, the reason for this weakening is that whereas the model-theoretic satisfaction relation can be defined, semantic truth itself (i.e. ) cannot, due to Tarski's theorem.

Secondly, under ZFC Zermelo's categoricity theorem can be shown, which states that is inaccessible if and only if is a model of second order ZFC.

In this case, by the reflection property above, there exists such that is a standard model of (first order) ZFC. Hence, the existence of an inaccessible cardinal is a stronger hypothesis than the existence of a transitive model of ZFC.

Inaccessibility of is a property over ,[4] while a cardinal being inaccessible (in some given model of containing ) is .[5]

See also

[edit]

Works cited

[edit]
  • Drake, F. R. (1974), Set Theory: An Introduction to Large Cardinals, Studies in Logic and the Foundations of Mathematics, vol. 76, Elsevier Science, ISBN 0-444-10535-2
  • Hausdorff, Felix (1908), "Grundzüge einer Theorie der geordneten Mengen", Mathematische Annalen, 65 (4): 435–505, doi:10.1007/BF01451165, hdl:10338.dmlcz/100813, ISSN 0025-5831, S2CID 119648544
  • Hrbáček, Karel; Jech, Thomas (1999), Introduction to set theory (3rd ed.), New York: Dekker, ISBN 978-0-8247-7915-3
  • Kanamori, Akihiro (2003), The Higher Infinite: Large Cardinals in Set Theory from Their Beginnings (2nd ed.), Springer, ISBN 3-540-00384-3
  • Sierpiński, Wacław; Tarski, Alfred (1930), "Sur une propriété caractéristique des nombres inaccessibles" (PDF), Fundamenta Mathematicae, 15: 292–300, doi:10.4064/fm-15-1-292-300, ISSN 0016-2736
  • Zermelo, Ernst (1930), "Über Grenzzahlen und Mengenbereiche: neue Untersuchungen über die Grundlagen der Mengenlehre" (PDF), Fundamenta Mathematicae, 16: 29–47, doi:10.4064/fm-16-1-29-47, ISSN 0016-2736. English translation: Ewald, William B. (1996), "On boundary numbers and domains of sets: new investigations in the foundations of set theory", From Immanuel Kant to David Hilbert: A Source Book in the Foundations of Mathematics, Oxford University Press, pp. 1208–1233, ISBN 978-0-19-853271-2.

References

[edit]
Revisions and contributorsEdit on WikipediaRead on Wikipedia
from Grokipedia
In set theory, an inaccessible cardinal is an uncountable cardinal number κ\kappa that is both regular—meaning its cofinality equals κ\kappa itself, so it cannot be expressed as the union of fewer than κ\kappa many sets each of cardinality less than κ\kappa—and a strong limit cardinal, satisfying 2λ<κ2^\lambda < \kappa for every λ<κ\lambda < \kappa.[1] This dual condition ensures that κ\kappa cannot be "accessed" or constructed from smaller cardinals using standard set-theoretic operations like exponentiation (powersets) or summation (unions).[2] The existence of such cardinals transcends the axioms of Zermelo-Fraenkel set theory with the axiom of choice (ZFC), as their presence cannot be proven within ZFC and requires additional large cardinal axioms.[1] A key property of an inaccessible cardinal κ\kappa is that the cumulative hierarchy up to κ\kappa, denoted VκV_\kappa, forms a model of ZFC, making κ\kappa a fixed point of the cumulative hierarchy where the universe "restarts" with full set-theoretic strength.[2] This implies that if κ\kappa is inaccessible, then VκV_\kappa satisfies the axiom of infinity, replacement, and power set without collapse, and under the generalized continuum hypothesis (GCH), every weakly inaccessible cardinal (regular limit but not necessarily strong limit) coincides with a strongly inaccessible one.[2] The concept originated in the early 20th century, with Felix Hausdorff considering weakly inaccessible cardinals (uncountable regular limit cardinals) in 1908, though the modern formulation emphasizing "unreachability" was developed by Alfred Tarski in his 1938 paper "Über unerreichbare Kardinalzahlen," where he characterized them via the condition κ<κ=κ\kappa^{<\kappa} = \kappa.[3] Tarski proved that if κ\kappa is an uncountable limit cardinal satisfying κ<κ=κ\kappa^{<\kappa} = \kappa, then κ\kappa is strongly inaccessible, linking it to the power set operation's behavior.[3] Subsequent work by Paul Erdős and Alfred Tarski in 1961 explored implications for measure theory, showing that inaccessible cardinals imply the consistency of ZFC and properties related to λ-additive measures and ideals.[1] In the hierarchy of large cardinals, inaccessible cardinals are the weakest nontrivial ones, serving as a foundation for stronger notions like measurable or supercompact cardinals, and their assumption underlies alternative set theories like Tarski-Grothendieck set theory.[2]

Definition and Properties

Formal Definition

In set theory within the framework of Zermelo–Fraenkel set theory with the axiom of choice (ZFC), cardinal numbers measure the size of sets and extend the natural numbers to transfinite ordinals, often indexed as aleph fixed points α\aleph_\alpha where 0\aleph_0 denotes the cardinality of the natural numbers and successors are defined via initial ordinals. The power set P(X)\mathcal{P}(X) of a set XX has cardinality 2X2^{|X|}, which strictly exceeds X|X| by Cantor's theorem, and this exponential operation plays a central role in bounding cardinal growth. A cardinal κ\kappa is a strong limit cardinal if the power set operation cannot reach κ\kappa from below, formally expressed as λ<κ(2λ<κ)\forall \lambda < \kappa \, (2^\lambda < \kappa). This condition ensures that κ\kappa is closed under exponentiation in a robust sense, preventing any smaller cardinal's power set from equaling or exceeding κ\kappa. A cardinal κ\kappa is regular if it cannot be expressed as the union of fewer than κ\kappa many sets each of cardinality less than κ\kappa; equivalently, its cofinality cf(κ)=κ\mathrm{cf}(\kappa) = \kappa, meaning the least ordinal α\alpha such that there exists a cofinal function f:ακf: \alpha \to \kappa (with suprange(f)=κ\sup \mathrm{range}(f) = \kappa) satisfies α=κ\alpha = \kappa. This is captured by the condition that for every ordinal β<κ\beta < \kappa and every function f:βκf: \beta \to \kappa, the range of ff has cardinality strictly less than κ\kappa. An inaccessible cardinal κ\kappa is an uncountable cardinal that is both regular and a strong limit cardinal, i.e., κ>0\kappa > \aleph_0, cf(κ)=κ\mathrm{cf}(\kappa) = \kappa, and λ<κ(2λ<κ)\forall \lambda < \kappa \, (2^\lambda < \kappa). This notion was introduced by Wacław Sierpiński and Alfred Tarski in 1930 as a generalization of 0\aleph_0, which satisfies the regularity and strong limit conditions but is countable.

Key Properties

An inaccessible cardinal κ\kappa exhibits strong closure properties derived directly from its definition as a regular strong limit cardinal. For any cardinal λ<κ\lambda < \kappa, the successor cardinal λ+\lambda^+ satisfies λ+<κ\lambda^+ < \kappa, ensuring that κ\kappa cannot be reached by taking successors from below. Similarly, κ\kappa is closed under cardinal exponentiation: for any cardinals μ,ν<κ\mu, \nu < \kappa, the power μν<κ\mu^\nu < \kappa. This follows from the strong limit condition, as μν2max(μ,ν)I\mu^\nu \leq 2^{\max(\mu, \nu)^{|I|}} for some index set II with Iν<κ|I| \leq \nu < \kappa, and thus 2α<κ2^\alpha < \kappa for all α<κ\alpha < \kappa implies the bound.[4][5] A key consequence is that the von Neumann hierarchy initial segment Vκ=α<κVαV_\kappa = \bigcup_{\alpha < \kappa} V_\alpha forms a model of ZFC. Since κ\kappa is an ordinal, VκV_\kappa is transitive, so extensionality, foundation, pairing, union, and infinity hold as they do in VV. Separation and replacement are preserved because sets in VκV_\kappa have rank below κ\kappa, and comprehension formulas are absolute for transitive models. The power set axiom holds internally due to the strong limit property: for any xVαx \in V_\alpha with α<κ\alpha < \kappa, x<κ|x| < \kappa, so 2x<κ2^{|x|} < \kappa, ensuring P(x)Vα+1Vκ\mathcal{P}(x) \in V_{\alpha+1} \subseteq V_\kappa. Replacement is secured by regularity: for AVκA \in V_\kappa with A<κ|A| < \kappa and a class function F:AVF: A \to V definable such that FAVκF''A \subseteq V_\kappa, the range FAF''A has cardinality less than κ\kappa (as κ\kappa is regular), so its rank is below κ\kappa, placing FAVκF''A \in V_\kappa. The axiom of choice holds in VκV_\kappa because well-orderings in VV of sets in VκV_\kappa remain within VκV_\kappa.[4][6][5] Inaccessible cardinals also possess a Mahlo-like quality in that they serve as fixed points in the hierarchy of cardinals, acting as least upper bounds for the smaller cardinals below them under the operations of successor and exponentiation. This closure makes them natural boundaries unreachable from below via standard cardinal arithmetic. Worldly cardinals, which satisfy VκV_\kappa \models ZFC but may be singular, represent a weaker notion, with inaccessible cardinals being precisely the regular worldly ones.[4]

Extensions and Variations

α-Inaccessible Cardinals

A cardinal κ\kappa is defined to be α\alpha-inaccessible, for an ordinal α\alpha, if κ\kappa is inaccessible and, for every ordinal β<α\beta < \alpha, κ\kappa is a limit of β\beta-inaccessible cardinals; in particular, the 00-inaccessible cardinals coincide with the ordinary inaccessible cardinals. This recursive definition builds a hierarchy of large cardinals by iterating the notion of inaccessibility along the ordinals.[7] The concept of α\alpha-inaccessible cardinals was introduced by William Hanf and Dana Scott in their 1961 work to classify and organize the hierarchy of inaccessible cardinals and related notions, providing a framework for studying stronger forms of large cardinals through ordinal iteration.[8] For successor ordinals, the definition simplifies: a cardinal κ\kappa is (α+1)(\alpha+1)-inaccessible if it is α\alpha-inaccessible and a limit of α\alpha-inaccessible cardinals below it. At limit ordinals λ\lambda, κ\kappa must be inaccessible and serve as the least upper bound of β\beta-inaccessible cardinals for all β<λ\beta < \lambda, ensuring closure under the iterative operation. For example, a 11-inaccessible cardinal is an inaccessible cardinal that is the supremum of a cofinal sequence of ordinary inaccessible cardinals. The hierarchy is constructed via enumerating functions: let I0(γ)I_0(\gamma) denote the γ\gamma-th inaccessible cardinal, and recursively define Iα+1(γ)I_{\alpha+1}(\gamma) as the γ\gamma-th α\alpha-inaccessible cardinal; the fixed points of IαI_\alpha yield the (α+1)(\alpha+1)-inaccessible cardinals. If an α\alpha-inaccessible cardinal exists for some α>0\alpha > 0, then the class of all α\alpha-inaccessible cardinals forms a proper class, as the hierarchy extends unboundedly. Moreover, for a [9] that is α\alpha-inaccessible, the model [10] satisfies ZFC together with the assertion that there exist β\beta-inaccessible cardinals for all β<α\beta < \alpha. Hyper-inaccessible cardinals correspond to the specific case of ω\omega-inaccessible cardinals.

Hyper-Inaccessible Cardinals

A hyper-inaccessible cardinal κ\kappa is defined as an inaccessible cardinal that is α\alpha-inaccessible for every finite ordinal α<ω\alpha < \omega. This means κ\kappa arises as the limit stage in the finite iterations of the α\alpha-inaccessible hierarchy, where the hierarchy is constructed inductively starting from 0-inaccessible (ordinary inaccessible) cardinals: a cardinal is (α+1)(\alpha + 1)-inaccessible if it is inaccessible and the supremum of α\alpha-inaccessibles below it; and γ\gamma-inaccessible for limit γ\gamma if it is α\alpha-inaccessible for all α<γ\alpha < \gamma. Thus, hyper-inaccessibility captures the ω\omega-limit of these successive strengthenings within the inaccessible cardinal hierarchy. Equivalently, κ\kappa is hyper-inaccessible if it is inaccessible and there is a cofinal sequence of order type ω\omega in the inaccessible cardinals below κ\kappa, where each level consists of limits of the prior levels in the finite hierarchy. This formulation emphasizes the iterative closure under limits at each finite step leading up to κ\kappa. If κ\kappa is hyper-inaccessible, then the model VκV_\kappa satisfies ZFC together with the assertion that there exists a proper class of inaccessible cardinals. Moreover, hyper-inaccessibles exhibit enhanced closure properties under certain elementary embeddings, reflecting the layered structure of the underlying hierarchy. Hyper-inaccessible cardinals differ from Mahlo cardinals in that the former are unbounded limits along the specific inaccessible hierarchy at the ω\omega-level, whereas Mahlo cardinals are inaccessible limits of regular cardinals (with the set of regulars below forming a stationary set). Every Mahlo cardinal is hyper-inaccessible, but the converse does not hold. In applications, hyper-inaccessible cardinals facilitate the construction of set-theoretic models VκV_\kappa that incorporate multiple levels of large cardinals below κ\kappa, aiding in the analysis of consistency strengths for axioms positing hierarchies of inaccessibles.

Consistency and Models

Consistency Implications

The theory ZFC augmented with the axiom asserting the existence of an inaccessible cardinal, denoted ZFC + I, has strictly greater consistency strength than ZFC. Specifically, if κ is inaccessible, then V_κ is a transitive model of ZFC, so ZFC + I proves Con(ZFC).[11] However, by Gödel's second incompleteness theorem, ZFC cannot prove its own consistency and thus cannot prove Con(ZFC + I). The consistency of ZFC + I is instead relative to stronger theories, such as ZFC plus the existence of a Mahlo cardinal, which yields a model of ZFC + I via a suitable initial segment.[11] In Gödel's constructible universe L, the existence of inaccessible cardinals is possible, as the property of inaccessibility is absolute between transitive models containing the relevant ordinals. Thus, if an inaccessible cardinal exists in the universe V, it also exists in the inner model L, and ZFC + I + V = L is consistent relative to ZFC plus a stronger large cardinal axiom.[6] This compatibility contrasts with stronger large cardinals like measurable ones, which cannot exist in L and thus imply V ≠ L. The existence of inaccessible cardinals has foundational implications, particularly regarding the independence of the continuum hypothesis (CH) from ZFC. Since V_κ models ZFC for inaccessible κ, it serves as a ground model for forcing extensions that can violate CH (e.g., by adding many Cohen reals), showing Con(ZFC + ¬CH) relative to ZFC + I, while Gödel's L models ZFC + CH.[12] A key historical development concerning the consistency of large cardinals is Paul Cohen's invention of forcing in 1963, which proved the independence of CH from ZFC and provided methods to explore the independence of inaccessible cardinals. While ZFC alone cannot disprove the existence of inaccessibles (as Con(ZFC) implies Con(ZFC + ¬I) via models like L without assuming I), forcing preserves the non-existence in certain extensions but cannot create genuine inaccessibles from below; upward consistency relies on assuming stronger cardinals.[13] There is no transitive model of ZFC + I whose height is smaller than the least inaccessible cardinal κ. Suppose such a model M existed with height λ < κ; then λ would satisfy the definition of an inaccessible cardinal (as M would witness the required regularity and strong limit properties up to λ), contradicting the minimality of κ.[14]

Existence in Set-Theoretic Models

In Gödel's constructible universe L, inaccessible cardinals exist precisely when they exist in V, due to the absoluteness of the inaccessibility property.[14] Forcing techniques allow the addition or preservation of inaccessible cardinals in set-theoretic models. Easton's theorem establishes that, starting from a ground model satisfying GCH, one can use a class forcing with Easton support—an iteration over the class of regular cardinals—to arbitrarily prescribe the continuum function 2α=F(α)2^\alpha = F(\alpha) for regular α\alpha, as long as FF is non-decreasing, F(α)>αF(\alpha) > \alpha, and cf(F(α))>α\mathrm{cf}(F(\alpha)) > \alpha.[15] This enables the creation of new inaccessible cardinals by forcing a regular cardinal κ\kappa to become a strong limit (e.g., by setting 2λ=λ+2^\lambda = \lambda^+ for all λ<κ\lambda < \kappa) while preserving existing inaccessibles above κ\kappa and maintaining regularity. Class forcing can also collapse inaccessibles; for instance, the Lévy collapse Col(ω,κ)\mathrm{Col}(\omega, \langle \kappa) over an inaccessible κ\kappa adds surjections from ω\omega onto every ordinal below κ\kappa, making κ=1\kappa = \aleph_1 in the extension without affecting cardinals above κ\kappa, due to the κ+\kappa^+-chain condition preserved by inaccessibility.[16] In inner models, the presence of an inaccessible cardinal in VV can lead to its appearance in extensions like L[U]L[U], where UU is a normal measure on a measurable cardinal μ>κ\mu > \kappa. The model L[U]L[U] is constructed by adjoining the measure to the constructible hierarchy, and under the embedding jU:L[U]L[U]j_U : L[U] \to L[U^*] induced by UU, inaccessible cardinals below μ\mu are often preserved as inaccessibles in the target model if they satisfy closure properties relative to the ultrapower.[17] Specifically, if κ<μ\kappa < \mu is inaccessible in VV, then κ\kappa remains inaccessible in L[U]L[U] because the fine-structural properties of the model, including absoluteness of power sets below μ\mu, ensure that regularity and the strong limit condition hold internally.[18] Reflection principles highlight the model-theoretic existence of inaccessibles despite limitations in VV. Kunen's inconsistency theorem proves that there is no nontrivial elementary embedding j:VVj : V \to V, which implies that no measurable cardinal κ\kappa can satisfy V=Ult(V,U)V = \mathrm{Ult}(V, U) for an ultrafilter UU on κ\kappa, as such an embedding would contradict the theorem.[19] However, inaccessible cardinals do not rely on such embeddings for their definition and can consistently exist in VV. By the Skolem paradox—arising from the Löwenheim-Skolem theorem—every consistent extension of ZFC, including ZFC + "there exists an inaccessible cardinal," has countable transitive models, in which the purported inaccessible cardinal appears as a countable ordinal externally, yet satisfies the internal properties of uncountable regularity and strong limit status.[20] If κ\kappa is the least inaccessible cardinal, then VκV_\kappa serves as the smallest transitive model of ZFC. In this model, all axioms of ZFC hold due to the closure of VκV_\kappa under replacement and comprehension, as κ\kappa's regularity ensures that images under set functions remain below κ\kappa, and its strong limit property guarantees that power sets of smaller cardinals stay within VκV_\kappa. Moreover, VκV_\kappa satisfies "there are no inaccessible cardinals," since any potential inaccessible in VκV_\kappa would be below κ\kappa, contradicting minimality.[11]

Proper Classes of Inaccessibles

A proper class of inaccessible cardinals refers to the scenario in which the class of all inaccessible cardinals is unbounded within the class of ordinals, meaning that inaccessible cardinals exist arbitrarily high in the ordinal hierarchy.[21] This condition asserts that for every ordinal α, there is an inaccessible cardinal κ > α, ensuring that the collection of such cardinals cannot be bounded by any single ordinal.[21] The assumption of a proper class of inaccessible cardinals has significant implications for the consistency strength of set-theoretic theories. Specifically, the theory ZFC augmented with the axiom "there exists a proper class of inaccessible cardinals" is consistent relative to ZFC plus the existence of stronger large cardinal axioms, such as a hyper-inaccessible cardinal.[21] This is stronger in consistency strength than the existence of merely a single inaccessible cardinal, as the latter can be modeled by V_κ for inaccessible κ, whereas the former requires an unbounded chain.[22] In the hierarchy of large cardinals, the existence of a proper class of inaccessible cardinals is equivalent to the existence of a hyper-inaccessible cardinal (also known as a 1-inaccessible or ω-inaccessible cardinal), which is itself an inaccessible cardinal that is a limit of inaccessible cardinals.[21] More generally, this fits into the α-inaccessible hierarchy, where higher levels (such as 2-inaccessible cardinals) require proper classes of lower-level inaccessibles below them.[21] A key model-theoretic observation is that if κ is a hyper-inaccessible cardinal, then the model V_κ satisfies ZFC together with the internal assertion of a proper class of inaccessible cardinals, since the inaccessible cardinals below κ form an unbounded class within V_κ.[21]

Characterizations

Model-Theoretic Characterizations

A cardinal κ\kappa is inaccessible if and only if the cumulative hierarchy up to κ\kappa, denoted VκV_\kappa, is a transitive model of ZFC. This equivalence provides a foundational model-theoretic characterization of inaccessibility. To see that inaccessibility implies VκZFCV_\kappa \models \mathrm{ZFC}, note that axioms such as extensionality, pairing, union, foundation, infinity, and choice are absolute between the universe VV and the transitive inner model VκV_\kappa, which contains all ordinals below κ\kappa. The power set axiom holds in VκV_\kappa because κ\kappa is a strong limit: for any λ<κ\lambda < \kappa, the power set P(Vλ)\mathcal{P}(V_\lambda) has cardinality 2λ<κ2^\lambda < \kappa, so P(Vλ)Vκ\mathcal{P}(V_\lambda) \in V_\kappa. For the replacement schema, suppose aVκa \in V_\kappa and a formula ϕ(x,y)\phi(x,y) such that Vκxa!yϕ(x,y)V_\kappa \models \forall x \in a \, \exists! y \, \phi(x,y). In VV, there exists a unique function F:aVF: a \to V satisfying ϕ\phi, with range b=FaVκb = F''a \subseteq V_\kappa. The ranks of elements of bb are each less than κ\kappa, and there are at most a<κ|a| < \kappa such ranks; by regularity of κ\kappa, their supremum is less than κ\kappa, so rank(b)<κ\mathrm{rank}(b) < \kappa and thus bVκb \in V_\kappa, confirming replacement in VκV_\kappa. Conversely, if VκZFCV_\kappa \models \mathrm{ZFC}, then κ\kappa must be inaccessible. Absoluteness of cofinality between VV and VκV_\kappa implies that κ\kappa is regular in VV, as VκV_\kappa satisfies that κ\kappa (its height) is a regular cardinal. For the strong limit property, consider any λ<κ\lambda < \kappa: the power set axiom in VκV_\kappa ensures P(Vλ)Vκ\mathcal{P}(V_\lambda) \in V_\kappa, so P(Vλ)=2λ<κ|\mathcal{P}(V_\lambda)| = 2^\lambda < \kappa. This bidirectional link highlights how the structural properties of VκV_\kappa encode the combinatorial features of inaccessibility. A proof sketch leveraging the reflection principle further illuminates regularity: the principle guarantees that for any formula, there are arbitrarily large α<κ\alpha < \kappa where VαV_\alpha reflects it, but to avoid cofinal subsets of κ\kappa of smaller cardinality, regularity ensures no such proper cofinal sequence exists within VκV_\kappa. Similarly, the strong limit prevents power set "overflow," as reflection combined with the limit hypothesis bounds cardinalities below κ\kappa. An alternative model-theoretic perspective identifies inaccessible cardinals as the ordinals κ\kappa such that VκZFCV_\kappa \models \mathrm{ZFC} and no smaller ordinal β<κ\beta < \kappa satisfies VβZFCV_\beta \models \mathrm{ZFC} in a collapsing manner; however, since the property VαZFCV_\alpha \models \mathrm{ZFC} holds precisely at inaccessible α\alpha, each such κ\kappa is the least upper bound in its segment without prior satisfaction, with the strong limit ensuring the hierarchy does not collapse prematurely below κ\kappa. This leastness follows from the fact that if there were a β<κ\beta < \kappa with VβZFCV_\beta \models \mathrm{ZFC}, then β\beta would be inaccessible, contradicting the minimality in the local context unless κ\kappa is the smallest overall. Connected to this is Tarski's insight on fixed points: inaccessible cardinals are fixed points of the aleph function, satisfying κ=κ\kappa = \aleph_\kappa, as regularity ensures κ\kappa is the κ\kappa-th infinite cardinal and the strong limit bounds intermediate exponentiations. This characterization extends naturally to α\alpha-inaccessible cardinals. If κ\kappa is α\alpha-inaccessible for some ordinal α\alpha, then VκZFC+thereareαmanyinaccessiblecardinals"V_\kappa \models \mathrm{ZFC} + ``\mathrm{there \, are \,} \alpha\mathrm{-many \, inaccessible \, cardinals}", because the hierarchy of lower inaccessibles below κ\kappa is reflected into VκV_\kappa via the inductive definition and the model's satisfaction of ZFC, ensuring the existence statement holds internally without exceeding the height κ\kappa.

Equivalent Formulations

An inaccessible cardinal κ\kappa can be characterized order-theoretically as an uncountable regular cardinal that is a fixed point of the beth function, satisfying κ=κ\beth_\kappa = \kappa. The beth function is defined recursively by 0=0\beth_0 = \aleph_0, α+1=2α\beth_{\alpha+1} = 2^{\beth_\alpha} for successor ordinals, and λ=supα<λα\beth_\lambda = \sup_{\alpha < \lambda} \beth_\alpha for limit ordinals λ\lambda. This fixed-point condition captures the strong limit property intrinsically through the iteration of power sets.[23] The equivalence between being a strong limit cardinal and a beth fixed point follows from transfinite induction on the beth hierarchy. If κ\kappa is a strong limit cardinal, then for every α<κ\alpha < \kappa, 2α<κ2^{\beth_\alpha} < \kappa by the definition of strong limit (since α<κ\beth_\alpha < \kappa), so α+1<κ\beth_{\alpha+1} < \kappa; at limit stages below κ\kappa, the supremum remains below κ\kappa. Thus, κ=supα<κα<κ\beth_\kappa = \sup_{\alpha < \kappa} \beth_\alpha < \kappa. But since κκ\beth_\kappa \geq \kappa (as the hierarchy includes all alephs up to at least κ\kappa if κ\kappa is a limit cardinal), equality holds. Conversely, if κ=κ\beth_\kappa = \kappa, then for any λ<κ\lambda < \kappa, λ+1=2λ2λ=λ+1<κ\beth_{\lambda+1} = 2^\lambda \leq 2^{\beth_\lambda} = \beth_{\lambda+1} < \kappa by the fixed-point property, establishing the strong limit condition.[24] Regularity admits an order-theoretic equivalent: κ\kappa is regular if and only if there exists no ordinal λ<κ\lambda < \kappa and strictly increasing cofinal function f:λκf: \lambda \to \kappa. If such an ff existed, the image would be a cofinal subset of order type λ<κ\lambda < \kappa, contradicting regularity. Conversely, if κ\kappa is singular with cof(κ)=λ<κ\mathrm{cof}(\kappa) = \lambda < \kappa, then a strictly increasing enumeration of a cofinal sequence witnesses the cofinal map. Combining this with the beth fixed-point condition yields the full order-theoretic formulation of inaccessibility.[25] A combinatorial equivalent of inaccessibility is that κ\kappa is uncountable and satisfies: for every collection of fewer than κ\kappa sets, each of cardinality less than κ\kappa, their union has cardinality less than κ\kappa; additionally, 2λ<κ2^\lambda < \kappa for all λ<κ\lambda < \kappa. The union condition is equivalent to regularity, as a counterexample would provide a cover by fewer than κ\kappa smaller sets reaching size κ\kappa, implying singular cofinality. The power set condition directly encodes the strong limit property in combinatorial terms, avoiding explicit reference to the beth hierarchy.[26] Inaccessible cardinals relate to weakly compact cardinals in the large cardinal hierarchy: every weakly compact cardinal is inaccessible, but the converse fails, as weak compactness requires additional combinatorial principles like the tree property or partition relations (e.g., κ(κ)22\kappa \to (\kappa)^2_2). Inaccessibles form a proper initial segment below weakly compacts, with the least weakly compact (if existent) exceeding the least inaccessible.[27] Historical variants include characterizations using generalized indescribability properties on structures like Pκλ\mathcal{P}_\kappa \lambda, where inaccessibility emerges as a base case for the Π01\Pi^1_0-indescribability hierarchy, though full indescribability typically strengthens to weakly compact or beyond. These formulations, developed in the 1970s, emphasize descriptive set-theoretic analogs for higher cardinals.[28]
User Avatar
No comments yet.