Let , the generic union for the Finite-condition Lévy collapse, and fix an infinite cardinal number in . For every , the set of conditions defining a value at is dense: extend a condition at that fresh coordinate with any value below . Hence is a total function .
For every , the set of conditions assigning the value at some fresh coordinate is also dense. Genericity therefore makes surjective. Thusso is a countable set in . Finite cardinals are already countable.
Assume that is regular and uncountable in , as required for this claim. If an antichain had size , apply the delta-system lemma at a regular uncountable cardinal inside to the finite domains of its conditions. After thinning, their domains form a delta-system with finite root .
There are fewer than possible restrictions to , because each coordinate has fewer than possible values. Since is a regular cardinal, we can thin again to conditions agreeing on . Any two now have disjoint domains outside and agree on , so their union is a common extension. This contradicts that is an antichain. ThereforeIf the word “regular” is allowed to include , the printed claim needs the additional hypothesis that is uncountable; the finite-condition order can have an infinite antichain when .
Suppose first that is regular and uncountable in . Part (b) and cardinal preservation by chain-condition forcing show that remains a cardinal number in , while part (a) makes every infinite ground-model cardinal below countable. Every ordinal below has ground-model cardinality below and is therefore countable in the extension. Thus is the least uncountable ordinal there:
Conversely, suppose and were singular in . Let and take in a cofinal function . Part (a) makes countable in , while the same remains cofinal there. This would give countable cofinality, contradicting first uncountable ordinal is regular. Hence was regular in , and for the intended uncountable ,
Articles by others on the same topic
There are currently no matching articles.