(This is the eighth lecture in Stevo Todorcevic’s Forcing class, held in the fall of 2012. You can find the seventh lecture here. Quotes by Stevo are in dark blue; some are deep, some are funny, some are paraphrased so use your judgement. I didn’t take these notes, so there are few Stevo quotes. Thanks to Dana Bartasova for letting me reproduce her notes here. As always I appreciate any type of feedback, including reporting typos, in the comments below.)
- Show Chang’s Conjecture implies .
- Show the failure of CC is equivalent to a nice colouring existing. This is fairly technical.
- Introduce definable posets and “Definable CH”.
Continue reading Stevo’s Forcing Class Fall 2012 – Class 8
(This is the fifth lecture in Stevo Todorcevic’s Forcing class, held in the fall of 2012. You can find the fourth lecture here. Quotes by Stevo are in dark blue; some are deep, some are funny, some are paraphrased so use your judgement. As always I appreciate any type of feedback, including reporting typos, in the comments below.)
- Mention something about Cohen and Random Forcing.
- We recall some facts about .
- Establish some lemmas about .
- Give most of the proof of the functor on ccc posets.
Continue reading Stevo’s Forcing Class Fall 2012 – Class 5
Here is Chris Eagle’s presentation from Stevo Todorcevic’s class “Combinatorial Set Theory”.
From the abstract:
We prove that MA + implies . The exposition is based on hand-written notes provided by S. Todorcevic. The result itself is due to R. Laver.
This is the analogous result to “MA implies (NonSpecial Tree) (NonSpecial Tree, “, which I explained here.
(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