(This is the third lecture in Stevo Todorcevic’s Forcing class, held in the fall of 2012. You can find the second lecture here. Quotes by Stevo are in dark blue; some are deep, some are funny, some are paraphrased so use your judgement.)
- We look at 4 examples of posets that collapse to .
- A problem of Foreman is mentioned that asks about collapsing versus adding.
- Talking about anti-Suslin trees.
Continue reading Stevo’s Forcing Class Fall 2012 – Class 3
(In the fall of 2012 I will be taking Stevo Todorcevic’s class in Forcing at the University of Toronto. I will try to publish my notes here, although that won’t always be possible.)
Summary of class 1.
- Discuss examples of ccc posets whose product is not ccc.
- Prove a theorem of Baumgartner’s that relates the branches in a tree to its antichain structure.
- Display the differences in chain conditions.
Continue reading Stevo’s Forcing Class Fall 2012 – Class 1
(This is the presentation I gave for Stevo Todorcevic’s course Combinatorial Set Theory on Feb 28, 2012. The material comes from Stevo’s 1983 paper “Partition Relations for Partially Ordered Sets”.)
In partition relations for ordinals, it has been established that:
Later it was shown that this is the best you can do, as the strengthenings are consistent:
Theorem(Hajnal). Under CH,
Theorem (Todorcevic). Under PFA, for any countable ordinal ,
Moving on, we can ask the same questions about non-special trees, which in some way are the tree analogue of “uncountable” or “large”.
Theorem (Todorcevic). Nonspecial Tree (Nonspecial Tree,
This is the analogue or the Erdos-Rado theorem.
Recall that a tree is nonspecial if , which means that any countable partition contains an infinite set. (This is a generalization of uncountable, because for countable sets you can always put one element per colour.)
We will show the following:
Theorem (Todorcevic). Under MA, for a tree with no uncountable chains and we have .
Continue reading MA and its effect on Tree Partitions