Use the countable-condition collapse
ordered by reverse inclusion: an extension of a function is a stronger condition. All sizes and conditions here are computed in the ground model .
This forcing is countably closed: the union of a descending countable sequence is a countable partial function. Thus it adds no countable ordinal sequences and preserves . For each , the conditions whose domains contain are dense; for each , those whose ranges contain are dense. The union of the generic filter is therefore a surjection from onto , and .
Inaccessibility gives : every countable sequence is bounded below the regular , and the strong limit cardinal property bounds the number of sequences at each bound below . Hence . The forcing satisfies the -chain condition for forcing, so it preserves every cardinal above . This gives precisely the requested collapse and preservation. The assertion that is collapsed to concerns its new cardinality; the ordinal itself does not change.

Articles by others on the same topic (0)

There are currently no matching articles.