Английская Википедия:Inaccessible cardinal
Шаблон:Short description Шаблон:Use dmy dates In set theory, an uncountable cardinal is inaccessible if it cannot be obtained from smaller cardinals by the usual operations of cardinal arithmetic. More precisely, a cardinal Шаблон:Mvar is strongly inaccessible if it satisfies the following three conditions: it is uncountable, it is not a sum of fewer than Шаблон:Mvar cardinals smaller than Шаблон:Mvar, and <math>\alpha < \kappa</math> implies <math>2^{\alpha} < \kappa</math>.
The term "inaccessible cardinal" is ambiguous. Until about 1950, it meant "weakly inaccessible cardinal", but since then it usually means "strongly inaccessible cardinal". An uncountable cardinal is weakly inaccessible if it is a regular weak limit cardinal. It is strongly inaccessible, or just inaccessible, if it is a regular strong limit cardinal (this is equivalent to the definition given above). Some authors do not require weakly and strongly inaccessible cardinals to be uncountable (in which case Шаблон:Tmath is strongly inaccessible). Weakly inaccessible cardinals were introduced by Шаблон:Harvtxt, and strongly inaccessible ones by Шаблон:Harvtxt and Шаблон:Harvtxt, in the latter they were referred to along with <math>\aleph_0</math> as Grenzzahlen.[1]
Every strongly inaccessible cardinal is also weakly inaccessible, as every strong limit cardinal is also a weak limit cardinal. If the generalized continuum hypothesis holds, then a cardinal is strongly inaccessible if and only if it is weakly inaccessible.
Шаблон:Tmath (aleph-null) is a regular strong limit cardinal. Assuming the axiom of choice, every other infinite cardinal number is regular or a (weak) limit. However, only a rather large cardinal number can be both and thus weakly inaccessible.
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 Шаблон:Mvar are regular ordinals, but not limits of regular ordinals.) A cardinal which is weakly inaccessible and also a strong limit cardinal is strongly inaccessible.
The assumption of the existence of a strongly inaccessible cardinal is sometimes applied in the form of the assumption that one can work inside a Grothendieck universe, the two ideas being intimately connected.
Models and consistency
Zermelo–Fraenkel set theory with Choice (ZFC) implies that the <math>\kappa</math>th level of the Von Neumann universe <math>V_\kappa</math> is a model of ZFC whenever <math>\kappa</math> is strongly inaccessible. And ZF implies that the Gödel universe <math>L_\kappa</math> is a model of ZFC whenever <math>\kappa</math> 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 <math>V</math> is a standard model of ZFC and <math>\kappa</math> is an inaccessible in <math>V</math>, then: <math>V_\kappa</math> is one of the intended models of Zermelo–Fraenkel set theory; and <math>Def(V_\kappa)</math> 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; and <math>V_{\kappa+1}</math> is one of the intended models of Morse–Kelley set theory. Here <math>Def(X)</math> is the set of Δ0 definable subsets of X (see constructible universe). However, <math>\kappa</math> does not need to be inaccessible, or even a cardinal number, in order for Шаблон:Math to be a standard model of ZF (see below).
Suppose <math>V</math> is a model of ZFC. Either V contains no strong inaccessible or, taking <math>\kappa</math> to be the smallest strong inaccessible in <math>V</math>, <math>V_\kappa</math> 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 Шаблон:Mvar contains no weak inaccessible or, taking <math>\kappa</math> to be the smallest ordinal which is weakly inaccessible relative to any standard sub-model of <math>V</math>, then <math>L_\kappa</math> 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 Шаблон:Harvtxt, 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
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 Шаблон:Mvar which is strictly larger, Шаблон:Math. 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
The term "α-inaccessible cardinal" is ambiguous and different authors use inequivalent definitions. One definition is that a cardinal Шаблон:Mvar is called α-inaccessible, for any ordinal α, if Шаблон:Mvar is inaccessible and for every ordinal β < α, the set of β-inaccessibles less than Шаблон:Mvar is unbounded in Шаблон:Mvar (and thus of cardinality Шаблон:Mvar, since Шаблон:Mvar is regular). In this case the 0-inaccessible cardinals are the same as strongly inaccessible cardinals. Another possible definition is that a cardinal Шаблон:Mvar is called α-weakly inaccessible if Шаблон:Mvar is regular and for every ordinal β < α, the set of β-weakly inaccessibles less than Шаблон:Mvar 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 Шаблон:Mvar is Шаблон:Mvar-inaccessible. (It can never be Шаблон:Math-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 Шаблон:Mvar is α-hyper-inaccessible if and only if Шаблон:Mvar is hyper-inaccessible and for every ordinal β < α, the set of β-hyper-inaccessibles less than Шаблон:Mvar is unbounded in Шаблон:Mvar.
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
Firstly, a cardinal Шаблон:Mvar is inaccessible if and only if Шаблон:Mvar has the following reflection property: for all subsets <math>U\subset V_\kappa</math>, there exists <math>\alpha<\kappa</math> such that <math>(V_\alpha,\in,U\cap V_\alpha)</math> is an elementary substructure of <math>(V_\kappa,\in,U)</math>. (In fact, the set of such α is closed unbounded in Шаблон:Mvar.) Therefore, <math>\kappa</math> is <math>\Pi_n^0</math>-indescribable for all n ≥ 0. On the other hand, there is not necessarily an ordinal <math>\alpha>\kappa</math> such that <math>V_\kappa</math>, and if this holds, then <math>\kappa</math> must be the <math>\kappa</math>th inaccessible cardinal.[2]
It is provable in ZF that ∞ satisfies a somewhat weaker reflection property, where the substructure <math>(V_\alpha,\in,U\cap V_\alpha)</math> 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 Шаблон:Math can be defined, semantic truth itself (i.e. <math>\vDash_V</math>) cannot, due to Tarski's theorem.
Secondly, under ZFC it can be shown that <math>\kappa</math> is inaccessible if and only if <math>(V_\kappa,\in)</math> is a model of second order ZFC.
In this case, by the reflection property above, there exists <math>\alpha<\kappa</math> such that <math>(V_\alpha,\in)</math> 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 <math>\kappa</math> is a <math>\Pi^1_1</math> property over <math>V_\kappa</math>,[3] while a cardinal <math>\pi</math> being inaccessible (in some given model of <math>\mathrm{ZF}</math> containing <math>\pi</math>) is <math>\Pi_1</math>.[4]
See also
- Worldly cardinal, a weaker notion
- Mahlo cardinal, a stronger notion
- Club set
- Inner model
- Von Neumann universe
- Constructible universe
Works cited
- Шаблон:Citation
- Шаблон:Citation
- Шаблон:Citation
- Шаблон:Citation
- Шаблон:Citation
- Шаблон:Citation. English translation: Шаблон:Citation.
References
- ↑ A. Kanamori, "Zermelo and Set Theory", p.526. Bulletin of Symbolic Logic vol. 10, no. 4 (2004). Accessed 21 August 2023.
- ↑ A> Enayat, "Analogues of the MacDowell-Specker_theorem for set theory" (2020), p.10. Accessed 9 March 2024.
- ↑ K. Hauser, "Indescribable cardinals and elementary embeddings". Journal of Symbolic Logic vol. 56, iss. 2 (1991), pp.439--457.
- ↑ K. J. Devlin, "Indescribability Properties and Small Large Cardinals" (1974). In <math>\vDash</math>ISILC Logic Conference: Proceedings of the International Summer Institute and Logic Colloquium, Kiel 1974, Lecture Notes in Mathematics, vol. 499 (1974)