The Fn forcing order is
It is ordered by reverse inclusion:
so a stronger condition specifies more values. Its maximal, or weakest, element is the empty function .
For a regular cardinal ,
Again means , and the maximal element is the empty function. The regularity of ensures that the union of a descending sequence of fewer than conditions still has domain of cardinality below whenever the conditions form a compatible increasing chain of partial functions.
Let be uncountable. Apply the Delta-system lemma to the finite sets for . After passing to an uncountable subset , there is a fixed finite root such that
for distinct . Because is countable and is finite, there are only countably many functions . A further uncountable subset therefore has the same restriction to .
Any two conditions in agree on the intersection of their domains, so their union is a common stronger condition. Thus every uncountable family contains two compatible conditions, and no uncountable antichain exists. Therefore
Let and . Define
This is a filter: restrictions of finite pieces of remain in , and the union of two members is a common stronger condition.
To prove genericity, take a dense set . Let consist of conditions for which some satisfies
The set is dense. Indeed, given , first read its finitely many assigned even coordinates as a condition on . Choose in , and extend by setting at the remaining coordinates of . Since , the generic filter meets it. For , the corresponding is a finite subfunction of , so .
Thus meets every dense subset belonging to . Moreover, each singleton belongs to , and hence

Articles by others on the same topic (0)

There are currently no matching articles.