Abstract
A structure Y of a relational language L is called almost chainable
iff there are a finite set F⊂Y and a linear order < on the set Y∖F
such that for each partial automorphism φ (i.e., local automorphism, in Fraïssé’s terminology)
of the linear order ⟨Y∖F,<⟩
the mapping idF∪φ is a partial automorphism of Y.
By a theorem of Fraïssé, if ∣L∣<ω, then Y is almost chainable iff the profile of Y is bounded;
namely, iff there is a positive integer m such that Y has ≤m non-isomorphic substructures of size n, for each positive integer n.
A complete first order L-theory T having infinite models is called almost chainable
iff all models of T are almost chainable
and it is shown that the last condition is equivalent to the existence of one countable almost chainable model of T.
In addition, it is proved that
an almost chainable theory has either one or continuum many non-isomorphic countable models
and, thus, the Vaught conjecture is confirmed for almost chainable theories.
2010 Mathematics Subject Classification:
03C15, 03C50, 03C35, 06A05
Key words and phrases:
Vaught’s conjecture, almost chainable structure, almost chainable theory
VAUGHT’S CONJECTURE FOR ALMOST CHAINABLE THEORIES
Miloš S. Kurilić111Department of Mathematics and Informatics, Faculty of Sciences, University of Novi Sad,
Trg Dositeja Obradovića 4, 21000 Novi Sad, Serbia.
e-mail: [email protected]
1 Introduction
In this article we confirm Vaught’s conjecture
for almost chainable theories,
extending the result of [7], which concerns the smaller class of monomorphic theories.
We recall that the Vaught conjecture is related to the number I(T,ω) of non-isomorphic countable models
of a countable complete first order theory T.
In 1959 Robert Vaught [11] asked if there is a theory T
such that the equality I(T,ω)=ω1 is provable without the use of the continuum hypothesis;
since then, the implication I(T,ω)>ω⇒I(T,ω)=c is known as Vaught’s conjecture.
The rich history of the investigation related to that (still unresolved) conjecture
includes a long list of results confirming the conjecture in particular classes of theories
(see, for example, the introduction and references of [8]) and, on the other hand,
intriguing results concerning the consequences of the existence of counterexamples and the properties of (potential) counterexamples
(see, e.g., [1]).
The results of this paper are built on the fundament consisting of two (groups of) results.
The first one is the basic Rubin’s paper [10] from 1974 in which the Vaught conjecture is confirmed
for theories of linear orders with unary predicates;
we will use the following result of Rubin (see Theorem 6.12 of [10]).
Theorem 1.1** (Rubin)**
If T is a complete theory of a linear order with a finite set of unary predicates, then I(T,ω)∈{1,c}.
The second group of results is a part of the fundamental work
concerning combinatorial properties of relational structures collected in the book of Roland Fraïssé [2].
We will use Fraïssé’s results related to almost chainable structures,
as well as a theorem of Gibson, Pouzet and Woodrow from [4],
describing all linear orders which chain an almost chainable structure over a fixed finite set,
which is derived from similar results obtained independently by Frasnay [3]
and by Hodges, Lachlan and Shelah [5]. These results are presented in Section 2.
In Section 3 we show that
a complete theory T with infinite models has a countable almost chainable model iff all models of T are almost chainable and, so,
establish the notion of an almost chainable theory. In Section
4 we prove that for each complete almost chainable theory T having infinite models we have I(T,ω)∈{1,c} and,
thus, confirm the Vaught conjecture for such theories.
The results of this paper generalize the results of [7] about theories of monomorphic structures222A relational structure Y is
monomorphic iff all its n-element substructures are isomorphic, for each positive integer n,
while (for ∣L∣<ω, see [2], p. 297) Y is almost chainable iff there is a positive integer m such that Y has ≤m non-isomorphic substructures of size n, for each n∈N.
and we note that the arguments used in our proofs are, as in [7], more combinatorial than model-theoretical.
Also we remark that some parts of this paper are (more or less) folklore or similar to the corresponding parts of [7],
but, for completeness of the paper, they are included in the text.
2 Preliminaries. Almost chainable structures
Throughout the paper
we assume that L=⟨Ri:i∈I⟩ is a relational language, where ar(Ri)=ni∈N, for i∈I.
If Y is a non-empty set and T⊂SentL an L-theory, then
ModLT(Y) (resp. ModL(Y); ModLT) will denote
the set of all models of T with domain Y
(resp. the set of all L-structures with domain Y;
the class of all models of T).
Let Y=⟨Y,⟨RiY:i∈I⟩⟩ be an L-structure.
For a non-empty set H⊂Y, H:=⟨H,⟨RiY↾H:i∈I⟩⟩ is the corresponding substructure of Y.
If J⊂I, then LJ:=⟨Ri:i∈J⟩ is the corresponding reduction of L
and Y∣LJ:=⟨Y,⟨RiY:i∈J⟩⟩ the corresponding reduct of Y.
By [Y] we will denote the class of all L-structures being isomorphic to Y (the isomorphism type of Y).
If X=⟨X,<⟩ is a linear order, then X∗ will denote its reverse, ⟨X,<−1⟩.
By LOX we denote the set of all linear orders on the set X.
We recall the notions and concepts introduced by Fraïssé which will be used in this paper
and fix a convenient notation.
For n∈N, by Agen(Y) we denote the collection {[H]:H∈[Y]n} of isomorphism types of n-element substructures of Y
(or equivalently, Agen(Y)={H∈ModL(n):H↪Y}/≅).
The age of Y is the collection Age(Y):=⋃n∈NAgen(Y).
The function φY with the domain N
defined by φY(n)=∣Agen(Y)∣, for all n∈N, is the profile of Y.
By Pa(Y) we denote the set of all partial automorphisms of Y (isomorphisms between substructures of Y,
or, in Fraïssé’s terminology, local automorphisms).
The L-structure Y is freely interpretable in an L′-structure X having the same domain
iff Pa(X)⊂Pa(Y). We will say that Y is simply definable in X iff each relation RiY
is definable by a quantifier free L′-formula in the structure X.
Almost chainable structures
Let Y∈ModL(Y), F∈[Y]<ω and <∈LOY∖F.
Following Fraïssé (see [2], p. 294), the structure Y is called (F,<)-chainable iff
[TABLE]
The structure Y is called F-chainable if it is (F,<)-chainable for some linear order < on Y∖F.
Y is called almost chainable if it is F-chainable for some F∈[Y]<ω.
The following four statements are proved in [2] for ∣L∣=1 and have straightforward generalizations for
arbitrary relational language L. So, these results of Fraïssé are cited and used in the paper in such, more general, form.
Generally, if Y is a set, F∈[Y]n, <∈LOY∖F and F={a0,…,an−1} is an enumeration of the elements of the set F,
we introduce the auxiliary language Ln:=⟨R,U0,…,Un−1⟩,
consisting of new relational symbols, where ar(R)=2 and ar(Uj)=1, for j<n,
and define the linear order ⊲ on the set Y and the Ln-structure (in fact, the linear order with n unary predicates) X by
⊲↾(Y∖F)=<,
⟨Y,⊲⟩={a0}+⋯+{an−1}+(Y∖F),
X:=⟨Y,⊲,{a0},…,{an−1}⟩.
Fact 2.1
*Let Y be an L-structure, F={a0,…,an−1}∈[Y]n and <∈LOY∖F. If ⊲ and X are defined by (L1)–(L3),
then the following conditions are equivalent:
Y* is (F,<)-chainable,*
Y* is freely interpretable in X, (that is, Pa(X)⊂Pa(Y)),*
Y* is simply definable in X.*
**Proof. **(a) ⇒ (b).
Let (1) hold and f∈Pa(X).
Then, since f preserves Uj’s,
for each y∈domf and each j<n we have: y=aj iff f(y)=aj.
So, if aj∈domf, then f(aj)=aj
and, hence, f↾(F∩domf)=idF∩domf.
In addition, if y∈(domf)∖F, then f(y)∈F
and, hence, f[(domf)∖F]⊂Y∖F.
So, by (L1), φ:=f↾((domf)∖F)∈Pa(⟨Y∖F,<⟩)
and by (1) we have g:=idF∪φ∈Pa(Y).
Finally, since f=g↾domf, it follows that f∈Pa(Y).
(b) ⇒ (c).
Let Pa(X)⊂Pa(Y) and i∈I.
For yˉ∈Yni, let εyˉ(v0,…,vni−1)
be the conjunction of all Ln-literals (i.e. atomic formulas and their negations)
in variables v0,…,vni−1
which are satisfied in the Ln-structure X by yˉ,
that is, εyˉ(vˉ):=⋀{η∈LitLn(vˉ):X⊨η[yˉ]}.
Since ∣Ln∣<ω the binary relation ∼ on the set Yni
defined by xˉ∼yˉ iff εxˉ=εyˉ
is an equivalence relation with finitely many equivalence classes, say m.
If ε1(vˉ),…,εm(vˉ) is the list of the corresponding formulas
and, for k≤m,
Dεk:={yˉ∈Yni:X⊨εk[yˉ]},
then {Dεk:k≤m} is a partition of the set Yni.
So, if we show that for each k≤m we have
[TABLE]
then RiY=⋃k∈JDεk, where J:={k≤m:Dεk∩RiY=∅},
and the relation RiY is definable in X by the quantifier-free Ln-formula φi(vˉ):=⋁k∈Jεk(vˉ).
So, if xˉ∈Dεk∩RiY and yˉ∈Dεk,
then X⊨εk[xˉ] and X⊨εk[yˉ]
and, hence, p:={⟨xr,yr⟩:r<ni}∈Pa(X)⊂Pa(Y)⊂Pa(⟨Y,ρi⟩).
Thus, since xˉ∈RiY↾{xr:r<ni},
we have yˉ=pxˉ∈RiY↾{yr:r<ni}
and, hence, yˉ∈RiY.
So, (2) is proved and RiY={yˉ∈Yni:X⊨φi[yˉ]}.
(c) ⇒ (a).
For i∈I, let φi(v0,…,vni−1)∈FormLn be a Σ0-formula such that
[TABLE]
For a proof of (1) we take φ∈Pa(⟨Y∖F,<⟩)
and show that f:=idF∪φ∈Pa(Y).
By (L1) we have φ∈Pa(⟨Y,⊲⟩); by (L2), f∈Pa(⟨Y,⊲⟩) and, since f(aj)=aj, for all j<n, we obtain
f∈Pa(X).
So, for K:=domf and H:=ranf,
denoting by K and H the corresponding substructures of X, we have f∈Iso(K,H).
Now, for i∈I and yˉ∈Kni we have
yˉ∈RiY
iff (by (3)) X⊨φi[yˉ]
iff (since φi is a Σ0-formula) K⊨φi[yˉ]
iff (since f∈Iso(K,H)) H⊨φi[fyˉ]
iff (since φi is a Σ0-formula) X⊨φi[fyˉ]
iff (by (3)) fyˉ∈RiY.
So f∈Pa(⟨Y,ρi⟩), for all i∈I;
thus f∈Pa(Y) and (1) is true.
□
Fact 2.2
If Y is an infinite almost chainable L-structure,
then there is a minimal finite set F⊂Y such that Y is F-chainable (the kernel of Y, in notation Ker(Y)).
**Proof. **For ∣L∣=1, this is 10.9.3 of [2], p. 296. But the proof of 10.9.3 as well as the proofs of propositions (1), (2) and (3) of 10.9.2,
which are used in the proof of 10.9.3 have straightforward generalizations for arbitrary relational language L.
We note that the Coherence lemma (2.4.1 of [2], p. 50) used in the proof of 10.9.2(2) works if, in particular, the language is finite and
I=[X]<ω for some set X.
□
Fact 2.3
If Y is an infinite almost chainable L-structure and F∈[Y]n is the kernel of Y, then φY(m)≤2n, for each positive integer m.
**Proof. **Let Y be (F,<)-chainable, where <∈LOY∖F. For m∈N we prove
[TABLE]
where K and H are the substructures of Y corresponding to K and H respectively.
If K,H∈[Y]m and K∩F=H∩F, then, since ∣K∖F∣=∣H∖F∣, there is φ∈Pa(⟨Y∖F,<⟩)
such that φ[K∖F]=H∖F and by (1), f:=idF∪φ∈Pa(Y).
Clearly we have f[K]=H, which implies K≅H and (4) is true.
Now, by (4) we have ∣{K:K∈[Y]m}/≅∣≤∣P(F)∣=2n.
□
Fact 2.4
Let Y and Z be L-structures.
If Y is almost chainable and Age(Z)⊂Age(Y), then Z is almost chainable and ∣Ker(Z)∣≤∣Ker(Y)∣.
**Proof. **For ∣L∣=1, this is Lemma 10.9.6 of [2], p. 297, which has a straightforward generalization for arbitrary relational language L.
We note that 10.1.4 of [2], p. 275, which is used in the proof 10.9.6 holds for (in the notation of [2]) R and R′
of arbitrary signature and for S′ of finite signature.
□
If Y∈ModL(Y) is an infinite (F,<)-chainable structure, then the set
[TABLE]
is a non-empty set of linear orders
and it is easy to see that ⟨Y∖F,⊲⟩∈LYF iff ⟨Y∖F,⊲⟩∗∈LYF.
Theorem 9 of [4] gives the following description of the set LYF.
Theorem 2.5** (Gibson, Pouzet and Woodrow)**
*If Y∈ModL(Y) is an infinite (F,<)-chainable L-structure and L:=⟨Y∖F,<⟩, then one of the following holds
LYF=LOY∖F, that is, each linear order ⊲ on Y∖F chains Y over F,
{\mathcal{L}}_{\mathbb{Y}}^{F}=\bigcup_{{\mathbb{L}}={\mathbb{I}}+{\mathbb{F}}}\Big{\{}{\mathbb{F}}+{\mathbb{I}},\,{\mathbb{I}}^{*}+{\mathbb{F}}^{*}\Big{\}},
There are finite subsets K and H of Y∖F such that L=K+M+H and
{\mathcal{L}}_{\mathbb{Y}}^{F}=\bigcup_{\vartriangleleft_{K}\in LO_{K}\atop\vartriangleleft_{H}\in LO_{H}}\Big{\{}\langle K,\vartriangleleft_{K}\rangle+{\mathbb{M}}+\langle H,\vartriangleleft_{H}\rangle,\langle H,\vartriangleleft_{H}\rangle^{*}+{\mathbb{M}}^{*}+\langle K,\vartriangleleft_{K}\rangle^{*}\Big{\}}.*
3 Almost chainable theories
A complete theory T⊂SentL will be called almost chainable iff each model Y of T
is almost chainable and this notion is established by the following theorem.
Theorem 3.1
If T is a complete L-theory with infinite models, then the following conditions are equivalent:
(a) All models of T are almost chainable,
(b) T has an almost chainable model,
(c) T has a countable almost chainable model.
If (a) is true, then there is n∈ω such that ∣Ker(Y)∣=n, for each model Y of T.
A proof of the theorem is given at the end of the section.
Claim 3.2
Let K be a finite family of non-isomorphic L-structures of size n∈N. Then we have
(a) For each finite set J⊂I there is an LJ-sentence ψK,J such that for each Y∈ModL we have:
Y⊨ψK,J iff {H∣LJ:H∈[Y]n}/≅={[K∣LJ]:K∈K};
(b) For the first-order theory TK:={ψK,J:J∈[I]<ω} and each Y∈ModL we have:
Y⊨TK iff Agen(Y)={[K]:K∈K}.
**Proof. **First, without loss of generality we can assume that the domain of each structure K∈K is the same set, say K.
Let K={x0,…,xn−1} be an enumeration of its elements and xˉ:=⟨x0,…,xn−1⟩.
(a) For a structure K∈K, let αK,J(vˉ):=⋀{η∈LitLJ(vˉ):K⊨η[xˉ]}, where
LitLJ(vˉ) is the set of all literals of LJ with variables in the set {v0,…,vn−1}.
Then for Y∈ModL, yˉ∈Yn and H:={y0,…,yn−1}, we have
Y⊨αK,J[yˉ] iff
{⟨xk,yk⟩:k<n} is an isomorphism from K∣LJ onto H∣LJ.
If π∈Sym(n)
and αK,Jπ(vˉ) is the formula obtained from αK,J
by replacement of vk by vπ(k), for all k<n,
then Y⊨αK,Jπ[yˉ]
iff Y⊨αK,J[yπ(0),…,yπ(n−1)]
iff pπ:={⟨xk,yπ(k)⟩:k<n} is an isomorphism from K∣LJ onto H∣LJ.
So, for the formula φK,J(vˉ):=⋁π∈Sym(n)αK,Jπ(vˉ)
we have Y⊨φK,J[yˉ] iff H∣LJ≅K∣LJ, and the equivalence in (a) is true for the formula
[TABLE]
(b) Let Y⊨TK. Suppose that H={y0,…,yn−1}∈[Y]n and that H≅K, for all K∈K.
Then for each K∈K and each π∈Sym(n) we have
pK,π:={⟨xk,yπ(k)⟩:k<n}∈Iso(K,H)
and, since pK,π:K→H is a bijection,
there is iK,π∈I such that pK,π∈Iso(⟨K,RiK,πK⟩,⟨H,RiK,πH⟩).
Since J:={iK,π:K∈K∧π∈Sym(n)}∈[I]<ω and Y⊨ψK,J,
by (a) there are K0∈K and π0∈Sym(n)
such that pK0,π0∈Iso(K0∣LJ,H∣LJ),
which implies that pK0,π0∈Iso(⟨K0,RiK0,π0K0⟩,⟨H,RiK0,π0H⟩)
and we have a contradiction. So we have proved
[TABLE]
that is, Agen(Y)⊂{[K]:K∈K}. Concerning the inclusion “⊃”, suppose that for some K0∈K
[TABLE]
and let K={K0,…,Ks−1} be an enumeration. Then, for each 0<r<s and π∈Sym(n), since K0≅Kr, we have
pπ:={⟨xk,xπ(k)⟩:k<n}∈Iso(K0,Kr)
and, hence, there is ir,π∈I such that
[TABLE]
Now J:={ir,π:0<r<s∧π∈Sym(n)}∈[I]<ω and, since Y⊨ψK,J,
there is H∈[Y]n such that H∣LJ≅K0∣LJ. By (7) and (8)
there is r>0 such that H≅Kr, which implies H∣LJ≅Kr∣LJ and, hence, K0∣LJ≅Kr∣LJ.
Thus, there is π∈Sym(n) such that pπ∈Iso(K0∣LJ,Kr∣LJ), which in particular gives
pπ∈Iso(⟨K,Rir,πK0⟩,⟨K,Rir,πKr⟩), but this contradicts (9). So
for each K∈K there is H∈[Y]n such that H≅K; that is, {[K]:K∈K}⊂Agen(Y).
Conversely, if Agen(Y)={[K]:K∈K} and J∈[I]<ω, then for each H∈[Y]n there is K∈K such that H≅K;
so H∣LJ≅K∣LJ and, hence, [H∣LJ]≅[K∣LJ]. In addition, for each K∈K there is H∈[Y]n such that H≅K
so H∣LJ≅K∣LJ again and, by (a), Y⊨ψK,J. Thus we have Y⊨TK.
□
Claim 3.3
Let Y be an infinite L-structure and ∣Agen(Y)∣<ω, for each n∈N.
Then for the theory TAge(Y):=⋃n∈NTAgen(Y) and any L-structure Z we have
(a) TAge(Y)⊂Th(Y);
(b) Z⊨TAge(Y) iff Age(Z)=Age(Y);
(c) If Z⊨Th(Y), then Age(Z)=Age(Y).
**Proof. **(a) By Claim 3.2(b), for n∈N we have Y⊨TAgen(Y)
so TAgen(Y)⊂Th(Y).
(b) Z⊨TAge(Y)
iff Z⊨TAgen(Y), for all n∈N;
iff (by Claim 3.2(b)) Agen(Z)=Agen(Y), for all n∈N;
iff Age(Z)=Age(Y).
(c) If Z⊨Th(Y), then by (a) Z⊨TAge(Y) and by (b) Age(Z)=Age(Y).
□
Claim 3.4
If Y is an infinite almost chainable L-structure and Z⊨Th(Y),
then Age(Z)=Age(Y), the structure Z is almost chainable and ∣Ker(Z)∣=∣Ker(Y)∣.
**Proof. **By Fact 2.2 we have Ker(Y)∈[Y]n, for some n∈N,
and, by Fact 2.3, ∣Agem(Y)∣≤2n, for all m∈N. So, by Claim 3.3(c) we have Age(Z)=Age(Y)
and, by Fact 2.4, the structure Z is almost chainable and ∣Ker(Z)∣=∣Ker(Y)∣.
□
Claim 3.5
If T is a complete almost chainable L-theory with infinite models and ∣I∣>ω,
then T has a countable model
and there are a countable language LJ⊂L and a complete almost chainable LJ-theory TJ
such that
[TABLE]
**Proof. **Let Y=⟨Y,⟨RiY:i∈I⟩⟩∈ModLT. By Fact 2.1,
there are a finite set F={a0,…,an−1}⊂Y, a linear order ⊲LOY and an Ln-structure X
satisfying (L1)–(L3) and for each i∈I there is a quantifier-free formula φi(v0,…,vni−1) such that
[TABLE]
Since there are countably many Ln-formulas,
there is a partition I=⋃j∈JIj, where ∣J∣≤ω, such that, picking ij∈Ij, for all j∈J,
we have RiY=RijY, for all i∈Ij.
So, for the L-sentences ηi,j:=∀vˉ(Ri(vˉ)⇔Rij(vˉ)), where j∈J and i∈Ij, we have
Tη:=⋃j∈J{ηi,j:i∈Ij}⊂ThL(Y)=T.
Now, LJ:=⟨Rij:j∈J⟩⊂L and, using recursion,
to each L-formula φ we adjoin an LJ-formula φJ
in the following way:
(vk=vl)J:=vk=vl;
(Ri(vk0,…,vkni−1))J:=Rij(vk0,…,vkni−1), for all i∈Ij;
(¬φ)J:=¬φJ; (φ∧ψ)J:=φJ∧ψJ and (∀vφ)J:=∀vφJ. A simple induction proves that
[TABLE]
We prove that, in addition, for each Z1,Z2∈ModLTη we have
[TABLE]
The first claim is true since Iso(Z1,Z2)=Iso(Z1∣LJ,Z2∣LJ).
For the second, suppose that Z1≡LZ2 and Z1∣LJ⊨ψ, where ψ∈SentLJ.
Then ψ∈SentL and Z1⊨ψ, which gives Z2⊨ψ
so, by (12), Z2∣LJ⊨ψ, because ψJ=ψ.
Conversely, suppose that Z1∣LJ≡LJZ2∣LJ and Z1⊨φ, where φ∈SentL.
Then, by (12), Z1∣LJ⊨φJ and, hence, Z2∣LJ⊨φJ so, by (12), Z2⊨φ.
Let TJ:=ThLJ(Y∣LJ). If Z∈ModLT, that is, Z≡LY,
then by (13) we have Z∣LJ≡LJY∣LJ, which means that Z∣LJ∈ModLJTJ.
So we obtain the mapping Λ:ModLT→ModLJTJ, where Λ(Z)=Z∣LJ, for all Z∈ModLT,
which is an injection, because Tη⊂T.
If A∈ModLJTJ, then Z=⟨A,⟨RiZ:i∈I⟩⟩∈ModLTη,
where RiZ=RijA, for j∈J and i∈Ij. Now Z∣LJ=A≡LJY∣LJ and, by (13), Z≡LY,
that is, Z∈ModLT and Λ is a surjection.
Since the mapping Λ preserves cardinalities of structures, we have
Λ[ModLT(ω)]=ModLJTJ(ω).
By the Löwenheim-Skolem theorem there is A∈ModLJTJ(ω) and
Λ−1(A) is a countable model of T.
By (13), the mapping Λ preserves the isomorphism relation and (10) is true.
By (11) the reduct Y∣LJ is simply definable in X
and, by Fact 2.1, it is almost chainable.
By Claim 3.4, the theory TJ=ThLJ(Y∣LJ) is almost chainable.
□
Proof of Theorem 3.1.
The implication (a) ⇒ (c) follows from Claim 3.5, the implication (c) ⇒ (b) is trivial
and (b) ⇒ (a) follows from Claim 3.4.
□
4 Vaught’s Conjecture
In this section we confirm Vaught’s Conjecture for almost chainable theories. More precisely,
the whole section is devoted to a proof of the following statement.
Theorem 4.1
If T is a complete almost chainable theory having infinite models, then
I(T,ω)∈{1,c}. In addition, the theory T is ω-categorical iff it has a countable model
which is chained by an ω-categorical linear order over its kernel.
So, let T be a complete almost chainable L-theory having infinite models.
By Theorem 3.1, there is n∈ω such that each model of T has the kernel of size n and,
by Claim 3.5, w.l.o.g. we suppose that ∣L∣≤ω, which gives ModLT(ω)=∅.
As above, let Ln denote the language ⟨R,U0,…Un−1⟩, where R is a binary and Uj’s are unary symbols.
In the sequel, for Y∈ModL(ω), by [Y] we denote the set {Y′∈ModL(ω):Y′≅Y} and similarly
for the structures from ModLn(ω).
Following the architecture of the proof of the corresponding statement from [7]
we divide the proof into two subsections.
In “Preliminaries” we take an arbitrary countable model Y0 of T
and a linear order with n unary predicates X0 such that Pa(X0)⊂Pa(Y0) (see Figure 1)
and describe the cardinal argument which will be used in our proof.
In “Proof”, distinguishing some cases, taking convenient structures Y0 and X0 and using that cardinal argument, we prove Theorem 4.1.
4.1 Preliminaries
For convenience,
let Δn:={⟨x0,…,xn−1⟩∈ωn:⋁k<l<nxk=xl}
and, for an n-tuple aˉ:=⟨a0,…,an−1⟩∈ωn, let us define Faˉ:={a0,…,an−1}.
We fix a model Y0=⟨ω,⟨RiY0:i∈I⟩⟩∈ModLT(ω) and an enumeration of its kernel, Ker(Y0)={a0,…,an−1}.
By Fact 2.1 there is a linear order ≺∈LOω such that, defining aˉ=⟨a0,…,an−1⟩
and X0:=⟨ω,≺,{a0},…,{an−1}⟩,
[TABLE]
Thus, the structure Y0 is (Faˉ,≺↾(ω∖Faˉ))-chainable.
Let TX0 denote the complete theory of X0, ThLn(X0).
The structure X0 has the following properties expressible by first order
sentences of the language Ln:
The interpretation of R is a linear order,
The interpretations of the relations Uk, k<n, are different singletons,
These singletons are ordered as the indices of Uk’s
(that is, the Ln-sentence ⋀k<l<n∀u,v(Uk(u)∧Ul(v)⇒R(u,v)) is true in X0),
The union of these singletons is an initial segment of the linear order; that is
X0⊨∀u,v((Un−1(u)∧⋀k<n¬Uk(v))⇒R(u,v)).
So, if T∗ is the set of the Ln-sentences expressing (i)–(iv), then T∗⊂TX0 and
[TABLE]
By Fact 2.1 the structure Y0 is simply definable in the Ln-structure X0.
Thus, for each i∈I there is a quantifier free Ln-formula φi(v0,…,vni−1) such that
[TABLE]
Generally speaking, using the Ln-formulas φi, i∈I,
to each Ln-structure X∈ModLn(ω) we can adjoin the L-structure
YX:=⟨ω,⟨RiYX:i∈I⟩⟩∈ModL(ω),
where, for each i∈I, the relation RiYX is defined in the structure X
by the formula φi, that is,
[TABLE]
Claim 4.2
*For each structure Y0∈ModLT(ω), each enumeration Ker(Y0)={a0,…,an−1}
each
structure X0∈MY0aˉ and each choice of formulas φi, i∈I, satisfying (14),
defining YX by (15), for X∈ModLn(ω), we have
The mapping
Φ:ModLn(ω)→ModL(ω), defined by
Φ(X)=YX,
for each X∈ModLn(ω),
preserves elementary equivalence and isomorphism;
moreover, Iso(X1,X2)⊂Iso(YX1,YX2), for all X1,X2∈ModLn(ω);
The mapping Ψ:ModLnTX0(ω)/≅→ModLT(ω)/≅, given by
Ψ([X])=[YX],
for all [X]∈ModLnTX0(ω)/≅,
is well defined.
**Proof. **(a) By recursion on the construction of L-formulas
to each L-formula φ(vˉ) we adjoin an Ln-formula φ∗(vˉ) in the following way:
(vk=vl)∗:=vk=vl, Ri(vk0,…,vkni−1)∗:=φi(vk0,…,vkni−1) (replacement of vj by vkj in φi),
(¬φ)∗:=¬φ∗, (φ∧ψ)∗:=φ∗∧ψ∗ and (∃vkφ)∗:=∃vkφ∗. A routine induction shows that, writing
vˉ instead of v0,…,vn−1, we have (see [6], p. 216)
[TABLE]
Let X1,X2∈ModLn(ω). If X1≡X2, then for an L-sentence φ we have:
YX1⊨φ
iff X1⊨φ∗ (by (16))
iff X2⊨φ∗ (since X1≡X2)
iff YX2⊨φ (by (16) again). So, YX1≡YX2 and the mapping Φ
preserves elementary equivalence.
If f:X1→X2 is an isomorphism,
then by (15) and since isomorphisms preserve all formulas in both directions, for each i∈I and xˉ∈ωni we have:
xˉ∈RiYX1
iff X1⊨φi[xˉ]
iff X2⊨φi[fxˉ]
iff fxˉ∈RiYX2.
Thus f∈Iso(YX1,YX2).
(b) For X∈ModLnTX0(ω) we have X≡X0, which, by (a), (14) and (15),
implies that Φ(X)=YX≡YX0=Y0.
So, since Y0⊨T, we have Φ(X)∈ModLT(ω) and, thus,
[TABLE]
Assuming that X1,X2∈ModLnTX0(ω) and X1≅X2, by (a) we have YX1≅YX2,
that is [YX1]=[YX2]. So, the mapping Ψ is well defined.
□
Thus, by Claim 4.2(b), if I(TX0,ω)=c, then for a proof that I(T,ω)=c
it is sufficient to show that the mapping Ψ is at-most-countable-to-one,
which will be true if for each X∈ModLnTX0(ω) we have ∣Ψ−1[{[YX]}]≤ω.
We note that, by Example 4.2 of [7], it is possible that ∣Ψ−1[{[YX]}]=ω.
Now, let X∈ModLnTX0(ω).
Then we have X⊨T∗
and, hence, there is bˉ:=⟨b0,…,bn−1⟩∈ωn∖Δn
such that X=⟨ω,≺X,{b0},…,{bn−1}⟩ and YX is definable in X by (15).
So, by Fact 2.1, the structure YX is (Fbˉ,≺X↾(ω∖Fbˉ))-chainable and
(see (5))
[TABLE]
For an n-tuple cˉ:=⟨c0,…,cn−1⟩∈ωn∖Δn let us define
[TABLE]
Thus, X∈MYXbˉ⊂MYX.
For M⊂ModLnT∗(ω), let M≅:={[A]:A∈M}.
Claim 4.3
For each structure X∈ModLnTX0(ω) we have
[TABLE]
**Proof. **Let X∈ModLnTX0(ω).
Then, by (17) we have YX∈ModLT(ω); so Ψ([X])=[YX]∈ModLT(ω)/≅
and Ψ−1[{[YX]}]⊂dom(Ψ)=ModLnTX0(ω)/≅.
Let [X1]∈Ψ−1[{[YX]}].
Then [X1]∈ModLnTX0(ω)/≅
and, since the set ModLnTX0(ω) is closed under ≅, we have X1∈ModLnTX0(ω).
This implies that X1⊨T∗
and, hence, X1=⟨ω,≺X1,{c0},…,{cn−1}⟩,
for some cˉ:=⟨c0,…,cn−1⟩∈ωn∖Δn.
Since X1∈ModLnTX0(ω), by (15) for i∈I we have
[TABLE]
Also we have [YX1]=Ψ([X1])=[YX],
so there is f∈Iso(YX,YX1) and we prove that
[X1]∈MYX≅.
Clearly, X2:=⟨ω,f−1[≺X1],{f−1(c0)},…,{f−1(cn−1)}⟩≅X1
and f∈Iso(X2,X1).
For i∈I and xˉ∈ωni we have
xˉ∈RiYX
iff fxˉ∈RiYX1 (since f∈Iso(YX,YX1)),
iff X1⊨φi[fxˉ] (by 21),
iff X2⊨φi[xˉ] (since f∈Iso(X2,X1)).
Thus xˉ∈RiYX iff X2⊨φi[xˉ], for all xˉ∈ωni,
so, by Fact 2.1,
the structure YX is (Ff−1cˉ,f−1[≺X1]↾(ω∖Ff−1cˉ))-chainable.
Now, X2∈MYXf−1cˉ
and, hence, [X1]=[X2]∈(MYXf−1cˉ)≅⊂MYX≅.
Thus Ψ−1[{[YX]}]⊂MYX≅.
□
The following folklore statement will be used in our case analysis as well.
Claim 4.4
If some structure Y∈ModLT(ω) is simply definable in an ω-categorical structure X with domain ω,
then Y is an ω-categorical structure and I(T,ω)=1.
**Proof. **By the theorem of Engeler, Ryll-Nardzewski and Svenonius (see [6], p. 341),
the automorphism group of X is oligomorphic; that is, for each n∈N we have
∣ωn/∼X,n∣<ω, where xˉ∼X,nyˉ iff fxˉ=yˉ, for some f∈Aut(X).
As in Claim 4.2(a) we prove that Aut(X)⊂Aut(Y), which implies that for n∈N
and each xˉ,yˉ∈ωn we have xˉ∼X,nyˉ⇒xˉ∼Y,nyˉ.
Thus ∣ωn/∼Y,n∣≤∣ωn/∼X,n∣<ω, for all n∈N, and, since ∣L∣≤ω, using the same theorem we conclude that
Y is an ω-categorical L-structure.
□
4.2 Proof
First we prove that ∣ModLT(ω)/≅∣∈{1,c},
using definitions and notation from “Preliminaries” and distinguishing the following cases.
Case A: There exist a structure Y0∈ModLT(ω), an enumeration of its kernel, Ker(Y0)={a0,…,an−1},
and a structure X0∈MY0aˉ such that the theory TX0 is ω-categorical.
Then by Fact 2.1 the structure Y0 is simply definable in X0 and by Claim 4.4 we have I(T,ω)=1.
In particular, Case A appears if there is a structure Y∈ModLT(ω) satisfying condition (i) of Theorem 2.5:
Y is F-chainable and LYF=LOω∖F. Then,
taking an enumeration F={a0,…,an−1},
the relations RiY of the structure Y are definable in the
structure X:=⟨ω,{a0},…,{an−1}⟩ of the unary language L′:=⟨U0,…,Un−1⟩
by quantifier free L′-formulas and,
since the structure X is ω-categorical, Y is ω-categorical as well; so, I(T,ω)=1 again.
We note that such structures are called finitist by Fraïssé, see [2], p. 292.
Case B: For each structure Y0∈ModLT(ω), each enumeration of its kernel Ker(Y0)={a0,…,an−1}
and each structure X0∈MY0aˉ, the theory TX0 is not ω-categorical; so, by Theorem 1.1,
∣ModLnTX0(ω)/≅∣=c, for all X0∈MY0aˉ.
Then, by the remark from Case A concerning condition (i) of Theorem 2.5, we have
[TABLE]
and we prove that ∣ModLT(ω)/≅∣=c, distinguishing the following two subcases.
Subcase B1:
There exist a structure Y0∈ModLT(ω), an enumeration of its kernel, Ker(Y0)={a0,…,an−1},
and a structure X0∈MY0aˉ
such that the linear order
LX0:=⟨ω∖Faˉ,≺X0↾(ω∖Faˉ)⟩∈LY0Faˉ has at least one end-point.
Then we take such Y0, aˉ and X0 and notice that X0⊨T∗ and that the mentioned property of LX0 gives a first order property of X0. Namely, X0⊨θ0∨θ1, where
[TABLE]
Now we have ∣ModLnTX0(ω)/≅∣=c
and, by Claim 4.2(b), for a proof that ∣ModLT(ω)/≅∣=c
it is sufficient to show that the mapping Ψ is at-most-countable-to-one. This will follow from the following claim and
Claim 4.3.
Claim 4.5
\Big{|}{\mathcal{M}}_{{\mathbb{Y}}_{{\mathbb{X}}}}^{\cong}\cap\mathop{\rm Mod}\nolimits_{L_{n}}^{{\mathcal{T}}_{{\mathbb{X}}_{0}}}(\omega)/\cong\Big{|}\leq\omega, for all X∈ModLnTX0(ω).
**Proof. **Let X∈ModLnTX0(ω). By (20) it is sufficient to show that for each cˉ∈ωn∖Δn
we have
[TABLE]
Let X1=⟨ω,≺X1,{c0},…,{cn−1}⟩∈MYXcˉ.
Then by (19) and (5) we have
[TABLE]
First, if the set LYXFcˉ satisfies condition (iii) of Theorem 2.5,
then we have (LYXFcˉ)≅={[LX1],[LX1∗]}
(because all “K+M+H-sums” are isomorphic
and all “H∗+M∗+K∗-sums” are isomorphic).
Thus each structure X2∈MYXcˉ consists of
the initial part, {c0}+⋯+{cn−1},
labeled by the unary relations UjX2={cj}, j<n,
and a final part, which is either isomorphic to the linear order LX1 or to its reverse, LX1∗.
So we have ∣(MYXcˉ)≅∣≤2 and (25) is true.
Otherwise, by (22) and Theorem 2.5,
LYXFcˉ=⋃LX1=I+F{F+I,I∗+F∗}.
Let X2=⟨ω,≺X2,{c0},…,{cn−1}⟩∈MYXcˉ∩ModLnTX0(ω).
Then LX2:=⟨ω∖Fcˉ,≺X2↾(ω∖Fcˉ)⟩∈LYXFcˉ
and, hence, there is a cut {I,F} in LX1 (i.e. a decomposition LX1=I+F)
such that LX2=F+I or LX2=I∗+F∗.
Suppose that I,F=∅,
that I does not have a largest element
and that F does not have a smallest element.
Then F+I and I∗+F∗ are linear orders without end points.
But, since X2∈ModLnTX0(ω) we have X2⊨θ0∨θ1
and, hence, the linear order LX2 must have at least one end-point,
which gives a contradiction.
So, for each X2∈MYXcˉ∩ModLnTX0(ω) we have
LX2=F+I or LX2=I∗+F∗,
where I has a largest element or F has a smallest element.
Since such cuts {I,F} in LX1 are defined by the elements of the set ω∖Fcˉ,
there are countably many of them.
Thus ∣MYXcˉ∩ModLnTX0(ω)∣=ω,
which implies (25), since each class from the set (MYXcˉ)≅∩ModLnTX0(ω)/≅
has a representative in MYXcˉ∩ModLnTX0(ω).
□
Subcase B2: For each structure Y0∈ModLT(ω), each enumeration of its kernel, Ker(Y0)={a0,…,an−1},
and each structure X0∈MY0aˉ,
the linear order
LX0:=⟨ω∖Faˉ,≺X0↾(ω∖Faˉ)⟩∈LY0Faˉ
is a linear order without end points.
Then we fix arbitrary Y0∈ModLT(ω) and X0∈MY0aˉ, where Ker(Y0)=Faˉ.
Again we have ∣ModLnTX0(ω)/≅∣=c and,
as in Subcase B1, the equality ∣ModLT(ω)/≅∣=c
will follow from Claims 4.2(b), 4.3 and the next claim.
Claim 4.6
\Big{|}{\mathcal{M}}_{{\mathbb{Y}}_{{\mathbb{X}}}}^{\cong}\cap\mathop{\rm Mod}\nolimits_{L_{n}}^{{\mathcal{T}}_{{\mathbb{X}}_{0}}}(\omega)/\cong\Big{|}\leq\omega, for all X∈ModLnTX0(ω).
**Proof. **Let X∈ModLnTX0(ω). By (20) it is sufficient to show that for each cˉ∈ωn∖Δn
we have ∣(MYXcˉ)≅∣≤2.
Let X1=⟨ω,≺X1,{c0},…,{cn−1}⟩∈MYXcˉ. Then, by our assumption,
LX1=⟨ω∖Fcˉ,≺X1↾(ω∖Fcˉ)⟩
is a linear order without end points and LX1∈LYXFcˉ.
Suppose that the set LYXFcˉ satisfies condition (ii) of Theorem 2.5;
that is, LYXFcˉ=⋃LX1=I+F{F+I,I∗+F∗}.
Then, taking an arbitrary x∈ω∖Fcˉ
we have LX1=(−∞,x)LX1+[x,∞)LX1=:I+F;
and, since LX1 is a linear order without end points, I,F=∅.
Let X2=⟨ω,≺X2,{c0},…,{cn−1}⟩,
where ≺X2 is the linear order on ω
such that ⟨ω,≺X2⟩={c0}+⋯+{cn−1}+F+I.
Then the structure YX is (Fcˉ,≺X2↾(ω∖Fcˉ))-chainable
and, hence, X2∈MYXcˉ.
But the linear order LX2:=⟨ω∖Fcˉ,≺X2↾(ω∖Fcˉ)⟩=F+I
has a smallest element,
which contradicts the assumption of Subcase B2.
Thus there are finite sets K,H⊂ω∖Fcˉ such that LX1=K+M+H and
[TABLE]
In addition, since each element of LYXFcˉ is a linear order without end points,
we have K=H=∅ and, hence, M=LX1 and LYXFcˉ={LX1,LX1∗}.
Thus each structure X2∈MYXcˉ consists of the initial part, {c0}+⋯+{cn−1},
labeled by the unary relations UjX2={cj}, j<n,
and a final part,
which is either isomorphic to the linear order LX1 or to its reverse, LX1∗.
So we have ∣(MYXcˉ)≅∣≤2.
□
Finally we prove the second part of Theorem 4.1.
By our analysis, the theory T is ω-categorical iff Case A appears;
so, we have to prove that the Ln-structure X0=⟨ω,≺,{a0},…,{an−1}⟩ is ω-categorical iff
LX0:=⟨ω∖Faˉ,≺↾(ω∖Faˉ)⟩ is an ω-categorical linear order.
Since Aut(X0)={idFaˉ∪f:f∈Aut(LX0)}, for n∈N and
xˉ,yˉ∈(ω∖Faˉ)n we have xˉ∼LX0yˉ⇔xˉ∼X0yˉ,
which implies that ∣(ω∖Faˉ)n/∼LX0∣≤∣ωn/∼X0∣.
So, if X0 is ω-categorical, then LX0 is ω-categorical (by the theorem of Engeler, Ryll-Nardzewski and Svenonius).
On the other hand, if LX0 is ω-categorical, then the linear order ⟨ω,≺⟩≅n+LX0
is ω-categorical (see Rosenstein’s theorem, [9], p. 299) and, since Aut(X0)=Aut(⟨ω,≺⟩),
X0 is ω-categorical too.
□