The existence of inaccessible cardinals ensures that the von-Neumann hierarchy is “long enough” for α to eventually “catch up” with the cardinality of Vα.
Recall the enumeration of all cardinals by means of the ℵ-sequence:
ℵ0=ω,ℵα+1=ℵα+,ℵλ=sup{ℵξ:ξ<λ} for limit λ.
Here κ+ is the least cardinal >κ. Some cardinals are limits of short sequences of cardinals -- for example,
ℵω=nlimℵn
is uncountable, but a limit of a countable sequence of smaller cardinals. Generally, cardinals who are a limit of a sequence of cardinals of length smaller than their cardinality are called singular. Non-singular cardinals are called regular:
reg(κ):⟺∀α<κ∀f(f:α→κ→ξ<αsupf(ξ)<κ).
In other words, a regular cardinal κ cannot be reached by less then κ-many steps. The first example of a regular cardinal is ℵ0.
On the other hand,
ℵω,ℵω+ω,ℵℵω,ℵℵℵω,…
are singular and this suggests the question:
Are there regular cardinals of the form ℵλ with λ limit?
This is captured by the notion of inaccessibility.
Under the Generalized Continuum Hypothesis,
(GCH)∀α2ℵα=ℵα+
weakly and strongly inaccessible cardinals coincide.
If κ>ω is inaccessible, then κ=ℵκ. Moreover, we have
Proof
It suffices to show that ∣Vα∣<κ for all α<κ. This follows by a straightforward induction, using the fact that κ is strongly inaccessible.
This in turn implies we can bound the cardinality of elements of Vκ.
We have already seen that for limit α>ω, Vα is a model of all ZFC axioms except Replacement.
Proof
We verify that Vκ satisfies the axiom of Replacement.
Suppose x∈Vκ and f:x→Vκ is a function. Then f[x]⊆Vκ, and by Proposition 2, ∣f[x]∣≤∣x∣<κ. Applying the other direction of Proposition 2 to f[x], we obtain f[x]∈Vκ, as desired.
Suppose an inaccessible cardinal exists, and let κ be the least inaccessible. It is not hard to verify that
Vκ⊨ZFC+“there does not exist an inaccessible cardinal”.
(You verify that being a inaccessible cardinal is absolute for Vκ.) Therefore, the existence of an inaccessible cardinal is not provable from ZFC. This fact also follows from Gödel’s second incompleteness theorem.
We have seen that (assuming the Axiom of Choice) there subsets of R that are not Lebesgue measurable. Inspecting the proof, we see that we only use the following properties of Lebesgue measure:
σ-additivity,
translation invariance (λ(A)=λ(A+r)),
λ(A)>0 for some A.
For spaces without an additive structures, instead of translation invariance, we can consider a non-triviality condition:
(M3) if (Ai)i<ω is a countable sequence of disjoint sets ⊆M, then
m(i<ω⋃Ai)=i<ω∑m(Ai)
The structure of the set M does not play any role here, so we can replace it by a cardinal κ outright. One can also consider strengthening σ-additivity to κ-additivity:
If γ<κ and (Aξ)ξ<γ is a sequence of disjoint subsets of κ, then
m(ξ<γ⋃Aξ)=ξ<γ∑m(Aξ).
A transfinite sum ∑ξ<γ is given as the supremum of all sums over finite subsequences:
A measure m is two-valued if it only assumes the values 0 and 1. In this case the corresponding filter Fm is an ultrafilter (and Im is a prime ideal).
Conversely, if U is ω1-complete, non-principal ultrafilter on κ, we can define a two-valued measure m:P(κ)→{0,1} on κ by letting
In the following, we will see that measurability implies inaccessibility.
Proof
Since U is non-principal, no singleton set {x} can be in U (for this would imply κ∖{x}∈/U and therefore no subset of it would be in U either, contradicting the non-principality of U).
If X∈U and ∣X∣<κ, then X is the union of <κ many singletons. Since ¬U is a κ-complete prime ideal, this implies X∈¬U, contradiction.
Proof
If κ were singular, it would be the union of <κ-many sets of cardinality <κ. Applying Lemma 1 leads to a contradiction.
Proof
By Proposition 3, any measurable cardinal is regular. Assume for a contradiction there exists γ<κ with 2γ≥κ. As 2γ≥κ, there exists a set S of functions f:γ→{0,1} with ∣S∣=κ. Let U be a κ-complete, non-principal ultrafilter on S.
Another concept of largeness is related to the existence of large homogeneous sets for partitions.
For given set S and n∈N, let
[S]n:={X⊆S:∣X∣=n}
be the set of all n-element subsets of S. For cardinals κ,λ, we define
κ→(λ)kn
to mean that any partition F:[S]n→{1,…,k} with ∣S∣=κ has an F-homogeneous subset of cardinality λ, that is, a set H, ∣H∣=λ, such that
F∣[H]n≡ constant.
Ramsey’s theorem (1929/39) says that for any n,k∈N,
ℵ0→(ℵ0)kn.
Do there exist uncountable cardinals with similar properties?
A cardinal κ is weakly compact if it is uncountable and κ→(κ)22 holds.
Measurable cardinals have even stronger homogeneity properties. Let [S]<ω be the set of all finite subsets of S. If F:[S]<ω→I is a partition, then H⊆S is F-homogenenous if
F∣[H]n≡ constant
for all n∈N.
In general, any cardinal that satisfies the statement of the theorem is called Ramsey.
To prove Theorem 4, we introduce normal ultrafilters.
Let us assume as a convention that a filter on a cardinal κ always contains the end-segments {ξ:α≤ξ<κ}.
Proof (Rowbottom’s Theorem)
Let U be a normal filter over κ.
We show that for every n, for any g:[κ]n→γ with γ<κ, there is a set Hn∈U such that g↾[Hn]n≡const. The intersection of the Hn is again in U and satisfies the statement of the the theorem.
We proceed by induction. The case n=1 follows from the κ-completeness of U. Now assume g:[κ]n+1→γ, with γ<κ.