The finite-condition Lévy collapse consists of finite partial functions with and , ordered by reverse inclusion. The generic union gives a surjection for every infinite . If is regular and uncountable, the Delta-system lemma at a regular uncountable cardinal proves the -chain condition, so the extension makes .
With an uncountable regular cardinal, finite partial functions on assigning a value below the first coordinate collapse every ground ordinal below to countable size. The Delta-system lemma gives the chain in a partial order condition; the possible-values lemma for chain-condition forcing then preserves the regularity of . Therefore becomes the extension . Strong inaccessibility is enough but is not needed for this identification.
For a regular uncountable , the finite-condition collapse has the chain in a partial order condition, by a regular-cardinal Delta-system lemma and thinning to identical assignments on the finite root. Thus every maximal forcing antichain has ground-model size less than . There is no fixed size: for any nonzero cardinal , assigning all values below at the one coordinate is a maximal forcing antichain of size .
Articles by others on the same topic
There are currently no matching articles.