PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Medium Entry average rating: No information on entry rating
[parent] FS iterated forcing preserves chain condition (Result)

Let $\kappa$ be a regular cardinal and let $\langle\hat{Q}_\beta\rangle_{\beta<\alpha}$ be a finite support iterated forcing where for every $\beta<\alpha$ , $\Vdash_{P_\beta} \hat{Q}_\beta$ has the $\kappa$ chain condition.

By induction:

$P_0$ is the empty set.

If $P_\alpha$ satisfies the $\kappa$ chain condition then so does $P_{\alpha+1}$ , since $P_{\alpha+1}$ is equivalent to $P_\alpha*Q_\alpha$ and composition preserves the $\kappa$ chain condition for regular $\kappa$ .

Suppose $\alpha$ is a limit ordinal and $P_\beta$ satisfies the $\kappa$ chain condition for all $\beta<\alpha$ . Let $S=\langle p_i\rangle_{i<\kappa}$ be a subset of $P_{\alpha}$ of size $\kappa$ . The domains of the elements of $p_i$ form $\kappa$ finite subsets of $\alpha$ , so if $\operatorname{cf}(\alpha)>\kappa$ then these are bounded, and by the inductive hypothesis, two of them are compatible.

Otherwise, if $\operatorname{cf}(\alpha)<\kappa$ , let $\langle \alpha_j\rangle_{j<\operatorname{cf}(\alpha)}$ be an increasing sequence of ordinals cofinal in $\alpha$ . Then for any $i<\kappa$ there is some $n(i)<\operatorname{cf}(\alpha)$ such that $\operatorname{dom}(p_i)\subseteq \alpha_{n(i)}$ . Since $\kappa$ is regular and this is a partition of $\kappa$ into fewer than $\kappa$ pieces, one piece must have size $\kappa$ , that is, there is some $j$ such that $j=n(i)$ for $\kappa$ values of $i$ , and so $\{p_i\mid n(i)=j\}$ is a set of conditions of size $\kappa$ contained in $P_{\alpha_j}$ , and therefore contains compatible members by the induction hypothesis.

Finally, if $\operatorname{cf}(\alpha)=\kappa$ , let $C=\langle \alpha_j\rangle_{j<\kappa}$ be a strictly increasing, continuous sequence cofinal in $\alpha$ . Then for every $i<\kappa$ there is some $n(i)<\kappa$ such that $\operatorname{dom}(p_i)\subseteq \alpha_{n(i)}$ . When $n(i)$ is a limit ordinal, since $C$ is continuous, there is also (since $\operatorname{dom}(p_i)$ is finite) some $f(i)<i$ such that $\operatorname{dom}(p_i)\cap [\alpha_{f(i)},\alpha_i)=\emptyset$ . Consider the set $E$ of elements $i$ such that $i$ is a limit ordinal and for any $j<i$ , $n(j)<i$ . This is a club, so by Fodor's lemma there is some $j$ such that $\{i\mid f(i)=j\}$ is stationary.

For each $p_i$ such that $f(i)=j$ , consider $p^\prime_i=p_i\upharpoonright j$ . There are $\kappa$ of these, all members of $P_j$ , so two of them must be compatible, and hence those two are also compatible in $P$ .




"FS iterated forcing preserves chain condition" is owned by Henry.
(view preamble | get metadata)

View style:


This object's parent.
Log in to rate this entry.
(view current ratings)

Cross-references: stationary, Fodor's lemma, club, continuous, strictly increasing, induction hypothesis, members, contains, contained, partition, cofinal, ordinals, sequence, increasing, compatible, inductive hypothesis, bounded, finite, elements, domains, size, subset, limit ordinal, regular, preserves, composition, equivalent, chain condition, satisfies, empty set, induction, finite support iterated forcing, regular cardinal
There is 1 reference to this entry.

This is version 1 of FS iterated forcing preserves chain condition, born on 2002-08-18.
Object id is 3314, canonical name is FSIteratedForcingPreservesChainCondition.
Accessed 1706 times total.

Classification:
AMS MSC03E35 (Mathematical logic and foundations :: Set theory :: Consistency and independence results)
 03E40 (Mathematical logic and foundations :: Set theory :: Other aspects of forcing and Boolean-valued models)

Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add example | add (any)