Closed Unbounded classes and the Haertig Quantifier Model
Philip Welch

TL;DR
This paper demonstrates that under certain large cardinal assumptions, there exists a definable class of ordinals with properties that make models built from them invariant under set forcing, sharing many structural features.
Contribution
It introduces a new class of models based on the Haertig quantifier, showing their invariance under forcing and rich combinatorial structure, advancing inner model theory.
Findings
Models satisfy GCH and are elementarily equivalent
Models have a definable wellorder of the reals
Models exhibit many combinatorial principles
Abstract
We show that assuming modest large cardinals, there is a definable class of ordinals, closed and unbounded beneath every uncountable cardinal, so that for any closed and unbounded subclasses , and possess the same reals, satisfy the Generalised Continuum Hypothesis, and moreover are elementarily equivalent. The theory of such models is thus invariant under set forcing. They also all have a rich structure satisfying many of the usual combinatorial principles and a definable wellorder of the reals. One outcome is that we can characterize the inner model constructed using definability in the language augmented by the H\"artig quantifier when such a is itself .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · Logic, Reasoning, and Knowledge
Closed unbounded classes and the Härtig quantifier model
P.D. Welch
School of Mathematics,
University of Bristol,
Bristol, BS8 1TW, England
(24.xii.18)
Abstract
We show that assuming modest large cardinals, there is a definable class of ordinals, closed and unbounded beneath every uncountable cardinal, so that for any closed and unbounded subclasses , and possess the same reals, satisfy the Generalised Continuum Hypothesis, and moreover are elementarily equivalent. The theory of such models is thus invariant under set forcing. They also all have a rich structure satisfying many of the usual combinatorial principles and a definable wellorder of the reals. One outcome is that we can characterize the inner model constructed using definability in the language augmented by the Härtig quantifier when such a is itself . 111We should like to warmly thank the authors of [7] for many discussions on their paper. We first presented this result at the CIRM-Luminy meeting in Oct. 2017, and also should like to thank I. Neeman for pointing out an egregious and nonsensical error in a version of the main theorem here claimed in our talk.
1 Introduction
In this paper we consider inner models of the axioms using constructibility relative to a predicate consisting of a closed and unbounded (cub) class of ordinals. Such models, so of the form , are easily defined (see Kanamori [6]). There are a number of questions one may ask about such: what structural properties they may have: are they models of ? of ? Does hold in them? How do they relate to other well known inner models - are they fine structural? What are their reals? What are their grounds?
Of course if the universe is too thin, these dissolve into triviality, for example if in the first place. Forcing constructions over also give some not terribly interesting consistency results. However it turns out that with a modest large cardinal assumptions in the universe (that there is a measurable limit of measurable cardinals, or more precisely that there exists an elementary embedding of an inner model with a proper class of measurable cardinals to itself - we’ll call the latter assumption ()) then we have the following perhaps surprising theorem:
Theorem 1.1
* Suppose exists. There is a definable proper class C\mbox{ \subseteq }On that is cub beneath every uncountable cardinal, so that for any definable cub subclasses P,Q\mbox{ \subseteq }C:*
[TABLE]
where the elementary equivalence is in the language with a predicate symbol . Consequently these models are all similar to one another: they have the same reals, and their theories are invariant under set forcing.
One might prima facie have surmised that a clever choice of elements of might have allowed some coding of interesting sets in order that at the very least the theories of two such models would be different. But apparently not. A particular example of course is when itself, the latter the class of uncountable cardinals. These models all have a rich structure and we have a complete picture of them: they can be considered as a form of generalised Příkrý class generic extensions of a fine structural model with a proper class of measurables (hence the need for the hypothesis ). This fine structural model will naturally form the core model of the class , for such . They thus have nice combinatorics: holds everywhere, holds. They all have the same set of reals. The elements of are all Jónsson in the model , but not much more. (See Cor. 2.4 below for a listing of such properties.) We should point out that these results can be extended easily to considering sequences from of the same bounded but limit order type order type: again the displayed formulae of Theorem 1.1 would hold for such and too.
We apply this to solve the question of the identity of the Härtig quantifier model (which was the starting point for this paper). In [7] the authors consider the possibilities of using the Gödel method of defining a hierarchy of constructible sets, but augmenting the logic from straightforward first order definability to one where a new quantifier is added to the language. If the enhanced language is called they build a model as follows:
[TABLE]
and then .
If the quantifier is the Härtig quantifier , they dub the model .
Definition 1.2
The Härtig quantifier has the following interpretation:
[TABLE]
For a summary of facts concerning this quantifier see [4]. It is an important point to note that the construction of an -hierarchy in such cases feeds in information from . We would not expect the construction of such a hierarchy to be in any way absolute. Other than in trivial cases (such as when ) we should not expect that for example.
The paper [7] shows, inter alia, the following results:
If , the least inner model of a measurable cardinal, exists then L^{\mu}\mbox{ \subseteq }C(I).
supercompact)
However it is left open as to exactly what model is, or of what kind. It is easy to see that with that where is a one place predicate true of the infinite cardinals (and is defined from the usual first order relativised constructibility hierarchy from the predicate). But that alone tells one very little about the structure of for example whether it has large cardinals, or the holds there. However is a cub class contained in the of the theorem above. The theorem and its proof are thus applicable to . It is important to require the closure of the classes of Theorem 1.1: let be the class of regular cardinals; then we can show that is, barring trivialities, a proper subclass of .
We shall have:
Theorem 5.1
.
where we shall set . Here is the core model, which we regard as here constructed à la Jensen for which see the original manuscript of [5], where the discussion is about mice with measures of order zero, which is all that we shall deal with here. Similarly the first part of [14] gives a full exposition of this theory. Such a model is one of a family of models of the form where is a coherent sequence of extenders. In this context the extenders can be rendered as simply filters (again see [14]). These models possess fine structure, have global wellorders of their domains, satisfy a strong form of the and have strong combinatorial properties, such as Jensen’s -property everywhere. For ‘small’ or ‘thin’ models, they will, like , be models of the statement ‘I am ’:
Corollary 5.2
* .*
This note, assuming large cardinals, rather just that exists, identifies this model: is a generalised Příkrý forcing extension of (an iterate of) the smallest inner model with a proper class of measurable cardinals. One way to express this is to say that, for limit ordinals the -sequences of successor cardinals form Příkrý -sequences for the model which is the least inner model with a measurable cardinal on every . We do this in such a manner that the class is -generic over the model for a certain class forcing . The source of this forcing is Magidor’s iterated Příkrý -forcing ([9] or see [3]) which has a full support; however as the measures in the model are sparsely distributed (there are inaccessible limits of measurables, but no measurable limits of measurables) the forcing can simplified. Here we use such a simplified version as was used for countable sequences in [12], but more relevant here, for any set sized sequences of measurables - again with no measurable limits of measurables - analysed in detail by Fuchs [2]. That will now follow from the existence of (Cor. 5.5).
In a final section we make a few remarks about the relationship between and - the latter the inner model defined using the additional ‘cofinality ’-quantifer . ( is coextensive with where is the class of ordinals of cofinality .) There is extensive discussion in [7] on this model. A model may be large in one sense, even if it does not have any, say measurable cardinals, of its own: it may have inner models with very large cardinals instead, and this would surely count as the model being ‘large’. However in all of the results there, some of which assume very large cardinals in , the outcomes for are nevertheless all consistent with it being also a thin model. We show here that it must be larger than , but not by much, only in that . So, one might conjecture that is also thin:
Conjecture: does not contain a mouse with a measurable of Mitchell order . Or alternatively no mouse with a measurable limit of measurable cardinals with Mitchell order .
Our result here does not imply that a mouse with a measure of Mitchell order is in .
2 The model
The principal model we shall use can be derived as follows.
Definition 2.1
Let name222“O Kukri” - from a Ghurka weapon somewhat intermediate between a dagger and a sword. being the least sound active mouse of the form so that
[TABLE]
Here we mean a mouse in the sense of e.g. [14], and the sequence is a coherent sequence of filters from which we are constructing. Then the following list of Facts are either common knowledge or are easily derived from standard arguments:
(i) is a countable mouse with - the first projectum drops to and there is a definable map of onto .
(ii) We may form iterated ultrapowers of repeatedly using the top measure and its images to form iterates so that “”.
(iii) These iterations generate, or “leave behind”, an inner model
(iv) The cub class of critical points forms a class of indiscernibles that is cub beneath each uncountable cardinal, for the inner model . Indeed an elementary skolem hull argument shows that the form a class of generating indiscernibles for just as the Silver indiscernibles from do for .
(v) From (iii) we have that for any that . Moreover for any we have that , where is the successor cardinal of in the sense of and is thus identical to . If is the iteration map between the iterates displayed, we shall thus have that also is an elementary embedding, which extends to an elementary map . (Again this is similar to the corresponding fact in the embeddings of coming from iterations of the “-mouse”: for Silver indiscernibles for , we have an elementary map , which extends to a map .)
(vi) We may if we wish think of to have the same domain as the model where is a sequence of filters on the which are normal measures in . The fine structure of the latter model was originally done à la Dodd-Jensen ([1]) rather than the style of Jensen in [14]. But the models have the same domain of sets.
We call a class of ordinals appropriate if P\mbox{ \subseteq }C_{M_{0}} is closed and unbounded. For such an appropriate let be its strictly increasing enumeration. Further, for we set and . Note the particular case of interest for later is the appropriate class . With this notation then we shall see the following:
Theorem 2.2
*Assume that exists and is an appropriate class. (i) where is a coherent filter sequence so that “ is measurable” if and only if for some .
(ii) The class of -sequences is mutually Příkrý -generic over for the forcing and .*
A corollary of (the proof of) our theorem will be the following (a restatement if Theorem 1.1):
Theorem 2.3
Assume that exists. Let P,Q\mbox{ \subseteq }C_{M_{0}} be any two appropriate classes. Then
[TABLE]
where the elementary equivalence is in the language with a predicate symbol .
Corollary 2.4
*Assume exists. Let be any appropriate class. Then in :
(i) Each is Jónsson, and forms a coherent sequence of Ramsey cardinals below (see Koepke [8]). But there are no measurable cardinals.
(ii) For any -cardinal we have , , -morasses etc. etc.
(iii) The holds but .
(iv) There is a wellorder of ; -\Pi^{1}_{1}$$) holds for any countable (see [12]), but Det($$\Sigma^{0}_{1}$$($$\Pi^{1}_{1}$$)) fails (Simms, Steel, see [10]).*
Indeed anything else that holds after a Příkrý -generic extension of the model. Notice that will be very far from as any will be in a Ramsey cardinal (hence weakly compact) or a limit of such.
We note the following for later use.
Lemma 2.5
Suppose exists. Let be the model defined above. Let be any other model with a proper class of measurable cardinals, with in the mouse/weasel ordering. Then is a simple iterate of .
**Proof: **As the models are equivalent the comparison of the models will be simple iterations on both sides. The claim is that the iteration on the side is trivial, i.e. no ultrapower is ever taken. However note that if is the least sound mouse that generates then N_{0}=M_{0}=\mbox{O^{k}}. Q.E.D.
In one obvious sense then is the ‘minimal’ model with a proper class of measurable cardinals.
Woodin in [13] considered the question of what occurs when an -sequence of ordinals is added to . Besides reals added by forcing of course, much can happen. He shows that if is an -sequence of ordinals then is a model of GCH. This also used a Příkrý -forcing and a short core model analysis. We comment below on what happens when we choose an sequence or indeed any limit length sequences contained in .
2.1 Universal Iterations
We place here a general discussion on universal iterations of a mouse, which we shall use only here as a device to ensure that certain iterations of a model, although defined externally to the model, leave inaccessibles of the model fixed. These results appeared in a somewhat more recherché form in [11].
Definition 2.6
([11] Def. 2.8) Let be a mouse and be an -admissible ordinal. Then with indices is an -universal iteration of of length , if (i) there are no truncations and dropping of degree of the iteration at any stage and (ii) for any measure with there is , with .
Thus, in an universal iteration, every extender (or its image under the iteration so far) appearing on any extender sequence of the iteration is used unboundedly often before . We shall be using the simplified version of the above where and the extenders are measures are all elements of the models appearing, which are themselves models (and so throughout). The next lemma states that, although there can be many universal iterations of given length, any two such end up with isomorphic results.
Theorem 2.7
([11] Thm. 2.9) Let be an -admissible ordinal. If and are any two -universal iterations of of length then .
We may define a universal iteration in :
Lemma 2.8
([11]) Let be two -admissible ordinals. Then there is an -universal iteration of up to which is an element of .
The point of a universal iteration is that any other iteration of the first model of a shorter length can be embedded into the universal iteration. We formulate that as follows.
Theorem 2.9
([11] Thm. 2.10) Let be an -admissible ordinal. If is an -universal iteration of up to , and is any length -iteration of , (with no truncations or drops in degree) then there is an iteration of of length some (with no truncations or drops in degree) so that for some , .
We thus say that a universal iteration of length absorbs all shorter length (appropriate) iterations of the first model. We shall only use this construction in one particular case. Let be an inner model with only boundedly many measurable cardinals, bounded by some least -regular cardinal say. Then we may just as easily as above define a length universal iteration of the proper class using the measures which are all below , and moreover we define this universal iteration in . But to make it about sets, we consider just some sufficiently large initial segment where is an -inaccessible limit of -inaccessibles. (Our intended will satisfy there are such.) We thus consider the universal iteration to be on the first model of the universal iteration
We then shall have:
Lemma 2.10
Let be any simple iteration of with as above, of length . Then for any -inaccessible , is a fixed point of : .
**Proof: **As has inaccessible height in , \upsilon_{0,\theta}\mbox{``}\gamma\mbox{ \subseteq }\gamma and indeed for any -inaccessible in our chosen interval. (Proven by induction on for the maps by the usual counting of functions in the internally defined iteration .) Further by the Theorem 2.9 there is an iteration of of length some so that for some , . However we have commuting maps . But as the -inaccessibles are fixed points of these maps defined in . So then too. Q.E.D.
3 The Generalized Příkrý forcing
In [2] is developed a style of iterated Příkrý forcing intended for use when there are no measurable limits of measurables. This considerably simplifies the format of the forcing as the manœuvres needed for names in the full Magidor iteration of [9] are not needed. Moreover Fuchs proves a Mathias like characterisation (see Thm. 3.3 below) which we shall make use of. The subsection 3.2 thus borrows heavily from [2], but we shall adopt notation appropriate for this specific case.
3.1 The model
We first defined a simple iteration of by its top measure and its images used times, that left behind the inner model . We fix an appropriate class for this whole discussion. We may then define a normal iteration of to line up the measures of onto the simple limit points of , the . We can reorganise these two into a single normal iteration. where as usual at limit stages direct limits are taken. Indeed given the model , the comparison coiteration of (see [14]) tells us what that iteration is by simply observing the -side, as the model does not move in this. This iteration of ‘leaves behind’ . Between ultrapowers where the top filter from the relevant model is used are the intermediate ultrapowers lining up each of the full measures with the appropriate . It is useful to identify the stages where the top measure is used: we let be this class of indices. It is easy to see that C\mbox{ \subseteq }C_{M_{0}} and is also cub in . Thus with both in we shall have Fact (v) above (and the comments following) holding in this context i.e. we have that for any both in , with :
(1) There is an extension of to with .
Consequently we also have the , which are -indiscernibles for the , will be full indiscernibles for , and inter alia that
[TABLE]
We shall thus have that also is a fully elementary embedding by noting that the domain of is precisely this in the model being left behind. We have then that for each that it is an inaccessible limit of measurables in .
From the above, in we have that is a proper class of discrete measurable cardinals with normal measures (which are indexed on the -sequence by although that is not of much consequence in what follows). We note also the following:
Lemma 3.1
Fix . Let where be a simple iteration of . Then .
**Proof: **Firstly note is strongly inaccessible in as it is indiscernible there. The iteration is divided into two parts: those measures used below and those above. It suffices to note that if the iteration below does not move the rest of the iteration using critical points will not move as, in particular, is not measurable in in . So it suffices to consider only those with measures used below . However for such an iteration, although not necessarily internally definable in , one shows by induction on that cannot move as (*cf. * the arguments using universal iterations in Lemma 2.10). Q.E.D.
As a consequence we have:
(2) Any , is only moved in an iteration if and for some we have .
3.2 The forcing
We proceed to define the forcing in up to the -inaccessible cardinal .
Definition 3.2
*For let be the following set of function pairs so that:
(i) and is finite, where the latter, the support of , is: .
(ii) ,
(iii) \forall\alpha\in\mathop{sp}(h)\,h(\alpha)\mbox{ \subseteq }\min H(\alpha).
(iv) .
*For set iff \forall\alpha\char 60\relax\nu(\,f(\alpha)\supseteq g(\alpha)\,\wedge\,f(\alpha)\backslash g(\alpha)\mbox{ \subseteq }G(\alpha)).
The reader will recognise that we are using a form of Příkrý forcing with full support up to . (Those familiar with [2] will see that we have further simplified by only seeking Příkrý sequences of length in the generic extension.) We have the following basic properties (3)-(7) from Fuchs [2] p.939.
Facts:
(3) For any , any , there is .
For the remainder of these Facts we let be -generic over , and we define by for all .
(4) Then .
(5) where the latter is \{\langle h,H\rangle\in\mathbbm{P}\,\char 124\relax\,{\forall}\alpha\char 60\relax\nu(h(\alpha)\mbox{ \em is an initial segment of }c(\alpha)\wedge c(\alpha){\backslash}h(\alpha)\mbox{ \subseteq }H(\alpha))\}.
The last then yields that .
(6) has the - c.c. (and this is best possible).
(7) For every , the set is finite.
We have the following crucial Mathias-like characterization of this product of forcings, stated in our terms:
Theorem 3.3** **(Fuchs [2] Thm. 1)
A function is -generic over if and only if for every , is finite.
The combinatorics of this argument are somewhat involved so we don’t repeat this here. But a corollary to this, also observed by Fuchs, allows a version of weak homogeneity which we shall exploit later. Since we have full products but only finite supports and thus only finitely many Příkrý -stems, if is any -generic and any condition, there is a finite perturbation of with . Using the Mathias characterisation of 3.3 this is the idea behind
Corollary 3.4** **([2] Cor.1)
*Let be -generic over . Let . Then there exists a sequence which is -generic over so that:
(i) ;
(ii) .*
But such a is in and we have then this model equals . Consequently we have also:
Corollary 3.5
If is any formula and any forcing names for elements of and a name for , and we have
[TABLE]
Again from Fuchs we have (8)-(9):
(8) For (not necessarily in ) can be decomposed as a product with elements of functions with domain and those in with domain .
(9) Forcing with preserves all cardinals and cofinalities excepting the measurable cardinals, which are made cofinal with by the addition of the generic function .
We also have:
(10) Let be a sentence of the forcing language and be a condition. Then there is a ‘pure’ or ‘direct’ extension with , deciding . That is if , then such a is the form where H^{\prime}(\beta)\mbox{ \subseteq }H(\beta) for all . (See, Gitik [3] Lemma 6.2). Further adds no bounded subsets of - the ’th measurable cardinal of (ibid. Sect. 6.)
4 The class version: the full forcing
We may consider the forcings as above, as defined for such , , within .
(11) .
(12) is -generic over if it is so over .
**Proof: **Let . By ‘generic over ’ we mean that intersects every open dense class of definable over . We note that is itself a proper class of . But , together with a global wellorder of its domain definable over . Thus given a formula with parameters defining some open dense class D\mbox{ \subseteq }\mathbbm{P}^{\iota}, we may define by recursion a maximal antichain A\mbox{ \subseteq }D. (6) implies that in and thus is an element of by the acceptability of the hierarchy. Q.E.D.(12)
We may now define the -forcing relation over . Then we shall have:
(13) For , , .
**Proof: **By (11) and (12). Q.E.D.(13)
We let . We may consider to be given by an -relation in the direct limit as some definable (in ) class E\mbox{ \subseteq }V\times V. This domain we can identify with the domain , the sole difference being that the maps , and so direct limit maps are fully elementary: . Of course if there were more ‘ordinals’ above we would say that is isomorphic to a model “ is the largest cardinal”. We define over . Note is also a proper class of ; but nevertheless we can still say that a -forcing relation for is definable by taking the direct limit of the relations defined before (13) above. (It would be natural to want to formalise this whole discussion in Kelley-Morse class theory, noting that we have a strong class choice principle in the form of a global wellorder of (a model of “”) which is -definable. Our -theorem then would additionally talk naturally about all appropriate classes contained in , rather than restricting to -definable ones.)
The Mathias condition in this context is obtained by treating as another indiscernible in :
(14) A proper class function is -generic over if and only if for every , coded in , satisfies is finite.
Another characterisation of being -generic is given below. From now on we let be the sequence where is as defined above. Then .
Lemma 4.1
(15)* Let . Then is -generic over .*
**Proof: **The first assertion will follow from the Mathias condition characterized in Theorem 3.3. But for this we need to observe that for every , is finite. Let be such a sequence. Then and as such is in the domain of the direct limit model . We thus have that for some , and some indices . The iteration only uses critical points and first lines up the next measure onto where is defined to be that least so that
[TABLE]
and then proceeds with the rest of the iteration to . Define for . Then
(16) .
(17) For we have: for any .
**Proof: **For such a , although , (as we are iterating up a smaller measure - meaning not the topmost measure - to ) itself is not a critical point of the iteration, and thus . So and so by (16). Q.E.D.(17)
(18) (i) c(\alpha_{0}){\backslash}\kappa_{i^{0}_{n(0)}+1}\mbox{ \subseteq }X(\alpha_{0}); thus at most finitely many elements of are not in .
(ii) For , c(\beta)\mbox{ \subseteq }X(\beta).
(iii) fulfills the condition for -genericity.
**Proof: **To abbreviate, set and and the latter the full measure on that is being normally iterated up to . Then (the full measure on in in the notation above). But . By normality of the measures in the iteration as well as the intermediate for . But the latter include, for some , the ordinals which form a co-finite tail of .
For (ii) a similar argument: for , there will be some and some such that . Setting this is a full measure on in . Then will have measure , and by normality of the iteration from to , we have for all :
[TABLE]
Thus c(\beta)\mbox{ \subseteq }X(\beta). This concludes (ii) and with (i), (iii) is immediate. Q.E.D.(18)
We now repeat the process below obtaining a descending chain of ordinals verifying new, lower, pieces of the form of the condition for . This process will halt with all of so verified. These details follow.
Then and as such is in the domain of the direct limit model . We thus have that for some , and some indices . Let abbreviate .
The iteration only uses critical points and first lines up the next measure onto where is the least so that .
Define for . Then . Arguing just as for (17) and (18) above we have:
(19) For : for any .
(20) (i) c(\alpha_{1}){\backslash}\kappa_{i^{1}_{n(1)}+1}\mbox{ \subseteq }X(\alpha_{1}); thus at most finitely many elements of are not in .
(ii) For , c(\beta)\mbox{ \subseteq }X(\beta).
(iii) fulfills the condition for -genericity.
We continue in this fashion defining a descending sequence of critical points , and ordinals , and deriving that fulfills the condition for -genericity. We then reach a point where in that for some we have that . As we have that c(0)\mbox{ \subseteq }X(0) and similarly c(\beta)\mbox{ \subseteq }X(\beta) for .
(21) is -generic over .
**Proof: **Setting we then have: , and c(\alpha)\mbox{ \subseteq }X(\alpha) for all not one of the . There are only finitely many , so this follows from (18)(i) and instances of (20)(i). Q.E.D.(21)
This finishes the Lemma. Q.E.D.(Lemma)
Lemma 4.2
(22) If , , with as above arising from the iteration maps , then with etc. as above, there is with , with .
**Proof: **As is -generic (respectively, is -generic) over and , if we define , then will be well-defined and elementary, extending . Furthermore . Q.E.D.
Consequently:
(23) is -generic over .
**Proof: **As we can see, for will be -generic over the direct limit model , as for any , with coded into the condition that be finite is fulfilled. Q.E.D.(23)
We now finish:
**Proof: **of Theorem 1.1. For we take the class of iteration points of the countable mouse by its topmost measure. Given then any cub P,Q\mbox{ \subseteq }C we shall have that there are iteration embeddings and . The reals of all such models are thus the same. As the forcings (with the obvious definition), and add no new bounded subsets of their least measurable we shall have that
[TABLE]
have the same reals, (indeed subsets of , the least measurable cardinal of ) where , are - and -generic over , respectively, . By the elementarity of the topmost condition forces the same sentences in the forcing language over the respective models. Hence . Q.E.D.
Corollary 4.3
If is appropriate, is a -generic extension of its core model - the latter being an iterate of the ‘minimal’ model of a proper class of measurable cardinals, .
**Proof: **With -generic over , contains none of its limit points. But is just together with the latter’s closure. It is thus mutually interconstructible with . Hence . But also . Q.E.D.
With less than a proper class sized the reader will now see easily that similar results apply for set sequences P,Q\mbox{ \subseteq }C of the same limit order type: any two such will have the same reals, the same theories and will look like the same Příkrý -generic extensions of their inner models which now have only a bounded set of measurable cardinals, depending on the length of or .
5 The Härtig quantifier model
We apply the above analysis directly to . However first we show that below computes the canonical inner core model of . We then characterise inside models. This shows that below the Härtig quantifier picks up all the sets of the model (and this is an equivalence to the non-existence of ). We shall let .
Theorem 5.1
.
Proof: follows from the work above: if exists, it is not an element of and hence cannot be which contains . : we compare the models and via coiteration and and with indices where in this case
- the comparison is class length.
(i) is universal.
**Proof: **Assume not. can only have boundedly many measurable cardinals. As there can be no truncation on the -side of this coiteration (see e.g. [14], Lemma 5.3.1), there is some least stage such that for . That is, all the full measures of have been lined up with those of . Thereafter . On the -side there may or may not have been a truncation but in any case if is still a proper class, there is an initial segment of , some say so that the coiteration of with yields the same outcome with the same indices and ultrapowers taken on both sides. We may this assume that is replaced by such a . The point is that some set sized mouse will eventually iterate using repeatedly only some filter and its images, with critical point , for , past leaving this model as behind. Let increasingly enumerate the next -cardinals above , and let their supremum be .
Then (a) the sequence ; (b) as the cardinality of each of the satisfy that and . Consequently the filter to be used at stage is generated by the final segment filter using the sequence , but also by the subsequence . But at this stage we have We further have (c): the cardinals are all fixed points of the embedding . We may thus, in , define on using the same final sequence . Thus . This is an -normal amenable measure on , which is again -complete. We have a contradiction as on the one hand is universal in (it is the actual core model of ), and thus by the theory of such models all -complete normal measures amenable to it are on its sequence; whilst on the other all the measurable cardinals of are strictly below which is less than . Q.E.D.(i)
(ii) .
**Proof: **As we are below (the sharp for the least model of a strong cardinal) it is a theorem of Jensen (see e.g. [14], Thm.7.4.9) that any universal weasel , and by (i) is such, is a simple iterate of in which does not move. If contains no measurable cardinals then the result is proven: there are no measurables in to iterate.
Suppose for a contradiction. In the comparison of with let the first measurable to be moved on the -side be , and let us suppose it to be iterated up to the measurable cardinal in . Suppose there is a further measurable cardinal in above which has critical point (where we take least). Then the measure on here is to be iterated up to some measurable in . (The case of only the one measurable in will be left to the reader.) So we suppose (and so ) has at least two measurable cardinals.
Note that and . Let where the latter is a strong limit -cardinal of -cofinality greater than , where we set .
In iterate the measure on -times, up to and do the same in sending to . Let the resulting models be and on the respective sides. Further let and be the initial segments of the two models cut down to . These are -models. To compare these two all we have to do is iterate the single measure on in up to on in . Let be this iteration map. If strictly increasingly enumerates the next many successor elements of above then all such are less than but are fixed points of the iteration map . Fix a set of definable skolem functions for , and so for too by elementarity. Let be the skolem hull of: . Then where the latter is the skolem hull of: in . (Note that we have and (the latter as ).) Furthermore is definable in since and those components are. Let be the Mostowski-Shepherdson Collapse, and thus .
Check that collapses to F_{\kappa}\mbox{ \subseteq }P, all inside . Hence, as we have we have , and we may then proceed to build, in , a universal class model with this structure as an initial segment. (In Jensen’s nomenclature is a ‘strong mouse’, *cf. * [14] Section 7.1 and Lemma 7.1.1). This is a contradiction since in must simply iterate up to and thus no such can have a measurable cardinal on an ordinal less than .
Q.E.D.((ii) and Theorem)
We then have easily that inside canonical models, if they are not too large then they are their own Härtig quantifier models:
Corollary 5.2
* .*
**Proof: **Again if exists in we have ensured it is outside of . If then . If additionally then we also have K\mbox{ \subseteq }C(I). Q.E.D.
For an inner model let mean that for .
Corollary 5.3
.
**Proof: **This is immediate since , and then will hold if K\mbox{ \subseteq }C(I). Q.E.D.
Corollary 5.4
Assume exists. Then is a -generic extension of its core model , where is as defined above as for .
Corollary 5.5
*Assume exists. Then . *
Proof: , whilst . Q.E.D.
Corollary 5.6
Assume exists. . Consequently
**Proof: **Note that by Cor. 5.4 has the same cardinals as its core model . Also satisfies “”, thus by Cor. 5.2, we have . Q.E.D.
The latter may consistently fail if : let be the forcing extension of that adds a Cohen real , and then collapses to iff . Then . But .
6 The model
We briefly make a few comments on the relationship between the Härtig quantifier model and the model of [7]. For our purposes here we let , and then \mbox{C^{\ast}}=L[\operatorname{Cof}_{\omega}]. We show these models differ in that O^{k}\in\mbox{C^{\ast}} (if it exists) whilst we have shown this must fail for . We first note as an aside a generalisation of an argument of [7] from a single measure to a sequence of such.
Theorem 6.1
Assume has measurable cardinals with measures . Let be the simple iteration of where each measure is iterated in turn times with iteration points . Then {\mbox{C^{\ast}}}=L[E^{\prime}][\langle\langle{\kappa_{\iota}^{\omega\cdot n}\,\char 124\relax\,0\char 60\relax n\char 60\relax\omega}\rangle\,\char 124\relax\,\iota\char 60\relax\theta\rangle].
**Proof: **The assumption on the length of the sequence of ensures that all the measurable cardinals are discrete ordinals: there are no measurable limits of measurables, and thus those arguments in [7] can be straightforwardly deployed for each cardinal in turn. Q.E.D.
We first show by methods of Theorem 5.1 that below is universal. We then show that if exists it must be in . However first we give two lemmata about cofinalities of regular cardinals in iterates of mice. We do the “” example of the mouse in detail first, and just state the generalisation for the case afterwards.
Lemma 6.2
*Let be a simple normal iteration of , the mouse, (i.e. without any truncations), with critical points . Suppose that:
(i) ; (ii) for any .
Then .*
**Proof: **By induction on . Suppose . If then the result follows from the inductive hypothesis as . By assumption is ruled out. For we use the following observations:
Claim (1) If then . Moreover any with has -cofinality .
**Proof: **We claim there is a -definable sequence which is increasing and cofinal in . Let be the least greater than so that . By amenability of and each to follow is well defined. For this, let be the least greater than so that . Then : for if not then setting we should have that is an iterable premouse with an amenable topmost measure illustrating that it is a measurable limit of measurables. is thus, being an initial segment of , in the mouse ordering below which was defined to be the least such mouse. Contradiction! We thus have the first sentence of the Claim. , being a simple iterate of , has the first -projectum dropping below its topmost critical point to . The same is true of and thus the latter is the -Hull of in (we write this as ). Let , where . Then and thus must be bounded in for any -regular . However and the Claim then is proven.
Q.E.D.(Claim (1))
The Lemma follows then in the successor case, since if then as the iteration is normal for any . Suppose now . Let satisfy (i) and (ii) of the Lemma. As is a direct limit model, for an let be such that , for . By elementarity, for such , . Consequently . If for some such then the conclusion of the lemma holds by the inductive hypothesis in (as ). So we may assume . However now we may form, as in the proof of the claim above, the ordinals . The -definability of the sequence yields the same for the sequence . Although the whole iteration is not internally definable in , each ultrapower stage by the measure with critical point , has cofinal in . Further . Proceeding to the direct limit we see that the image of this -sequence will be an -sequence cofinal in . This concludes the limit case and the lemma. Q.E.D.(Lemma)
We state here the generalisation of this for other mice in this region. We say that an iteration has “no drops” if there are no truncations in the iteration, and there are no “drops in degree”, i.e. if is such that then . (Hence the level at which the fine-structural ultrapowers are taken remains constant.) The lemma is proven by similar reasoning to the previous one, which is only an instance of the next with .
Lemma 6.3
*Let . Let have no drops in the above sense. Let be least with . Let . Suppose and that:
(i) is inaccessible but not measurable”; (ii) for any .
Then .*
**Proof: **We just sketch the main point: although may be non-zero, the iteration map at each stage is -preserving and cofinal at the ’th projectum level (and so -preserving) (see [14]). The map restricted to is thus cofinal into . (We recall that equals for any .) Moreover we may pick a definition for a -definable partial, but cofinal, map which thus furnishes an increasing sequence for cofinal in . The range of is thus preserved by this definition throughout the iteration as a -definable set which we may write in increasing order as for , with and . It is clear then that for all . Now we can finish off as in the last lemma defining for any regular in the interval, sequences cofinal in the ordinal by defining appropriate skolem hulls in the successor case, and the mechanism of as analogues of the for the direct limit argument etc. Q.E.D.
Theorem 6.4
* is universal; thus is a simple iterate of .*
**Proof: **We argue as in the proof of (i) of Theorem 5.1 assuming that is not universal for a contradiction, and thus it only has boundedly many measurable cardinals again. We additionally require that is such that there are no further drops on the -side for . Let . Further, instead of setting as the next -cardinals above , we take them as the next ordinals in increasing order satisfying:
(a) ; or if ;
(b) is inaccessible)^{\mbox{K^{\ast}}}.
Claim (i) Each is a fixed point of .
**Proof: **As each of the are inaccessible in N_{0}=\mbox{K^{\ast}} they would be trivially fixed points for any iteration of by measurable cardinals below if the iteration were to be internally definable in . But seemingly there is no guarantee of this. So instead we deploy the universal iteration of Definition 2.6. Let be a regular cardinal of bounding the measurable cardinals of and so of N_{0}=\mbox{K^{\ast}}. By increasing the choice of if necessary, we shall assume without loss of generality that . Let be in an inaccessible limit of inaccessibles. Fix then a universal iteration of length as defined with starting model Q_{0}=\mbox{K^{\ast}}{\upharpoonright}\gamma. Although the iteration is not defined in , Lemma 2.10 then shows that the are all fixed points of this map.
Claim (ii) Each for some critical point in the iteration of by the top measure on .
**Proof: **The instances of (ii) follow from the last two lemmata above. Q.E.D.
We then finish off as follows: let then and is generated by the final segment filter on . As these are fixed points of the embedding we can define as before, in , as this final segment filter generated by on . As is then an -complete measure, we get a contradiction as before.
The next corollary is just a particular example of the above.
Corollary 6.5
If but there is an inner model (say with ’s critical point on the least possible ordinal), then is an iterate of .
Corollary 6.6
If there is an inner model with a proper class of measurable cardinals, then there is such an inner model in .
Then the following ensures that must be different from .
Theorem 6.7
If exists, then it is in .
**Proof: **Assume for a contradiction that \mbox{O^{k}}\notin\mbox{C^{\ast}}. We coiterate with N_{0}=_{\operatorname{df}}\mbox{K^{\ast}} to models . By assumption \mbox{K^{\ast}}\leq^{\ast}L[E_{0}], the latter again the model left behind by the iteration out of ’s top measure.
*Case 1 has a proper class of measurable cardinals.
*As exists it is in and indeed appears as an initial segment of on the sequence. The coiteration immediately starts with a truncation to a of , followed by an ultrapower and thereafter we have a comparison of with . Thus is a simple normal iteration of that generates . In this iteration \mbox{K^{\ast}}=N_{0} does not move, and thus , by Lemma 2.5. Now consider an increasing -sequence of ordinals that (i) have uncountable -cofinality; (ii) are limits of measurable cardinals in , and (iii) are inaccessible in . Such a sequence must exist as there is a cub class of where the topmost measure of is used to form an ultrapower at stage (and this leaves behind a non-measurable but inaccessible limit of measurables in ). Such can be found in as . But conversely any satisfying (i)-(iii) must itself be a critical point , where by (i) and (ii) of the Lemma 6.2 the step has to be an ultrapower step by the topmost measure of . If , then in the direct limit model the topmost measure of on is generated by the final segment filter on \langle\kappa_{\iota(n)}\rangle_{n}\in\mbox{C^{\ast}}. But is then in , and so P_{\iota^{\ast}}\in\mbox{C^{\ast}}. But , that is, it is the (transitive collapse of) the -SH, and thus is also in .
Case 2 Otherwise
We argue that this case cannot occur. If it did, then has a bounded set of measurable cardinals at most. Now argue as in the proof of Theorem 6.4. For some there are no further truncations on the -side of the iteration for . We take for an ascending sequence in of ordinals satisfying (a) and (b) there. (Again, apply the arguments using the universal iteration and Lemma 2.10 that .) We again define an , an -complete measure on {P}(\lambda)^{\mbox{K^{\ast}}} for , with \widetilde{F}\in\mbox{C^{\ast}}. This is a contradiction just as before. So Case 2 cannot occur. Q.E.D.
As discussed above, the exact nature of remains open, but the above methods illustrate starkly how they do not apply to the least sword mouse .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. J. Dodd. The Core Model , volume 61 of London Mathematical Society Lecture Notes in Mathematics . Cambridge University Press, Cambridge, 1982.
- 2[2] G. Fuchs. A characterisation of generalized Příkrý forcing. Archive for Mathematical Logic , 44:935–971, 2005.
- 3[3] M. Gitik. Prikry type forcings. In M. Foreman and A. Kanamori, editors, Handbook of Set Theory , volume 2. Springer Verlag, 2007.
- 4[4] H. Herre, M. Krynicki, A. Pinus, and J. Väänänen. The Härtig Quantifier: a survey. Journal of Symbolic Logic , 56(4):1153–1183, Dec. 1991.
- 5[5] R. B. Jensen. The core model for measures of order zero. Circulated manuscript , Oxford, 1989.
- 6[6] A. Kanamori. The Higher Infinite . Omega Series in Logic. Springer Verlag, New York, 1994.
- 7[7] J. Kennedy, M. Magidor, and J. Väänänen. Inner Models from extended logics. Isaac Newton Preprint Series , NI 16006, January 2016.
- 8[8] P. Koepke. The consistency strength of the free subset problem for ω ω subscript 𝜔 𝜔 \omega_{\omega} . Journal of Symbolic Logic , 49(4):1198–1204, 1984.
