18. Large cardinals
18. Large cardinals
18. Large cardinals
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
• z<br />
• y<br />
y • • z<br />
y • • z x • • z<br />
x •<br />
• x<br />
• x<br />
Case 1 Subcase 2.1 Subcase 2.2 Case 3<br />
x •<br />
y<br />
•<br />
z •<br />
x •<br />
y<br />
•<br />
z •<br />
x •<br />
y<br />
•<br />
z •<br />
Subcase 4.1 Subcase 4.2 Subcase 4.3<br />
We claim that B is a chain in T of size κ. Suppose that t 0 , t 1 ∈ B with t 0 ≠ t 1 , and choose<br />
x 0 , x 1 ∈ L correspondingly. Say wlog x 0 < ′′ x 1 . Now t 0 ∈ B and x 0 ≤ ′′ x 1 , so t 0 ≤ x 1 .<br />
And t 1 ∈ B and x 1 ≤ x 1 , so t 1 ≤ x 1 . So t 0 and t 1 are comparable.<br />
Now let α < κ; we show that B has an element of height α. For each t of height α let<br />
V t = {x ∈ L : t ≤ x}. Then<br />
{x ∈ L : ht(x) ≥ α} = ⋃<br />
ht(t)=α<br />
since there are fewer than κ elements of height less than κ, this set has size κ, and so there<br />
is a t such that ht(t) = α and |V t | = κ. We claim that t ∈ B. To prove this, take any<br />
x ∈ V t such that t < x. Suppose that a ∈ L and x ≤ ′′ a. Choose y ∈ V t with a < ′′ y and<br />
t < y. Then t < x, t < y, and x ≤ ′′ a < ′′ y. If x = a, then t ≤ a, as desired. If x < ′′ a,<br />
then t < a by (*).<br />
This finishes the case in which L has a subset of order type κ. The case of order type<br />
κ ∗ is similar, but we give it. So, suppose that L has order type κ ∗ . Define<br />
V t ;<br />
B = {t ∈ T : ∃x ∈ L∀a ∈ L[a ≤ ′′ x → t ≤ a]}.<br />
We claim that B is a chain in T of size κ. Suppose that t 0 , t 1 ∈ B with t 0 ≠ t 1 , and choose<br />
x 0 , x 1 ∈ L correspondingly. Say wlog x 0 < ′′ x 1 . Now t 0 ∈ B and x 0 ≤ x 0 , so t 0 ≤ x 0 . and<br />
t 1 ∈ B and x 0 ≤ ′′ x 1 , so t 1 ≤ x 0 . So t 0 and t 1 are comparable.<br />
199