A Reduction in Consistency Strength for Universal Indestructibility ∗† Arthur W. Apter‡ Department of Mathematics Baruch College of CUNY New York, New York 10010 USA and The CUNY Graduate Center, Mathematics 365 Fifth Avenue New York, New York 10016 USA http://faculty.baruch.cuny.edu/apter [email protected] Grigor Sargsyan Group in Logic and the Methodology of Science University of California Berkeley, California 94720 USA http://math.berkeley.edu/∼grigor [email protected] September 4, 2006 (revised March 30, 2007)

Abstract We show how to reduce the assumptions in consistency strength used to prove several theorems on universal indestructibility.

In [3], the first author and Hamkins introduced the concept of universal indestructibility and established several theorems concerning this notion, most prominently the relative consistency of ∗

2000 Mathematics Subject Classifications: 03E35, 03E55 Keywords: Universal indestructibility, indestructibility, measurable cardinal, Woodin cardinal, strongly compact cardinal, supercompact cardinal, cardinal Woodin for supercompactness, high-jump cardinal, almost huge cardinal. ‡ The first author’s research was partially supported by PSC-CUNY Grants and CUNY Collaborative Incentive Grants. †

1

universal indestructibility for both supercompactness and strong compactness. In [1], the first author extended this work and showed the relative consistency of two strongly compact cardinals with universal indestructibility for both supercompactness and strong compactness. All of these results were proven using a high-jump cardinal, a very strong notion reflected by almost hugeness. The purpose of this paper is to reduce the consistency strength used to prove each of these theorems from a high-jump cardinal to something reflected by this notion which we will call a cardinal Woodin for supercompactness. Specifically, we prove the following two theorems. Theorem 1 Universal indestructibility for supercompactness in the presence of a supercompact cardinal is consistent relative to the existence of a cardinal Woodin for supercompactness. Theorem 2 Universal indestructibility for either supercompactness or strong compactness in the presence of two strongly compact cardinals is consistent relative to the existence of a cardinal Woodin for supercompactness. As we will also indicate without proving explicitly, other theorems from [3] are consistent relative to the existence of a cardinal Woodin for supercompactness. Before continuing, we take this opportunity to remind readers of some of the relevant definitions. We say that universal indestructibility for supercompactness holds in a model V for ZFC if every V -supercompact and partially supercompact (including measurable) cardinal δ has its degree of supercompactness fully Laver indestructible [7] under δ-directed closed forcing. Analogously, universal indestructibility for strong compactness holds in a model V for ZFC if every V -strongly compact and partially strongly compact (including measurable) cardinal δ has its degree of strong compactness fully indestructible under δ-directed closed forcing. We recall from [3] that the cardinal κ is a high-jump cardinal if there is an elementary embedding j : V → M having critical point κ such that for some θ we have that M θ ⊆ M and j(f )(κ) < θ for every function f : κ → κ. As Lemma 2 of [3] indicates, if κ is almost huge, then κ is the κth high-jump cardinal. Our key new concept is that of a cardinal κ being Woodin for supercompactness. This will hold if for every f : κ → κ with f (α) a cardinal, there is some δ < κ with f 00 δ ⊆ δ and an 2

elementary embedding j : V → M having critical point δ generated by a supercompact ultrafilter having rank below κ such that M j(f )(δ) ⊆ M . Our terminology comes from the usual definition of a Woodin cardinal. Since by its definition, a cardinal Woodin for supercompactness is also a Woodin cardinal, it follows that if κ is Woodin for supercompactness, then κ is both regular and a limit of measurable cardinals (and as Lemma 1.3 will show, much more). In addition, essentially the same proof used with Woodin cardinals shows that the least cardinal Woodin for supercompactness isn’t weakly compact. The following lemma is central to establishing our results. Lemma 1.1 If κ is a high-jump cardinal, then κ carries a normal measure concentrating on A = {δ < κ | δ is Woodin for supercompactness}. Proof: Our proof is reminiscent of the usual proof that a superstrong cardinal has a normal measure concentrating on Woodin cardinals (see Proposition 26.12 of [6]). Suppose j : V → M is an elementary embedding witnessing that κ is a high-jump cardinal, with θ such that M θ ⊆ M and j(f )(κ) < θ for every f : κ → κ. Fix f : κ → κ such that f (α) is a cardinal, and let λ = j(f )(κ). Take U and U 0 as the λ supercompactness measure and normal measure over κ derived from j, i.e., X ∈ U iff hj(α) | α < λi ∈ j(X), and Y ∈ U 0 iff κ ∈ j(Y ). Then both U and U 0 are elements of M . In addition, for i : V → Ult(V, U) and k : M → Ult(M, U) = M ∗ , the closure properties of M imply that i(f )(κ) = k(f )(κ). Now, for ` : Ult(V, U) → M the factor embedding, i.e., the elementary embedding such that ` ◦ i = j, we know that `  λ = id. Also, by the definitions of ` and λ, `(i(f )(κ)) = j(f )(κ) = λ. Further, if i(f )(κ) < λ, there must be some ν < λ (namely i(f )(κ)) such that `(ν) = λ. However, since `  λ = id, `(ν) = ν. This means that i(f )(κ) = λ = j(f )(κ) = k(f )(κ). And, because cp(j) = κ, M  “f : κ → κ and j(f ) : j(κ) → j(κ) are functions which agree below κ”. By elementarity, M ∗  “k(f ) and k(j(f )) agree below k(κ)”, which immediately yields that k(f )(κ) = k(j(f ))(κ). Putting all of the preceding together allows us to infer that M  “j(f ) : j(κ) → j(κ), j(f )00 κ ⊆ κ, and there is a δ < j(κ) (namely κ) and an elementary embedding k : M → M ∗ with critical point κ generated by a supercompact ultrafilter having rank below j(κ) such that (M ∗ )k(j(f ))(κ) = (M ∗ )k(f )(κ) ⊆ M ∗ ”. By reflection, V  “There is a 3

δ < κ and an elementary embedding k ∗ : V → N with critical point δ generated by a supercompact ultrafilter having rank below κ such that f 00 δ ⊆ δ and N k

∗ (f )(δ)

⊆ N ”. Hence, V  “κ is Woodin

for supercompactness”, so since M θ ⊆ M , M  “κ is Woodin for supercompactness” as well. Consequently, κ ∈ j(A), which means A ∈ U 0 . This completes the proof of Lemma 1.1.  Having completed the proof of Lemma 1.1, we turn our attention now to the proof of Theorem 1. We proceed in analogy to the proof of Theorem 5 given in [3], using the same definition for our forcing conditions as found there. Suppose V  “ZFC + κ is Woodin for supercompactness”. We define a reverse Easton iteration having length κ which does nontrivial forcing only at those stages δ < κ which are measurable cardinals in V . If at such a δ, some condition p ∈ Pδ forces that δ is <γ supercompact in V Pδ for γ the next measurable cardinal above δ and the <γ supercompactness of δ is indestructible under δ-directed closed forcing having rank less than κ, then we stop the Pδ

construction and use as our final model (Vγ )V , assuming we have forced above p. Otherwise, we continue the iteration. In this case, there is some minimal α < γ such that the α supercompactness of δ is destroyed by some δ-directed closed partial ordering Q of rank below κ. By the work of [3], we may assume that forcing with Q leaves no measurable cardinals in the half-open interval ˙ where Q ˙ is a term for such a Q of smallest possible rank. (α, |Q|]. We then let Pδ+1 = Pδ ∗ Q, By the same arguments as in [3], if there is a stage of forcing δ < κ at which we can stop the construction and use (Vγ )V



as our final model, then we have obtained a model for universal

indestructibility for supercompactness containing a supercompact cardinal. Thus, it suffices to show that this is indeed what occurs. If this is not the case, then let f : κ → κ be defined inductively by f (δ) = 0 if δ isn’t a measurable cardinal, but for δ a measurable cardinal, f (δ) is the least inaccessible cardinal above max(α, β, γ), where V Pδ  “γ is the least measurable cardinal above δ and α is the smallest degree of supercompactness of δ below γ that can be destroyed by some δ-directed closed forcing Q which leaves no measurable cardinals in the half-open interval (α, |Q|]”, and β is the smallest rank below κ of such a Q. By the fact κ is Woodin for supercompactness, let δ < κ be such that f 00 δ ⊆ δ and there is an elementary embedding j : V → M having critical 4

˙ δ ∗ R. ˙ By the definition of f , the closure point δ with M j(f )(δ) ⊆ M . Write j(Pδ ) = Pδ ∗ Q properties of M , and the fact that j(κ) ≥ κ (in actuality, j(κ) = κ), we then have that in both V Pδ and M Pδ , forcing with Qδ destroys the α supercompactness of δ, where α is minimal below the least measurable cardinal above δ (which is the same in both V Pδ and M Pδ ), forcing with Qδ leaves no measurable cardinals in the half-open interval (α, |Qδ |], and Qδ has smallest possible rank below κ = j(κ). However, as in the proof of Theorem 5 of [3], the usual reverse Easton arguments show that if G0 is V -generic over Pδ , G1 is V [G0 ]-generic over Qδ , and G2 is V [G0 ][G1 ]generic over R, then j lifts in V [G0 ][G1 ][G2 ] to j : V [G0 ] → M [G0 ][G1 ][G2 ]. We may then find a master condition q for j 00 G1 in V [G0 ][G1 ][G2 ] with respect to the partial ordering j(Qδ ), take G3 as a V [G0 ][G1 ][G2 ]-generic object containing q, and working in V [G0 ][G1 ][G2 ][G3 ], lift j further to j : V [G0 ][G1 ] → M [G0 ][G1 ][G2 ][G3 ]. As usual, U given by X ∈ U iff hj(β) | β < αi ∈ j(X) is a supercompactness measure over (Pδ (α))V [G0 ][G1 ] which is present in V [G0 ][G1 ][G2 ][G3 ]. However, ˙ δ ) in both M [G0 ][G1 ] and V [G0 ][G1 ], U ∈ V [G0 ][G1 ]. This by the closure properties of R ∗ (Q contradicts that forcing with Qδ over V Pδ destroys the α supercompactness of δ and therefore completes the proof of Theorem 1.  Theorems 7 and 8 from [3], in which models for universal indestructibility for strong compactness and universal indestructibility for strongness are constructed, also remain valid when forcing with the same partial orderings as in [3], using a cardinal Woodin for supercompactness and the method of proof given in Theorem 1 above. In addition, Theorem 6 of [3], where a model for universal indestructibility for supercompactness is constructed in which every Ramsey and weakly compact cardinal also satisfies the appropriate form of universal indestructibility, can be proven as well using a cardinal Woodin for supercompactness and the same partial ordering as in [3]. All of these models contain either a supercompact, strongly compact, or strong cardinal. In order to prove Theorem 2, we need the following lemma, which is the analogue of Lemma 1.1 of [1]. It shows that the results of [8] are true for cardinals Woodin for supercompactness.

5

Lemma 1.2 Suppose V  “ZFC + κ is Woodin for supercompactness + P is a partial ordering such that |P| < κ”. Then V P  “κ is Woodin for supercompactness”. Proof: Suppose p ∈ P and f˙ are such that p “f˙ : κ → κ is a function with f˙(α) a cardinal”. Define in V a function g by g(α) = |P|+ if α ≤ |P|, and g(α) = The least inaccessible cardinal above sup({β < κ | For some q extending p, q “f˙(α) = β”}) if α > |P|. Since |P| < κ and κ is a regular limit of measurable cardinals, g is a well-defined function whose values are always cardinals. It is then the case that p “For every α < κ, f˙(α) < g(α)”. By the definitions of g and Woodin for supercompactness, there is some δ < κ, δ > |P| and elementary embedding j : V → M having critical point δ such that g 00 δ ⊆ δ and M j(g)(δ) ⊆ M . By the results of [8], since |P| < δ, j lifts in V P to j : V P → M j(P) . We then have that p “There is δ < κ and an elementary ˙

j(f )(δ) embedding j : V P → M j(P) having critical point δ such that f˙00 δ ⊆ δ and (M j(P) ) ⊆ M j(P) ”.

This completes the proof of Lemma 1.2.  We are just about ready to begin the proof of Theorem 2. Before doing so, however, we prove the following lemma. Lemma 1.3 If κ is Woodin for supercompactness, then {δ < κ | δ is <κ supercompact} is unbounded in κ. Proof: Assume towards a contradiction that {δ < κ | δ is <κ supercompact} is bounded in κ. Let therefore α0 be such that for every α ≥ α0 , θα is the least cardinal below κ with the property that α isn’t θα supercompact. Define f : α → α by f (α) = α0+ if α < α0 , and f (α) = The least inaccessible cardinal above θα if α ≥ α0 . By the fact κ is Woodin for supercompactness, we may find δ < κ, δ > α0+ and an elementary embedding j : V → M with critical point δ such that f 00 δ ⊆ δ and M j(f )(δ) ⊆ M . By the closure properties of M and the definition of f , it then immediately follows that δ is θδ supercompact in both V and M , a contradiction. This completes the proof of Lemma 1.3.  6

We are now ready to prove Theorem 2. Suppose once again that V  “ZFC + κ is Woodin for supercompactness”. By Lemma 1.3, let δ < κ be the smallest cardinal such that V  “δ is <κ supercompact”. Force with the partial ordering P of Theorem 1 of [2] defined with respect to δ. By the results of [2], V P  “δ is the least measurable cardinal, δ is <κ strongly compact, and the <κ strong compactness of δ is indestructible under forcing with δ-directed closed partial orderings having rank below κ”. Since P may be defined so that |P| = δ < κ, by Lemma 1.2, V P  “κ is Woodin for supercompactness”. If we then let Q be the partial ordering of either Theorem 5 or Theorem 6 of [3] (both of which force universal indestructibility for supercompactness) or Theorem 7 of [3] (which forces universal indestructibility for strong compactness), with the first nontrivial stage of forcing taking place at or above the least weakly compact cardinal in V P above δ, then the arguments given in the proof of Theorem 1 of this paper show that the construction of Q terminates ˙

at some stage γ < κ. Let σ < κ, σ > γ be the least weakly compact cardinal above γ in V P∗Q . By the same arguments as in [1], (Vσ )V

˙ P∗Q

is our model for either universal indestructibility for

strong compactness or universal indestructibility for supercompactness (depending upon the exact definition of Q) containing two strongly compact cardinals. This completes the proof of Theorem 2.  Since our constructions require implict applications of Hamkins’ Gap Forcing Theorem of [4] and [5], our proofs are going to require at the minimum as a hypothesis a supercompact limit of supercompact cardinals. Readers are urged to consult [3] for the explicit details. The exact consistency strength of universal indestructibility as discussed in this paper therefore remains unknown. Added in proof: It is possible to reduce the consistency strength of the assumptions used to establish Theorems 1 and 2 still further. Details can be found in our forthcoming paper “An Equiconsistency for Universal Indestructibility”.

7

References [1] A. Apter, “ Universal Indestructibility is Consistent with Two Strongly Compact Cardinals”, Bulletin of the Polish Academy of Sciences 53, 2005, 131–135. [2] A. Apter, M. Gitik, “The Least Measurable can be Strongly Compact and Indestructible”, Journal of Symbolic Logic 63, 1998, 1404–1412. [3] A. Apter, J. D. Hamkins, “Universal Indestructibility”, Kobe Journal of Mathematics 16, 1999, 119–130. [4] J. D. Hamkins, “Gap Forcing”, Israel Journal of Mathematics 125, 2001, 237–252. [5] J. D. Hamkins, “Gap Forcing: Generalizing the L´evy-Solovay Theorem”, Bulletin of Symbolic Logic 5, 1999, 264–272. [6] A. Kanamori, The Higher Infinite, Springer-Verlag, Berlin and New York, 1994. [7] R. Laver, “Making the Supercompactness of κ Indestructible under κ-Directed Closed Forcing”, Israel Journal of Mathematics 29, 1978, 385–388. [8] A. L´evy, R. Solovay, “Measurable Cardinals and the Continuum Hypothesis”, Israel Journal of Mathematics 5, 1967, 234–248.

8

A Reduction in Consistency Strength for Universal ...

Sep 4, 2006 - Department of Mathematics ... The CUNY Graduate Center, Mathematics ... supercompact (including measurable) cardinal δ has its degree of.

123KB Sizes 3 Downloads 271 Views

Recommend Documents

Performance limitations in sensitivity reduction for ... - ScienceDirect.com
ity optimization to a nonlinear time-varying setting. Keywords: Non-minimum phase systems; nonlinear systems; sensitivity reduction; performance limitations; disturbance re- jection. considered in [7,10,16]. For example it has been shown for plants w

Workspace Consistency: A Programming Model for ...
the statement merely evaluates all right-side expressions. (in some order) .... usually indicate software bugs, one response is to throw a runtime exception.

A Course in Universal Algebra
algebra have been developed sufficiently to bring the reader to the brink of ... finds a brief survey of recent developments and several outstanding problems. ..... finite sequence of elements c1,...,cn from P we have a = c1 ≺ c2 ···cn−1 ≺ c

Workspace Consistency: A Programming Model for ...
tor prototype, particularly for applications demanding pipeline parallelism or “all-to-all” communication like the MapReduce model. During a MapReduce, for ...

socializing consistency
often rather interact with a person than a machine: Virtual people may represent a ..... (Cook, 2000), an active topic of discussion as telephone-based call.

Automated Architecture Consistency Checking for ...
implementation, design documents, and model transformations. .... of the same stage of a software development process, e.g., comparing UML sequence.

socializing consistency
demonstrates that as interfaces become more social, social consistency .... action with any number of such complex beings on a daily basis. .... media (stereotypically gender neutral), and computers (stereotypically male) ... In line with predictions

Recruiting Decay for Dynamic Power Reduction in Set ...
specific line, we predict, for each way, whether the line could be live in it. We access all the ways that possibly contain the live line and we call this way selection. ...... In In Proc. of the Int. Conference on Supercomputing, 2002. 11. K. Flautn

Fitted Components for Dimension Reduction in ...
the value of the response to view the full data. ... we cannot view the data in full and dimension reduc- ... ¯µ|y ∈ SY }, where SY denotes the sample space of.

DSP-based Multimode Signaling for FEXT Reduction in ...
Dominant noise in most microstrip interconnects. – Far-end crosstalk (FEXT) proportional to rise time and line length. – FEXT induces jitter (CIJ) at the receiver, ...

Recurrent Neural Networks for Noise Reduction in Robust ... - CiteSeerX
duce a model which uses a deep recurrent auto encoder neural network to denoise ... Training noise reduction models using stereo (clean and noisy) data has ...

Uncertainty Modeling and Error Reduction for Pathline Computation in ...
fundamental tool for deriving other visualization and analysis tech- niques, such as path ...... an extra control point, to perform a fair comparison we also com- pared the linear ..... In Expanding the Frontiers of Visual Analytics and Visualization

Use of adaptive filtering for noise reduction in ...
software solutions to the adaptive system using the two main leaders of adaptive LMS (least mean square) ... environment is variable in time and its development.

A Network Traffic Reduction Method for Cooperative ...
[11], our work in [9] operates across the physical layer and the medium access layer. In this paper, we extend our previous work by developing a network traffic ...

A Heuristic Correlation Algorithm for Data Reduction ...
autonomously monitoring, analysing and optimizing network behaviours. One of the main challenges operators face in this regard is the vast amount of data ...

A Survey of Noise Reduction Methods for Distant ...
H.3.1 [Information Storage and Retrieval]: Content. Analysis ... relation extraction paradigms can be distinguished: 1) open information ... While open information extraction does ..... to the textual source on which it is most frequently applied,.

Transfer Learning in Collaborative Filtering for Sparsity Reduction
ematically, we call such data sparse, where the useful in- ... Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI-10) ... way. We observe that these two challenges are related to each other, and are similar to the ...