A cardinal-preserving forcing over leaves every ground-model cardinal number a cardinal in every generic extension. In the present notation, for every -generic filter and every ordinal ,
Set forcing preserves ordinals, and an old bijection witnessing that an ordinal is not a cardinal remains available. Thus this condition also means that the two models have exactly the same cardinals. Cardinality here is computed inside the respective models, not from their external sizes.
The countable chain condition for forcing says that every antichain in a forcing order is a countable set. Equivalently,
In this question the assertion is evaluated inside . Although every subset of the countable set is externally countable, that observation does not establish the internal chain condition: need not contain an enumeration of an antichain.
Let be an uncountable cardinal of . If it ceased to be a cardinal, some ordinal would admit a surjection onto in an extension. By the forcing theorem, there would be a condition and a forcing name such that
Inside , for each choose a maximal antichain in a forcing order below deciding the ordinal value of . Conditions deciding that value are dense below . The chain condition makes the chosen antichain countable in , so the corresponding set of possible decided values is countable in .
A generic filter containing meets the downward closure of every such maximal antichain, so its value belongs to . Therefore its whole range lies in the ground-model set
The last inequality is infinite cardinal arithmetic and uses only that is uncountable and ; no regularity of is needed. Some ordinal in exists already in and cannot occur in the range, contradicting the forced surjectivity.
Finite cardinals cannot collapse, and cannot become finite: a finite domain has finite image, and transitive models agree on the natural numbers. Old non-cardinals cannot become cardinals because their old bijections persist. Thus

Articles by others on the same topic (0)

There are currently no matching articles.