So what have we learned? The main thing is that we’ve now got a correct(ed) proof of the following result of Shelah, which we can state without any ambiguity:
Theorem 1 If is singular of uncountable cofinality , then
We’ve also got a pretty good idea of how this fits into the rest of Shelah’s work on “cov vs pp”. Most importantly though, forcing myself to work through his proof in this format has suddenly made most of his work on this problem seem much more accessible: the myriad arguments for partial results present in “Cardinal Arithmetic” are all just variations on the pattern of proof we’ve seen in the preceding posts. The next part of this project will consist of demonstrating this by giving streamlined (and cleaned up!) proofs of several more such results. (The point is that everything is much clearer in hindsight, so lots of very difficult proofs can be simplified in light of later discoveries.)
Note: I still want to go back and cross-reference the blog posts, and organize the titles and tags in a coherent way.
We will now define certain increasing sequences and as in the last post, along with another sequence .
Start by setting and . Given and , we let be the least element of above with the property that
What is the point? Note that this arrangement ensures that
for any . Since , it follows that we can choose such that “ majorizes beyond ”, i.e.,
We know the following facts from previous posts:
- , and
Thus, the theorem will be done provided we establish
Here we use the “Elementary submodel argument” from February 12, which tells us that we have what we want provided
The above is satisfied trivially for as ; thus, we need only verify things for which are greater than . Furthermore, we know , so
in any case.
Assume now by way of contradiction that we have such that
- , and
Choose so large that
- , and
Since and , it follows from the definition of that
as both and are in the latter model. Thus, on the one hand we have
and on the other,
Clearly, this is absurd.