# Sacks forcing and supercompact cardinals

** Posted on**

Time for the first ever blog post! And it is about one of my favourite topics, the preservation of large cardinals through forcing.

The motivation behind this post, is a discussion I had with James Cummings in the “Set theory today” conference that took place in the KGRC in Vienna last week. He explained to me how supercompact cardinals can be preserved through iterations of Sacks forcing, a fact that I was not aware of and which I find very useful. Although the technique was already known by some set theorists (Sy Friedman and Radek Honzik were aware of it for instance), it seems that it has not appeared in the literature yet. So, with James’ permission, in this post I will describe the proof that he showed me.

I believe it would be useful to say a few words on why such a technique is useful. One of the most interesting and active areas in set theory is to fully understand the behaviour of the continuum function, which calculates the size of the power set of all infinite cardinals. During the late 20th century we had a wealth of results that have given us a much greater understanding of this problem. However, things get more complicated when we bring large cardinals in the picture. Given a large cardinal, the challenge is to find all the possible configurations of the continuum function that can be true while preserving the properties of the large cardinal.

Originally, the main forcing notion that was used to force a desired configuration of the continuum function was Cohen forcing. However, about ten years ago, in work of S. Friedman, R. Honzik and K. Thompson ((Friedman & Honzik, 2008) and (Friedman & Thompson, 2008)), Sacks forcing was used instead, bringing a new insight to the problem. The definition of Sacks forcing is more complicated than that of Cohen forcing, but it offers more room for combinatorial arguments and in a sense, this is the reason that we are able to have preservation arguments for large cardinals.

Let us now move to the main part of the post. If is an inaccessible cardinal, let denote the forcing notion whose conditions are trees that satisfy the following conditions:

- is downwards closed: for all and , ,
- does not have leaves: every has a proper extension in ,
- is upwards -closed: if is an increasing sequence of nodes in , then their union is also in ,
- there are club-many splitting levels: If denotes the set of nodes such that , then there is a club such that is exactly the set of nodes that their length is some ordinal in .

The order of the forcing is inclusion, which means that is stronger than iff . The definition is taken from (Friedman & Thompson, 2008), where you can find information about the various properties of . In particular, it is a -closed and -c.c. forcing that adds an unbounded subset of , without collapsing any cardinals. In order to add -many Sacks subsets to , where , we use which denotes the product forcing of length and support , where each factor is equal to .

Now, to go to our specific case, we wish to add -many Sacks subsets to a supercompact cardinal , while preserving its supercompactness. As usual, we would first need to do some preparatory forcing, like adding an appropriate number of Sacks subsets to every inaccessible cardinal below . Then, fixing a -supercompactness embedding we would do a “generic” lift of through this preparatory forcing and then, we would come to the task of further lifting through . The standard way to do this is by finding a master condition that extends all conditions of the form , where is a condition in the generic filter for . It is exactly this construction that James described to me and for the sake of presentation, I am going to ignore the preparatory forcing and assume we already have the right generic embedding. The following theorem describes how to construct the master condition.

# Theorem

Suppose is supercompact and is a cardinal such that . Also, assume that is a -generic filter for and is a generic -supercompactness embedding with . Then, there is a condition such that for all .

## Proof

Fix and as above. We are going to take as given that has the -c.c. and is closed under -sequences in . For more details, see (Friedman & Thompson, 2008).

First, we need to specify the domain of . Since is a -support product, the domain of each can be seen as a -sized subset of . By a standard density argument, we can easily see that every possible -sized subset of appears as a domain in some condition in , hence we define the domain of to be the set

Now, if we fix some , we wish to define as an -Sacks tree of height . This will be done by an induction on , i.e. on the levels of the tree, in . We impose the inductive hypothesis that at any stage , if is a node at the -level of , then for all with . This is reasonable, since we want to extend all these conditions at the end of the construction.

To deal with the limit case first, suppose is a limit ordinal and that we have constructed all levels of smaller than . By definition, each is an upwards -closed perfect tree and by elementarity, is an upwards -closed tree in . Thus, we do the only choice we have, i.e. add all branches that have been constructed so far. Formally, any function such that all its initial segments are in the already constructed levels of the tree, is itself a node in the -level of . Note that the construction takes place in , but since is closed under -sequences, everything can be defined in too. Also, it is clear that the inductive hypothesis still holds.

Now, we look at the successor case and this is the crucial step, as we need to decide which nodes will split or not. To do this, let is the splitting club of for some such that Since is closed under -sequences and has size , and it is the intersection of -many clubs of . Thus, is a club of in and it is going to be the club of splitting levels of .

Back to the construction, suppose we have defined the -level of and is node of height . If , then we put both and in the -level. If not, we have to choose only one extension of . By the inductive hypothesis, there is such that . Then, either or is in and without loss of generality, assume . Then, we let also be in the -level of , but we need to check if the inductive hypothesis will still hold. Let be some other condition such that . By genericity, there is such that and by elementarity, . Since extends , it has to be the case that and similarly, since it extends it has to be the case that . Thus, the inductive hypothesis indeed holds and the construction is complete.

Clearly, extends all conditions in and thus, the proof is complete.

The theorem shows how to construct a master condition when we add Sacks subsets to but in fact, the same technique would work when we add subsets to a cardinal greater than , as long as has a sufficient degree of supercompactness.

Since I am a beginner to the blog business, any comment or remark about the post is welcome! To contact me, you can find my email at the “Contact” section of the website.

## References

- Friedman, S.-D., & Honzik, R. (2008). Easton’s theorem and large cardinals.
*Ann. Pure Appl. Logic*,*154*(3), 191–208. https://doi.org/10.1016/j.apal.2008.02.001 - Friedman, S.-D., & Thompson, K. (2008). Perfect trees and elementary embeddings.
*J. Symbolic Logic*,*73*(3), 906–918. https://doi.org/10.2178/jsl/1230396754