One-strong cardinal 2026-09-28
A cardinal is 1-strong when it is the critical point of an elementary embedding into a transitive model satisfying .
A large cardinal axiom says that there is an uncountable cardinal with a strong closure, reflection, combinatorial or embedding property. Its interest is not merely the magnitude of the cardinal: it packages a universe-like portion of set theory, or a coherent way of comparing the universe with a proper inner model. Such axioms form a hierarchy extending ordinary ZFC, compared through relative consistency implications. The consistency qualifications are essential; an existence axiom is not a theorem of ZFC simply because its consequences are attractive.
The basic example is a strongly inaccessible cardinal: an uncountable regular cardinal which is a strong limit cardinal, so
These conditions imply for every . Prove this by induction along the cumulative hierarchy: the successor step uses the strong-limit property, and a limit step uses regularity to bound a union of fewer than smaller sets. Thus every member of has cardinality below .
Consequently is a transitive model of ZFC. Pairing, union, power set, separation, axiom of infinity and foundation stay within the hierarchy. For replacement, a definable function on has fewer than values; regularity bounds their ranks below , putting the range in . Ambient choice supplies a choice function for a family in , and its graph also has bounded rank. This verifies the substantial closure axiom rather than only saying that the rank is large. It also shows why inaccessible existence cannot be proved in a consistent ZFC: it would yield a set first-order model of ZFC and hence its consistency, contrary to the Gödel second incompleteness theorem.
An uncountable regular limit cardinal is a weakly inaccessible cardinal; requiring the strong-limit inequality is stronger without additional hypotheses. Under GCH, every smaller infinite cardinal satisfies , so the two notions coincide. This distinction separates cardinal-arithmetic assumptions from the regularity requirement.
A Mahlo cardinal is an inaccessible whose inaccessible cardinals below it form a stationary set. Thus every club set meets those inaccessibles, which strengthens mere unboundedness. There are inaccessible ; is a first-order model of ZFC containing an inaccessible . Mahloness therefore supplies a consistency statement stronger than the bare existence of one inaccessible. Iterating the demand that smaller cardinals have the same reflection property leads to further levels of the hierarchy.
A weakly compact cardinal is a logical and combinatorial strengthening of inaccessibility. One standard characterization is an inaccessible with
every two-colouring of pairs has a homogeneous subset of size . Equivalently one can use compactness for theories of size at most , or the tree property at an inaccessible. These viewpoints explain the terminology: a local collection of compatible requirements has a global realization, and tall narrow trees cannot avoid cofinal branches. They are characterization statements; the elementary closure and measure arguments below are separate proofs of the consequences used here.
A measurable cardinal carries a nonprincipal kappa-complete ultrafilter on . Every set of size less than is -null, since it is a union of fewer than null singletons. Such a cardinal is regular: a cofinal sequence of length would partition into bounded, hence null, pieces; completeness would make their union null, an impossibility.
It is also strong limit. If and there were distinct sets for , choose for each the -large side of the partition according to whether . The intersection of these fewer than large sides belongs to , but all its indices designate the same subset of , so it has at most one member. This contradicts nonprincipality. Hence , proving that every measurable cardinal is inaccessible.
The measure gives an ultrapower embedding. Form equivalence classes of functions under equality on a -large set, with membership defined coordinatewise modulo . Induction on first-order formulas proves elementarity: Boolean operations use the ultrafilter laws, and the existential step chooses coordinate witnesses on a large set. Countable completeness makes the ultrapower well-founded. An infinite descending membership chain would give countably many large coordinate conditions; their intersection would produce an actual infinite membership descent in . Collapse the ultrapower to a transitive class , obtaining .
For , every function into is constant on a large set by completeness; induction shows . The class of the identity function is larger than every such constant ordinal and lies below , so . Thus the critical point of an elementary embedding is . The measure viewpoint has become a precise self-similarity principle for the universe.
A supercompact cardinal imposes arbitrarily strong closure on these embeddings: for every there is with critical point , , and . It implies measurability by the derived ultrafilter
Elementarity makes this an ultrafilter; fixed ordinals below show that singletons are null. For , fixes the indexing length, so it carries an intersection of sets to the intersection of their images. If all these images contain , so does their intersection, proving -completeness.
These examples illustrate three connected uses of large cardinals: obtaining set first-order models and stronger consistency statements, extending finite or countable compactness and partition phenomena to uncountable domains, and constructing elementary embeddings with controlled closure. They also interact with inner models: an inaccessible remains inaccessible in the constructible universe, since it cannot acquire a new short cofinal sequence there and there are fewer subsets of smaller ordinals. A measurable cardinal's measure need not belong to that inner model, so preservation of the stronger property is a different issue. Large cardinal axioms are thus structured additional hypotheses, with carefully distinguishable consequences and relative-consistency claims, rather than a single claim that sufficiently big cardinals exist.
A measurable cardinal is an uncountable cardinal carrying a kappa-complete nonprincipal ultrafilter on . An elementary embedding preserves all first-order formulas with parameters:
For a measurable , the Łoś theorem gives an elementary map from the universe into its ultrapower. Countable completeness makes that ultrapower well founded, so the Mostowski collapse gives a transitive target and an ultrapower embedding . The least moved ordinal, its critical point of an elementary embedding, is : every function into an ordinal below is constant on a -large set by kappa-completeness, whereas the identity function on represents an ordinal above every constant ordinal below and below the image of . Conversely a suitably available embedding with critical point defines the measure .
The identity is elementary. In ZFC there is no nonidentity elementary class embedding , by the Kunen inconsistency theorem. Here the embedding is a class for which restrictions to sets and the critical sequence are available, as in the usual class-theoretic formulation. The axiom of choice is part of this conclusion; it is not a claimed contradiction for the choice-free Reinhardt-cardinal hypothesis.
Here is the stationary-set proof. A nonidentity has a least moved ordinal ; if all ordinals were fixed, induction on rank would fix every set. Put , and . Since fixes and shifts this sequence, . It therefore fixes the regular successor cardinal . The stationarity of ordinals of prescribed cofinality gives the stationary set
Use the stationary partition at a successor cardinal to split into disjoint stationary pieces , merging pieces if necessary. Applying gives a partition of the same into stationary pieces. The additional piece is stationary.
The closure points
form a club set. For unboundedness, repeatedly close a bound under the values of below it and take the supremum of the resulting countable sequence; regularity of keeps it below . Closure under limits is immediate. Choose and an increasing sequence cofinal in . Then
while every ordinal satisfies , so . There is an with . Since , elementarity gives , contrary to disjointness from .
A measurable cardinal is an uncountable cardinal carrying a nonprincipal ultrafilter on that is -complete: intersections of fewer than members of remain in . An elementary embedding preserves truth of every first-order formula, with its parameters carried along by .
The identity is always an elementary embedding of the universe into itself. The substantive question concerns a nonidentity embedding. In ZFC, the Kunen inconsistency theorem gives
Here, as usual for class embeddings, restrictions to sets and the recursively defined critical sequence are available. We give the stationary-set proof, including its partition ingredient.
Suppose such a existed. It has a least moved ordinal , its critical point of an elementary embedding. To see why some ordinal must move, if all ordinals were fixed, induction on rank would fix every set: membership of in is equivalent to membership of in once every lower-rank is fixed. A rank segment containing a moved set would then be fixed pointwise, a contradiction. The critical point is an uncountable cardinal. All finite ordinals and are definable and fixed. If had cardinality , a bijection would be carried to a surjection whose range still consists exactly of the fixed ordinals below , impossible since .
Put , and . Applying to this Kunen critical sequence shifts it by one, so . Elementarity also gives ; write .
We need a stationary partition at a successor cardinal. If is stationary, choose bijections for . For each , on the stationary tail the function is regressive. The Fodor lemma supplies a stationary fiber with constant value . Some value occurs for many , since a union of sets each of size at most cannot have size . For distinct such , their fibers are disjoint: cannot equal two different ordinals. These fibers yield disjoint stationary subsets; include any leftover points in one cell. Grouping cells also gives a partition into any nonzero number at most .
For completeness, the Fodor lemma used here follows from diagonal intersections of clubs. If a regressive function had no stationary fiber, choose a club set disjoint from each fiber. The diagonal intersection is club by regularity and closure. A point in its intersection with would belong to , contradicting the choice of that club.
The set is stationary: inside any club choose a strictly increasing countable sequence, whose supremum still lies below the regular uncountable and belongs to the club. Partition it as . Its image is another stationary partition of the same .
The set is club. Closure is immediate. To get a member above any given ordinal, repeatedly bound the images of all earlier ordinals and take a countable supremum; regularity of keeps each bound below . Choose . Since , a countable cofinal sequence in and give : the image sequence remains below by closure under , and .
But for some . Applying and using gives , contradicting its membership in the disjoint cell . This proves the assertion. The use of axiom of choice in the cardinal and stationary-partition arguments matters; the conclusion here is explicitly in ZFC.
An uncountable cardinal is measurable when it carries a nonprincipal ultrafilter that is -complete. For an inaccessible , the cardinal is 1-strong when there is an elementary embedding
into a transitive model, with critical point and .
The fundamental theorem on measurable cardinals constructs from the well-founded ultrapower and its ultrapower embedding , whose critical point is . The embedding fixes . If , then , and elementarity gives
Both and belong to the transitive target, so . Thus , proving that every measurable cardinal is 1-strong.
Because , the definition of the critical point of an elementary embedding immediately gives
To evaluate , first use the regularity of the measurable cardinal . Every function has bounded range, so every ordinal below lies below for some . Hence
The strong-limit property of gives for every . There are therefore fewer than functions , which implies . On the other hand . Taking suprema yields
the two measurable cardinals under an ultrapower embedding formula.
The critical point of an elementary embedding is the least ordinal for which .
We first prove by transfinite induction that for every . Suppose this is known below . If , then
The sets for partition into fewer than pieces. A kappa-complete filter that is an ultrafilter must contain one cell : otherwise all their complements would belong to , and their intersection would contradict . Hence . The predecessors of are consequently exactly the already-fixed ordinals below , so .
Now let . An identical argument shows that the predecessors of in the ultrapower are exactly for , so
Since , one has . After collapsing, , and therefore . Thus .
Reflection below a cardinal Created 2026-09-28 Updated 2026-10-03
A property reflects below a cardinal when is unbounded in . For an elementary embedding with critical point , one often proves this by using as a witness below in the target and then invoking elementarity.
Supercompact cardinal 2026-10-14
A cardinal is supercompact if for every cardinal there is an elementary embedding into a transitive class with critical point of an elementary embedding , , and . This closure supplies every sufficiently small rank segment needed to transfer existential witnesses into .