Usually well-behaved class forcings can behave quite badly in the absence of choice

by kamerynwilliams

I recently stumbled upon yet another example of how class forcing can be wilder than set forcing. A class forcing can be well-behaved under the assumption that the ground model satisfies the axiom of choice while being destructive if choice fails in the ground model. (Thank you to Joel David Hamkins for a helpful conversation and for noticing the key fact I had missed.)

Proposition: There is a (definable) class forcing \mathbb G so that:

  1. If (M,\mathcal X) \models \mathsf{GB} + \mathsf{AC} then forcing with \mathbb G^M over (M,\mathcal X) preserves \mathsf{GB} + \mathsf{AC}.
  2. If (M,\mathcal X) \models \mathsf{GB} + \neg \mathsf{AC} then forcing with \mathbb G^M over (M,\mathcal X) does not preserve Replacement.

Proof: This forcing \mathbb G is the forcing to add a global choice function. Specifically, conditions in \mathbb G are functions g : \alpha \to V whose domains are ordinals. The order is the natural one, namely g \le h if g extends h. (Observe that this definition only depends upon the first-order part of our model of set theory, justifying the use of \mathbb G^M above instead of \mathbb G^{(M,\mathcal X)}.)

An easy density argument shows that for any a \in V it is dense to get a in the range of a condition. Therefore, forcing with \mathbb G adds a surjection G : \mathrm{Ord} \to V, from which we can easily define a global choice function. Note that this doesn’t require the ground model to satisfy any fragment of choice. While we will see that forcing with \mathbb G over a model without choice kills Replacement, at least we get Global Choice as a consolation prize.

We also have that \mathbb G is \mathord<\mathrm{Ord}-closed, meaning that any set-sized decreasing sequence of conditions has a lower bound. Given a descending sequence \langle g_\xi : \xi < \alpha \rangle of conditions from \mathbb G, they have \bigcup_{\xi < \alpha} g_\xi as a lower bound. Therefore, forcing with \mathbb G does not add any new sets. In particular, if we start with a model of \mathsf{AC}, then choice is preserved.

To finish the argument for (1) of the Proposition we need to see that \mathsf{GB} is preserved. For that, I will be lazy and link to a pair [1, 2] of blog posts by Victoria Gitman who was kind enough to write up the gritty details. Let’s check, however, where  Vika’s argument uses that choice holds in the ground model. Consider her argument that Replacement is preserved, i.e. that if F is a class (in the forcing extension) and a is a set then F \upharpoonright a is a set. Vika does this by contradiction, assuming some g in the generic forces \dot F \upharpoonright \check a. She then finds a stronger  condition which decides \dot F \upharpoonright \check a, leading to the desired contradiction. To do this, she uses a well-order of a. Of course, if choice fails, then we can find a with no well-order, so her argument won’t work in that context.

Now let’s see (2) of the Proposition. Suppose we have a ground model set which lacks a well-order. Call this set b. As we saw above, if G is the generic function \mathrm{Ord} \to V added by forcing with \mathbb G, then every element of b appears in the range of G. However, it cannot be that they all appear by some bounded stage. If it were that b \subseteq \mathrm{ran}(G \upharpoonright \alpha) for some ordinal \alpha, then since G \upharpoonright \alpha is a set from the ground model, we would have a well-order of b in the ground model, contrary to our assumption.

This gives a failure of Replacement. Namely, consider the function F taking a \in V to the least \alpha so that G(\alpha) = a. By the above paragraph, we get that F '' b \subseteq_{\mathsf{cof}} \mathrm{Ord} is not a set.

The following corollary can be extracted from the above argument.

Corollary: In the absence of Replacement, Global Choice does not imply (Set) Choice. In other words, in the absence of Replacement the existence of a (class) function which picks elements from every nonempty set does not imply the existence of a set function which picks elements from every nonempty subset of a set b.

I view this corollary as (yet more) evidence of the importance of Replacement. It is necessary to prove the ‘obvious fact’ that Global Choice implies (Set) Choice.

Advertisements