I decided to work back through the presentation of Gitik’s long extender forcing from his Handbook chapter, and I’m using this blog to motivate me to actually type stuff out. Unfortunately, I will probably stop updating this blog at some point again because I don’t exactly like WordPress as a medium for a math blog. However, as long as I feel like updating this thing, I feel like I should make use of it. This post will assume knowledge of the basic Prikry forcing as well as the diagonal Prikry forcing (mainly for motivational purposes), presentations of which can be found in Gitik’s handbook chapter as well as here. Actually, this post was part of the reason I ended up posting my unfinished notes from Spencer’s talk.

The diagonal Prikry forcing uses a sequence of measurable cardinals and witnessing measures to add a Prikry sequence to dominating all ground model functions. So, in order to blow up the power of , we just have to find a way of doing this diagonal Prikry forcing a bunch of times in a nice and coherent way. Since we used measures on each to accomplish this, the natural step to take is to utilize extenders of the appropriate length, since those naturally carry a bunch of measures that are associated in a nice way. The hope is that we can generalize the diagonal Prikry forcing construction using extenders, and have nothing horrible go wrong (like accidentally collapsing cardinals). It turns out that this approach almost works. I want to use this post to flesh out this “naive” idea, and then to present Gitik’s actual construction.

The presentation in this post is based off of the presentation in Gitik’s Handbook Chapter, as well as Gitik and Unger’s notes from the Appalachian Set Theory Workshop. We will assume that GCH holds in the ground model.

Suppose that we have an increasing sequence of -strong cardinals where , and . For each , fix a non-trivial, elementary embedding with the following properties:

- ;
- ;
- , and .

For , and , define . Note that each is a -complete, non-principal ultrafilter on with normal. These are the measures that we will be working with. The presence of these -strong embeddings will give us a nice -directed order on these measures, which will allow us to perform the diagonal Prikry forcing -many times.

For , we say that if there is some such that . This extender ordering allows us to project the ultrafilter to . To see this, assume we have that , and let be such that . Let , and note that by definition we have . By elementarity, we then have that , but again by elementarity we know that . Thus, we have that and so by definition . We now fix some notation.

- If , we will suggestively call the witnessing function . That is, we have .
- Let , and let be the associated ultrapower embedding.
- The general theory of ultrapowers gives us a factor map , given by .

Note that if , we have that . Let , and note that this is, roughly speaking, what things the seed of is. We can then use this ordinal to define an elementary embedding that makes some awful looking diagram commute. Basically, this ordering yields a directed system of ultrapowers and their associated embeddings, the direct limit of which is the embedding . Of course, here we’re brushing a lot of technical details under the rug, but this is the basic idea.

We are not so concerned with the directed system of embeddings and ultrapowers itself. We are much more concerned with how the ordering relates the measures themselves. The following three lemmas are somewhat technical, but relatively standard affair with arguments involving commutative diagrams of elementary embeddings.

Lemma: (GCH) Fix , and . If is a collection of ordinals below , then there are -many such that for each . In particular, is -directed.

Proof: Since GCH holds, we can enumerate in order type by with the property that, for any regular , enumerates such that every appears -many times. Now we want to look at , and note that since , by elementarity we have that enumerates in order type with the above property. Call this enumeration . Fix some such that , we claim that for each . Since there are -many such ordinals , that will complete the proof.

By standard ultrapower stuff, we have that . Since is the th member of the above sequence, we can express as . Since , it follows that is a -length sequence of ordinals from . Fix , and let be the th member of this sequence, and note that by elementarity. As before, we’ve isolated what thinks is the seed of , and we can use this to define an embedding from as well as a projection map .

We define by . It is fairly routine to check that is elementary and commutes with and . Next, let be such that . By definition, , and thus . Since was arbitrary, this completes the proof.

Now that we’ve shown that the extender order is -directed, we will show that has some nice coherency properties that will allow us to generically add -many sequences to .

Lemma: Suppose that . If and , that .

Proof: This is relatively simple, as we simply need to show that . But we’ve already shown that and , and thus it follows by elementarity and the fact that that and so the lemma is proved.

Lemma: Suppose that we have ordinals such that , then there is some such that, for each , .

Proof: Note that we only need to show that . We already know that , so by the above argument, we only need to show that . By definition and liberal applications of elementarity, we have:

.

This completes the proof.

With these properties of the extender ordering in hand, we can describe our first approach to adding -many sequences to using the presence of extenders. The idea is, for each , to use elements such that each contains a -maximal element , and do the diagonal Prikry forcing at the sequence of ultrafilters corresponding to these maximal elements. This will yield a Prikry sequence through with each Prikry point at each ultrafilter. The properties extender order will then allow us to project this Prikry point nicely through each element of , giving us many -sequences. But, we can use the coherency properties of this order to move the sequences around, and therefore generically cover in this manner. We now attempt to make this idea more precise.

Definition: We let be the forcing consisting of conditions of the form where:

- For , .
- For each , .
- Each has a -maximal element .
- For each , .
- For each , if , then for each .
- For each , and for each , .

In some sense, this is the natural definition for this forcing given what we know about the extender ordering. Unfortunately, it’s rather complicated compared to the diagonal Prikry forcing. We now define the ordering by saying that if the following hold:

- ;
- For , ;
- For , $s_i$ is a collection of ordinals in members of ultrafilters corresponding to the sequence ;
- For , ;
- For , .

I’m being a bit imprecise with the third condition, but the idea’s there. It should be noted that, unlike the case for diagonal Prikry forcing, conditions with the same stems in the ordering we’ve constructed may have many incompatible extensions. So, we have no easy way of showing that cardinals above are preserved, and it turns out that forcing with will actually collapse cardinals. So, we need to tweak this idea a bit and add more structure in order to keep this collapse from happening. In the next post, I will present Gitik’s definition of his Long Extender forcing, which is actually a small adjustment of this above idea, except he uses Cohen conditions to add some extra structure and hide these Prikry sequences.

## One thought on “Gitik’s Long Extender Forcing – Preliminaries”