I wanted to use this post to briefly talk about the square bracket partition relation, as a lot of the work I’ve been doing recently has centered around a very particular instance of this.
Definition: Suppose , , and are cardinals, and that is an ordinal. The symbol
means that, for any coloring of the cardinality subsets of in colors, there is some such that . We say that is weakly homogeneous in this case.
Perhaps the best way to get a handle on the square bracket partition relation is to look a colorings of pairs. In particular, one question that appears in the literature is, given a cardinal , when does the relation hold? In order for this to fail, there has to be a coloring such that, for any with , we have that . That is, there is a coloring of the pairs of which is so pathological, that restricting it to any subset of size gives us a coloring which hits every color.
We can see the failure of this partition relation as a gross failure of Ramsey’s theorem for . So with that in mind, I’m going to focus on colorings of pairs in this post, as there is a very deep theory that comes from asking to construct pathological colorings of pairs.
For example, Todorčević was able to show that, for regular uncountable , we have using his walks on ordinals technique. Shelah was then able to further expand upon this to show that if has a non-reflecting stationary subset, then . In more recent work, both Shelah and Eisworth have been able to show that this, and an even stronger negative partition relation hold for many where is singular by combining the machinery of scales and club guessing with walks on ordinals.
I’ll probably return to that stuff in a later post. In particular, I want to give an overview of what’s known in the area, and motivate some of the open questions. I’ve been spending most of my time looking at colorings of all finite subsets of , but in that case one can actually work with elementary submodels instead. Lately, however, I’ve been interested in colorings of pairs, so posting about this will be a nice way of keeping myself on track. First though, I want to talk about a case when the square bracket partition relation does hold.
Theorem (Prikry): If is real-valued measurable, then .
Proof: Much like how we exploit the -complete, normal measure on a measurable to show that is Ramsey, we will use the ideal of null sets to find a weakly homogeneous set for any coloring.
So let be a -additive, atomless measure on with measure algebra all of . Let be the ideal of -null sets, and let denote the dual filter. It’s relatively easy to see that must be -complete and -saturated.
Now, fix a coloring . For each and , let
Note that for each , we have that . So by completeness and saturation of , we have that there is some such that . Now we recursively build an increasing sequence with the property that . This is easy by the -completeness of .
Now, note that since real-valued measurability of gives us that , we can find a set of of size such that for each such . So reindex and let be the set of corresponding . Then we have that gives us that and so . But the we’re done, as .
It should be noted that the failure of CH was necessary here by Todorčević’s theorem.