Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Inaccessible cardinal
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Type of infinite number in set theory}} {{use dmy dates|date=June 2020}} In [[set theory]], a [[cardinal number]] is a '''strongly inaccessible cardinal''' if it is [[uncountable set|uncountable]], [[regular cardinal|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 has meant "weakly inaccessible cardinal". Weakly inaccessible cardinals were introduced by {{harvtxt|Hausdorff|1908}}. Strongly inaccessible cardinals were introduced by {{harvtxt|Sierpiński|Tarski|1930}} and {{harvtxt|Zermelo|1930}}; in the latter they were referred to along with <math>\aleph_0</math> as ''Grenzzahlen'' ([[English language|English]] "limit numbers").<ref>A. Kanamori, "[https://math.bu.edu/people/aki/10.pdf Zermelo and Set Theory]", p.526. Bulletin of Symbolic Logic vol. 10, no. 4 (2004). Accessed 21 August 2023.</ref> 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 <math>\kappa</math> describe a cardinality <math>\kappa</math> which can not be obtained as the cardinality of a result of typical set-theoretic operations involving only sets of cardinality less than <math>\kappa</math>. 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<ref>{{Cite web |last=Joel |first=Hamkins |date=2022-12-24 |title=Does anyone still seriously doubt the consistency of ZFC? |url=https://mathoverflow.net/questions/437195/does-anyone-still-seriously-doubt-the-consistency-of-zfc |publisher=[[MathOverflow]]}}</ref>. On the other hand, it also believed that there are models of ZFC for which even strongly inaccessible cardinals <em>do</em> exist. That ZFC can accommodate these large sets, but does not necessitate them, provides an introduction to the [[large cardinal|large cardinal axioms]]. See also [[#Models and consistency|Models and consistency]]. The existence of a strongly inaccessible cardinal is equivalent to the existence of a [[Grothendieck universe]]. If <math>\kappa</math> is a strongly inaccessible cardinal then the [[Von Neumann universe|von Neumann stage]] <math>V_{\kappa}</math> is a Grothendieck universe. Conversely, if <math>U</math> is a Grothendieck universe then there is a strongly inaccessible cardinal <math>\kappa</math> such that <math>V_{\kappa}=U</math>. As expected from their correspondence with strongly inaccessible cardinals, Grothendieck universes are very well-closed under set-theoretic operations. An [[ordinal number|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.) From some perspectives, the requirement that a weakly or strongly inaccessible cardinal be uncountable is unnatural or unnecessary. Even though {{tmath|\aleph_0}} is countable, it is regular and is a strong limit cardinal. {{tmath|\aleph_0}} 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 {{tmath|\kappa}} larger than {{tmath|\aleph_0}} is necessarily uncountable, if {{tmath|\kappa}} is also regular and a weak limit cardinal then {{tmath|\kappa}} must be a weakly inaccessible cardinal. == Models and consistency == Suppose that <math>\kappa</math> is a cardinal number. [[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 theory|model]] of ZFC whenever <math>\kappa</math> is strongly inaccessible. Furthermore, ZF implies that the [[Gödel's constructible universe|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]]; # <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 Δ<sub>0</sub>-definable subsets of ''X'' (see [[constructible universe]]). It is worth pointing out that the first claim can be weakened: <math>\kappa</math> does not need to be inaccessible, or even a cardinal number, in order for {{math|<math>V</math><sub><math>\kappa</math></sub>}} to be a standard model of ZF (see [[Inaccessible cardinal#Two model-theoretic characterisations of inaccessibility|below]]). Suppose <math>V</math> is a model of ZFC. Either <math>V</math> 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|V}} 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|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== 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 [[Jean-Louis Verdier|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 [[urelement]]s). This axiomatic system is useful to prove for example that every [[category (mathematics)|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 ''ψ''<sub>0</sub>(''λ'') the ''λ''<sup>th</sup> inaccessible cardinal, then the fixed points of ''ψ''<sub>0</sub> are the 1-inaccessible cardinals. Then letting ''ψ''<sub>''β''</sub>(''λ'') be the ''λ''<sup>th</sup> ''β''-inaccessible cardinal, the fixed points of ''ψ''<sub>''β''</sub> are the (''β''+1)-inaccessible cardinals (the values ''ψ''<sub>''β''+1</sub>(''λ'')). If ''α'' is a limit ordinal, an ''α''-inaccessible is a fixed point of every ''ψ''<sub>''β''</sub> for ''β'' < ''α'' (the value ''ψ''<sub>''α''</sub>(''λ'') is the ''λ''<sup>th</sup> such cardinal). This process of taking fixed points of functions generating successively larger cardinals is commonly encountered in the study of [[List of large cardinal properties|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|{{var|κ}}+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 {{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 cardinal]]s 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 principle|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 [[Club set|closed unbounded]] in {{mvar|κ}}.) Therefore, <math>\kappa</math> is <math>\Pi_n^0</math>-[[Totally indescribable cardinal|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.<ref>A. Enayat, "Analogues of the MacDowell-Specker_theorem for set theory" (2020), p.10. Accessed 9 March 2024.</ref> It is provable in ZF that <math>V</math> has 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 undefinability theorem|Tarski's theorem]]. Secondly, under ZFC [[Zermelo's categoricity theorem]] can be shown, which states that <math>\kappa</math> is inaccessible if and only if <math>(V_\kappa,\in)</math> is a model of [[Second order logic|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 logic|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>,<ref>K. Hauser, "Indescribable cardinals and elementary embeddings". Journal of Symbolic Logic vol. 56, iss. 2 (1991), pp.439--457.</ref> 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>.<ref>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)</ref> ==See also== * [[Worldly cardinal]], a weaker notion * [[Mahlo cardinal]], a stronger notion * [[Club set]] * [[Inner model]] * [[Von Neumann universe]] * [[Constructible universe]] == Works cited == {{refbegin}} *{{Citation| title = Set Theory: An Introduction to Large Cardinals | last = Drake | first = F. R. | year = 1974 | publisher = Elsevier Science | volume = 76 | series = Studies in Logic and the Foundations of Mathematics | isbn = 0-444-10535-2 }} *{{Citation| title = Grundzüge einer Theorie der geordneten Mengen | last = Hausdorff | first = Felix | year = 1908 | author-link = Felix Hausdorff | journal = [[Mathematische Annalen]] | volume = 65 | issue = 4 | pages = 435–505 | url = https://gdz.sub.uni-goettingen.de/id/PPN235181684_0065?tify={%22pages%22:[453]} | doi = 10.1007/BF01451165 | hdl = 10338.dmlcz/100813 | s2cid = 119648544 | issn = 0025-5831 | hdl-access = free }} *{{Citation| title = Introduction to set theory | edition = 3rd | last1 = Hrbáček | first1 = Karel | last2 = Jech | first2 = Thomas | author1-link = Karel Hrbáček | author2-link = Thomas Jech | year = 1999 | publisher = Dekker | location = New York | isbn = 978-0-8247-7915-3 }} *{{Citation| title = The Higher Infinite: Large Cardinals in Set Theory from Their Beginnings | title-link = The Higher Infinite | edition = 2nd | last = Kanamori | first = Akihiro | year = 2003 | author-link = Akihiro Kanamori | publisher = Springer | isbn = 3-540-00384-3 }} *{{Citation| title = Sur une propriété caractéristique des nombres inaccessibles | last1 = Sierpiński | first1 = Wacław | last2 = Tarski | first2 = Alfred | author1-link = Wacław Sierpiński | author2-link = Alfred Tarski | journal = [[Fundamenta Mathematicae]] | year = 1930 | volume = 15 | pages = 292–300 | doi = 10.4064/fm-15-1-292-300 | url = http://matwbn.icm.edu.pl/ksiazki/fm/fm15/fm15129.pdf | issn = 0016-2736 }} *{{Citation| title = Über Grenzzahlen und Mengenbereiche: neue Untersuchungen über die Grundlagen der Mengenlehre | last = Zermelo | first = Ernst | year = 1930 | author-link = Ernst Zermelo | journal = [[Fundamenta Mathematicae]] | volume = 16 | pages = 29–47 | doi = 10.4064/fm-16-1-29-47 | url = http://matwbn.icm.edu.pl/ksiazki/fm/fm16/fm1615.pdf | issn = 0016-2736 }}. English translation: {{Citation| chapter = On boundary numbers and domains of sets: new investigations in the foundations of set theory | last = Ewald | first = William B. | year = 1996 | title = From Immanuel Kant to David Hilbert: A Source Book in the Foundations of Mathematics | publisher = Oxford University Press | pages = 1208–1233 | isbn = 978-0-19-853271-2 }}. {{refend}} {{Mathematical logic}} ==References== {{Reflist}} [[Category:Large cardinals]]
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)
Pages transcluded onto the current version of this page
(
help
)
:
Template:Citation
(
edit
)
Template:Cite web
(
edit
)
Template:Harvtxt
(
edit
)
Template:Math
(
edit
)
Template:Mathematical logic
(
edit
)
Template:Mvar
(
edit
)
Template:Refbegin
(
edit
)
Template:Refend
(
edit
)
Template:Reflist
(
edit
)
Template:Short description
(
edit
)
Template:Tmath
(
edit
)
Template:Use dmy dates
(
edit
)