I firmly believe that when one is stuck on a research problem one should tell as many people as possible about it, because one of two things will happen: either someone will solve your problem (and you will have contributed to the store of mathematical knowledge) or you will frustrate all of your mathematician friends. Either of those is a good thing. For this reason I’ve decided to write a couple of posts sketching my current project and some of the points of frustration.

The fundamental idea arose from the following fact about Laver functions on a supercompact cardinal, which was given to me as an exercise at some point by Joel Hamkins:

**Theorem. **If is supercompact then there are (the maximal possible number) many Laver functions such that this sequence is *jointly Laver*, i.e. such that for any and any sequence of sets in there is a -supercompactness embedding with critical point which satisfies for all .

It is not difficult to see that this is true; furthermore, it will be interesting to give an alternative proof of the weaker claim that there is a jointly Laver sequence of length . This can be accomplished by simply coding everything appropriately. Specifically, start with a single Laver function and let . Given a sequence in , we fix a -supercompactness embedding such that . It is then easy to check that for all .

For the length case, we reindex our sequences to use elements of instead of . Still working with a given Laver function we define for . Given a sequence in we fix a -supercompactness embedding such that and check that this makes everything work as required. If we had we should, at the end, also factor our a supercompactness embedding of the appropriate degree.

There are two things we should take away from this proof:

- The short case was fairly easy, requiring merely some coding. This suggests that whenever we have any Laver function-like object on a cardinal we should have many joint such objects, whatever that might mean;
- In the long case we seemingly only used the -supercompactness of . If we then consider only partially supercompact cardinals, this raises the question whether there is any strength in having a length jointly Laver sequence or whether such things just always exist (provided there is an appropriate Laver function in the first place).

As alluded to in point 1, questions about jointly Laver sequences make sense whenever a Laver function-like object makes sense. This ties together nicely with the various Laver diamond principles, introduced for many large cardinals in an (as of yet unpublished) paper by Hamkins. Building on his work and also on the work of Apter-Cummings-Hamkins on the number of measures problem, some answers have been forthcoming.

Let me illustrate the main results about these joint Laver sequences in the case of measurable cardinals, where many of the interesting phenomena already occur. The supercompact case is fairly similar, with some complications.

To be concrete, if is measurable we call a function a *Laver diamond (for measurability)* if for every there is an elementary embedding with critical point such that . We call a sequence a *joint Laver diamond sequence (for measurability*) if for every sequence of sets in there is an elementary embedding with critical point such that for every .

**Theorem.** If is measurable and has a Laver diamond then it has a joint Laver diamond sequence of length . In general, if is measurable then there is a forcing extensions in which remains measurable and has a joint Laver diamond sequence of length .

This is quite simple. If there is a Laver diamond for then we can simply do the coding we did before and get a joint Laver diamond sequence. The point is that if there is no Laver diamond for we can always force to add one. This can be done in one of several (nonequivalent) ways, e.g. by Woodin’s fast function forcing or by first doing a preparatory forcing and then adding a Cohen subset to .

**Theorem.** If is measurable then there is a forcing extension in which remains measurable and has a joint Laver diamond sequence of length .

This builds on the construction of adding a single Laver diamond. We first force the GCH to hold at if necessary. We next prepare by doing a Silver-style iteration up to where we add many Cohen subsets to inaccessible . Finally we add many Cohen subsets to . An argument as in the previous case shows that the Cohen subsets of can be decoded into a joint Laver diamond sequence, and since GCH still holds at at the end, there are many. The crucial issue is showing that remains measurable after this forcing. The usual lifting argument via master conditions doesn’t work since the generic is too big to be distilled down to a master condition. To solve this we use what has been called in the literature the “master filter argument”, where instead of building a single master condition we build a descending sequence of partial master conditions, which encode larger and larger pieces of the generic. The construction is quite sensitive and exploits, among other things, the continuity of the embedding at (this becomes relevant in the supercompactness argument).

The fact that in the resulting model GCH holds in is unavoidable without stronger hypotheses. The following question is still open.

**Question. **Given a model where is measurable, GCH fails at and has a Laver diamond, is there a forcing extension preserving these facts where has a joint Laver diamond sequence of length ?

The final result on measurables is a separation of the conclusions of the previous two theorems. Therefore, while having a joint Laver diamond sequence of length is no weaker in consistency strength than having a joint Laver diamond sequence of length , the outright implication still fails.

**Theorem.** If is measurable then there is a forcing extension in which remains measurable and has a joint Laver diamond sequence of length but no joint Laver diamond sequence of length .

The key observation here is that, in order to have a joint Laver diamond sequence of length , there must be at least many normal measures on , since every binary -sequence must be guessed by some embedding and, of course, each embedding corresponds to a single sequence. The argument now proceeds by first forcing to add a Laver diamond to as before and then using a result of Apter-Cummings-Hamkins by which we can force over a model with a measurable preserving measurability but making only carry many normal measures. By our argument before cannot possibly have a joint Laver diamond sequence of length greater than . It then remains to check that the single Laver diamond survived this final forcing and this gives us a joint Laver diamond sequence of length as in our first theorem above.

The main gap in these results concerns the lack of control over . One would like to be able to push high and still talk about joint Laver diamond sequences of intermediate length. Of course, this requires higher consistency strength than merely measurability, but I would guess that we get equiconsistency at that level again.

Next time (whenever that might be) I will discuss similar results on (partially) supercompact cardinals and perhaps some others (like weakly compact or strong or strongly unfoldable).

Miha, this is really interesting! Question: how do you construct a Laver diamond in the preparatory forcing+adding a Cohen subset extension?

You can pretend that you are really adding many Cohen subsets and let the value of the Laver diamond at be whatever is coded by the first many bits of the -th Cohen set. The fact that you can guess everything comes from being totally free in what to put on top of the master condition in the diagonalization argument.