A strong failure of ℵ0-stability for atomic classes
Michael C. Laskowski
Department of Mathematics
University of Maryland
Partially supported
by NSF grant DMS-1308546.
Saharon Shelah
Hebrew University
Rutgers University
Partially supported by European Research Council grant 338821 and
NSF grant DMS-1362974.
Publication no. 1099.
Abstract
We study classes of atomic models AtT of a countable, complete first-order theory T. We prove that if
AtT is not pcl-small, i.e., there is an atomic model N that realizes uncountably many types over pcl(aˉ) for some finite aˉ from N,
then there are 2ℵ1 non-isomorphic atomic models of T, each of size ℵ1.
1 Introduction
In a series of papers [2, 3, 4], Baldwin and the authors have begun to develop a model theory for complete sentences of Lω1,ω that have fewer than 2ℵ1 non-isomorphic models of size ℵ1. By well known reductions, one can replace the reference to infinitary sentences by restricting to the class of atomic models of a countable, complete first-order theory.111Specifically, for every complete sentence Φ of Lω1,ω, there is a complete first-order theory T in a countable vocabulary containing the vocabulary of Φ such that the models of Φ are precisely the reducts of the class of atomic models of T to the smaller vocabulary.
Fix, for the whole of this paper, a complete theory T in a countable language that has at least one atomic model222A model M is atomic if, for every finite
tuple aˉ from M, tpM(aˉ) is principal i.e., is uniquely determined by a single formula φ(x)∈tpM(aˉ). of size ℵ1.
By theorems of Vaught,
these restrictions on T are well understood.
Such a T has an atomic model if and only if every consistent formula can be extended to a complete formula. Furthermore, any two countable, atomic models of T are isomorphic, and a model is prime if and only if it is countable and atomic. Using a well-known union of chains argument, T has an atomic model of size ℵ1 if and only if the countable atomic model is not minimal, i.e., it has a proper elementary substructure.
The analysis of AtT, the class of atomic models of T, begins by restricting the notion of types to those that can be realized in an atomic model.
Suppose M is atomic and A⊆M. We let
Sat(A) denote the set of complete types p over A for which Ab is an atomic set for some (equivalently, for every) realization b of p. It is easily checked that when A is countable, Sat(A) is a Gδ subset of the Stone space S(A), hence Sat(A) is Polish with respect to the induced topology. We will repeatedly use the fact that any countable, atomic set A is contained in a countable, atomic model M. However, unlike the first-order case, some types in Sat(A) need not extend to types in Sat(M).
Indeed, there are examples where the space Sat(A) is uncountable (hence contains a perfect set) while Sat(M) is countable.
Thus, for analyzing types over countable, atomic sets A⊆M, we are led to consider
[TABLE]
Equivalently, Sat+(A,M) is the set of q∈Sat(A) that can be extended to a type q∗∈Sat(M).
Next, we recall the notion of pseudo-algebraicity, which was introduced in [2], that is the correct analog of algebraicity in the context of atomic models. Suppose M is an atomic model, and b,aˉ are from M. We say b∈pclM(aˉ) if b∈N for every elementary submodel N⪯M that contains aˉ. The seeming dependence on M is illusory – as is noted in [2], if b′,aˉ′ are inside another atomic model M′, and tpM′(b′aˉ′)=tpM(baˉ), then b∈pclM(aˉ) if and only if
b′∈pclM′(aˉ′). It is easily seen that inside any atomic model M, pclM(aˉ) is countable for any finite tuple aˉ. Moreover, if f:M→M′ is an isomorphism of atomic models, then f(pclM(aˉ))=pclM′(f(aˉ)) setwise. As an important special case, if aˉ⊆M′⪯M and f:M→M′ fixes aˉ pointwise, then
f induces an elementary permutation on D=pclM(aˉ), which in turn induces a bijection between Sat+(D,M) and Sat+(D,M′).
We now give the major new definition of this paper:
Definition 1.1
An atomic class AtT with an uncountable model is pcl-small if, for every atomic model N and for every finite aˉ from N,
N realizes only countably many complete types over pclN(aˉ).
**
The name of this notion is by analogy with the first-order case – A complete, first-order theory T is small if and only if for every model N and every finite aˉ from N,
N realizes only countably many complete types over aˉ.
The following proposition relates pcl-smallness with the spaces of types Sat+(D,M).
Proposition 1.2
The atomic class AtT is pcl-small if and only if the space of types Sat+(pclM(aˉ),M) is countable for every countable, atomic model M and every finite aˉ from M.
Proof. First, assume that some atomic model N and finite sequence aˉ from N witness that AtT is not pcl-small. Choose {ci:i∈ω1}⊆N
realizing distinct complete types over D=pclN(aˉ). Also, choose a countable M⪯N that contains aˉ, and hence D. Then {tp(ci/D):i∈ω1} witness that
Sat+(D,M) is uncountable.
For the converse, choose a countable, atomic model M and aˉ from M such that Sat+(D,M) is uncountable, where D=pclM(aˉ).
We will inductively construct a continuous, increasing elementary chain ⟨Mα:α<ω1⟩ of countable, atomic models with M=M0 and, for each ordinal α, there is an element cα∈Mα+1
such that tp(cα/D) is not realized in Mα. Given such a sequence, it is evident that N=⋃α<ω1Mα and aˉ witness that AtT is not pcl-small. To construct such a sequence, we have defined M0 to be M and take unions at limit ordinals. For the successor step, assume Mα has been defined.
As M and Mα are each countable atomic models that contain aˉ, choose an isomorphism f:M→Mα fixing aˉ pointwise. As noted above,
f fixes D setwise. As Mα is countable, so is the set {tp(c/D):c∈Mα}. As Sat+(D,M) is uncountable, choose an atomic type
p∈Sat(M), whose restriction to D is distinct from {f−1(tp(c/D)):c∈Mα}. Now choose cα to realize f(p). Then, as Mαcα
is a countable atomic set, choose a countable elementary extension Mα+1⪰Mα containing cα.
Recall that an atomic class AtT is ℵ0-stable333Sadly, this usage of ‘ℵ0-stability’ is analogous, but distinct from, the familiar first-order notion.
if Sat(M) is countable for all (equivalently, for some) countable atomic models M.
As Sat+(A,M) is a set of projections of types in Sat(M), it will be countable whenever Sat(M) is. This observation makes the following corollary to
Proposition 1.2 immediate:
Corollary 1.3
If an atomic class AtT is ℵ0-stable, then AtT is pcl-small.
The converse to Corollary 1.3 fails. For example, the theory T=REF(bin) of countably many, binary splitting equivalence relations is not ℵ0-stable, yet
pclM(aˉ)=aˉ for every model M and aˉ from M. Thus, Sat(pclM(aˉ)) and hence Sat+(pcl(aˉ),M) is countable for every finite tuple aˉ inside any atomic model M.
The main theorem of this paper is:
Theorem 1.4
Let T be a countable, complete theory T with an uncountable atomic model. If the atomic class AtT is not pcl-small, then
there are 2ℵ1 non-isomorphic models in AtT, each of size ℵ1.
Section 2 sets the stage for the proof. It describes the spaces of types Sat+(A,M), states a transfer theorem for sentences of Lω1,ω(Q), and
details a non-structural configuration arising from non-pcl-smallness. In Section 3, the non-structural configuration is exploited to give a family of 2ℵ0
non-isomorphic structures (N,bˉ∗), where each of the reducts N is in AtT and has size ℵ1.
Theorem 1.4 is finally proved in Section 4. It is remarkable that whereas it is a ZFC theorem, the proof is non-uniform depending on the relative sizes of
the cardinals
2ℵ0 and 2ℵ1.
2 Preliminaries
In this section, we develop some general tools that will be used in the proof of Theorem 1.4.
2.1 On Sat+(A,M)
In this subsection we explore the space of types
[TABLE]
where A is a subset of a countable, atomic model M.
Fix a countable, atomic model M and an arbitrary subset A⊆M. Let P denote the space of complete types in one free variable
over finite subsets of M. As M is atomic,
P can be identified with the set of complete formulas φ(x,m) over M. Implication gives a natural partial order on P, namely
p≤q if and only if dom(p)⊆dom(q) and q⊢p.
One should think of elements of P as ‘finite approximations’ of types in Sat+(A,M). We describe two conditions on p∈P that identify extreme behaviors in this regard.
Definition 2.1
We say a type p∗∈Sat+(A,M) lies above p∈P if there is some pˉ∈Sat(M) extending p∪p∗. As every p∈P extends to a type in Sat(M),
it follows that at least one p∗∈Sat+(A,M) lies above p.
An element p∈P determines a type in Sat+(A,M) if exactly one p∗∈Sat+(A,M) lies above p.
An element p∈P is A-large if {p∗∈Sat+(A,M):p∗ lies above p} is uncountable.
To understand these extreme behaviors, we define a rank function rkA:P→(ω1+1) as follows:
rkA(p)≥0 for all p∈P;
For α≤ω1, rkA(p)≥α if and only if for every β<α and for all finite F, dom(p)⊆F⊆M, there is q∈Sat(F)
with q≥p
that β-A splits, where:
A type q∈Sat(F) A-splits if, for some φ(x,aˉ) with aˉ from A, there are q1,q2≥q with q∪φ(x,aˉ)⊆q1 and
q∪¬φ(x,aˉ)⊆q2; and q∈Sat(F) β-A splits if, in addition, rkA(q1),rkA(q2)≥β.
For α<ω1, we say rkA(p)=α if rkA(p)≥α, but rkA(p)≥α+1.
Proposition 2.2
If p∈P and rkA(p)=α<ω1, then some r≥p determines a type in Sat+(A,M).
Proof. We prove this by induction on α. We begin with α=0. Suppose rkA(p)=0. As rkA(p)≥1, there is a finite F, dom(p)⊆F⊆M
for which there is no q∈Sat(F) and φ(x,aˉ) with aˉ from A for which q≥p and both q∪{φ(x,aˉ)} and q∪{¬φ(x,aˉ)} are consistent.
So fix any r∈Sat(F) with r≥p. Any such r determines a type in Sat+(A,M).
Next, choose 0<α<ω1 and assume the Proposition holds for all β<α. Choose p∈Sat(E) with rkA(p)=α. As rkA(p)≥α, while rkA(p)≥α+1, there is a finite F, E⊆F⊆M for which there is no q∈Sat(F) that both extends p and α-A splits. So choose any q∈Sat(F) with q≥p. If q determines a type in Sat+(A,M), then we finish, so assume otherwise. Thus, there is some φ(x,aˉ) with aˉ from A such that both q∪{φ(x,aˉ)} and q∪{¬φ(x,aˉ)} are consistent. Choose complete types q1,q2∈Sat(Faˉ) extending these partial types. Clearly, both q1,q2≥q,
but since q does not α-A split, at least one of them has rkA(qℓ)<α. But then by our inductive hypothesis, there is r≥qℓ that determines a type
in Sat+(A,M) and we finish.
Next, we turn our attention to A-large types and types of rank at least ω1 and see that these coincide.
We begin with two lemmas, the first involving types of rank at least ω1 and the second involving A-large types.
Lemma 2.3
Assume that E⊆M is finite and p∈Sat(E) has rkA(p)≥ω1. Then:
-
For every finite F, E⊆F⊆M, there is q∈Sat(F), q≥p, with rkA(q)≥ω1; and
2. 2.
There is some formula φ(x,aˉ) with aˉ from A and q1,q2∈P with p∪{φ(x,aˉ)}⊆q1, p∪{¬φ(x,aˉ)}⊆q2,
and both rkA(q1),rkA(q2)≥ω1.
Proof. (1) Fix a finite F satisfying E⊆F⊆M. As rkA(p)≥ω1, for every β<ω1 there is some q≥p with q∈Sat(F)
for which certain extensions of q have rank at least β. It follows that rkA(q)≥β for any such witness. However, as Sat(F) is countable, there is some
q∈Sat(F) which serves as a witness for uncountably many β. Thus, rkA(q)≥ω1 for any such q≥p.
(2) Assume that there were no such formula φ(x,aˉ). Then, for any formula φ(x,aˉ), since P is countable, there would be an ordinal β∗<ω1 such that
either every q∈P extending p∪{φ(x,aˉ)}, rkA(q)<β∗ or every q∈P extending p∪{¬φ(x,aˉ)} has rkA(q)<β∗.
Continuing, as there are only countably many formulas φ(x,aˉ), there would be an ordinal β∗∗<ω1 that works for all formulas φ(x,aˉ).
Restating this, p does not β∗∗-A split, so no extension of p could β∗∗-A split either. This contradicts rkA(p)≥β∗∗+1.
Lemma 2.4
Suppose q∈Sat(F) is A-large. Then:
-
For every finite F′, F⊆F′⊆M, there is some A-large r∈Sat(F′) with r≥q; and
2. 2.
For some φ(x,aˉ), there are A-large extensions r1⊇q∪{φ(x,aˉ)} and r2⊇q∪{¬φ(x,aˉ)}.
Proof. Fix such a q and let
S={p∗∈Sat+(A,M):p∗ lies above q}.
(1) is immediate, since S is uncountable, while Sat(F′) is countable.
For (2), first note that
if there is no such φ(x,aˉ), then there is at most one p∗∈S with the property that:
For any formula φ(x,aˉ) with parameters from A,
φ(x,aˉ)∈p∗ if and only if there is an A-large r∈Sat(Faˉ) extending q∪{φ(x,aˉ)}.
It follows that for any q∗∈S−{p∗}, q∗ lies over some r≥q that is not A-large. That is, using the fact that there are only countably many r≥q,
S−{p∗} is contained in the union of countably many countable sets. But this contradicts q being A-large.
Proposition 2.5
For p∈P, rkA(p)≥ω1 if and only if p is A-large.
Proof. First, assume that rkA(p)≥ω1. Fix an enumeration {cn:n∈ω} of M. Using Clauses (1) and (2) of Lemma 2.3, we inductively construct a tree {pν:ν∈2<ω} of elements of P satisfying:
-
rkA(pν)≥ω1 for all ν∈2<ω;
2. 2.
If lg(ν)=n, then {ci:i<n}⊆dom(pν);
3. 3.
p⟨⟩=p;
4. 4.
For ν⊴μ, pν≤pμ;
5. 5.
For each ν there is a formula φ(x,aˉ) with aˉ from A such that φ(x,aˉ)∈pν0 and ¬φ(x,aˉ)∈pν1.
Given such a tree, for each η∈2ω, let pˉη:=⋃{pη∣n:n∈ω} and let pη∗:=pˉη∣A.
By Clauses (2) and (4), each pˉη∈Sat(M), so each pη∗∈Sat+(A,M). By Clause (5), pη∗=pη′∗ for distinct η,η′∈2ω.
Finally, each of these types lies over p by Clause (3). Thus, p is A-large.
Conversely, we argue by induction on α<ω1 that:
(∗)α: X If p∈P is A-large, then rkA(p)≥α.
Establishing (∗)0 is trivial, and for limit α<ω1, it is easy to establish (∗)α given that (∗)β holds for all β<α.
So assume (∗)α holds and we will establish (∗)α+1.
Choose any A-large p∈P. Towards showing rkA(p)≥α+1, choose any finite F, dom(p)⊆F⊆M.
As Sat(F) is countable and uncountably many types in Sat+(A,M) lie above p, there is some A-large q∈Sat(F) with
q≥p.
Next, by Lemma 2.4 choose a formula φ(x,aˉ) with aˉ from A such that there are A-large extensions r1⊇q∪{φ(x,aˉ)}
and r2⊇q∪{¬φ(x,aˉ)}. Applying (∗)α to both r1,r2 gives rkA(r1),rkA(r2)≥α. Thus, q α-A splits.
Thus, by definition of the rank, rkA(p)≥α+1.
We obtain the following Corollary, which is analogous to the statement ‘If T is small, then the isolated types are dense’ from the first-order context.
Corollary 2.6
If Sat+(A,M) is countable, then every p∈P has an extension q≥p that determines a type in Sat+(A,M).
Proof. If Sat+(A,M) is countable, then no p∈P is A-large. Thus, every p∈P has rkA(p)<ω1 by Proposition 2.5, so has an extension determining a type in Sat+(A,M) by Proposition 2.2.
We close with a complementary result about extensions of A-large types.
Definition 2.7
A type r∈Sat(M) is A-perfect if r↾A is omitted in M and for every finite m from M, the restriction r↾m is A-large.
**
The name perfect is chosen because, relative to the usual topology on Sat(M), there are a perfect set of
A-perfect types extending any A-large p∈P. However, for what follows, all we need to establish
is that there are uncountably many, which is notationally simpler to prove.
Proposition 2.8
Suppose p∈P is A-large. Then there are uncountably many A-perfect r∈Sat(M) extending p.
Proof. Fix an A-large p∈P. Choose a set R⊆Sat(M) of representatives for {p∗∈Sat+(A,M):p∗ lies above p},
i.e., for every such p∗, there is exactly one pˉ∈R whose restriction pˉ↾A=p∗. As p is A-large, R is uncountable. Now, for each finite m from M,
there are only countably many complete q∈Sat(m), and if some q∈Sat(m) is A-small, then only countably many pˉ∈R extend q.
As M is countable, there are only countably many m, hence all but countably many pˉ∈R satisfy pˉ↾m A-large for every m.
Further, again since M is countable, at most countably many pˉ∈R have restrictions to A that are realized in M. Thus, all but countably many pˉ∈R are
A-perfect.
2.2 A transfer result
In this brief subsection we state a transfer result that follows immediately by Keisler’s completeness theorem for the logic Lω1,ω(Q), given in [6].
Recall that Lω1,ω(Q) is the logic obtained by taking the (usual) set of atomic L formulas and closing under boolean combinations, existential quantification,
the ‘Q-quantifier,’ i.e., if θ(y,x) is a formula, then so is Qyθ(y,x); and countable conjunctions of formulas involving a finite set of free variables,
i.e., if {ψi(x):i∈ω} is a set of formulas, then so is ⋀i∈ωψi(x). We are only interested in standard interpretations of these formulas,
i.e., M⊨⋀i∈ωψi(aˉ) if and only if M⊨ψi(aˉ) for every i∈ω; and M⊨Qyθ(y,aˉ) if and only if the solution
set θ(M,aˉ) is uncountable.
Throughout the discussion let ZFC∗ denote a sufficiently large, finite subset of the ZFC axioms. In the notation of [8], Proposition 2.9 states that sentences of Lω1,ω(Q) are grounded.
Proposition 2.9
Suppose L is a countable language, and Φ∈Lω1,ω(Q) are given.
There is a sufficiently large, finite subset ZFC∗ of ZFC such that
IF there is a countable, transitive model (B,ϵ)⊨ZFC∗ with L,Φ∈B and
[TABLE]
THEN (in V!) there is N⊨Φ and ∣N∣=ℵ1.
Proof. This follows immediately from Keiser’s completeness theorem for Lω1,ω, given that provability is absolute between transitive models of set theory.
More modern, ‘constructive’ proofs can be found in [1] and [2]. These use the existence B-normal ultrafilters. Given an arbitrary language L∗∈B
and any countable L∗-structure (B,E,…) where the reduct (B,E) is an ω-model of ZFC∗, for any B-normal ultrafilter U, the ultrapower
Ult(B,U) is a countable, ω-model that is an L∗-elementary extension of (B,E,…). It has the additional property that for any L∗-definable subset
D, DUlt(B,U) properly extends DB if and only if (B,E,…)⊨‘D is uncountable’.
Using this, one constructs (in V!) a continuous, L∗-elementary ω1-sequence ⟨Bα:α<ω1⟩ of ω-models, where each
Bα+1=Ult(Bα,Uα). Then the interpretation MC where C=⋃α∈ω1Bα will be a suitable choice of N.
More details of this construction are given in [1] or [2].
2.3 A configuration arising from non-pcl-smallness
The goal of this subsection is to prove the following Proposition, the data from which will be used throughout Section 3.
Proposition 2.10
Assume T is a countable, complete theory for which AtT has an uncountable atomic model, but is not pcl-small.
Then there are a countable, atomic M∗∈AtT, finite sequences aˉ∗⊆bˉ∗⊆M∗, and complete 1-types {rj(x,bˉ∗):j∈ω}
such that, letting D∗=pclM∗(aˉ∗), An=⋃{rj(M∗,bˉ∗):j<n} and A∗=⋃{An:n∈ω} we have:
-
A∗⊆D∗;
2. 2.
Sat+(An,M∗)* is countable for every n∈ω; but*
3. 3.
Sat+(A∗,M∗)* is uncountable.*
Proof. Fix any countable, atomic M∗∈AtT. Using Proposition 1.2 and the non-pcl-smallness of AtT, choose a finite tuple aˉ∗⊆M∗
such that Sat+(D∗,M∗) is uncountable, where
D∗=pclM∗(aˉ∗)⊆M∗.
Fix any finite tuple bˉ⊇aˉ∗ from M∗ and look at the complete 1-types Qbˉ:={r∈Sat(bˉ) such that r(M∗)⊆D∗}.
These types visibly induce a partition D∗, and it is easily seen that if bˉ′⊇bˉ, the partition induced by bˉ′ refines the partition induced by bˉ.
Let Q:=⋃{Qbˉ:aˉ∗⊆bˉ⊆M∗}.
Define a rank function rk:Q→ON∪{∞} as follows:
rk(c/bˉ)≥0 if and only if tp(c/bˉ)∈Q;
rk(c/bˉ)≥1 if and only if tp(c/bˉ)∈Q and there are infinitely many c′∈D∗ realizing tp(c/D∗); and
for an ordinal α≥2, rk(c/bˉ)≥α if and only if for every β<α and every bˉ′ from M∗,
there is c′∈D∗ realizing tp(c/bˉ) such that rk(c′/bˉbˉ′)≥β.
rk(c/bˉ)=α if and only if rk(c/bˉ)≥α but rk(c/bˉ)≥α+1.
Claim 1. For every r∈Q, rk(r) is a countable ordinal.
Proof. Assume by way of contradiction that rk(c/bˉ)≥ω1 for some type c/bˉ. Then, for any bˉ′ from M, as D∗ is countable, there is
an element c′∈D∗ such that rk(c′/bˉbˉ′)≥β for uncountably many β’s, hence rk(c′/bˉbˉ′)≥ω1 as well.
Using this idea, if we let ⟨bˉn:n∈ω⟩ be an increasing sequence of finite sequences from M∗ whose union is all of M∗,
then we can find a sequence ⟨cn:n∈ω⟩ of elements from D∗ such that, for each n, rk(cn/bˉn)≥ω1
and tp(cn/bˉn)⊆tp(cn+1/bˉn+1).
The union of these 1-types yields a complete, atomic 1-type q∈Sat(M∗) all of whose realizations are in pclM∗(aˉ).
However, since the type asserting that ‘x=c’ has rank 0 for each c∈D∗, q is omitted in M∗. To obtain a contradiction, choose a realization e of q and,
as M∗e is a countable, atomic set, construct a countable, elementary extension M′⪰M∗ with e∈M′. But now, q implies that e∈pclM′(aˉ),
yet this is contradicted by the fact that M∗ contains aˉ but not e.
As notation, for a subset \SS⊆Qbˉ, let A\SS=⋃{r(M∗):r∈\SS}, which is always a subset of D∗.
Define the set of ‘candidates’ as
[TABLE]
Note that C is non-empty as (\SS0,aˉ∗)∈C, where \SS0 is an enumeration of all the complete, pseudo-algebraic types over aˉ∗.
Among all candidates, choose (\SS∗,bˉ∗)∈C such that
[TABLE]
is as small as possible.
Enumerate \SS∗={rj:j∈ω} and put A∗:=A\SS∗ and An:=⋃{rj(M∗,bˉ∗):j<n} for each n∈ω.
As Clauses (1) and (3) are immediate, it suffices to prove the following Claim:
Claim 2. For each n∈ω, Sat+(An,M∗) is countable.
Proof. Fix any n∈ω. First, note that if rk(rj)=0 for every j<n, then An would be finite, which would imply Sat(An) is countable. As
Sat(An) contains Sat+(An,M∗), the result follows.
Now assume rk(rj)>0 for at least one j<n. Let β:=max{rk(rj):j<n} and let F={j<n:rk(rj)=β}.
Clearly, β<α∗.
For each j∈F, as β>0 but rk(rj)≥β+1, there is a finite tuple bˉj such that
rk(c/bˉ∗bˉj)<β for all c∈rj(M∗).
Let bˉ′ be the concatenation of bˉ∗ with each bˉj for j∈F and let
[TABLE]
Subclaim. rk(r′)<β for every r′∈\SS′.
Proof. Fix r′∈\SS′ and choose c∈r′(M∗,bˉ′). There are two cases. On one hand, if r′ extends some rj with j∈F, then
rk(c/bˉ′)≤rk(c/bˉ∗bˉj)<β. On the other hand, if r′ extends some rj with rj∈F, then as rk(rj)<β,
rk(c/bˉ′)≤rk(c/bˉ∗)<β.
Clearly A\SS′=An, so Sat+(An,M∗)=Sat+(A\SS′,M∗).
Thus, if Sat+(An,M∗) were uncountable, then (\SS′,bˉ′) would be a candidate, i.e., an element of C.
But, as β<α∗, this is impossible by the Subclaim and the minimality of α∗.
3 A family of 2ℵ0 atomic models of size ℵ1
Throughout the whole of this section, we assume that T is a complete theory in a countable language for which AtT has an uncountable atomic model, but is
not pcl-small. Appealing to Proposition 2.10,
Fix, for the whole of this section, a countable atomic model M∗, tuples aˉ∗⊆bˉ∗⊆M∗ and sets A∗ and An for each
n∈ω as in Proposition 2.10.
We work with this fixed configuration for the whole of this section and, in Subsection 3.3 eventually prove:
Proposition 3.1
There is a family {(Nη,bˉ∗):η∈2ω} of atomic models of T, each of size ℵ1,
that are pairwise non-isomorphic over bˉ∗.
3.1 Colorings of models realizing many types over A∗
Definition 3.2
Call a structure (N,bˉ∗) rich if N∈AtT has size ℵ1, M∗⪯N, and N realizes uncountably many
1-types over A∗.
**
Lemma 3.3
For each n∈ω, a rich (N,bˉ∗) realizes only countably many distinct 1-types over An.
Proof. Fix any (N,bˉ∗) and n<ω as above. If {ci:i∈ω1} realize distinct types over An, then the types {tpN(ci/M∗):i∈ω1}
would be distinct, contradicting Sat+(An,M∗) countable.
How can we tell whether rich structures are non-isomorphic?
We introduce the notion of U-colorings and Corollary 3.6 gives a sufficient condition.
Definition 3.4
Fix a subset U⊆ω and a rich (N,bˉ∗).
For elements d,d′∈N, define the splitting number spl(d,d′)∈(ω+1)
to be the least k<ω such that tp(d/Ak)=tp(d′/Ak) if such exists; and spl(d,d′)=ω if
tp(d/A∗)=tp(d′/A∗).
A U-coloring of a rich (N,bˉ∗) is a function
[TABLE]
such that for all pairs d,d′∈N, at least one of the following hold:
-
tp(d/A∗)=tp(d′/A∗); or
2. 2.
c(d)=c(d′); or
3. 3.
spl(d,d′)∈U.
The color filter F(N,bˉ∗):={U⊆ω: a U-coloring of (N,bˉ∗) exists}.
Lemma 3.5
Fix a rich (N,bˉ∗). Then:
-
F(N,bˉ∗)* is a filter;*
2. 2.
F(N,bˉ∗)* contains the cofinite subsets of ω; but*
3. 3.
No finite U⊆ω is in F(N,bˉ∗).
Proof. (1) First, note that if U⊆U′⊆ω, then every U-coloring c is also a U′-coloring. Thus, F(N,bˉ∗) is upward closed.
Next, suppose U1∈F(N,bˉ∗) via the coloring c1:N→ω and U2∈F(N,aˉ∗bˉ∗) via the coloring c2:N→ω.
Fix any bijection t:ω×ω→ω. It is easily checked that c∗:N→ω defined by c∗(d)=t(c1(d),c2(d)) is a
U1∩U2-coloring of (N,bˉ∗). Thus, U1∩U2∈F(N,bˉ∗). So F(N,bˉ∗) is a filter.
(2) As F(N,bˉ∗) is a filter, it suffices to show
(ω−n)∈F(N,bˉ∗) for each n∈ω. So fix such an n. By Lemma 3.3, N realizes at most countably many types over An.
Thus, we can produce a map c:N→ω such that c(d)=c(d′) if and only if tp(d/An)=tp(d′/An). As any such c is an (ω−n)-coloring,
(ω−n)∈F(N,bˉ∗).
(3) It suffices to show that no n={0,…,n−1} is in F(N,bˉ∗). To see this, let c:N→ω be an arbitrary map.
We will show that c is not an {0,…,n−1}-coloring. As
N realizes ℵ1 distinct types over A∗, there is some m∗∈ω and an uncountable subset
{dα:α<ω1}⊆N that realize distinct types over A∗, yet c(dα)=m∗ for each α.
However, as N realizes only countably many types over An, there are α=β such that n≤spl(dα,dβ)<ω.
Thus, c is not an {0,…,n−1}-coloring.
We close with a sufficient condition for non-isomorphism of rich models.
Corollary 3.6
Suppose that for ℓ=1,2, (Nℓ,bˉ∗) is a Uℓ-colored rich model, and U1∩U2 is finite. Then there is
no isomorphism f:N1→N2 fixing bˉ∗ pointwise.
Proof. If there were such an isomorphism, then (N2,bˉ∗) would be both U1-colored and U2-colored. Thus, both U1,U2∈F(N2,bˉ∗),
which contradicts Lemma 3.5.
3.2 Constructing a colored rich model via forcing
Arguing as in the proof of Proposition 1.2, from the data of Lemma 2.10 we can construct a rich (N,bˉ∗)
as the union of a continuous, elementary chain ⟨Mα:α∈ω1⟩
of countable, atomic models with M0=M∗ such that, for each α∈ω1 there is a distinguished bα∈Mα+1 such that tp(bα/A∗) is
omitted in Mα.
Our goal is to construct a sufficiently generic rich (N,bˉ∗), along with a coloring c:N→(ω+1) via forcing.
Our forcing (Q,≤Q) encodes finite approximations of such an (N,bˉ∗) and c. A fundamental building block is the notion of
a striated type over a finite subset aˉ satisfying bˉ∗⊆aˉ⊆M∗.
As an atomic type over a finite subset is generated by a complete formula,
we use the terms interchangeably.
Definition 3.7
Choose a finite tuple aˉ with bˉ∗⊆aˉ⊆M∗. A striated type over aˉ is a complete formula
θ(x)∈Sat(aˉ) whose variables are partitioned as x=⟨xj:j<ℓ⟩ where, for each j, xj=⟨xj,n:n<n(j)⟩ is an n(j)-tuple of variable symbols
that satisfy tp(xj,0/aˉ∪{xi:i<j}) is A∗-large. The integer ℓ is the length of the striated type.
A simple realization of a striated type θ(x) of length ℓ is a sequence bˉ=⟨bˉj:j<ℓ⟩ of tuples from M∗ such that M∗⊨θ(bˉ).
A perfect chain realization of θ(x) is a pair (M,bˉ), consisting of a chain M0⪯M1⪯Mℓ−1⪯M∗
of ℓ elementary submodels of M∗ and a simple realization bˉ=⟨bˉj:j<ℓ⟩ from M∗ that satisfy: For each j<ℓ,
-
aˉ∪{bˉi:i<j}⊆Mj; and
2. 2.
tp(bj,0/Mj) is A∗-perfect (see Definition 2.7).
Lemma 3.8
Every striated type θ(x)∈Sat(aˉ) has a perfect chain realization.
Proof. We argue by induction on ℓ, the length of the striation.
For striations of length zero there is nothing to prove, so assume the Lemma holds for striated types of length ℓ
and choose an (ℓ+1)-striation θ(x)∈Sat(aˉ). Let θ↾ℓ be the truncation of θ to the variables
x↾ℓ=⟨xj:j<ℓ⟩. As θ↾ℓ is clearly an ℓ-striation, it has a perfect chain realization, i.e., a chain M0⪯M1⪯Mℓ−1⪯M∗
and a tuple bˉ=⟨bˉj:j<ℓ⟩ from M∗ realizing θ↾ℓ such that aˉ∪{bˉi:i<j}⊆Mj and tp(bj,0/Mj) is A∗-perfect for each
j<ℓ.
Now, since tp(xℓ,0/aˉbˉ) is A∗-large, by applying Proposition 2.8 there is an A∗-perfect type pˉ∈Sat(M∗)
(in a single variable xℓ,0) extending tp(xℓ,0/aˉbˉ).
Choose a countable, atomic N⪰M∗ and e∈N realizing pˉ. As N and M∗ are both countable and atomic,
choose an isomorphism f:N→M∗ that fixes aˉbˉ pointwise.
Then f(M0)⪯f(M1)⪯…f(Mℓ−1)⪯f(M∗)⪯M∗ is a chain. Let bℓ,0:=f(e) and choose ⟨bℓ,1…,bℓ,n(ℓ)−1⟩ arbitrarily from
M∗ so that, letting bˉℓ=⟨bˉℓ,n:n<n(ℓ)⟩, bˉ⌢bˉℓ realizes θ(x). This chain and this sequence form a perfect chain realization of θ.
The following Lemma is immediate, and indicates the advantage of working with A∗-perfect types.
Lemma 3.9
Let (M,bˉ) be any perfect chain realization of a striated type
θ(x)∈Sat(aˉ). Then for every cˉ⊆M0, tp(bˉ/aˉcˉ)∈Sat(aˉcˉ) is a striated type extending θ(x),
and (M,bˉ) is a perfect chain realization of it.
The Lemma below, whose proof simply amounts to unpacking definitions, demonstrate that striated types are rather malleable.
Lemma 3.10
-
If tp(cˉ/aˉ) is a striated type of length k and tp(dˉ/aˉcˉ) is a striated type of length ℓ, then
tp(cˉdˉ/aˉ) is a striated type of length k+ℓ.
2. 2.
Suppose tp(bˉ/aˉ) is a striated type of length ℓ and k<ℓ. Let bˉ<k and bˉ≥k be the induced partition of bˉ.
Then tp(bˉ<k/aˉ) is a striated type of length ℓ and tp(bˉ≥k/aˉbˉ<k) is a striated type of length (ℓ−k).
Moreover, if (M,bˉ) is a perfect chain realization of tp(bˉ/aˉ), then (M<k,bˉ<k) is a perfect chain realization of
tp(bˉ<k/aˉ) and (M≥k,bˉ≥k) is a perfect chain realization of tp(bˉ≥k/aˉbˉ<k).
We begin by defining a partial order (Q0,≤Q0) of ‘preconditions’. Then our forcing (Q,≤Q)
will be a dense suborder of these preconditions.
Definition 3.11
Q0 is the set of all p=(ap,up,np,θp(xp),kp,Up,cp), where
-
ap is a finite subset of M∗ containing bˉ∗;
2. 2.
up is a finite subset of ω1;
3. 3.
np=⟨nt:t∈up⟩ is a sequence of positive integers;
4. 4.
xp=⟨xt,p:t∈up⟩, where each xt,p=⟨xt,n:n<nt⟩ is a finite sequence from the set X={xt,n:t∈ω1,n∈ω} of variable symbols;
5. 5.
θp(xp)∈Sat(ap) is a striated type of length ∣up∣ (see Definition 3.7);
6. 6.
kp∈ω;
7. 7.
Up⊆kp={0,…,kp−1};
8. 8.
cp:xp→ω is a function
such that
for all pairs xt,n,xs,m from xp with cp(xt,n)=cp(xs,m)
- (a)
either
spl(bt,n,bs,m)≥kp for all perfect chain realizations (M,bˉ) of θp(xp);
2. (b)
or there is some k∈Up such that spl(bt,n,bs,m)=k for all perfect chain realizations (M,bˉ) of θp(xp).
We order elements of Q0 by: p≤Q0q if and only if
ap⊆aq;
up⊆uq and nt,p≤nt,q for all t∈up, hence xp is a subsequence of xq;
θq(xq)⊢θp(xp);
kp≤kq;
Up=Uq∩kp (hence, for j<kp, j∈Up if and only if j∈Uq);
cp=cq↾xp.
Visibly, (Q0,≤Q0) is a partial order.
Call a precondition p∈Q0 unarily decided if, for every
xt,n∈xp, p(xp) determines a type in Sat+(Akp,M∗) (see Definition 2.1). That the unarily decided
preconditions are dense follows easily from the fact that
Sat+(Akp,M∗) is countable.
Lemma 3.12
The set {p∈Q0:p is unarily decided} is dense in (Q0,≤Q0). Moreover, given any p∈Q0, there is a unarily decided
q≥Q0p with xq=xp and kq=kp (hence Uq=Up).
Proof. Fix p∈Q0 and let k:=kp.
Arguing by induction on the size of the finite set xp, it is enough to strengthen p(xt,n) individually for each xt,n∈xp.
So fix xt,n∈xp. By Corollary 2.6 there is an aˉ′⊇aˉp and a 1-type q1(xt,n)∈Sat(aˉ′)
extending tp(xt,n/aˉp) that determines a type in Sat+(Akp,M∗). Then, using Lemma 3.10(1) we can choose a striated type
p′(xp)∈Sat(aˉ′) extending p(xp)∪q1.
We iterate the above procedure for each of the (finitely many) elements of xp. We then get a unarily decided precondition
p′≥Q0p whose type p′(xp) still has the same free variables, and each of kp, Up, cp are unchanged.
Next, call a precondition p∈Q0 fully decided if, it is unarily decided and, for each pair xt,n,xs,m from xp with cp(xt,n)=cp(xs,m), if
spl(bt,n,bs,m)≥kp
for some perfect chain realization (M,bˉ), then tp(bt,n/A∗)=tp(bs,m/A∗) for all perfect chain realizations (M,bˉ) of θp(xp).
Lemma 3.13
The set {p∈Q0:p is fully decided} is dense in (Q0,≤Q0). Moreover, given any p∈Q0, there is a fully decided
q≥Q0p with xq=xp.
Proof. It suffices to handle each pair xt,n,xs,m from xp with c(xt,n)=c(xs,m) separately. Given such a pair, suppose there is some
perfect chain realization (M,bˉ) of θ(xp)∈Sat(ap) with kp≤spl(bt,n,bs,m)<ω. Among all such perfect chain realizations,
choose one that minimizes k∗=spl(bt,n,bs,m).
Choose a formula φ(x,cˉ) with cˉ from Ak∗+1 witnessing that tp(bt,n/Ak∗+1)=tp(bs,m/Ak∗+1).
As Ak∗+1⊆M0, by applying Lemma 3.9, let θ∗(xp) be a complete formula over apcˉ isolating tp(bˉ/apcˉ).
Form the precondition p′∈Q0 by putting ap′=apcˉ;
θp′=θ∗; kp′=k∗+1; and Up′=Up∪{k∗}; while leaving
xp and cp unchanged.
It is evident that spl(bt,n′,bs,m′)=k∗∈Up′ for all perfect chain realizations (M,bˉ′) of θp′. Continuing this process for each of the (finitely many)
relevant pairs gives us a fully decided extension of p.
Definition 3.14
The forcing (Q,≤Q) is the set of fully decided p∈Q0 with the inherited order.
Lemma 3.15
The forcing (Q,≤Q) has the countable chain condition (c.c.c.).
Proof. Suppose {pi:i∈ω1} is an uncountable subset of Q. In light of Lemma 3.13, it suffices to find i=j for which there is some precondition
q∈Q0 satisfying pi≤Q0q and pj≤Q0q. First, by the Δ-system lemma applied to the finite
sets {upi}, we may assume that ∣upi∣ is constant and there is some fixed u∗ that is an initial segment of each upi and, moreover, whenever i<j,
every element of (upi∖u∗) is less than every element of (upj∖u∗).
By further trimming, but preserving uncountability, we may assume that
the integer kp, the subset Up⊆kp, and the parameter ap remain constant.
As notation, for i<j, let f:upi→upj be the unique order-preserving bijection. We may additionally assume that npi(t)=npj(f(t)), hence
f has a natural extension (also called f):xpi→xpj given by f(xt,n)=xf(t),n. With this identification, we may assume
θpi(xpi)=θpj(f(xpi)). As well, we may
also assume
tp(xt,n/Akp)=tp(xf(t),n/Akp) for every xt,n∈xpi. As well, the colorings match up as well, i.e., c(xt,n)=xf(t),n.
Now fix i<j. Define q by kq:=kp; Uq:=Up; and aq:=ap (the common values). Let uq:=upi∪upj,
and, for t∈upi, nt,q=nt,pi while nt,q=nt,pj for t∈upj. To produce the striated type θq∈Sat(aq), first choose
a perfect chain realization (M,bˉ) of θpi(xpi). Say ∣upi∣=ℓ=∣upj∣, while ∣u∗∣=k<ℓ.
By Lemma 3.10(2), tp(bˉ<k/ap) is a striated type of length k and
(M≥k,bˉ≥k) is a perfect chain realization of the striated type tp(bˉ≥k/apbˉ<k) of length (ℓ−k).
Choose dˉ from Mk such that tp(dˉ/apbˉ<k)=tp(bˉ≥k/apbˉ<k).
Then by Lemma 3.9 (with Mk playing the role of M0 there), (M≥k,bˉ≥k) is a perfect chain realization of the striated type
tp(bˉ≥k/apbˉ<kdˉ). So, by Lemma 3.10(1), tp(dˉbˉ≥k/apbˉ<k) is a striated type of length 2(ℓ−k).
Thus, a second application of Lemma 3.10(1) implies that tp(bˉ<kdˉbˉ≥k/ap) is a striated type of length 2ℓ−k.
Let θq be a complete formula over ap generating this type.
In order to show that q is a precondition (i.e., an element of Q0) only Clause (8) requires an argument.
Fix any xt,n,xs,m in xq with cq(xt,n)=cq(xs,m). As both pi,pj∈Q0, the verification is immediate if {t,s} is a subset of either
upi or upj, so assume otherwise. By symmetry, assume t∈upi−u∗ and s∈upj−u∗. The point is that by our trimming,
xf(t),n∈xpj, cpj(xf(t),n)=cpi(xt,n), and tp(xt,n/Akp)=tp(xf(t),n/Akp).
There are now two cases: First, if tp(xf(t),n/A∗)=tp(xs,m/A∗), then it follows that tp(xt,n/Akp)=tp(xs,m/Akp), hence
spl(et,n,es,m)≥kp for any perfect chain realization (N,eˉ) of θq.
On the other hand, if θpj ‘says’ spl(xf(t),n,xs,m)=k∈Up, then θq ‘says’ spl(xt,n,xs,m)=k∈Uq as well.
Thus, q∈Q0, which suffices by Lemma 3.13.
Lemma 3.16
Each of the following sets are dense and open in (Q,≤Q).
-
For every t∈ω1, Dt={p∈Q:t∈up};
2. 2.
For every (t,n)∈ω1×ω, Dt,n={p∈Q:xt,n∈xp}; and
3. 3.
Henkin witnesses:* For all t∈ω1, all ⟨xsi,ni:i<m⟩ with each si≤t and all
φ(y,vi:i<m),
{p∈Q: either θp(xp)⊢∀y¬φ(y,xsi,ni:i<m) or for some n∗,
θp(xp)⊢φ(xt,n∗,xsi,ni:i<m)}.*
4. 4.
For all e∈M∗, De={p∈Q:e∈ap and θ(xp)⊢x0,n=e for some n∈ω}.
Proof. That each of these sets is open is immediate. As for density, in all four clauses we will show that given some p∈Q, we will find an extension q≥Qp
with xq a one-point extension of xp. In all cases, we will put kq:=kp, Uq=Up and since xp is finite,
we can choose the color cq of the ‘new element’ to be distinct from the other colors. Because of that, Clause (8) for q follows immediately from the fact p∈Q.
Thus, for all four clauses, all of the work is in finding a striated type θq extending θp.
(1)
Fix t∈ω1 and choose
an arbitrary p∈Q. If t∈up then there is nothing to prove, so assume otherwise. Let ℓ=∣up∣ and let k=∣{s∈up:s<t}∣. Assume that k<ℓ,
as the case of k=ℓ is similar, but easier. Choose a perfect chain realization (M,bˉ) of θp(xp). By Lemma 3.10(2),
tp(bˉ<k/ap) is a striated type of length k. By Lemma 2.4(1), choose an A∗-large type r∈Sat(apbˉ<k) and choose a realization e of r in Mk. One checks immediately that tp(bˉ<ke/ap) is a striated type of length (k+1). Now, also by Lemma 3.10(2),
(M≥k,bˉ≥k) is a perfect chain realization of tp(bˉ≥k/apbˉ<k). So, by Lemma 3.9,
(M≥k,bˉ≥k) is also a perfect chain realization of tp(bˉ≥k/apbˉ<ke). In particular, tp(bˉ≥k/apbˉ<ke)
is a striated type of length (ℓ−k). Thus, by Lemma 3.10(1), tp(bˉ<kebˉ≥k/ap) is a striated type of length (ℓ+1).
Take aq:=ap, xq:=xp∪{xt,0},
and take θq(xq) to be a complete formula in tp(bˉ<kebˉ≥k/aq).
The proofs of (2) and (3) are extremely similar. We prove (2) and indicate the adjustment necessary for (3).
Fix (t,n)∈ω1×ω. By (1) and an inductive argument, we may assume we are given p∈Q with t∈up and
xt,n−1∈xp. Say ∣up∣=ℓ and assyne t is the (k−1)st element of up in ascending order.
Choose a perfect chain realization (M,bˉ) of θp(xp). By Lemma 3.10(2), tp(bˉ<k/ap) is striated of length k.
Choose an arbitrary e∈Mk444In the proof of (3), e would be a realization of φ(y,bsi,ni:i<m) in Mk, if one existed. and adjoin it to bˉk−1.
More formally, let bˉ<k∗:=⟨bˉj∗:j<k⟩, where bˉj∗=bˉj for j<k−2, while bˉk−1∗:=bˉk−1e.
Note that tp(bˉ<k∗/ap) remains a striated type of length k.
By Lemma 3.10(2), (M≥k,bˉ≥k) is a perfect chain realization of tp(bˉ≥k/apbˉ<k). So, by Lemma 3.9
it is also a perfect chain realization of tp(bˉ≥k/apbˉ<k∗). In particular, tp(bˉ≥k/apbˉ<k∗) is a striated type of length
(ℓ−k), so tp(bˉ<k∗bˉ≥k/ap) is a striated type of length ℓ extending θp(xp). Put xq:=xp∪{xt,n}
and let θq(xq) be a complete formula isolating this type.
(4) is also similar and is left to the reader.
The following Proposition follows immediately from the density conditions described above.
Proposition 3.17
Let G be a Q-generic filter. Then, in V[G], a rich, UG-colored atomic model of T exists,
where UG={k∈ω:k∈Up for some p∈G}.
Proof. There is a congruence ∼G defined on X={xt,n:t∈ω1,n∈ω} defined by xt,n∼Gxs,m if and only if
θp⊢xt,n=xs,m for some p∈G. Let MG be the model of T with universe X/∼G and relations
MG⊨φ(a1,…,ak) if and only if there are (xt1,n1,…,xtk,nk)∈Xk such that [xti,ni]=ai for each i
and θp⊢φ(xt1,n1,…,xtk,nk) for some p∈G.
Since (Q,≤Q) has c.c.c., MG has size ℵ1. As notation, for each t∈ω1, let M≤t be the substructure of MG
with universe {[xs,m]:s≤t,m∈ω}. Then M∗⪯M0 and M≤s⪯M≤t⪯MG whenever s≤t<ω1.
The definition of a striated type implies that tp([xt,0]/A∗) is omitted in M<t, hence
the set {[xt,0]:t∈ω1} witnesses that (MG,bˉ∗) is
rich.
Also, define cG:=⋃{cp:p∈G}. Using the fact that each p∈Q is fully decided, check that cG is a UG-coloring of (MG,bˉ∗).
Note that in the Conclusion below, such a G∈V always exists, since B is countable.
Conclusion 3.18
Suppose B is a countable, transitive model of ZFC∗, with {M∗,T,L}⊆B,
and let G∈V, G⊆Q be any filter meeting every dense D⊆Q with D∈B. Then:
Let UG={k∈ω:k∈Up for some p∈G}. Then:
-
UG∈V; and
2. 2.
In V, there is a UG-colored, rich atomic model (N,bˉ∗) of T.
Proof. That UG∈V is immediate, since both B and G are. As for (2), as G meets every dense set in B, B[G] is a countable, transitive model of ZFC∗, and
by applying Proposition 3.17,
[TABLE]
Let L′=L∪{c,R}∪{cm:m∈M∗} Working in B[G], expand MG to an L′-structure M′, interpreting each cm by m,
interpreting the unary function cM′ as cG=⋃{cp:p∈G}, and the unary predicate RM′={[xt,0]:t∈ω1}.
Now, for each d,d′∈M′ and k∈ω, the relation tpM′(d/Ak)=tpM′(d′/Ak) is definable by an Lω1,ω′-formula.
Thus, the binary function spl:(M′)2→(ω+1) is also Lω1,ω′-definable, hence, using the coloring c,
there is an Lω1,ω′-sentence Ψ
stating that ‘c induces a UG-coloring.’ Finally, using the Q-quantifier to state that R is uncountable, there is an Lω1,ω′-sentence Φ∈B[G]
stating that the L(bˉ∗)-reduct of a given L′-structure is a rich, atomic model of T, that is UG-colored via c.
We finish by applying Proposition 2.9 to M′ and Φ.
3.3 Mass production
In this subsection we define a forcing (P,≤P) such that a P-generic filter G produces a perfect set {Gη:η∈2ω} of Q-generic filters
such that the associated subsets {UGη:η∈2ω} of ω are almost disjoint.
Although the application there is very different, the argument in this subsection is similar to one appearing in [7].
We begin with one easy density argument concerning the partial (Q,≤Q).
Fundamentally, it allows us to ‘stall’ the construction for any fixed, finite length of time.
Lemma 3.19
For every p∈Q and every k∗>kp, there is q≥Qp such that xq=xp,
(hence cq=cp); but kq=k∗ and Uq=Up, i.e., Uq∩[kp,k∗)=∅.
Proof. Simply define q as above and then verify that q∈Q.
Definition 3.20
For n∈ω, let
[TABLE]
As notation, for p∈Pn, we let k(p) denote the (integer) first coordinate of p. For each ℓ<k(p), define the trace of ℓ,
trℓ(p)={ν∈2n:ℓ∈Upν}.
Let P=⋃n∈ωPn. As notation, for p∈P, n(p) is the unique n for which p∈Pn.
**
Definition 3.21
Define an order ≤P on P by p≤Pq if and only if
-
n(p)≤n(q), k(p)≤k(q);
2. 2.
pν≤Qqμ for all pairs ν∈2n(p),μ∈2n(q) satisfying ν⊴μ; and
3. 3.
For all ℓ∈[k(p),k(q)), the set {μ↾n(p):μ∈trℓ(q)} is either empty or is a singleton.
It is easily checked that (P,≤P) is a partial order, hence a notion of forcing.
The following Lemma describes the dense subsets of P.
Lemma 3.22
-
For each n and k, {p∈P:n(p)≥n} and
{p∈P:k(p)≥k} are dense;
2. 2.
Suppose D is a dense, open subset of Q. Then for every n and every p∈Pn, there is q∈Pn
such that q≥Pp and, for every ν∈2n, qν∈D.
Proof. Arguing by induction, it suffices to prove that for any given p∈P, there is q≥Pp with n(q)=n(p)+1 and
an r≥Pp with k(r)>k(p). Fix p∈P. Say p∈Pn and p=(k,pˉ). To construct q, for each ν∈2n,
define qν0=qν1=pν. Let qˉ:=⟨qμ:μ∈2n+1⟩ and q=(k,qˉ). Then q∈Pn+1 and q≥Pp
(note that Clause (3) in the definition of ≤P is vacuously satisfied since k(p)=k(q)).
To construct r, simply apply Lemma 3.19 to each pν to produce an extension rν≥Qpν with krν=k+1, but
Urν=Upν. Then let rˉ:=⟨rν:ν∈2n⟩ and r=(k+1,rˉ). Then r≥Pp as required.
(2) Fix such a D and n. As we are working exclusively in Pn and because 2n is a fixed finite set, it suffices to prove that
for any chosen ν∈2n,
For every p∈Pn there is q∈Pn with q≥Pp and qν∈D.
To verify this, fix ν∈2n and p∈Pn. Concentrating on pν, as D is dense, choose qν∈D∩Q with qν≥Qpν.
Let k∗:=kqν. Next, for each δ∈2n with δ=ν, apply Lemma 3.19 to pδ, obtaining some qδ∈Q
satisfying qδ≥Qpδ, kqδ=k∗, but Uqδ=Upδ. Now, collect all of this data into a condition
q∈Pn defined by k(q)=k∗ and qˉ=⟨qγ:γ∈2n⟩, where each qγ is as above. To see that q≥Pp,
Clause (3) is verified by noting that for every ℓ∈[k(p),k∗), trℓ(q) is either empty, or equals {ν}, depending on whether or not ℓ∈Uqν.
Notation 3.23
Suppose B⊨ZFC∗ and let G∗⊆P, G∗∈V
be a filter meeting every dense subset D∗⊆P with D∗∈B.
For each n and ν∈2n, let
[TABLE]
Then, for each η∈2ω, let
[TABLE]
Proposition 3.24
In the notation of 3.23:
-
For every η∈2ω, Gη⊆Q is a filter meeting every dense D⊆Q with D∈B;
2. 2.
The sets {Uη:η∈2ω} are an almost disjoint family of infinite subsets of ω.
Proof. (1) follows immediately from Lemma 3.22(2).
(2) Choose distinct η,η′∈2ω. Choose n0 such that η∣n=η′∣n whenever n≥n0.
By Lemma 3.22(1), choose p∗∈G∗ with n(p∗)≥n0. We show that Uη∩Uη′ is finite by establishing that
if ℓ∈Uη∩Uη′, then ℓ≤k(p∗).
To establish this, choose ℓ∈Uη∩Uη′. By unpacking the definitions, choose q∗,r∗∈G∗ such that, letting μ:=η∣n(q∗)
and μ′:=η′∣n(r∗), we have ℓ∈Uqμ∗∩Urμ′∗. As G∗ is a filter, choose s∗∈G∗ with s∗≥Pp∗,q∗,r∗.
As notation, let δ:=η∣n(s∗) and δ′:=η′∣n(s∗).
Claim: ℓ∈Usδ∗∩Usδ′∗.
Proof. As ℓ∈Uqμ∗, ℓ<k(q∗). From q∗≤Ps∗ we conclude k(q∗)≤k(s∗), so ℓ<k(s∗) as well.
From q∗≤Ps∗ and μ⊴δ we obtain qμ∗≤Qsδ∗. But then, as ℓ∈Uqμ∗, it follows
that ℓ∈Usδ∗. That ℓ∈Usδ′∗ is analogous, using r∗ in place of q∗.
Finally, assume by way of contradiction that ℓ≥k(p∗). The Claim implies that {δ,δ′}⊆trℓ(s∗). As ℓ∈[k(p∗),k(s∗)),
Clause (3) of p∗≤Ps∗ implies that δ∣n(p∗)=δ′∣n(p∗). But, as η∣n(p∗)=δ∣n(p∗) and η′∣n(p∗)=δ′∣n(p∗), we contradict our choice of p∗.
We close this section with the proof of Proposition 3.1, which we restate for convenience.
Conclusion 3.25
There is a family {(Nη,bˉ∗):η∈2ω} of 2ℵ0 rich, atomic models of T, each of size ℵ1,
that are pairwise non-isomorphic over bˉ∗.
Proof. Choose any countable, transitive model B of ZFC∗ and choose any G∗∈V, G∗⊆P, G∗ meets every dense subset D∗∈B
(as B is countable, such a G∗ exists). For each η∈2ω, choose Gη and Uη as in Proposition 3.24,
and apply Conclusion 3.18 to get a rich Uη-colored (Nη,bˉ∗) in V. That this family is pairwise non-isomorphic over bˉ∗
follows immediately from Corollary 3.6, since the sets {Uη:η∈2ω} are almost disjoint.
4 The proof of Theorem 1.4
Assume that the class AtT is not pcl-small, as witnessed by an (uncountable) model N∗ containing a finite
tuple aˉ∗. Fix a countable, elementary substructure M∗⪯N∗ that contains aˉ∗. To aid notation, let D∗:=pclN∗(aˉ∗).
We now split into cases, depending on the relationship between the cardinals 2ℵ0 and 2ℵ1.
Case 1. 2ℵ0<2ℵ1.
In this case, expand the language of T to L(D∗), adding a new constant symbol for each d∈D∗. Then, the natural expansion ND∗∗ N∗ to an
L(D∗)-structure is a model of the infinitary L(D∗)-sentence Φ that entails Th(ND∗∗) and ensures that every finite tuple is L-atomic with respect to T.
As ND∗∗ is a model of Φ that realizes uncountably many types over the empty set (after fixing D∗!), it follows from [5], Theorem 45 of Keisler
that there are 2ℵ1 pairwise non-L(D∗)-isomorphic models Φ, each of size ℵ1. As 2ℵ0<2ℵ1, it follows that there is a subfamily
of 2ℵ1 pairwise non-L-isomorphic reducts to the original language L. As each of these models are L-atomic, we conclude that AtT has 2ℵ1
non-isomorphic models of size ℵ1.
Case 2. 2ℵ0=2ℵ1.
Choose bˉ∗ from M∗ as in Proposition 2.10 and apply Conclusion 3.25 to get a set F∗={(Nη,bˉ∗):η∈2ω} of atomic models,
each of size ℵ1, that are pairwise non-isomorphic over bˉ∗. Let F={Nη:η∈2ω} be the set of reducts of elements from F∗.
By our cardinal hypothesis, F has size 2ℵ1. The relation of L-isomorphism is an equivalence relation on F, and
each L-isomorphism equivalence class has size at most ℵ1 (since ℵ1<ω=ℵ1). As ℵ1<2ℵ1 we conclude that F has a
subset of size 2ℵ1 of pairwise non-isomorphic atomic models of T, each of size ℵ1.