A strongly inaccessible cardinal is an uncountable regular cardinal that is also a strong limit cardinal:
A theory is -satisfiable when every subtheory of size below has a model. An uncountable cardinal is weakly compact when every -satisfiable theory in an infinitary language with at most nonlogical symbols is satisfiable.
Equivalently, : every coloring has a homogeneous subset of cardinality .
A filter is -complete when intersections of fewer than members remain in . An uncountable cardinal is a measurable cardinal when it carries a -complete nonprincipal ultrafilter.
An uncountable cardinal is a strongly compact cardinal when every -satisfiable theory in any language is satisfiable. Unlike weak compactness, there is no cardinality bound on the language.
Let witness that is measurable. Regularity is given, so it remains to prove the strong limit cardinal property. First, every has cardinality : if , then
by nonprincipality and -completeness, contradicting .
Suppose and . Choose an injection . For each , exactly one of
lies in . Their chosen intersection lies in by -completeness. On that intersection every is the same subset of , contradicting injectivity because every member of has size . Thus , and is strongly inaccessible.
Let be a -complete filter on . Use an propositional language with a sentence for every . Form a theory containing for , the Boolean identities
and, for every ,
Every subtheory of size below mentions fewer than required members of . Their intersection is nonempty by -completeness; choosing a point in it and interpreting as membership of that point satisfies the subtheory. The theory is therefore -satisfiable. Strong compactness supplies a model. Then
is an ultrafilter, contains , and is -complete by the infinitary intersection axioms.
For regular , the cobounded filter on a regular cardinal is -complete. Part (c) extends it to a -complete ultrafilter . Since is cobounded for every , no singleton belongs to ; hence is nonprincipal. Thus every strongly compact cardinal is measurable.
Let be inaccessible and let be an elementary embedding into a transitive set with critical point . It is -strong when
A formula is a beta-stable cardinal property when it is absolute between the universe and every transitive set containing .
To say that the embedding reflects such a property means that whenever holds,
is unbounded in : for every there is such a with . Indeed, stability gives , so sees the witness between and . Elementarity reflects a witness between and . This is reflection by a beta-strong embedding.
The standard closure lemma for the ultrapower embedding says that every -sequence of members of which belongs to is itself in . If , choose in a surjection
All ordinal values of belong to the transitive model , so closure gives . Therefore
and does not regard as a cardinal.
Every ordinal below
has an ultrapower representative : by Łoś theorem, a representative below the successor of may be chosen below on a set in the ultrafilter. Hence, in ,
The ultrapower is closed under -sequences, so it contains every subset of and computes correctly. By elementarity regards as measurable, hence strongly inaccessible by Question 1(b). Consequently
Thus has a set of cardinality at most whose order type is , so
Let
be the supremum of the Kunen critical sequence, and put
The required choices are
Indeed has rank , so , while the Kunen lemma gives once the domain contains the omega-Jonsson function required by the proof, which is ensured by .
Let . Every term of the critical sequence is below . If , then its countable supremum also satisfies , and because is a limit ordinal,
Apply the Kunen lemma to the restriction available inside . It gives
which is impossible because . Hence . A nonzero limit ordinal has infinite cofinality, so

Articles by others on the same topic (0)

There are currently no matching articles.