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] proof of partial order with chain condition does not collapse cardinals (Proof)

Outline:

Given any function $f$ purporting to violate the theorem by being surjective (or cofinal) on $\lambda$ , we show that there are fewer than $\kappa$ possible values of $f(\alpha)$ , and therefore only $\max(\alpha,\kappa)$ possible elements in the entire range of $f$ , so $f$ is not surjective (or cofinal).

Details:

Suppose $\lambda>\kappa$ is a cardinal of $\mathfrak{M}$ that is not a cardinal in $\mathfrak{M}[G]$ .

There is some function $f\in\mathfrak{M}[G]$ and some cardinal $\alpha<\lambda$ such that $f:\alpha\rightarrow\lambda$ is surjective. This has a name, $\hat{f}$ . For each $\beta<\alpha$ , consider $$F_\beta=\{\gamma<\lambda\mid p\Vdash \hat{f}(\beta)=\gamma\}\text{ for some }p\in P$$

$|F_\beta|<\kappa$ , since any two $p\in P$ which force different values for $\hat{f}(\beta)$ are incompatible and $P$ has no sets of incompatible elements of size $\kappa$ .

Notice that $F_\beta$ is definable in $\mathfrak{M}$ . Then the range of $f$ must be contained in $F=\bigcup_{i<\alpha} F_i$ . But $|F|\leq\alpha\cdot\kappa=\max(\alpha,\kappa)<\lambda$ . So $f$ cannot possibly be surjective, and therefore $\lambda$ is not collapsed.

Now suppose that for some $\alpha\geq\lambda>\kappa$ , $\operatorname{cf}(\alpha)=\lambda$ in $\mathfrak{M}$ and for some $\eta<\lambda$ there is a cofinal function $f:\eta\rightarrow\alpha$ .

We can construct $F_\beta$ as above, and again the range of $f$ is contained in $F=\bigcup_{i<\eta} F_i$ . But then $|\operatorname{range}(f)|\leq|F|\leq\eta\cdot\kappa<\lambda$ . So there is some $\gamma<\alpha$ such that $f(\beta)<\gamma$ for any $\beta<\eta$ , and therefore $f$ is not cofinal in $\alpha$ .




"proof of partial order with chain condition does not collapse cardinals" 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: contained, definable, size, force, cardinal, range, entire, cofinal, surjective, theorem, function
There is 1 reference to this entry.

This is version 1 of proof of partial order with chain condition does not collapse cardinals, born on 2002-07-30.
Object id is 3243, canonical name is ProofOfPartialOrderWithChainConditionDoesNotCollapseCardinals.
Accessed 1792 times total.

Classification:
AMS MSC03E35 (Mathematical logic and foundations :: Set theory :: Consistency and independence results)

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

No messages.

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