The Destruction of the Axiom of Determinacy by Forcings on R When Θ Is Regular
William Chan
Department of Mathematics, University of North Texas, Denton, TX 76203
[email protected]
and
Stephen Jackson
Department of Mathematics, University of North Texas, Denton, TX 76203
[email protected]
Abstract.
ZF+AD proves that for all nontrivial forcings P on a wellorderable set of cardinality less than Θ, 1P⊩P¬AD. ZF+AD+Θ is regular proves that for all nontrivial forcing P which is a surjective image of R, 1P⊩P¬AD. In particular, ZF+AD+V=L(R) proves that for every nontrivial forcing P∈LΘ(R), 1P⊩P¬AD.
March 16, 2019. The first author was supported by NSF grant DMS-1703708. The second author was supported by NSF grant DMS-1800323.
1. Introduction
Paul Cohen [1] developed forcing which is a very flexible method of extending models of certain axioms of set theory (such as ZF or ZFC) so that the resulting structures continue to satisfy these axioms of set theory. This technique has become a powerful tool for showing statements are independent of ZFC. For example by [1], if ZFC is consistent, then ZFC+2ℵ0=ℵ1 and ZFC+2ℵ0>ℵ1 are both consistent.
Descriptive set theory is the study of the definable aspects of mathematics. Various interesting properties are commonly considered while employing definable techniques to study mathematical problems. Some of these include the perfect set property, Lebesgue measurability, the property of Baire, partition relations on ordinals, and certain properties of Turing degrees. These properties in their full generality are all incompatible with AC, the axiom of choice.
These properties are interesting and appeared naturally in classical descriptive set theory. Definable instances of these properties are provable in more basic axiom systems such as ZF, in the same way that definable instances of the axiom of choice, for example, coanalytic uniformization, is provable in ZF. This analogy justifies the study of the consequences of the full generalization of these properties just as one does with AC, the full generalization of definable selection principles.
The axiom of determinacy, AD, has developed into a comprehensive framework for studying the properties mentioned above in their full generality. As customary in descriptive set theory, R will denote the Baire space, ωω, of functions from ω into ω. For each A⊆R, let GA be the game where Player 1 and 2 take turns playing elements of ω. After infinitely many stages, a single f∈R has been produced. Player 1 wins this run of GA if and only if f∈A. The axiom of determinacy states that for all A⊆R, one of the two players has a winning strategy for GA. AD implies the perfect set property, Lebesgue measurability, Baire property for all sets of reals, and there are many cardinals with various partition properties. As with all these properties, definable fragments of AD can be proved in ZF, for example, Martin showed all games GA where A is Borel are determined under ZF.
One can wonder if the forcing construction which has been fruitful for studying consistency results over ZFC could be useful for AD. The most basic question would be to understand what forcings over AD could preserve AD. By the nature of AD, if one does not change R or P(R), then AD will be preserved. Therefore the question becomes what forcings which disturb R or P(R) can still preserve AD.
Ikegami and Trang initiated the study of the preservation of AD under forcing. They showed that many forcings, such as Cohen forcing, can never preserve AD. They also showed that if one is working with natural models of AD, i.e. models satisfying ZF+AD++V=L(P(R)), then any forcing which preserve AD must preserve Θ, where Θ is the supremum of the ordinals which are surjective images of R. They also showed that the consistency of ZF+AD++Θ>Θ0 implies the consistency of ZF+AD and there is a forcing which preserve AD and increases Θ. Thus necessarily this forcing must disturb P(R) by adding a new set of reals.
The following are some examples of concrete forcings applied within AD. They all destroy the axiom of determinacy for various reasons. These examples give some emperical evidence that most small forcings can not preserve AD and also motivate the general arguments presented throughout the paper.
Let C denote Cohen forcing. Cohen forcing adds a generic filter which is equiconstrucible from a generic real, called the Cohen generic real. Ikegami and Trang observed that if g is a Cohen generic real over V, then V[g]⊨ “RV does not have the Baire property”. Hence V[g]⊨¬AD.
Note that Woodin has shown that if V⊨ZFC has a proper class of Woodin cardinals, then for any P and G⊆P which is P-generic over V, L(R)V is elementarily equivalent to L(R)V[G]. This setting implies that L(R)V⊨AD. Let g be a Cohen real which is generic over V. Note g∈L(R)V[g] and by Woodin’s result, L(R)V[g]⊨AD. However, L(R)[g]⊨¬AD by the result of Ikegami and Trang of the previous paragraph. Observe that the elements of the ground model always belong to its forcing extension. Thus RV∈L(R)[g]; however, RV∈/L(R)V[g].
Assume ZF+DCR+AD. Let Coll(ω1,ω2) be the forcing consisting of countable partial functions from ω1 into ω2 ordered by reverse extension. By AD and the coding lemma, there is a surjection π:R→Coll(ω1,ω2). Suppose there was a G⊆Coll(ω1,ω2) generic over V such that V[G]⊨AD. Since Coll(ω1,ω2) is countably closed and DCR holds, no new reals are added. V[G] has a surjection of ω1V onto ω2V. Thus there is a new subset of ω1V which codes an ordering of ω1V of length ω2V. In V, let π:RV→ω1V be a surjection. By the coding lemma in V[G]⊨AD, there is some real which codes this new subset of ω1V with respect to π. This is impossible if there are no new reals. Thus V[G] can not satisfy AD.
Suppose κ is a cardinal. The partition relation κ→(κ)2λ is the statement that for all Φ:[κ]λ→2, there is a club C⊆κ and an i∈2 so that Φ(f)=i for all f∈[κ]λ of the correct type. The notion of correct type will be defined below and is needed to obtain a club set which is homogeneous. Martin showed that ω1→(ω1)2ω1 holds under AD.
Assume ZF+AD. Let Coll(ω,ω1) be the forcing consisting of finite partial functions from ω into ω1 ordered by reverse extension. Suppose there is a G⊆Coll(ω,ω1) generic over V such that V[G]⊨AD. One can show that ω1V[G]=ω2V. Since ∣Coll(ω,ω1)∣V=ℵ1V, one can show that for all club D⊆ω1V[G]=ω2V, there is a club C⊆ω2V which belong to V so that V[G]⊨C⊆D. (This is shown later as the ground club property.) In V, let Φ:[ω2]ω2→2 be an arbitrary partition. Since Φ∈V[G] and ([ω2]ω2)V∈V[G], within V[G], define Φ~:[ω1V[G]]ω1V[G]→2 by
[TABLE]
If V[G]⊨AD, then ω1V[G]→(ω1V[G])ω1V[G] implies there is some club D⊆ω2V so that D is homogeneous for Φ~. Let C∈V be club in ω2V so that V[G]⊨C⊆D. One can show that C is homogenous for Φ in V. Since Φ was an arbitrary partition, one has established ω2→(ω2)2ω2 in V. But Martin and Paris showed that AD implies ω2→(ω2)2ω2 is not true. Contradiction. So Coll(ω,ω1) can not preserve AD.
Revisiting the Cohen forcing C: Assume ZF+AD. Suppose there was a Cohen generic real g over V such that V[g]⊨AD. Since ∣C∣=ℵ0, every D⊆ω1 in V[g] has a C∈V which is a club subset of ω1 so that V[g]⊨C⊆D. (Again this is the ground club property.) Note that ([ω1]ω1)V∈V[g], so one may define a function Φ:[ω1]ω1→2 in V[g] as follows:
[TABLE]
V[g]⊨AD, so by ω1→(ω1)2ω, let D⊆ω1 be a club set homogeneous for Φ. Let C⊆D be a club in V so that V[g]⊨C⊆D. Taking any f∈([C]ω1)V of the correct type, one can show that in V[g], C is homogeneous for Φ taking value [math]. Let ci denote the (ω⋅i+ω)th element of C. As C∈V, ⟨ci:i∈ω⟩∈V. Pick z∈RV[g]. Let fz∈([C]ω)V[g] be defined by letting fz be the increasing enumeration of {ci:i∈z}. The function fz is of the correct type so Φ(fz)=0. Thus fz∈V. Since z={i∈ω:ci∈fz}, one has that z∈V. It has been shown that RV=RV[g] which is impossible since g∈RV[g]∖RV.
These examples suggest that “small” nontrivial forcings should not be able to preserve AD. The examples also seem to indicate that the partition property and the ground model club phenomenon appears to be common aspects of these arguments.
The axiom of determinacy by its definition influences the sets which are surjective images of R. It is reasonable to ask whether a nontrivial forcing which itself is within the realm of determinacy (i.e. is a surjective image of R) must disturb R or P(R) and if so, can it preserve AD. More specifically, if V⊨AD, L(R) is the smallest model of determinacy containing RV. One can ask if in L(R), which is the most natural model of AD, can a nontrivial forcing within the realm of determinacy, i.e. in LΘ(R), preserve AD. The following are the main questions:
Question 1.1**.**
Assume ZF+AD. If P is a nontrivial forcing which is a surjective image of R, is it possible that 1P⊩PAD?
Assume ZF+AD+V=L(R). Is there any nontrivial P which is a surjective image of R so that 1P⊩PAD?
The first question will be answered negatively if the assumptions are augmented with the condition that Θ is regular. Since Θ is regular in L(R), this immediately gives the negative answer to the second question. The results of the paper are the following:
Theorem 3.2.
Assume ZF+AD. If P is a nontrivial wellorderable forcing of cardinality less than Θ, then 1P⊩P¬AD.
The argument of the above theorem serves as a template for the main result. Its proof is a generalization of the example involving Cohen forcing. In discussion with Goldberg, a stronger result for wellorderable forcing can be shown using different techniques:
Corollary 3.5.
Assume ZF+AD. If P is a wellorderable forcing which adds a new real, the 1P⊩P¬AD.
The main results are:
Theorem 5.6.
Assume ZF+AD+ Θ is regular. Suppose P is a nontrivial forcing which is a surjective image of R. Then 1P⊩P¬AD.
Corollary 5.7.
Assume ZF+AD+V=L(R). No nontrivial forcing P∈LΘ(R) can preserve AD.
In fact, assume ZF+AD++¬ADR+V=L(P(R)). No nontrivial forcing which is the surjective image of R can preserve AD.
2. Ground Club Property
Recall that if A⊆R×Rn and e∈R, Ae={x∈Rn:(e,x)∈A}.
Fact 2.1**.**
(Moschovakis) Assume ZF+AD. Let Γ be a nonselfdual pointclass closed under continuous substitution, ∃R, ∧, and Σ11⊆Γ. Let ≺∈Γ be a strict prewellordering. For each a∈dom(≺), let Qa={b∈dom(≺):a⪯b∧b⪯a}. Let U⊆R3 be a Γ-universal set for subsets of R2 in Γ. Let Z⊆dom(≺)×R. Then there is an e∈R so that
(1) Ue⊆Z.
(2) For all a∈dom(≺), (Ue)a=∅ if and only if Za=∅.
Proof.
See [6] Section 7D.
∎
Fact 2.2**.**
Assume ZF+AD. Let X⊆R and π:X→κ be a surjection. Let ≺ be a strict prewellordering on X defined by x≺y if and only if π(x)<π(y). Let Γ be a nonselfdual pointclass closed under continuous substitution, ∃R, ∧, and Σ11⊆Γ. Let U be a fixed Γ-universal set for subsets of R2 in Γ. For each e∈R, let Seπ={α<κ:(∃a)(π(a)=α∧Ue(a,0)}.
For all C⊆κ, there is some e∈R so that Seπ=C.
Proof.
Let Z={(a,0):a∈X∧π(a)∈C}. Apply Fact 2.1.
∎
Definition 2.3**.**
Assume ZF+AD. Let A⊆R. Let δA be the least ordinal δ so that Lδ(A,R)≺1L(A,R), where ≺1 denotes Σ1 elementarity in a language that includes a predicate A˙ and R˙, which are always interpreted as A and R, respectively. It is also the least ordinal δ so that Lδ(A,R) is an elementary substructure of L(A,R) with respect Σ1 formulas in the above language using elements of R, R itself, and A as parameters.
Let Σ1(L(A,R),R∪{R,A}) be the collection of sets in L(A,R) which are Σ1 definable in L(A,R) using elements of R, R itself, and A as parameters.
Definition 2.4**.**
Following [4] Section 2.4 and 2.5, the following is an explicit prewellordering of a subset of R of length δA which is Σ1(L(A,R),R∪{R,A}):
Let T be the theory consisting of ZF without the power set axiom, “R exists”, and countable choice for R.
Let φA(x,A,R˙) denote a Σ1 formula that defines the Σ1(L(A,R˙),{A,R˙}) set, denoted UA, which is universal for Σ1(L(A,R˙),R˙∪{A,R˙}). For x∈UA, let Θx be the least ordinal so that LΘx(A,R˙)⊨T and LΘx(A,R˙)⊨φA(x,A,R˙). Define ρ~A(x)=(δA)LΘx(A,R˙). Let ιA:ρ~A[UA]→δA be the transitive collapse of ρ~[UA]. Let ρA=ιA∘ρ~A. ρA is a Σ1(L(A,R˙),{A,R˙}) surjection of UA onto δA. In applications of the coding lemma throughout the paper, the prewellordering and universal set used will always be the ones produced above.
Therefore there is a Σ1 formula ς(α,e,A,R˙) so that for all α<δA, L(A,R˙)⊨α∈SeρA⇔ς(α,e,A,R˙).
Definition 2.5**.**
A function f:λ→ON has uniform cofinality ω if and only if there is a g:λ×ω→ON with the property that for all α<λ and n∈ω, g(α,n)<g(α,n+1) and f(α)=sup{g(α,n):n∈ω}.
A function f:λ→ON is of the correct type if and only if f is strictly increasing, for all α<λ, f(α)>sup{f(β):β<α}, and f has uniform cofinality ω.
Let κ be an ordinal. For ordinals λ≤κ, let κ→(κ)2λ denote that for all Φ:[κ]λ→2, there is a club C⊆κ and i∈2 so that for all f:λ→C of the correct type, Φ(f)=i.
If κ→(κ)2κ, then one says that κ has the strong partition property. If for all η<κ, κ→(κ)2η, then κ is said to have the weak partition property. (Note that κ→(κ)22 implies that κ is regular.)
Fact 2.6**.**
Assume ZF+AD. Let A⊆R. Then δA has the strong partition property in L(A,R) and even in V.
Proof.
This is shown by following Martin’s template for establishing partition properties. The reflection properties and the uniform coding lemma is used to produce a good coding system for functions f:δA→δA. See [2] for more details. See [5] for the details of this specific result.
∎
Definition 2.7**.**
The ordinal Θ is the supremum of the ordinals which are surjective images of R.
For A,B∈P(R), A≤wB denotes that A is Wadge reducible to B. For each r∈R, let Ξr denote the Wadge reduction coded by r. So Ξr−1[B] is the subset of R reducible to B via the Wadge reduction coded by r.
The Wadge lemma states that ZF+AD implies that for all A,B∈P(R) either A≤wB or B≤w(R∖A).
Fact 2.8**.**
([3]) Assume ZF+AD. For all λ<Θ, there exists some κ with λ<κ<Θ so that κ has the strong partition property.
Proof.
This result follows from Fact 2.6. [3] works with ZF+DC+AD as its base theory. [5] has a careful presentation of this result from just ZF+AD.
∎
Definition 2.9**.**
Let κ be a regular cardinal and P=(P,≤P,1P) be a forcing. P has the ground club property at κ if and only if for all p∈P and all P-name D˙ such that p⊩P “D˙ is a club subset of κˇ”, there is some club C⊆κ so that p⊩PCˇ⊆D˙.
Lemma 2.10**.**
Assume ZF. Let P be a forcing and p∈P. If P has the ground club property at κ and p⊩κ→(κ)2ω, then p⊩R˙=Rˇ.
Proof.
Let G⊆P be any P-generic filter over V containing p. Observe that every set of V belongs to V[G], so in particular, ([κ]ω)V∈V[G].
In V[G], define Φ:[κ]ω→2 by
[TABLE]
Let D⊆κ be a club set homogeneous for Φ. By the ground club property at κ, there is some C⊆D with C∈V and is a club in V. Pick any f∈([C]ω)V of correct type. Then Φ(f)=0. Thus D is homogeneous for Φ taking value [math]. Therefore C is also homogeneous for Φ taking value [math]. Any function f∈([C]ω)V[G] of the correct type belongs to V.
Let ci=C(ω⋅i+ω). Since C∈V, the sequence (ci:i∈ω) belongs to V. Each ci∈C since C is club and each ci has cofinality ω. Let z∈RV[G]. Let fz={ci:i∈z}. Then fz∈[C]ω and is of correct type. So Φ(fz)=0. fz∈V. Then z={i∈ω:ci∈fz}. So z∈RV.
∎
3. Wellorderable Forcings of Cardinality Less than Θ
This section will show that a nontrivial forcing on a wellorderable set of cardinality less than Θ can not preserve AD. The results of this section are subsumed by the results of Section 5; however, the argument there is far less natural for wellorderable forcings.
Fact 3.1**.**
Assume ZF. Let P be a wellorderable forcing of size λ. Then P has the ground club property at κ for all regular κ>λ.
Proof.
Let p∈P and D˙ be a P name such that p⊩P “D˙⊆κˇ is a club”. For each α<κ, let Aα={p∈P:(∃β<κ)(p⊩PD˙(αˇ)=βˇ)}. Let Bα={β:(∃p∈Aα)(p⊩PD˙(αˇ)=βˇ)}. Since ∣Aα∣≤∣P∣=λ<κ and κ is regular, supBα<κ. Let F(α)=supBα. Note that F(α)≥α since 1P⊩PD˙(αˇ)≥αˇ. Let C={α<κ:(∀η<α)(F(η)<α)}. C is club.
Let G⊆P be a P-generic filter over V with p∈G. Let D=D˙[G]. Suppose α∈C. Since G is generic, for each η<α, G∩Aη=∅. For any q∈G∩Aη, q⊩PD˙(ηˇ)<F(ηˇ)<αˇ. Hence η≤D(η)<α for all η<α. Since D is a club, α∈D. This shows C⊆D in V[G]. Since G was arbitrary with p∈G, p⊩PCˇ⊆D˙.
∎
Theorem 3.2**.**
Assume ZF+AD. If P is a nontrivial wellorderable forcing of cardinality less than Θ, then 1P⊩P¬AD.
Proof.
Suppose ∣P∣=δ where δ<Θ is a cardinal. One may assume P⊆δ.
Let G⊆P be a P-generic filter over V. Assume that V[G]⊨AD. By Fact 2.8, let κ be a cardinal such that δ<κ<ΘV[G] and has the strong partition property in V[G]. Therefore, κ is regular in V. Let p∈G be such that p⊩κ→(κ)2ω. Since δ<Θ, let π:RV→δ be a surjection in V.
Since P⊆δ, if P is nontrivial, then G is a new subset of δ. Since V[G]⊨AD, there is some e∈RV[G] so that Seπ=G by Fact 2.2. If RV=RV[G], then this would imply G∈V. Hence one must have that RV⊊RV[G].
Fact 3.1 implies that P has the ground club propery at κ. Lemma 2.10 implies that p⊩PR˙=Rˇ. So RV=RV[G]. Contradiction.
∎
The previous theorem illustrates the main ideas to be used in Section 5. The above proof uses the partition property κ→(κ)2ω. This requires the theorem to be restricted to wellorderable forcings of cardinality less than Θ. In discussion with Goldberg, the following more elementary argument was found which could apply to more wellorderable forcings:
Fact 3.3**.**
(ZF)* Assume all sets of reals have the Baire property. Let P be a wellorderable forcing such that 1P⊩PRˇ⊊R˙ (adds new reals), then 1P⊩P “Rˇ has no perfect subset”.*
Proof.
Suppose there was a G⊆P which is P-generic over V and V[G]⊨RV has a perfect subset. In V[G], let T be a perfect tree so that [T]⊆RV. Let T˙ be a name for T and q∈G be such that q⊩PT˙ is a perfect tree.
Work in V. For each p∈P, let Ap={x∈R:p⊩Pxˇ∈[T˙]}. Note that if p≤Pq, then each Ap is closed. To see this: Suppose z is a limit point of Ap. Let H be any P-generic filter over V containing p. Since [T˙[H]] is a closed set and Ap⊆[T˙[H]], z∈[T˙[H]]. Since H was arbitrary containing p, p⊩Pzˇ∈[T˙].
Note that in V[G], [T]⊆⋃p≤PqAp. Thus in V, ⋃p≤PqAp is an uncountable set. By the Baire property in V for all sets of reals, a wellordered union of meager sets is meager. Hence, there is some p∈P so that Ap is uncountable. Since Ap is a closed uncountable set, there is some perfect tree U so that [U]⊆Ap. Note that for all t∈U, p⊩Ptˇ∈T˙. Thus p⊩P[Uˇ]⊆[T˙].
In V[G], since U∈V and V[G] has a new real, [U] must have a new real. Then [T˙[G]]=[T] has a new real. But [T]⊆RV. Contradiction.
∎
Fact 3.4**.**
(ZF). Let P be a forcing on a wellorderable set. If R is not wellorderable, then 1P⊩PRˇ is not wellorderable.
Proof.
Since P is wellorderable, let ∣P∣=δ where δ is some ordinal. One may assume P⊆δ. Suppose G⊆P is P-generic over V and V[G]⊨RV is wellorderable. There is an injection Φ:RV→ON. Let Φ˙ be a P-name for Φ.
Work in V: For each r∈R, let Ar={⟨p,β⟩:p⊩PΦ˙(rˇ)=βˇ}, where ⟨⋅,⋅⟩ denotes a definable bijection of ON×ON with ON. Each Ar=∅ and if r=s, then Ar∩As=∅. In V, let Ψ:R→ON be defined by Ψ(r)=minAr. Ψ is an injection and hence RV is wellorderable in V. Contradiction.
∎
Corollary 3.5**.**
Assume ZF+AD. If P is a wellorderable forcing which adds a new real, then 1P⊩P¬AD.
Proof.
Let G⊆P be P-generic over V. By Fact 3.4, V[G] must think that RV is uncountable. By Fact 3.3, RV is an uncountable set of reals without the perfect set property. Thus AD must fail.
∎
Question 3.6**.**
Assume ZF+AD. Can a nontrivial wellorderable forcing preserve AD?
If P is a nontrivial wellorderable forcing, then must P add a new real?
The proof of Theorem 3.2 used the Moschovakis coding lemma to show that nontrivial wellorderable forcing of cardinality less than Θ must add a new real.
4. Preservation of Θ
Trang and Ikegami showed that in natural models of AD+, every forcing that preserves AD must preserve Θ:
Fact 4.1**.**
(Ikegami and Trang) Assume ZF+AD++V=L(P(R)). If P is a nontrivial forcing and 1P⊩PAD, then 1P⊩Θ˙=ΘV.
This section will show under ZF+AD that any forcing which is a surjective image of R that preserves AD must preserve Θ. It will first be shown using Lemma 2.10 that any forcing that adds a new real and preserves AD must preserve Θ.
A nontrivial forcing adds the generic filter as a new object. If P is a surjective image of R, then a new set of reals must be added. It will then be shown under ZF+AD that any nontrivial forcing which is a surjective image of R which preserves AD must actually add a new real. Hence any nontrival forcing which is a surjective image of R must preserve Θ.
Lemma 4.3 and Fact 4.4 below have been known to Ikegami and Trang under ZF+AD++V=L(P(R)) for forcing more general than those which are surjective images of R. An important aspect of their argument involves the sharps of sets of reals. It should be noted that the arguments below are for forcing which are surjective images of R proved under just ZF+AD without DCR. DCR is used in some classical arguments to produce sharps of sets of reals and to show the wellfoundedness of the Wadge hierarchy.
Fact 4.2**.**
Let P be a forcing which is a surjective image of R. For each regular κ≥Θ, P has the ground club property at κ.
Proof.
Let π:R→P be a surjection. Let κ≥Θ be regular.
Let p∈P and D˙ be a P-name so that p⊩P “D˙⊆κˇ is a club”. For each α<κ, let Aα={p∈P:(∃β<κ)(p⊩PD˙(αˇ)=βˇ)}. Let Bα={β:(∃p∈Aα)(p⊩D˙(αˇ)=βˇ)}. Define in V, Φ:R→κ by
[TABLE]
Φ induces a prewellordering on R. Let δ<ΘV be the length of this prewellordering. Hence Φ induces a map Ψ:δ→κ. Since κ is regular in V, Ψ must be bounded below κ.
Thus supBα<κ. Let F(α)=supBα. Let C={α<κ:(∀η<α)(F(η)<α)}. C is a club subset of κ in V. As in the proof of Fact 3.1, p⊩PCˇ⊆D˙.
∎
Lemma 4.3**.**
Assume ZF+AD. If P is a forcing which is a surjective image of R and adds a new real, then 1P⊩PAD implies that 1P⊩PΘ=ΘV.
Proof.
Let G⊆P be a P-generic filter over P. Suppose V[G]⊨AD and ΘV[G]>ΘV.
By Fact 2.8 applied in V[G], there is a κ such that ΘV<κ<ΘV[G] and κ→(κ)2ω. Note κ→(κ)22 implies that κ is regular in V[G]. Hence κ is regular in V. By Fact 4.2, P has the ground club property at κ. Choose p∈G so that p⊩Pκ→(κ)2ω. Lemma 2.10 implies that RV=RV[G]. Contradiction.
∎
Fact 4.4**.**
Assume ZF+AD. Let P be a nontrival forcing which is a surjective image of R. Suppose 1P⊩PAD. Then 1P⊩PRˇ⊊R˙. Hence 1P⊩PΘ˙=ΘV.
Proof.
Let π:R→P be a surjection. Suppose there is some p∈P so that p⊩PRˇ=R˙. Since P is a nontrivial forcing, π−1[G˙] is forced to be a new set of reals. Since p⊩PRˇ=R˙, for each A∈P(R)V, p⊩PAˇ≤wπ−1[G˙].
In V, define Φ:R×R→Θ by
[TABLE]
Thus in V, Φ is a surjection of R×R onto Θ. This is impossible.
∎
Fact 4.5**.**
Assume that P is a forcing which is a surjective image of R. Then there is a forcing Q on R so that for every G⊆P which is P-generic over V, there is an H⊆Q which is Q-generic over V so that V[G]=V[H].
Proof.
Let π:R→P be a surjection. Define a forcing Q on R by p≤Qq if and only if π(p)≤Pπ(q). If G⊆P is a P-generic filter over V, then π−1[G]⊆Q is a Q-generic filter over V and V[G]=V[π−1[G]].
∎
Lemma 4.6**.**
Assume ZF+AD and there is an A⊆R such that V=L(A,R). Let P be a forcing on R such that 1P⊩PAD and P≤wA. Let A⊕RV indicate some fixed recursive coding of the two sets of reals into a single set of reals. (Note that V=L(A⊕RV,RV).) Then 1P⊩V˙=L(Aˇ⊕Rˇ,R˙).
Proof.
Suppose not. Let G⊆P be a P-generic filter over L(A,R) witnessing the failure of the conclusion of the lemma. Here R refers to RL(A,R). Let R∗=R˙L(A,R)[G]. Note that P,R∈L(A⊕R,R∗). Therefore, L(A,R) is a definable inner model of L(A⊕R,R∗). Thus ΘL(A,R)≤ΘL(A⊕R,R∗). Since P,R∈L(A⊕R,R∗), L(A⊕R,R∗)=L(A,R)[G] implies that G∈/L(A⊕R,R∗). Since L(A⊕R,R∗) and L(A,R)[G] have the same set of reals, G Wadge reduces every set of reals in L(A,R∗). In L(A,R)[G], define Φ:R∗→ΘL(A,R∗) by
[TABLE]
Φ is a surjection in L(A,R)[G] of R∗ onto ΘL(A⊕R,R∗). This implies that ΘL(A,R)≤ΘL(A⊕R,R∗)<ΘL(A,R)[G]. This contradicts Fact 4.4 which asserts that ΘL(A,R)=ΘL(A,R)[G].
∎
Fact 4.7**.**
Assume ZF+AD. If P is a forcing which is the surjective image of R and Θ is regular, then 1P⊩PAD implies 1P⊩Θ is regular.
Proof.
Let π:R→P be a surjection. Let G⊆P be a P-generic filter over V. By Fact 4.4, V[G]⊨ΘV[G]=ΘV. Suppose Θ is not regular in V[G]. There is some η<Θ and a function f:η→Θ which is cofinal. Let τ∈V be a P-name so that τ[G]=f.
Now work in V. Define g:η×R→Θ by
[TABLE]
Let ρ:R→η be a surjection. Define h:R→Θ by h(x)=g(ρ(x1),x2), where x=⟨x1,x2⟩ under some standard pairing function. Let x⪯y if and only if h(x)≤h(y). As ⪯ is a prewellordering of R, it has length some δ<Θ. Thus there is a map h~:δ→Θ which is cofinal. This is impossible since Θ is regular in V.
∎
5. Destroying AD When Θ Is Regular
By Fact 4.5, this section will assume that the forcing is on R. For such a forcing P, a name for a real consisting of elements of the form (nˇ,p) for n∈ω and p∈P can be considered subsets of R. In this section, when one writes that a name σ∈P(R), it is understood that σ takes this form.
Definition 5.1**.**
Let P be a forcing on R. P has the name condition if and only if there is an A⊆R so that P≤wA and 1P⊩P “for all r∈R˙, there is a P-name σ∈P(Rˇ)L(Aˇ,Rˇ) so that σ[G˙]=r and L(Aˇ,Rˇ)⊨σ≤wAˇ”.
This means that there is a set A⊆R so that for all G⊆P which are P-generic over V, for all r∈RV[G], there is a set of reals σ in L(A,R) which is also Wadge reducible to A in L(A,R) so that when σ is construed as a P-name, σ[G]=r.
Fact 5.2**.**
Assume ZF+AD. Suppose P is a wellorderable forcing of cardinality less than Θ. Then P has the name condition.
Proof.
Suppose ∣P∣=δ where δ<Θ. One may assume P⊆δ. Suppose τ is a P name so that for some p∈P, p⊩Pτ∈R˙. Let σ={(nˇ,q):q⊩Pnˇ∈τ}. Then p⊩Pσ=τ. Note that σ can be identified as a subset of δ. Since δ<Θ, let ⪯ be a prewellordering of rank δ. By the Moschovakis coding lemma, every subset of δ is coded by a real using ⪯. Thus σ∈L(⪯,R).
∎
Fact 5.3**.**
Assume ZF+AD. Let A⊆R. Let CA be the set of ordinals α less than Θ so that A can Wadge reduce a prewellordering on R of length α. Then CA is bounded below Θ.
Proof.
Suppose not. Define Ψ:R×R→Θ by
[TABLE]
where if ⪯ is a prewellordering on R, then rk⪯(s) denote the rank of s in the prewellordering ⪯. Ψ is a surjection of R×R onto Θ. Contradiction.
∎
Fact 5.4**.**
Assume ZF+AD+Θ is regular. Every forcing P on R such that 1P⊩PAD has the name condition.
Proof.
Let p∈P and G⊆P be a P-generic filter over V such that p∈G. By Fact 4.4 and Fact 4.7, ΘV[G]=ΘV and Θ remains regular in V[G].
Suppose r∈RV[G]. There is some P-name τ∈V so that r=τ[G]. Let σ={(nˇ,s):s⊩Pnˇ∈τ}. Note that σ[G]=τ[G] and σ can be considered as essentially a set of reals.
Since P(R)V∈V[G], one can define a function Φ:RV[G]→Θ by
[TABLE]
where CA, for A⊆R, is defined in Fact 5.3.
In V[G], define x⊑y if and only if Φ(x)≤Φ(y). ⊑ is a prewellordering on R. There is some δ<ΘV[G]=ΘV so that ⊑ has length δ. Thus Φ induces a map Φ~:δ→Θ. Since Θ is regular in V[G], Φ~ and hence Φ is bounded below some γ<Θ.
Fix a prewellordering ⪯∗ in V of length greater than or equal to γ. Let r∈RV[G]. Let σ∈V be a set of reals so that when it is construed as a P-name, σ[G]=r and Φ(r)=(Cσ)V+1. Since γ>sup(Cσ)V, σ can not Wadge reduce ⪯∗ in V. Hence by Wadge’s lemma, σ≤w⪯∗ in V.
It has been shown that in V[G], there is some ordinal γ, so that for any prewellordering ⪯∗∈V of length greater than or equal to γ, every r∈RV[G] has a name σ∈P(R)L(⪯∗,R) so that σ[G]=r and L(⪯∗,R)⊨σ≤w⪯∗. Find some q≤Pp, q∈G, and some γ<Θ so that q which forces this above statement about γ. Since p∈P was arbitrary, it has been shown that there is a dense set of q for which there is some γ so that q forces the above statement involving γ.
Define Ψ:P→Θ by Ψ(q) is the least γ so that q forces the above statement involving γ if such a γ exists. Let Ψ(q)=0 otherwise. Ψ induces a prewellordering on R of length δ<Θ. Since Θ is regular in V, Ψ is bounded below Θ by some γ. Let ⪯∗ be some prewellordering on R of length γ. Let A=⪯∗. One has that A witnesses that P has the name condition.
∎
Lemma 5.5**.**
Assume ZF+AD. Let P be a forcing on R and 1P⊩AD. Assume that P has the name condition. Let A⊆R witness the name condition. Then in L(A,R), 1P⊩PAD, δA has the ground club property, and 1P⊩PδˇA has the strong partition property.
Proof.
Let A witness the name condition. Note that L(A,R)⊨AD.
Throughout this proof, R denotes RV and R∗ denotes RV[G] whenever G is P-generic over V.
Let p∈P. Let G⊆P be any P-generic filter over V containing p. By definition of the name condition, R˙L(A,R)[G]=R˙V[G]. Thus since V[G]⊨AD, L(A,R)[G]⊨AD. Let q≤Pp with q∈G be such that L(A,R)⊨q⊩PAD. Since p∈P was arbitrary, there is a dense set of q∈P so that L(A,R)⊨q⊩PAD. One has that L(A,R)⊨1P⊩PAD.
By Lemma 4.6, L(A,R)[G]=L(A⊕R,R∗).
Let p∈G. Let G⊆P be any P-generic filter over V.
Claim 1: δA=(δA⊕R)L(A⊕R,R∗).
Let r∈R∗. By the name condition, there is some τ⊆R which is Wadge reducible to A and τ[G]=r when τ is construed as a P-name. Note that every set which is Wadge reducible to A appears at level L1(A,R). Let φ(v˙,A⊕R,R˙) be a Σ1 formulas. Suppose that L(A⊕R,R∗)⊨φ(r,A⊕R,R∗). Since L(A⊕R,R∗)=L(A,R)[G], there is some q0≤Pp so that q0∈G and
[TABLE]
By replacement, the following is a true Σ1(L(A,R),R∪{R,A}) formula: (Note that it is important that τ≤wA.)
[TABLE]
By definition of δA, there exists some α<δA so that
[TABLE]
Hence for some α<δA,
[TABLE]
Since q0∈G, the forcing theorem gives
[TABLE]
Also
[TABLE]
Since A witnesses the name condition, every t∈R∗ has a name in L1(A,R). Hence R˙Lα(A,R)[G]=R∗. Thus one has
[TABLE]
Thus
[TABLE]
By upward absolute of Σ1 formulas,
[TABLE]
It has been established that (δA⊕R)L(A⊕R,R∗)≤δA.
Let φ(v˙,A,R˙) be a Σ1 formula and r∈RV. Note R∈L(A⊕R,R∗). Suppose L(A,R)⊨φ(r,A,R). Then
[TABLE]
The following is a true Σ1(L(A⊕R,R∗),R∗∪{A⊕R,R∗}) sentence
[TABLE]
By definition of (δA⊕R)L(A⊕R,R∗), there is some α<(δA⊕R)L(A⊕R,R∗) so that
[TABLE]
Thus
[TABLE]
By upward absoluteness
[TABLE]
This shows that δA≤(δA⊕R)L(A⊕R,R∗). Claim 1 has been established.
By Claim 1, let q≤Pp with q∈G be such that L(A,R)⊨q⊩δˇA=δ˙A⊕Rˇ. Since p∈P was arbitrary, the set of q∈P such that L(A,R)⊨q⊩δˇA=δ˙A⊕Rˇ is dense. Thus L(A,R)⊨1P⊩PδˇA=δ˙A⊕Rˇ.
Fact 2.6 now gives that 1P⊩PδˇA has the strong partition property. It remains to show that δA has the ground club property.
Claim 2: In L(A,R), δA has the ground club property.
Let p∈P and G be P-generic over L(A,R) containing p. Recall again that L(A,R)[G]=L(A⊕R,R∗) by Lemma 4.6 and δAL(A,R)=δA⊕RL(A⊕R,R∗). Let D∈L(A,R)[G] be a club subset of δAL(A,R)=δA⊕RL(A⊕R,R∗). Let ρA⊕R and ς be those objects from Definition 2.4 for A⊕R defined in L(A,R)[G]=L(A⊕R,R∗). Since L(A,R)[G]=L(A⊕R,R∗)⊨AD and Fact 2.2, there is some e∈R∗ so that the graph of the increasing enumeration of D is SeρA⊕R. By the name condition as witnessed by A, there is some P-name e˙⊆R so that e˙≤wA by a Wadge reduction coded in L(A,R) and e˙[G]=e. There is some q0≤Pq with q0∈G so that q0⊩‘‘Se˙ρA⊕R is the graph of an enumeration of a club subset of δˇA”.
By reflection, for each β<δA, the following is a true Σ1 statement in L(A,R) using parameters among A, R, and elements of LδA(A,R):
[TABLE]
where ⟨⋅,⋅⟩ refers to a fixed ordinal pairing function. This merely states that there is a dense set of conditions below q0 which forces a value for the image of βˇ under the function whose graph is Se˙ρAˇ⊕Rˇ.
By the definition of δA in L(A,R), there is some α<δA so that
[TABLE]
Let ϵβ be the least α with this property. By upward absoluteness of the Σ1 formula ς,
[TABLE]
Thus for all P-generic filter H containing q0, the βth element of the club subset of δAL(A,R) enumerated by the function whose graph is Se˙[H]ρA⊕R is less than ϵβ. Define in L(A,R), a function g:δA→δA by g(β)=ϵβ. Let C={μ<δA:(∀γ<μ)(g(γ)<μ)}. By the same argument as in the proof of Fact 3.1, C⊆δA is a club in L(A,R) and q0⊩‘‘Cˇ is a subset of the club enumerated by Se˙ρA⊕R”. Thus L(A,R)[G]⊨C⊆D. This proves Claim 2 and completes the lemma.
∎
Theorem 5.6**.**
Assume ZF+AD+ Θ is regular. Suppose P is a nontrivial forcing which is a surjective image of R. Then 1P⊩P¬AD.
Proof.
By Fact 4.5, one may assume P⊆R. Assume AD is preserved by the forcing. Fact 5.4 implies that P has the name condition. Let A⊆R witness the name condition.
Work in L(A,R). Fact 4.4 states that a new real must be added. However Lemma 2.10 and Lemma 5.5 imply that the ground model and the forcing extension have the same reals. Contradiction.
∎
Corollary 5.7**.**
Assume ZF+AD+V=L(R). No nontrivial forcing P∈LΘ(R) can preserve AD.
In fact, assume ZF+AD++¬ADR+V=L(P(R)). No nontrivial forcing which is the surjective image of R can preserve AD.
Proof.
If there is some set X so that every set is ODX,r for some r∈R, then Θ is regular. Hence if L(R)⊨AD, then L(R)⊨Θ is regular. Woodin showed that if ZF+AD++¬ADR+V=L(P(R)) holds, then there is some set of ordinals J so that V=L(J,R). Hence in these natural models of AD++¬ADR, Θ is regular.
∎
Question 5.8**.**
Assume ZF+AD. If P is a nontrivial forcing which is a surjective image of R, then does 1P⊩P¬AD hold?
By the above, it remains to consider the case when Θ is singular.
Let Θ0 be the supremum of the ordinals which are the surjective image of R by OD surjections. Ikegami and Trang have informed the authors that the consistency of ZF+AD+ and Θ>Θ0 implies the consistency of the statement that there is a forcing P (which is not a surjective image of R) such that 1P⊩PAD∧Θˇ<Θ˙. This model also does not satisfy ZF+AD++V=L(P(R)).