Order-isomorphic Morass-definable $\eta_1$-orderings
Bob A Dumas

TL;DR
This paper demonstrates that under certain set-theoretic assumptions, all morass-definable $ ext{eta}_1$-orderings of size $eth_3$ are order-isomorphic, extending classical results to larger cardinalities using morasses.
Contribution
It proves the order-isomorphism of morass-definable $ ext{eta}_1$-orderings of size $eth_3$ in a Cohen extension with a simplified gap-2 morass, extending previous results to larger continuum sizes.
Findings
Morass-definable $ ext{eta}_1$-orderings of size $eth_3$ are order-isomorphic.
Existence of ultrapowers of $ ext{Reals}$ over $ ext{omega}$ that are gap-2 morass-definable.
Construction techniques extend transfinite back-and-forth to size $eth_3$.
Abstract
We prove that in the Cohen extension adding generic reals to a model of containing a simplified -morass, gap-2 morass-definable -orderings with cardinality are order-isomorphic. Hence it is consistent that the and that morass-definable -orderings with cardinality of the continuum are order-isomorphic. We prove that there are ultrapowers of over that are gap-2 morass-definable. The constructions use a simplified gap-2 morass, and commutativity with morass-maps and morass-embeddings, to extend a transfinite back-and-forth construction of order type , to a function between objects of cardinality .
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 · Rings, Modules, and Algebras
Gap-2 Morass-definable -orderings
Bob A. Dumas
University of Washington
Seattle, Washington 98195
(December 9, 2016)
Abstract
We prove that in the Cohen extension adding generic reals to a model of containing a simplified -morass, gap-2 morass-definable -orderings with cardinality are order-isomorphic. Hence it is consistent that and that morass-definable -orderings with cardinality of the continuum are order-isomorphic. We prove that there are ultrapowers of over that are gap-2 morass-definable. The constructions use a simplified gap-2 morass, and commutativity with morass-maps and morass-embeddings, to extend a transfinite back-and-forth construction of order type , to a function between objects of cardinality .
1 Introduction
An -ordering without endpoints, , is a linear-ordering for which countably many consistent order constraints are necessarily witnessed by an object in . That is, if and are both countable, and for every and , , then there is such that for every and , . We consider only -orderings without endpoints, that is or above may be empty.
By the Compactness Theorem, -orderings exist in proliferation at all infinite cardinalities, and there are many well-studied examples of -orderings that play a significant role in logic, topology and analysis. It is an early result of Model Theory that -orderings having cardinality are order-isomorphic. This is proved with a classic back-and-forth construction of the isomorphism. The argument is by transfinite construction of length , requiring that only countably many order commitments need be satisfied at any step of the construction. Hence it is a consequence of the Continuum Hypothesis () that -orderings having cardinality of the continuum, , are order-isomorphic.
We are particularly interested in -orderings without endpoints bearing cardinality of the continuum. We seek to find useful conditions on -orderings in which fails and -orderings bearing cardinality of the continuum are order-isomorphic. In [References] we showed that in a Cohen extension adding -generic reals to a model of containing a simplified -morass, there is a level order-isomorphism between morass-definable -orderings with cardinality of the continuum (Theorem 5.4, [References]). The simplified-morass plays a critical role in that we reduce the element-wise construction of a function between orderings having cardinality to a construction of length .
In this paper, working in the Cohen extension adding generic reals indexed by to a model of containing a simplified -morass, we define a level order-isomorphism between gap-2 morass-definable -orderings having cardinality . Our strategy is as follows. Given a simplified gap-2 morass, , we construct a sequence of level order-preserving bijections, , on the “fake” morasses below in a manner similar to the construction of [References], but with the additional provision that the construction is closed under the embeddings of , for all . Then is a level term function that is forced to be an order-isomorphism between those elements of the -orderings that are also in the generic extension adding reals indexed by . Furthermore, we are able to use the embeddings of , , to extend to a level term function that is forced to be an order-isomorphism between -orderings having cardinality of the continuum in a model of set theory with -generic reals.
In the next paper we show that morass-definable and gap-2 morass-definable -ordered real-closed fields bearing cardinality of the continuum are isomorphic in the Cohen extensions adding or generic reals, by an -linear order-preserving isomorphism. The role of -ordered real-closed fields in the subject of automatic continuity (the existence of discontinuous homomorphisms of , the algebra of continuous real-valued functions on an infinite compact Hausdorff space, ) has been well-explored in , , , , and . We use the techniques of this paper to show that it is consistent that the continuum has cardinality , and that there exists a discontinuous homomorphism of , for any infinite compact Hausdorff space .
2 The Simplified Gap-2 Morass
For a regular cardinal, we define a simplified -morass as in Definition 1.3 [References].
Definition 2.1
* The structure is a simplified -morass provided it has the following properties:*
* is a neat simplified -morass .* 2. 2.
, is a family of embeddings (see page 172, ) from to . 3. 3.
. 4. 4.
. Here is defined by:
[TABLE]
[TABLE] 5. 5.
, is an amalgamation (see page 173 ). 6. 6.
If , a limit ordinal, and , then and and . 7. 7.
If and is a limit ordinal, then:
- (a)
, . 2. (b)
, , . 3. (c)
, , , .
We consider the case in which . If , and , then following the notational simplification of Velleman, we consider to be a triple:
[TABLE]
In the triple above, is an order-preserving injection with . We will refer to this as the first component of the embedding. For , is an order-preserving injection. We refer to this as the second component of the embedding (corresponding to ). Finally for , is a function between morass maps of . We refer to this as the third component of the embedding (corresponding to and ). Embeddings satisfy a number of regularity and commutativity conditions that make them a practical tool for extending our -inductive construction to a construction of cardinality .
3 Morass Maps and Morass-Embeddings
Let be a model of containing a simplified -morass, . Let be the poset , be -generic over and be the forcing language of the poset in . The construction of this paper is dependent on details of the indexing set of . We are required to construct a function between terms in the forcing language that is sensitive to the precise subset of required for the construction of carefully selected terms of . In general, if , we let be the poset . In order to easily associate these partial languages with constructions along the morass, for , let . If is -generic over , let be the factor of that is -generic over (similarly for ).
We will construct a function between sets of terms with cardinality in the forcing language, , by applying the second components of embeddings of a simplified gap-2 morass to a function on a set of terms in with cardinality . If is a simplified -morass, then is a simplified -morass. It is easy to verify that every countable subset of is in the image of a single morass function of . If every countable subset of were in the range of a morass map from a countable vertex, then the construction of Theorem 5.4 [References] would suffice to prove that morass-definable -orderings are order-isomorphic in . However, not every countable subset of is anticipated by a morass map from a countable vertex of . Instead we employ the embeddings of a simplified -morass to anticipate countable subsets of by countable subsets of , and thereby construct a function between sets of terms in the forcing language having cardinality by an inductive construction of length .
The basic strategy of the central construction of this paper is to define a sequence of functions on terms in the forcing language adding generic reals indexed by with the enhanced back-and-forth argument similar to the argument in [References]. The term functions so constructed will be level and satisfy certain closure conditions with the second components of morass-embeddings. We use the embeddings of to “lift” the construction to a function on terms in the forcing language adding generic reals indexed by . We use the following pair of Lemmas due to Velleman.
Lemma 3.1
(Velleman). Let , , and . Then and .
The gap-2 version of this is Lemma 2.2 [References]:
Lemma 3.2
(Velleman) Suppose , , , and . Then , and for all .
We show that every countable subset of is in the range of a morass function, albeit not necessarily from a countable vertex.
Lemma 3.3
Let be a countable subset of . Then there is and such that .
Proof. Let . We assume that . Enumerate the elements of , , with . By condition P5 of the definition of a simplified gap-1 morass there is , and such that . For , there is , and such that . By condition P4 of the definition of a simplified gap-1 morass there is , , and such that and . We observe that
[TABLE]
and
[TABLE]
Hence if , and are in the image of a single morass map .
Let for all . By condition P2 of the simplified gap-1 morass, there is and such that
[TABLE]
We observe that
[TABLE]
Let , , and be such that
[TABLE]
Then
[TABLE]
So by the previous lemma,
[TABLE]
and
[TABLE]
In particular, and . Hence, for all ,
[TABLE]
Lemma 3.4
Assume
* and * 2. 2.
** 3. 3.
For , 4. 4.
For , and . 5. 5.
For , and .
Then there is countable , , , , and such that
** 2. 2.
** 3. 3.
For , there are such that .
Proof: Let , , , , and (), satisfy the hypotheses. By Condition 6 of Definition 2.1, there are , and () such that . Let . Then and
[TABLE]
Since is an injection and ,
[TABLE]
Let . Then
[TABLE]
Since is an embedding,
[TABLE]
Definition 3.5
(Continuation) Let and . If and are such that , then we say that is the -continuation of .
Condition 4 of Definition 2.1 states that, for any , if , then has a -continuation. Condition 6 of Definition 2.1 states that if , a limit ordinal, and then there is such that and have a common -continuation.
Lemma 3.6
Let , and be a sequence satisfying:
** 2. 2.
For all , and 3. 3.
For all , and .
Then there is a sequence satisfying:
For all , and 2. 2.
For all , 3. 3.
For all , 4. 4.
For all , 5. 5.
For all , is the -continuation of 6. 6.
For all , is the -continuation of .
The sequence is called an embedding sequence of .
Proof: Let satisfy the hypothesis of the Lemma. We construct by induction. Let . Assume and that satisfies the conclusion of the Lemma beneath . By Condition 4 and Condition 6 of Definition 2.1, there is countable and that is the -continuation of and . Let where and . Let . Then
[TABLE]
Let . Then
[TABLE]
For any , is the -continuation of .
Definition 3.7
(Complete embedding sequence) Let and and be an embedding sequence of and . Then is a complete embedding sequence for , with respect to , provided that .
If is a complete embedding sequence of , then each embedding gives partial information about . That is
[TABLE]
Later embeddings in the sequence, () necessarily agree with earlier embeddings about , on , but in general will provide information about on a larger subset of , . A complete embedding sequence will provide full information on .
The second term of the embeddings also provides information about . For all ,
[TABLE]
If , then
[TABLE]
and
[TABLE]
Lemma 3.8
Let be countable, , and such that . Then there is , , and such that
[TABLE]
[TABLE]
and
[TABLE]
Proof: Let , , and satisfy the hypothesis of the lemma. By Lemma 3.6 there is a complete embedding sequence for with respect to , . For all , is the -continuation of . Therefore, for all , there is such that
[TABLE]
Let be a countable and, for all , . For , let be the -continuation of . Let . For each , there is such that
[TABLE]
Let . For all , is the -continuation of . Hence
[TABLE]
We observe that
[TABLE]
By a Lemma 3.2,
[TABLE]
and
[TABLE]
Since is a complete embedding sequence with respect to ,
[TABLE]
Then
[TABLE]
Let . Then
[TABLE]
So
[TABLE]
However
[TABLE]
Therefore
[TABLE]
Definition 3.9
(Compatible Maps) Let be ordinals, and be injections. The ordinal maps and are compatible provided that for any , implies .
If and are compatible, then is a well-defined function. Lemma 3.1 implies that morass-maps with the same domain and codomain are compatible.
Lemma 3.10
Let , be the splitting point of the right-branching embedding of , and . Then and are compatible. If then and are compatible conditions in .
Proof. If and are left-branching embeddings then . By Lemma 3.1 they are compatible. Assume that is the right-branching embedding of . Then
[TABLE]
Therefore, by Lemma 3.1, and are compatible.
Let , and be second components of embeddings of . So and are members of or are equal to . Let , , and . Then
[TABLE]
and
[TABLE]
Morass maps are compatible, hence if then and .
Suppose that . Then there is (where is the splitting point of ) and such that . So
[TABLE]
Since ,
[TABLE]
Therefore and .
4 The Gap-1 Construction
In [References], we constructed an order-isomorphism between morass-definable -orderings in the generic extension adding -generic reals of a model of containing a simplified -morass. This was accomplished by an inductive construction of length on terms in the forcing language for adding generic reals, subject to numerous technical constraints, and using the morass maps to “lift” the construction to the generic extension adding generic reals. The benefit of the gap-1 morass is that the necessary back-and-forth construction occurs strictly in the forcing language for adding only generic reals, relying on the morass-maps for the completion of the overall construction.
The conditions required for the gap-1 construction were that the -orderings be morass-definable. We present some adjustments of definitions from the gap-1 construction that will serve us in the gap-2 construction.
Let be a simplified -morass.
Notation 4.1
(, , , ) If , is the poset adding generic reals indexed by and is the set of terms in the forcing language of . For , is the poset for adding generic reals indexed by , and is the set of terms in the forcing language of .
So .
Definition 4.2
(Support) Let . The support of , , is the minimal subset of , , such that . We say that has countable support provided that is countable.
Let . We consider . If is -generic over , then where is -generic over and is -generic over . If is a term of the forcing language of , the value of in the generic extensions will be an element of .
Definition 4.3
(Strict Support) Let and . The term has strict support if there is no proper subset , and such that .
If a term, , has strict support , then will not be an element of , for any proper subset of .
Definition 4.4
(Discerning Set of Terms) A set of terms, , , is discerning provided that every term of has strict support.
Definition 4.5
(Level Function) Let and be discerning sets of terms and . The function is level if for any , and have identical strict support.
Definition 4.6
(Morass-Commutative) Let be regular, be a simplified -morass, and . We say that is morass-commutative beneath provided that for any and , iff . We say that is morass-commutative if it is morass-commutative beneath .
Definition 4.7
(Embedding-Commutative) Let be regular, be a simplified -morass, and . We say that is embedding-commutative beneath provided that for any and , iff . We say that is embedding-commutative if it is embedding-commutative beneath .
Morass-commutativity and embedding-commutativity extend to relations and functions on terms in the obvious way.
Definition 4.8
(Grounded Order-Support) Let be forced to be a linear-ordering and be a discerning set of terms for the domain of . has grounded order-support provided that for all and , -generic over , there is such that .
If has grounded order-support, then for all , and for all with , there is and such that . For instance, has grounded support.
Definition 4.9
(Upward Level-Dense) Let be forced to be a linear-ordering, and be a set of discerning terms for the domain of . is upward level-dense provide that for every , in which has strict order support , with and , there is a discerning term with strict support , such that .
If a set of discerning terms has grounded order-support, and terms bear an order relation in a generic extension, then there is an element of the ground model that is between the elements. If a set of discerning terms is upward level-dense, then between any pair of elements there are elements of arbitrarily large strict support (in the sense of containment) between them.
We will require that the sequence of term functions we are constructing is closed under second components of morass-embeddings between our “fake morasses”. That is, for , and , we require that the partial term function constructed at level , is closed under maps, .
We revise the definition of morass-definability for extension to the gap-2 construction.
Definition 4.10
(Morass-Definable) Let be a simplified -morass, be the poset that adds generic reals indexed by , be a discerning set of terms and . We say is a morass-definable -ordering (with respect to ) provided that
For every , is forced to be an -ordering 2. 2.
* and are morass-commutative and embedding-commutative* 3. 3.
* has grounded order-support and is upward level-dense* 4. 4.
Every term of has countable support.
If is -generic over and is an -ordering we say that is morass-definable provided there is morass-definable with .
If satisfies the conditions of Definition 4.10 below , then we say that is morass-definable below .
If is a c.t.m. of containing a simplified -morass and is the Cohen extension adding generic reals, then in , morass-definable -orderings are order-isomorphic. Furthermore, if is the poset for adding generic reals, and and are morass-definable and are forced to be -orderings, there is a level term function, , that is forced in all -generic extensions to be an order-isomorphism.
5 The Gap-2 Construction
In the proof that morass-definable -orderings are order-isomorphic in the Cohen extension adding -generic reals, we built a term function with cardinality by an inductive construction of length . The constraint on the length of the chain is governed by the possibility that we are unable to to satisfy uncountably many simultaneous consistent order-constraints when committing to discrete extensions. The construction depends on commutative extensions by morass maps to “lift up” the construction to exhaust the required commitments in the forcing language adding generic reals. In the argument using the gap-1 morass, all commitments can be met provided that any countable subset of is in the range of a single morass map from a countable vertex to the vertex.
This strategy does not extend to higher cardinality. Instead, we work in a model of that contains a simplified -morass, , using the morass-embeddings between “fake” morasses, that is, initial segments of the gap-two morass for vertices , . The maps , for embeddings , “lift” a term function on a domain of cardinality to a term function on a domain with cardinality . Provided the term function constructed at stage exhausts and , the technical results of Section 3 allow us to complete the construction of a term function on by closure under second components of morass-embeddings of , .
In Section 4 we adapted the key definitions from [References] to a higher cardinality gap-1 morass and a gap-2 morass. These definitions concern technical considerations for building a function between sets of terms in the forcing language for adding Cohen generic reals that may be extended by compatible injections on ordinals. In passing from the gap-1 construction to the gap-2 construction, we need to use the gap-1 morass maps of and the second components of morass-embeddings , to extend a partial construction of a term function below by closure under second components of embeddings to a term function in the forcing language adding generic reals indexed by . That is, we will make all discrete decisions extending a function in an enhanced back-and-forth construction of length , and “lift” the entire construction by second components of embeddings of to exhaust terms with countable support in the language adding generic reals indexed by .
Assume that are ordinals, is an injection, and that is a term in the forcing language adding generic reals indexed by . We define to be the term in the forcing language adding generic reals indexed by that results from the formal substitution of every indexing ordinal in appearing in by its image under . So is a term in the forcing language adding generic reals indexed by . Morass maps of and the first and second components of morass embeddings of , are order-preserving injections on ordinals. We treat morass maps and second components of morass-embeddings as functions between terms of a forcing language by this convention.
The morass maps of a simplified gap-1 morass have a restricted character. There are only two morass maps from a morass vertex to its successor: identity on an associated ordinal, and a single “splitting” map that translates the cofinal end segment of that ordinal. We need to consider a new collection of ordinal maps along the morass that will enrich the terms we can define by closure under ordinal injections, the second components of the morass embeddings, , for (. We are able to restrict our attention to the morass-embeddings of the amalgamations . Each is an order-preserving injection, but may split its domain into many disconnected pieces that have less predictable intersections with morass maps.
Definition 5.1
(Embedding-closure) Let and be a set of terms in the forcing language . The closure of under is the smallest set of terms of such that and implies . The set is closed under if the closure of is . If , and is closed under , then we say that is embedding-closed at level .
We will require that our sequence of functions be embedding-closed at level for all . We prove a lemma that allows for a transfinite construction of a sequence of embedding-closed term functions along a simplified gap-2 morass. If is a morass-definable -ordering, Then has grounded order-support. If is countable, then c.c.c of implies that there is a countable extension of by elements of the ground model that has grounded order-support.
Lemma 5.2
Let be a countable ordinal and assume
* is a simplified -morass* 2. 2.
* and are morass-definable -orderings* 3. 3.
* has grounded order-support and is morass-commutative* 4. 4.
* is a morass-commutative level term injection that is forced to be order-preserving in all generic extensions.*
Then is a level term injection that is forced to be an order-preserving injection.
Proof: Let , , , and satisfy the hypotheses of the lemma, and . The family of embeddings, is an amalgamation, so it is composed of a single right-branching , and all possible left-branching embeddings. For each left branching embedding of , . The second components of embeddings of are injections. Therefore is level, and the elements of the range of are discerning terms in .
To see that is forced to be a well-defined function, suppose that
; ; and . Since and are discerning terms, so are and . Therefore and must have identical strict support, , and may be replaced by a condition of . We claim that . We observe that for , there are such that . Then there is and such that . However,
[TABLE]
So and . By Lemma 3.1, and are equal up to . Specifically, if , and , then .
Define a relation by iff there is with and . We claim that is a well-defined function and order-preserving injection. If and are witnessing functions from the definition of for , then . Since is an injection, , and is a well-defined function. Assume that and . Then
[TABLE]
Therefore and is an injection. So
[TABLE]
Therefore . Since is morass-commutative, and has grounded order-support, is morass-commutative. Hence
[TABLE]
Therefore is forced to be a well-defined function. The proof that is forced to be an injection is essentially identical.
We show that is forced to be order-preserving. Consider as a function on . Let . If , then . Assume and . Let and and Since has a grounded order-support, there is in and such that . Then
[TABLE]
So
[TABLE]
Therefore it is forced that is order-preserving.
Theorem 5.3
Let be a model of containing a simplified -morass, , and . Let and be sets of discerning terms in for morass-definable -orderings (with respect to ). Then there is a level function from to that is forced to be an order-isomorphism.
Proof. For , let and . We consider and as the restrictions of and , resp., to the forcing language adding generic reals indexed by . In any -generic extension of , , the interpretation of in is the interpretation of in where is the factor of that is -generic over .
We will use the previous Lemma to construct a morass-commutative level term bijection from to that is forced to be an order-isomorphism. The closure under embeddings, where , of this function will be the term function we seek.
Let be an enumeration of that satisfies the condition for all . Let satisfy the same condition with respect to .
We will inductively construct a transfinite sequence of morass-commutative term functions that satisfies the following for all ,
and are morass-commutative, countable sets of terms with grounded order support 2. 2.
and 3. 3.
and 4. 4.
is a morass-commutative level term function that is forced to be an order-preserving bijection 5. 5.
for all
We call a sequence of term functions satisfying these conditions (beneath ) and extendable sequence. We argue be induction on
Case 1: . Then and are elements of the ground model, . Let .
Case 2: . Let be an extendable sequence. By Lemma 5.2, is forced to be an order-preserving bijection. Let and be the least ordinal for which there exists and such that . Then there is such that . Let . Then is the smallest morass-commutative subset of that contains . Let be a countable subset of so that has grounded order-support. By repeated applications of Lemma 4.5 of [References], there is that is a morass-commutative level term function that is forced to be order-preserving and has grounded order-support. By Lemma 4.5, [References], there is such that is a level term function that is forced to be order-preserving. Let . Then is a level term function that is forced to be a bijection. To see that is order-preserving, assume that , , , , is -generic over and . Since the domain of has grounded order-support, there is such that . Then
[TABLE]
Therefore is forced to be order-preserving.
Let be the range of . Let be the smallest morass-commutative subset of that contains . Then has grounded order-support and there is a countable extension of by elements of , , so that has grounded order-support. Again, by applications of Lemma 4.5 [References], there is a level injection, , such that is a level injection extending that is forced to be an order-preserving injection. Let be the range of . Then is an extendable sequence.
Case 3: a limit ordinal. It is routine to verify that is a level injection that is forced to be an order-preserving injection. In a manner identical to the successor case, may be extended to a level injection, with domain containing and range containing , both bearing grounded order-support, in which is forced to be an order-preserving injection.
Let . Then is a level bijection that is forced to be an order-isomorphism. By Lemma 3.8, the domain of is and the range of is .
6 Ultrapowers of over
We turn our attention to , an ultrapower of over a non-principal ultrafilter on , . By results of G. Dales [References], J. Esterle [References] and B. Johnson [References] the existence of an -linear order-preserving monomorphism from the finite elements of , for some non-principal ultrafilter on , , into the Esterle algebra is sufficient to prove the existence of a discontinuous homomorphism of , the algebra of continuous real valued functions on , where is an infinite compact Hausdorff space. In a later paper, relying on the techniques of this paper, we prove that it is consistent that such a monomorphism exists in a model of set theory in which . In anticipation of such a construction, we finish this paper with a proof that in the Cohen extension adding -generic reals of a model of ZFC+CH containing a simplified -morass, there is an ultrapower of over a standard ultrafilter on that is gap-2 morass-definable, and hence is order-isomorphic with other gap-2 morass-definable -orderings. This result extends Theorem 6.15 [References], that in the Cohen extension adding -generic reals of a model of containing a simplified gap-1 morass, ultrapowers of over standard ultrafilters on are order-isomorphic.
By Theorem 5.3, in order to prove that an ultrapower of , , is order-isomorphic with a gap-2 morass-definable -ordering, it sufficient to prove that is gap-2 morass-definable. We show that this is so, provided that is a standard non-principal ultrafilter. We adapt the definition of standard ultrafilter (Definition 6.14 [References]) to a simplified gap-2 morass.
Definition 6.1
(Standard Term for a subset of ) A standard term for a subset of is a term , such that for each , is a canonical term in for a natural number.
Definition 6.2
(Standard Term for an Ultrafilter) Let and be a morass-commutative and embedding-commutative set of standard terms for subsets of (below ) such that for all , is forced to be an ultrafilter in all -generic extensions for . Then is a standard term for an ultrafilter below .
If is a standard term for an ultrafilter below , we say it is a standard ultrafilter.
Definition 6.3
(Complete Standard Term for an Ultrafilter) Let be a standard term for an ultrafilter below . is complete provided that for every standard term for a subset of , , iff .
That is, below , every standard term for a subset of that is forced to be in , is a member of . Every standard term for an ultrafilter has a complete extension. Let be a complete standard term for an ultrafilter and be a standard term for a subset of . There is a standard term for a subset of that decides the membership of in in all -generic extensions. Since is forced to be an ultrafilter, is dense in . We consider as a term for a binary sequence. In this sense, iff . It is clear that there is a standard term for a binary sequence, , such that iff . Let be the standard term for a subset of so that it is forced that if and if . Then it is forced in all generic extensions that .
We wish to construct a standard term for an ultrafilter that commutes with the second components of embeddings of , for all . That is, if is a simplified gap-2 morass, we construct a sequence of standard terms for ultrafilters, , where for each successor, , is a set of standard terms for subsets of in the language adding generic reals indexed by , that is forced to be a non-principal ultrafilter in all -generic extensions of . Furthermore, we require that for all countable , and all , . Since is an amalgamation, all , with a single exception, are left-branching, and hence . By results of [References], the morass closure of under left-branching embeddings have f.i.p. The single right-branching embedding of must be handled independently.
Theorem 6.4
There is a standard ultrafilter, , that commutes with the embeddings of , for all . The ultrapower, , is a gap-2 morass-definable -ordering.
Proof. By Lemma 3.10 the morass-embeddings of an amalgamation , for , are compatible. We construct the sequence by induction on . The limit case is routine, so we assume that has been defined. We wish to show that the closure of under the embeddings of has f.i.p.
Lemma 6.5
Let be a standard ultrafilter, and be an amalgamation. Let be the right-branching embedding, and . If , then .
Proof of Lemma. Let be a standard term for a subset of such that . Then . If is complete, then . If , and , then iff . Hence if , then for all ,
[TABLE]
By Lemma 3.10, are compatible, as members of . It follows that
[TABLE]
If there were a generic extension in which , then in that generic extension,
[TABLE]
Suppose a condition, , forced this. Let be the support of . If were the projection onto , then by a straightforward generalization of Lemma 6.2 [References],
[TABLE]
Then,
[TABLE]
However there is a condition and such that . Therefore there is a condition where
[TABLE]
So the intersection of is forced in all generic extensions to be nonempty. This completes the proof of the Lemma.
Continuing the proof of the Theorem, it follows from Lemma 6.5 that the union under the embeddings of of a standard ultrafilter in has f.i.p., and may be extended to a standard term for an ultrafilter in the forcing language adding generic reals indexed by . It is routine to see that there is a standard ultrafilter, , that commutes with the embeddings of for . We claim that is a gap-2 morass-definable -ordering. It was shown in that is upward level-dense, has countable support and is morass-commutative. By an application of the proof of Lemma 6.10 [References], is embedding-commutative. We show that has grounded order support. We repeat the proof of Lemma 6.13 [References]. Let and be terms for sequences of reals, and . There are terms for sequences or reals, and , such that , and . Let be an ordinal and be an injection, where . Then, since is level dense,
[TABLE]
Let and . Then
[TABLE]
For , let be such that . Let be a standard ultrafilter extending . Then
[TABLE]
In the language of the gap-1 argument, has a grounded order base. Therefore, by Lemma 4.4 [References], has a grounded order support. Hence, is gap-2 morass-definable.
7 Next Results
In this paper and [References] we have extended the classical result that -orderings of cardinality are order-isomorphic. In the next paper we extend the result that there is an -linear isomorphism between -ordered real-closed fields of cardinalty . We show that in the Cohen extension adding -generic reals to a model of ZFC+CH containing a simplified -morass, there is a morass-definable -linear isomorphism between -ordered morass-definable real-closed fields. We then show that in the Cohen extension adding -generic reals to a model of ZFC+CH containing a simplified -morass, there is a gap-2 morass-definable -linear isomorphism between gap-2 morass-definable -orderings. With these results we are able to extend the theorem of Woodin [References] that it is consistent that and there exists a discontinuous homomorphism of . We show that it is consistent that and that there exists a discontinuous homomorphism of , for any infinite compact Hausdorff space, .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] H.G. Dales, “A discontinuous Homomorphism of C(X)”, Amer. J. Math. Vol. 101, No. 3 (Jun., 1979), pp. 647-734
- 2[2] H.G. Dales, “Automatic Continuity: A Survey”, Bull. Lond. Math. Soc. 10 (1978), 129 - 183.
- 3[3] B. A. Dumas, “Order-isomorphic η 1 subscript 𝜂 1 \eta_{1} -orderings in Cohen extensions”, 158 (2009) 1 - 22.
- 4[4] J. Esterle, “Semi-normes on C ( K ) 𝐶 𝐾 C(K) ”, Proc. London Math. Soc. (3), 36 (1978), 27 - 45.
- 5[5] J. Esterle, “Sur l’existence d’un homomorphisme discontinu do C(K)”, Acta Math. Acad. Sci Hungar., 30 (1977), 113 - 127.
- 6[6] J. Esterle, “Injections de semi-groupes divisible dans des alg e ´ ´ 𝑒 \acute{e} bras de convolution et construction d’homomorphismes discontinus des C(K)”, Proc. London Math. Soc. (3) 36 (1978), 59 - 85.
- 7[7] T. Jech, Set Theory , Springer-Verlag 2002.
- 8[8] B. E. Johnson, “Norming C ( ω ) 𝐶 𝜔 C(\omega) and related algebras”, Trans. Amer. Math. Soc., 220 (1976), 37 - 58.
