Inaccessible Cardinal
   HOME

TheInfoList



OR:

In
set theory Set theory is the branch of mathematical logic that studies 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 mathematics, is mostly concer ...
, an uncountable cardinal is inaccessible if it cannot be obtained from smaller cardinals by the usual operations of cardinal arithmetic. More precisely, a cardinal is strongly inaccessible if it is uncountable, it is not a sum of fewer than cardinals smaller than , and \alpha < \kappa implies 2^ < \kappa. 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 The term regular can mean normal or in accordance with rules. It may refer to: People * Moses Regular (born 1971), America football player Arts, entertainment, and media Music * "Regular" (Badfinger song) * Regular tunings of stringed instrum ...
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 is strongly inaccessible). Weakly inaccessible cardinals were introduced by , and strongly inaccessible ones by and . Every strongly inaccessible cardinal is also weakly inaccessible, as every strong limit cardinal is also a weak limit cardinal. If the
generalized continuum hypothesis In mathematics, the continuum hypothesis (abbreviated CH) is a hypothesis about the possible sizes of infinite sets. It states that or equivalently, that In Zermelo–Fraenkel set theory with the axiom of choice (ZFC), this is equivalent t ...
holds, then a cardinal is strongly inaccessible if and only if it is weakly inaccessible. ( aleph-null) is a regular strong limit cardinal. Assuming the
axiom of choice In mathematics, the axiom of choice, or AC, is an axiom of set theory equivalent to the statement that ''a Cartesian product of a collection of non-empty sets is non-empty''. Informally put, the axiom of choice says that given any collection ...
, 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 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 \kappath level of the Von Neumann universe V_\kappa is a model of ZFC whenever \kappa is strongly inaccessible. And ZF implies that the Gödel universe L_\kappa is a model of ZFC whenever \kappa 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 In the mathematical field of set theory, a large cardinal property is a certain kind of property of transfinite cardinal numbers. Cardinals with such properties are, as the name suggests, generally very "large" (for example, bigger than the least ...
. If V is a standard model of ZFC and \kappa is an inaccessible in V, then: V_\kappa is one of the intended models of Zermelo–Fraenkel set theory; and Def(V_\kappa) is one of the intended models of Mendelson's version of
Von Neumann–Bernays–Gödel set theory In the foundations of mathematics, von Neumann–Bernays–Gödel set theory (NBG) is an axiomatic set theory that is a conservative extension of Zermelo–Fraenkel–choice set theory (ZFC). NBG introduces the notion of class, which is a coll ...
which excludes global choice, replacing limitation of size by replacement and ordinary choice; and V_ is one of the intended models of Morse–Kelley set theory. Here Def(X) is the set of Δ0 definable subsets of ''X'' (see
constructible universe In mathematics, in set theory, the constructible universe (or Gödel's constructible universe), denoted by , is a particular class of sets that can be described entirely in terms of simpler sets. is the union of the constructible hierarchy . It ...
). However, \kappa does not need to be inaccessible, or even a cardinal number, in order for to be a standard model of ZF (see
below Below may refer to: *Earth * Ground (disambiguation) * Soil * Floor * Bottom (disambiguation) * Less than *Temperatures below freezing * Hell or underworld People with the surname * Ernst von Below (1863–1955), German World War I general * Fr ...
). Suppose V is a model of ZFC. Either V contains no strong inaccessible or, taking \kappa to be the smallest strong inaccessible in V, V_\kappa 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 contains no weak inaccessible or, taking \kappa to be the smallest ordinal which is weakly inaccessible relative to any standard sub-model of V, then L_\kappa 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 , 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 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 Category, plural categories, may refer to: Philosophy and general uses *Categorization, categories in cognitive science, information science and generally * Category of being * ''Categories'' (Aristotle) * Category (Kant) * Categories (Peirce) ...
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 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 -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

Firstly, a cardinal is inaccessible if and only if has the following reflection property: for all subsets U\subset V_\kappa, there exists \alpha<\kappa such that (V_\alpha,\in,U\cap V_\alpha) is an elementary substructure of (V_\kappa,\in,U). (In fact, the set of such ''α'' is closed unbounded in .) Equivalently, \kappa is \Pi_n^0- indescribable for all ''n'' ≥ 0. It is provable in ZF that ∞ satisfies a somewhat weaker reflection property, where the substructure (V_\alpha,\in,U\cap V_\alpha) 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. \vDash_V) cannot, due to Tarski's theorem. Secondly, under ZFC it can be shown that \kappa is inaccessible if and only if (V_\kappa,\in) is a model of second order ZFC. In this case, by the reflection property above, there exists \alpha<\kappa such that (V_\alpha,\in) is a standard model of (
first order In mathematics and other formal sciences, first-order or first order most often means either: * "linear" (a polynomial of degree at most one), as in first-order approximation and other calculus uses, where it is contrasted with "polynomials of high ...
) ZFC. Hence, the existence of an inaccessible cardinal is a stronger hypothesis than the existence of a transitive model of ZFC.


See also

*
Worldly cardinal In mathematical set theory, a worldly cardinal is a cardinal κ such that the rank ''V''κ is a model of Zermelo–Fraenkel set theory. Relationship to inaccessible cardinals By Zermelo's theorem on inaccessible cardinals, every inaccessible c ...
, a weaker notion * Mahlo cardinal, a stronger notion * Club set *
Inner model In set theory, a branch of mathematical logic, an inner model for a theory ''T'' is a substructure of a model ''M'' of a set theory that is both a model for ''T'' and contains all the ordinals of ''M''. Definition Let L = \langle \in \rangle b ...
* Von Neumann universe *
Constructible universe In mathematics, in set theory, the constructible universe (or Gödel's constructible universe), denoted by , is a particular class of sets that can be described entirely in terms of simpler sets. is the union of the constructible hierarchy . It ...


Works cited

* * * * * *. English translation: . {{Mathematical logic Large cardinals