Hostname: page-component-586b7cd67f-rcrh6 Total loading time: 0 Render date: 2024-11-22T16:57:31.346Z Has data issue: false hasContentIssue false

THEORIES WITH DISTAL SHELAH EXPANSIONS

Published online by Cambridge University Press:  08 March 2023

GARETH BOXALL
Affiliation:
MATHEMATICS DIVISION DEPARTMENT OF MATHEMATICAL SCIENCES STELLENBOSCH UNIVERSITY PRIVATE BAG X1, MATIELAND 7602 STELLENBOSCH, SOUTH AFRICA E-mail: [email protected]
CHARLOTTE KESTNER*
Affiliation:
MATHEMATICS DEPARTMENT IMPERIAL COLLEGE LONDON 180 QUEENSGATE LONDON SW7 2AZ, UK
Rights & Permissions [Opens in a new window]

Abstract

We show that a complete first-order theory T is distal provided it has a model M such that the theory of the Shelah expansion of M is distal.

Type
Article
Copyright
© The Author(s), 2023. Published by Cambridge University Press on behalf of The Association for Symbolic Logic

1 Introduction

Since its introduction [Reference Simon7] distality has played an important role in the study of NIP. The notion identifies those NIP theories which are, in some sense, completely non-stable. Thus RCF is distal while ACVF, which has o-minimal value group and stable residue field, is not. Indeed, Simon has decomposition results [Reference Simon9] according to which types in NIP theories are understood in terms of a stable part and a distal part. The theory of an infinite set is not distal and so distality has the quirky property, among tameness conditions, of not always passing to reducts.

Of course, some reducts of structures with distal theories will have distal theories and so will some expansions. In the NIP context, it is natural to consider the Shelah expansion: one adds to the language a predicate for every externally definable set of the structure. Shelah proved [Reference Shelah6] that NIP is preserved when moving to this expansion and trivially NIP passes to reducts. In early 2017, Artem Chernikov pointed out to us that, while it is easy to see that the Shelah expansion of a model of a distal theory will have a distal theory, it is not so clear that the intermediate expansions will have distal theories. We prove that they will.

Theorem 1.1. Let T be a complete first-order theory. Let $M\models T$ and let $M^{Sh}$ be the Shelah expansion of M. If $Th(M^{Sh})$ is distal then T is distal.

Corollary 1.2. If $\hat {M}$ is an expansion of M such that $M^{Sh}$ is an expansion of $\hat {M}$ , then distality of $Th(M^{Sh})$ implies distality of $Th(\hat {M})$ .

In the next section we say exactly what we mean by “expansion” and show how the corollary is obtained from the theorem. Our proof of Theorem 1.1 relies on a lemma in the NIP setting which we hope will have other applications. Before stating it, we mention some notational conventions. We identify a non-constant indiscernible sequence $(a_i)_{i\in I}$ with the ordered set $\{a_i:i\in I\}$ , the order given by saying $a_i<a_j$ if and only if $i<j$ . If M is a structure and A a set then $A\subseteq M$ means A is a subset of a finite Cartesian power of sorts of M. If we want to be specific about which Cartesian power then we write $A\subseteq M^{\bar {x}}$ , where $\bar {x}$ is a tuple of variables of the appropriate sorts. We follow a similar convention with the notation $a\in M$ and $a\in M^{\bar {x}}$ . If A and B are both just sets then $A\subseteq B$ has its usual meaning. By “sufficiently saturated” we mean $\kappa $ -saturated and strongly $\kappa $ -homogeneous for some sufficiently large cardinal $\kappa $ .

We make much use of pairs of structures $(N,M)$ where $M\prec N$ . In the one-sorted setting, the language of such a structure is $L_P=L\cup \{P\}$ , where L is the language of M and P is a new unary predicate interpreted such that $P(N)=M$ . In the many-sorted setting, one would need to replace P with a family $(P_s)_{s\in S}$ of unary predicates, one for each sort, and the interpretation would be $P_s(N_s)=M_s$ for each $s\in S$ . Given that this is understood, we shall for simplicity use the one-sorted notation even in the many sorted setting.

Lemma 1.3. Let L be a language and T a complete first-order L-theory. Assume T has NIP. Let $M\models T$ and let $M\prec N$ and $(N,M)\prec (N',M')$ be sufficiently saturated elementary extensions, where $(N,M)$ and $(N',M')$ are $L\cup \{P\}$ -structures and P is a unary predicate, not in L, such that $P(N)=M$ and $P(N')=M'$ . Let $A\subseteq M'$ be a small non-constant L-indiscernible sequence. Then there is a small L-indiscernible sequence $A'\subseteq M'$ which extends A and has the following property. For every complete L-type $q(\bar x)$ over $A'$ with $\bar {x}=(x_1, \ldots , x_n)$ , if $q(\bar {x})$ is finitely realised in $A'$ then $q(\bar {x})\cup \{P(x_1), \ldots , P(x_n)\}$ implies a complete L-type over N.

This lemma is one of two ingredients in the proof of Theorem 1.1. The other is the argument used in [Reference Chernikov and Simon3] to show that distality is equivalent to the existence of strong honest definitions (Theorem 21 in [Reference Chernikov and Simon3]).

In Section 2 we give some background definitions and information. In Section 3 we prove Lemma 1.3. In Section 4 we prove Theorem 1.1. In Section 5, for completeness, we prove the converse of Theorem 1.1 which was already known to experts.

After talks given by the second author on this work, Ehud Hrushovski and Anand Pillay both directed us to an alternative approach to Theorem 1.1 via generically stable measures, using Simon’s characterisation of distal theories as those NIP theories for which every generically stable measure over a model is smooth. Both were kind enough to supply us with further details and to grant permission for the inclusion of the argument here. We sketch it in Section 6. We felt it appropriate to retain our original proof, which avoids use of measures and Simon’s result, partly as an advertisement for Lemma 1.3.

2 Preliminaries

Let L be a language and T a complete first-order L-theory. Let $M\models T$ and let $M\prec M'$ be sufficiently saturated. We assume throughout that T has NIP. By an expansion of M we mean a structure N with the same underlying set (the same sorts, in the many sorted-setting) such that every $\emptyset $ -definable set of M is $\emptyset $ -definable in N. An externally definable set of M is a set of the form $X\cap M^{\bar {x}}$ where $X\subseteq M^{\prime{\bar {x}}}$ is definable (with parameters) in $M'$ . It is easy to check that this does not depend on the choice of $M'$ . The Shelah expansion $M^{Sh}$ of M is the structure whose language $L(M^{Sh})$ has one predicate for each externally definable set of M and in which these predicates are interpreted in the obvious way. We shall rely on the following fact proved by Shelah in [Reference Shelah6].

Fact 2.1. $Th(M^{Sh})$ has quantifier elimination and NIP.

Let $\hat {M}$ be an expansion of M such that $M^{Sh}$ is an expansion of $\hat {M}$ . Corollary 1.2 follows from Theorem 1.1 in combination with the fact that $M^{Sh}$ is an expansion of $\hat {M}^{Sh}$ , it being obvious that $\hat {M}^{Sh}$ is an expansion of $M^{Sh}$ . The fact that $M^{Sh}$ expands $\hat {M}^{Sh}$ follows from the fact that $M^{Sh}$ expands $(M^{Sh})^{Sh}$ . This must be well known but, unaware of a suitable reference, we provide a short proof (the main points of which were suggested to us by the referee).

Lemma 2.2. $M^{Sh}$ is an expansion of $(M^{Sh})^{Sh}$ .

Proof Let $M^{Sh}\prec \bar {N}$ and $(\bar {N},M^{Sh})\prec (\bar {N}',\bar {M}')$ be sufficiently saturated elementary extensions in the languages $L(M^{Sh})$ and $L(M^{Sh})\cup \{P\}$ , respectively. Let $N,M'$ , and $N'$ be the reducts of $\bar {N},\bar {M}'$ , and $\bar {N}'$ to L. Let $X\subseteq M^{\bar {x}}$ be $\emptyset $ -definable in $(M^{Sh})^{Sh}$ . Then there exists $Y\subseteq M^{\prime \bar {x}}$ definable in $\bar {M}'$ such that $X=Y\cap M^{\bar {x}}$ . We then have some $Z\subseteq M^{\prime \bar {x}\bar {y}}$ and $\bar {b}\in M^{\prime \bar {y}}$ such that Z is $\emptyset $ -definable in $\bar {M}'$ and $Y=\{\bar {a}\in M^{\prime \bar {x}}:(\bar {a},\bar {b})\in Z\}$ . By Fact 2.1, Z is defined by an $L(M^{Sh})$ -formula which defines an externally definable set of M. It follows that there exists $W\subseteq N^{\prime \bar {x}\bar {y}}$ definable in $N'$ such that $Z=W\cap M^{\prime \bar {x}\bar {y}}$ . We then have $X=\{\bar {a}\in M^{\bar {x}}:(\bar {a},\bar {b})\in W\}$ and so X is $\emptyset $ -definable in $M^{Sh}$ .

We shall make much use of cuts in the following sense.

Definition 2.3. Let $(A,<)$ be a totally ordered set. A cut in A is a complete quantifier-free one-type over A, considered as a structure in the language $\{<\}$ . An unrealised cut in A is one which has no realisation in A.

The following concept will be useful in the proof of Lemma 1.3.

Definition 2.4. Let $C=\{c_1, \ldots , c_k\}$ be a set of unrealised cuts in an indiscernible sequence $A\subseteq M'$ . Let $\bar {b}=(b_1, \ldots , b_n)$ and $\bar {b}^\prime =(b_1^\prime , \ldots , b_n^\prime )$ be tuples of elements of A. We say that $\bar {b}$ and $\bar {b}^\prime $ have the same order type over C if they have the same quantifier-free type over $\emptyset $ in the structure $(A,<)$ and, for each $i\leq n$ and $m\leq k$ , $b_i<c_m$ if and only if $b_i^\prime <c_m$ . In this case we write $otp(\bar {b}/C)=otp(\bar {b}^\prime /C)$ .

The following is an immediate consequence of Fact 1 in [Reference Chernikov and Simon3] (see also [Reference Adler1, Reference Shelah5]).

Fact 2.5. Let $A\subseteq M'$ be a small indiscernible sequence. Let $\theta (\bar {x})$ be a formula with parameters in $M'$ . Then there is a finite set $C=\{c_1, \ldots , c_k\}$ of unrealised cuts in A such that, for any tuples $\bar {b},\bar {b}^\prime $ from A, if $otp(\bar {b}/C)=otp(\bar {b}^\prime /C)$ then $M'\models \theta (\bar {b})\leftrightarrow \theta (\bar {b}^\prime )$ .

We note that there is a minimum such C.

Lemma 2.6. Let $A\subseteq M'$ be a small indiscernible sequence. Let $\theta (\bar {x})$ be a formula with parameters in $M'$ . Let $\mathcal {C}$ be the collection of all C as in Fact 2.5. Then $\mathcal {C}$ has a minimum element with respect to set inclusion.

Proof By Fact 2.5, $\mathcal {C}$ is not empty. Let $C=\{c_1, \ldots , c_k\}\in \mathcal {C}$ such that k is minimal. Let $C^\prime \in \mathcal {C}$ . Suppose $C\nsubseteq C'$ . Let $c\in C\setminus C'$ and $C_1=C\setminus \{c\}$ . Since k is minimal, there are tuples $\bar {b},\bar {b}'$ from A such that $otp(\bar {b}/C_1)=otp(\bar {b}'/C_1)$ and $M'\models \theta (\bar {b})\wedge \neg \theta (\bar {b}')$ . One can deform $\bar {b}$ into $\bar {b}'$ without changing the truth value of $\theta (\bar {b})$ (by ensuring that at each stage one preserves the order type over C or the order type over $C'$ ). This is a contradiction.⊣

Note that none of the cuts in the minimum C will be at $\infty $ or $-\infty $ . If A and B are disjoint ordered sets then $A+B$ denotes $A\cup B$ equipped with the ordering which places everything in A below everything in B and agrees with the existing orderings of A and B. The following, which we take as our definition of distality, is provided by a combination of Definition 2.1 and Lemma 2.7 in [Reference Simon7].

Definition 2.7. T is distal if, for any small indiscernible sequence of the form $I+\{b\}+J$ in $M'$ , where $\{b\}$ is a singleton and I and J are infinite without endpoints, and any small $D\subseteq M'$ , if $I+J$ is indiscernible over D then $I + \{b\} + J$ is indiscernible over D.

Trivially, if distality fails then this is witnessed by some $D, b, I$ , and J such that I and J are both indexed by $\mathbb {Z}$ . Note that $M'$ could be many-sorted. Even if it is one-sorted, the elements of $I+\{b\}+J$ could be tuples. When distality fails we shall want the following convenient consequence which must be well known. (For a slightly stronger version, see Corollary 1.11 in [Reference Aschenbrenner, Chernikov, Gehret and Ziegler2].)

Lemma 2.8. If T is not distal then there exist a small indiscernible sequence ${I+\{b\}+J}$ with I and J infinite, a formula $\phi (x,y)$ and some $a\in M'$ such that $I+J$ is indiscernible over a and $M'\models \phi (a,c)$ for all $c\in I+J$ but $M'\models \neg \phi (a,b)$ .

Proof Suppose T is not distal. Then we have a small indiscernible $I+\{b\}+J$ in $M'$ , with I and J indexed by $\mathbb {Z}$ , and a small $D\subseteq M'$ such that $I+J$ is indiscernible over D but $I+\{b\}+J$ is not. It follows that there exist a formula $\phi (x,\bar {y})$ and some $a\in M'$ , with $\bar {y}$ an n-tuple of variables in the sort of $I+\{b\}+J$ , such that $M'\models \phi (a,\bar {c})$ for any strictly increasing n-tuple $\bar {c}$ from $I+J$ and $M'\models \neg \phi (a,\bar {b})$ for some strictly increasing n-tuple $\bar {b}$ from $I+\{b\}+J$ .

Let $I'$ be the set of all elements in I below $\bar {b}$ and let $J'$ be the set of all elements in J above $\bar {b}$ . Then $I'$ and $J'$ are both infinite and each is indexed by $\mathbb {N}$ , with the standard or reverse order, or by $\mathbb {Z}$ . By grouping elements together we may treat $I'$ and $J'$ as sequences of n-tuples. Then $I'+\{\bar {b}\}+J'$ is indiscernible and $I'+J'$ is indiscernible over a. We have $M'\models \phi (a,\bar {c})$ , for all $\bar {c}\in I'+J'$ , while $M'\models \neg \phi (a,\bar {b})$ .

3 Lemma

In this section we prove Lemma 1.3. For convenience we recall the statement.

Lemma 3.1. Let L be a language and T a complete first-order L-theory. Assume T has NIP. Let $M\models T$ and let $M\prec N$ and $(N,M)\prec (N',M')$ be sufficiently saturated elementary extensions, where $(N,M)$ and $(N',M')$ are $L\cup \{P\}$ -structures and P is a unary predicate, not in L, such that $P(N)=M$ and $P(N')=M'$ . Let $A\subseteq M'$ be a small non-constant L-indiscernible sequence. Then there is a small L-indiscernible sequence $A'\subseteq M'$ which extends A and has the following property. For every complete L-type $q(\bar x)$ over $A'$ with $\bar {x}=(x_1, \ldots , x_n)$ , if $q(\bar {x})$ is finitely realised in $A'$ then $q(\bar {x})\cup \{P(x_1), \ldots , P(x_n)\}$ implies a complete L-type over N.

Proof When a language other than L is intended, we shall make that clear. Let $\theta (\bar {x})$ be a formula with parameters in N. By Fact 2.5 there is a set $C_A^\theta =\{c_1, \ldots , c_k\}$ of unrealised cuts of A such that, for any two tuples $\bar {b}$ and $\bar {b}^\prime $ from A, if $otp(\bar {b}/C_A^\theta )=otp(\bar {b}^\prime /C_A^\theta )$ then $N'\models \theta (\bar {b})\leftrightarrow \theta (\bar {b}^\prime )$ . By Lemma 2.6, we may assume $C_A^\theta $ is the minimum among all possible choices (ordered by set inclusion).

For any small indiscernible sequence $B\subseteq M'$ extending A and any cut $c\in C_A^\theta $ , there must be some $c'\in C_B^\theta $ such that $c^\prime $ refines c (by which we mean that every realisation of $c^\prime $ is also a realisation of c). Otherwise $C_B^\theta $ would give rise to a finite set $C^\prime $ of unrealised cuts in A such that $C_A^\theta \nsubseteq C^\prime $ and, for any tuples $\bar {b}$ and $\bar {b}'$ from A, $otp(\bar {b}/C')=otp(\bar {b}^\prime /C')\implies N'\models \theta (\bar {b})\leftrightarrow \theta (\bar {b}^\prime )$ . This would be a contradiction.

As each $C_B^\theta $ is finite, it follows that we cannot have an infinite sequence of small indiscernible extensions $A\subseteq B_1\subseteq B_2\subseteq \cdots \subseteq M'$ such that $| C_A^\theta |<|C_{B_1}^\theta |<|C_{B_2}^\theta |<\ldots $ (since otherwise the union $\bigcup \limits _{n\in \mathbb {N}}B_n$ would be a small indiscernible sequence for which the conclusion of Fact 2.5 is false). So then, for each $\theta $ , we can find a small extension B of A such that, for any small extension $B^\prime $ of B, $|C_B^\theta |=|C_{B^\prime }^\theta |$ and in fact there is a bijection from $C_B^\theta $ to $C_{B^\prime }^\theta $ which sends each cut $c\in C_B^\theta $ to the unique $c^\prime \in C_{B^\prime }^\theta $ which refines it.

The process of extending A to such a B could be called “maximising for $\theta $ ”. Enumerate all formulas with parameters in N, add one to the enumerating indices so that only successor ordinals are used and then maximise for each formula in turn, taking unions at limit ordinals. We thereby obtain a small indiscernible sequence $A^*\subseteq M'$ extending A such that, for any formula $\theta $ with parameters in N and any small indiscernible $B\subseteq M'$ extending $A^*$ , there is a bijection from $C_{A^*}^\theta $ to $C_B^\theta $ which sends each $c\in C_{A^*}^\theta $ to the unique $c^\prime \in C_B^\theta $ which refines it. Note that “formula $\theta $ ” really means “formula $\theta (\bar {x})$ where $\bar {x}$ is a tuple of variables in the sort of A”.

We would like to consider $\bigcup \limits _\theta C_{A^*}^\theta $ and, for any small extension B of $A^*$ , the bijection taking each $c\in \bigcup \limits _\theta C_{A^*}^\theta $ to the unique $c^\prime \in \bigcup \limits _\theta C_B^\theta $ which refines it. However, we cannot be sure at this stage that such a bijection exists. The problem is that, for some $\theta _1,\theta _2$ , we might have $|C_{A^*}^{\theta _1}\cap C_{A^*}^{\theta _2}|>|C_B^{\theta _1}\cap C_B^{\theta _2}|$ . In other words, some cuts might coincide in $A^*$ but not in B. For any small $B'$ extending a small B extending $A^*$ , we must have $|C_{A^*}^{\theta _1}\cap C_{A^*}^{\theta _2}|\geq |C_B^{\theta _1}\cap C_B^{\theta _2}|\geq |C_{B'}^{\theta _1}\cap C_{B'}^{\theta _2}|$ . (To see this note, in the notation of the first inequality, that every cut in $C_B^{\theta _1}\cap C_B^{\theta _2}$ refines one in $C_{A^*}^{\theta _1}\cap C_{A^*}^{\theta _2}$ and that it would contradict the existence of our bijections if two cuts in $C_B^{\theta _1}\cap C_B^{\theta _2}$ were to refine the same cut in $C_{A^*}^{\theta _1}\cap C_{A^*}^{\theta _2}$ .) An ordinal (in this case a finite one) cannot be decreased infinitely many times. So, for each pair $\theta _1,\theta _2$ , we can extend so that $|C_B^{\theta _1}\cap C_B^{\theta _2}|$ is minimised. We can enumerate all such pairs of formulas and extend appropriately for each one in turn, taking unions at limit ordinals. This results in a small extension $A^{**}\subseteq M'$ of $A^*$ with the following property. For any small indiscernible $B\subseteq M'$ extending $A^{**}$ and any formula $\theta $ with parameters in N, let $f_B^\theta :C_{A^{**}}^\theta \rightarrow C_B^\theta $ be the bijection which maps each $c\in C_{A^{**}}^\theta $ to the unique $c^\prime \in C_B^\theta $ which refines it and define $C_B=\bigcup \limits _\theta C_B^\theta $ . Then, for each such B, the union, over all such $\theta $ , of the graphs of the functions $f_B^\theta $ is the graph of an order-preserving bijection $f_B:C_{A^{**}}\rightarrow C_B$ .

To simplify notation, let $C=C_{A^{**}}$ . Enumerate the elements of C as $(c^\alpha )_{\alpha <\kappa }$ . For each small indiscernible $B\subseteq M'$ extending $A^{**}$ and each $\beta <\kappa $ , let $c_B^\beta =f_B(c^\beta )$ . We build a chain $(B_\alpha )_{\alpha <\kappa }$ of small indiscernible sequences in $M'$ extending $A^{**}$ in the following way. Let $\beta <\kappa $ and suppose we have formed $B_\alpha $ for all $\alpha <\beta $ . Let $B_\beta '=A^{**}\cup \bigcup \limits _{\alpha <\beta } B_\alpha $ . Consider the cut $c^\beta _{B_\beta '}$ . There are four cases.

  1. (1) Suppose $\{a\in B^{\prime }_\beta : a<c^\beta _{B^{\prime }_\beta }\}$ has a maximum and $\{a\in B^{\prime }_\beta : a>c^\beta _{B^{\prime }_\beta }\}$ has a minimum. Then let $B_\beta =B^{\prime }_\beta $ .

  2. (2) Suppose $\{a\in B^{\prime }_\beta : a<c^\beta _{B^{\prime }_\beta }\}$ has a maximum and $\{a\in B^{\prime }_\beta : a>c^\beta _{B^{\prime }_\beta }\}$ does not have a minimum. By compactness, there exist a small indiscernible sequence B extending $B^{\prime }_\beta $ and some $v_\beta \in B$ such that $v_\beta>c^\beta _B$ and $v_\beta $ realises $c^\beta _{B^{\prime }_\beta }$ . (One uses the limit type of the indiscernible sequence $B^{\prime }_\beta $ over $NB^{\prime }_\beta $ as $c^\beta _{B^{\prime }_\beta }$ is approached from the right.) Then let $B_\beta =B^{\prime }_\beta \cup \{v_\beta \}$ .

  3. (3) Suppose $\{a\in B^{\prime }_\beta : a>c^\beta _{B^{\prime }_\beta }\}$ has a minimum and $\{a\in B^{\prime }_\beta : a<c^\beta _{B^{\prime }_\beta }\}$ does not have a maximum. By compactness, there exist a small indiscernible sequence B extending $B^{\prime }_\beta $ and some $u_\beta \in B$ such that $u_\beta <c^\beta _B$ and $u_\beta $ realises $c^\beta _{B^{\prime }_\beta }$ . Then let $B_\beta =B^{\prime }_\beta \cup \{u_\beta \}$ .

  4. (4) Suppose $\{a\in B^{\prime }_\beta : a<c^\beta _{B^{\prime }_\beta }\}$ does not have a maximum and $\{a\in B^{\prime }_\beta : a>c^\beta _{B^{\prime }_\beta }\}$ does not have a minimum. By compactness, there exist a small indiscernible sequence B extending $B^{\prime }_\beta $ and some $u_\beta ,v_\beta \in B$ such that $u_\beta <c^\beta _B$ , $v_\beta>c^\beta _B$ and both $u_\beta $ and $v_\beta $ realise $c^\beta _{B^{\prime }_\beta }$ . Then let $B_\beta =B^{\prime }_\beta \cup \{u_\beta ,v_\beta \}$ .

Let $A'=\bigcup \limits _{\alpha <\kappa }B_\alpha $ . In the remainder of this proof, if we write an indiscernible sequence as $(B,<)$ we are thinking of it as a structure and the language we are using is $\{<\}$ . The sequence $A'$ has been constructed so that, for each $\beta <\kappa $ , the cut $c^\beta _{A'}$ is definable in $(A',<)$ . Therefore, whenever we have small indiscernible sequences B and $B'$ in $M'$ , with $A'\subseteq B$ and $A'\subseteq B'$ , and $\bar {a}=(a_1, \ldots , a_n)\in B^n$ and $\bar {a}'=(a^{\prime }_1, \ldots , a^{\prime }_n)\in B^{{\prime }n}$ , if $(A',<)\prec (B,<)$ and $(A',<)\prec (B',<)$ and $qftp_{\{<\}}(\bar {a}/A')=qftp_{\{<\}}(\bar {a}'/A')$ then, for each $\beta <\kappa $ and $i\in \{1, \ldots , n\}$ , $a_i<c_B^{\beta }$ if and only if $a^{\prime }_i<c_{B'}^{\beta }$ .

We show that $A'$ has the desired property. Let $q(\bar x)$ be a complete L-type over $A'$ which is finitely realised in $A'$ . Let $\bar a=(a_1, \ldots , a_n)$ and $\bar a'=(a_1', \ldots , a_n')$ both realise $q(\bar x)$ in $M'$ . Let $(N",M",A")$ be a sufficiently saturated elementary extension of $(N',M',A')$ , in the language $L\cup \{P,Q,<\}$ , where P is a unary predicate for $M'$ , Q is a unary predicate for $A'$ , and $<$ is a binary predicate for the order relation on $A'$ . Then $q(\bar {x})$ is realised in $A"$ , say by $\bar {a}"$ . By the downward Löwenheim–Skolem theorem, there is a small $(N"',M"',A"')\prec (N",M",A")$ such that $A'\cup \{\bar {a}"\}\subseteq A"'$ and $(A',<)\prec (A"',<)$ . Then $A"'$ is indiscernible in the sense of L. We then have automorphisms $\sigma $ and $\sigma '$ of the $L\cup \{P\}$ -structure $(N",M")$ which fix $A'$ pointwise and are such that $\sigma (\bar {a}")=\bar {a}$ and $\sigma '(\bar {a}")=\bar {a}'$ . Let $B=\sigma (A"')$ and $B'=\sigma '(A"')$ . Then B and $B'$ are indiscernible (in the sense of L), $(A',<)\prec (B,<)$ and $(A',<)\prec (B',<)$ , where the orderings of B and $B'$ are determined by $\sigma $ and $\sigma '$ . We may assume $B,B'\subseteq M'$ . Since $qftp_{\{<\}}(\bar {a}/A')=qftp_{\{<\}}(\bar {a}'/A')$ we have $a_i<c_B^{\beta }$ if and only if $a^{\prime }_i<c_{B'}^{\beta }$ , for each $\beta <\kappa $ and $i\in \{1, \ldots , n\}$ . It follows that $tp(\bar {a}/N)=tp(\bar {a}'/N)$ .

Remark 3.2. One then gets for free that $q(\bar {x})\cup \{P(x_1), \ldots , P(x_n)\}$ implies a complete L-type over $N A^\prime $ . One way to obtain N and $(N^\prime ,M^\prime )$ would be to take sufficiently saturated elementary extensions $M^{Sh}\prec \bar {N}$ and $(\bar {N},M^{Sh})\prec (\bar {N}^\prime ,\bar {M}^\prime )$ , in the languages $L(M^{Sh})$ and $L(M^{Sh})\cup \{P\}$ , respectively, and then define N, $M^\prime $ and $N^\prime $ to be the L-reducts of $\bar {N}$ , $\bar {M}^\prime $ , and $\bar {N}^\prime $ . In this case, given that $q(\bar {x})\cup \{P(x_1), \ldots , P(x_n)\}$ implies a complete L-type over $NA'$ , $q(\bar {x})$ implies membership of a maximal consistent collection of sets defined by predicates in $L(M^{Sh})$ using parameters in $A'$ . Since $Th(M^{Sh})$ has QE $($ Fact 2.1 $)$ , $q(\bar {x})$ implies a complete $L(M^{Sh})$ -type over $A'$ .

4 Theorem

In this section we prove Theorem 1.1, after restating it for convenience. Our proof borrows a great deal from the proof in [Reference Chernikov and Simon3] that distality is equivalent to having so-called strong honest definitions (see Proposition 19 and Theorem 21 of [Reference Chernikov and Simon3]). It is essentially just a stretching of that argument to a setting provided by Lemma 1.3.

Theorem 4.1. Let L be a language and T a complete first-order L-theory. Let $M\models T$ and let $M^{Sh}$ be the Shelah expansion of M. Suppose $Th(M^{Sh})$ is distal. Then T is distal.

Proof As in the proof of Lemma 1.3, the default language is L. Suppose, for contradiction, that T is not distal. By Lemma 2.8 there exist a model $K\models T$ , an indiscernible sequence $I+\{b\}+J$ in K, with I and J infinite and $\{b\}$ a singleton, some $a\in K$ and a formula $\phi (x,y)$ such that $I+J$ is indiscernible over a, $K\models \phi (a,d)$ for all $d\in I+J$ and $K\models \neg \phi (a,b)$ .

Let $M^{Sh}\prec \bar {N}$ and $(\bar {N},M^{Sh})\prec (\bar {N}',\bar {M}')$ be sufficiently saturated elementary extensions in the languages $L(M^{Sh})$ and $L(M^{Sh})\cup \{P\}$ , respectively. Let $N,M'$ , and $N'$ be the reducts of $\bar {N},\bar {M}'$ , and $\bar {N}'$ to L. We may assume $K\prec M^\prime $ .

By Lemma 1.3 and Remark 3.2, $I+J$ extends to a small indiscernible sequence $A'$ in $M'$ with the property that every complete type over $A'$ which is finitely realised in $A'$ implies a complete $L(M^{Sh})$ -type over $A'$ . We may assume a and b are such that $A'\cup \{b\}$ is indiscernible, with b positioned just above I, and $A'$ is indiscernible over a. (To see this, let $r(x,y)$ be the partial type over $A'$ expressing the desired properties of the pair $(a,b)$ . Any finite $r'(x,y)\subseteq r(x,y)$ involves only a finite tuple $cd$ from $A'$ , where c is bounded above by an element of I and d lies entirely above I. By indiscernibility, an automorphism of $M'$ takes c to a tuple in I and d to a tuple in J, establishing that $r'(x,y)$ can be realised. One then uses saturation.)

Now consider the structure $(\bar {N}',\bar {M}',A')$ in the language $L(M^{Sh})\cup \{P,Q\}$ . Take sufficiently saturated elementary extensions

$$\begin{align*}(\bar{N}',\bar{M}',A')\prec (\bar{N}",\bar{M}",A")\prec (\bar{N}"',\bar{M}"',A"')\prec (\bar{N}"",\bar{M}"",A"").\end{align*}$$

In all cases, let the removal of the bar correspond to taking the L-reduct. Let $p(x)=tp(a/A")$ . Let $q(y)$ be a complete type over $A"$ , where y is a single variable in the sort of $A'$ , such that q is finitely realised in $A'$ . We show that $p(x)\cup q(y)$ implies a complete type in $xy$ over $\emptyset $ .

Let $q'(y)$ be some extension of $q(y)$ to a complete type over $N""$ which is finitely realised in $A'$ . Let $(d_i)_{i\in \mathbb {Z}}$ be a Morley sequence for $q'$ over $N'$ in $A"$ . (Of course, a Morley sequence is usually indexed by $\mathbb {N}$ but, having obtained such a sequence, one can choose another one indexed by $\mathbb {Z}$ with the same EM-types.) Let $d^*$ realise q in $M"'$ . Let $(d^{\prime }_i)_{i\in \mathbb {Z}}$ be a Morley sequence in $q'$ over $N"'$ in $A""$ . We find the following picture helpful.

The sequence $(d_i)_{i\in \mathbb {Z}}+d^*+(d^{\prime }_i)_{i\in \mathbb {Z}}$ is $L(M^{Sh})$ -indiscernible. This is because every finite subsequence has a type over $A'$ which is finitely realised in $A'$ and therefore implies a complete $L(M^{Sh})$ -type over $A'$ . Also $(d_i)_{i\in \mathbb {Z}}+(d^{\prime }_i)_{i\in \mathbb {Z}}$ is L-indiscernible over $Na$ and so $L(M^{Sh})$ -indiscernible over a. By the distality of $Th(M^{Sh})$ , $(d_i)_{i\in \mathbb {Z}}+d^*+(d^{\prime }_i)_{i\in \mathbb {Z}}$ is $L(M^{Sh})$ -indiscernible over a and thus L-indiscernible over a. Since $d^*$ was an arbitrary realisation of q in $M"'$ it follows that $p(x)\cup q(y)$ implies a complete type in $xy$ over $\emptyset $ .

Since the set of all $d \in M"'$ such that $tp(d/A")$ is finitely realised in $A'$ is type-definable over $A"$ in the structure $M"'$ , a compactness argument gives us some $\bar {c}\in A^{{\prime \prime }k}$ and an L-formula $\theta (x, \bar {z})$ , with $\bar {z}$ a k-tuple of variables in the sort of y, such that $M"\models \theta (a,\bar {c})$ and $\theta (x,\bar {c})$ implies the $\phi $ -type of a over $A'$ . (To see this, suppose not. Then, for any choice of $\theta (x,\bar {c})\in tp(a/A")$ , there exist $b'\in A'\subseteq \{d\in M"':tp(d/A")\text { is finitely realised in }A'\}$ and $a'\in M"$ such that $M"\models \theta (a',\bar {c})$ and $M"\models \phi (a,b')\leftrightarrow \neg \phi (a',b')$ . Then, by compactness, there exist $a',b'\in M"'$ such that $a'\models p(x)$ , $tp(b'/A")$ is finitely realised in $A'$ and $tp(ab')\neq tp(a'b')$ which is a contradiction.) So for any finite $A\subseteq A'$ there is a $\bar {c}\in A^{{\prime }k}$ such that $M'\models \theta (a,\bar {c})$ and $\theta (x, \bar {c})$ implies the $\phi $ -type of a over A.

Recall that $A'\cup \{b\}$ is indiscernible, with b positioned just above I, and $A'$ is indiscernible over a. So $M'\models \phi (a,d)$ for all $d\in A'$ and $M'\models \neg \phi (a,b)$ . Let $A\subseteq A'$ have cardinality $k+1$ . Let $\bar {c}\in A^{{\prime }k}$ be such that $M'\models \theta (a, \bar {c})$ and $\theta (x, \bar {c})$ implies the $\phi $ -type of a over A. Let d be an element of A which does not belong to the tuple $\bar {c}=(c_1, \ldots , c_k)$ . Let f be a partial automorphism of $(A'\cup \{b\},<)$ , with domain $A \cup \{c_1, \ldots , c_k\}$ , such that $f(d)=b$ . Let $f(\bar {c})$ denote the tuple $(f(c_1), \ldots , f(c_k))$ . Then $M'\models \theta (a,f(\bar {c}))$ . It follows that $M'\models \phi (a,b)$ , since otherwise there would be some $a'\in M'$ such that $M'\models \theta (a',\bar {c})\wedge \neg \phi (a',d)$ which would be a contradiction. But $M'\models \neg \phi (a,b)$ and so we have a contradiction and the proof is finished.

5 Converse

For completeness we give a proof of the converse of Theorem 1.1, though it was already known to experts in the area.

Theorem 5.1. Let T be a complete first-order L-theory and let $M\models T$ . Suppose T is distal. Then $Th(M^{Sh})$ is distal.

Proof Let $M^{Sh}\prec \bar {N}$ and $(\bar {N},M^{Sh})\prec (\bar {N}',\bar {M}')$ be sufficiently saturated elementary extensions, the first in the language $L(M^{Sh})$ and the second in the language $L(M^{Sh})\cup \{P\}$ , where P is a new unary predicate. Let $N,M'$ , and $N'$ be the L-reducts of $\bar {N},\bar {M}'$ , and $\bar {N}'$ , respectively. Let $I+\{b\}+J$ be a small $L(M^{Sh})$ -indiscernible sequence in $\bar {M}'$ , such that I and J are both infinite without endpoints. Let $A\subseteq \bar {M}'$ be small and suppose $I+J$ is $L(M^{Sh})$ -indiscernible over A. It follows that $I+J$ is L-indiscernible over $NA$ and that $I+\{b\}+J$ is L-indiscernible over N. By distality of T, $I+\{b\}+J$ is L-indiscernible over $NA$ . Therefore $I+\{b\}+J$ is $L(M^{Sh})$ -indiscernible over A.

6 Alternative approach using measures

In this section we mention an alternative proof of Theorem 1.1 for which we thank Ehud Hrushovski and Anand Pillay. We shall be brief with the details as we have already given a thorough proof and experts will be able to fill in the gaps quite easily. Throughout, T is a complete first-order NIP theory.

We recall the definitions we shall need and direct the reader to Chapter 7 of [Reference Simon8] for further details. A measure $\mu $ over a structure M assigns to each definable (with parameters) subset of some fixed sort of M a number in the interval $[0,1]$ . It is finitely additive and achieves a maximum value of $1$ . It is smooth if, for each elementary extension $M\prec N$ , there is only one measure over N extending $\mu $ . Suppose we have $M\models T$ , a sufficiently saturated elementary extension $M\prec N$ and a measure $\mu $ over N. We say $\mu $ is definable over M if, for each L-formula $\varphi (x,y)$ and closed $B\subseteq [0,1]$ , the set of all $b\in N$ such that $\varphi (x,b)$ defines a set with $\mu $ -measure in B is type-definable over M. We say $\mu $ is finitely satisfiable in M if every definable set with positive $\mu $ -measure has non-empty intersection with the relevant sort of M. In the case where $\mu $ is both definable over M and finitely satisfiable in M, we say $\mu $ is generically stable over M.

The following fact is from [Reference Simon7] (Corollary 2.22 and Proposition 2.27). The “moreover” statement follows from Proposition 2.21 in [Reference Simon7].

Fact 6.1. Let T be a complete first-order L-theory. Suppose T has NIP. Then T is distal if and only if, for every $K\models T$ , sufficiently saturated $K\prec N$ and measure $\mu $ over N, if $\mu $ is generically stable over K then its restriction to K is smooth. Moreover, if T is not distal then it has a model K such that, for every elementary extension $K\prec \hat {K}$ , there exist a sufficiently saturated $\hat {K}\prec \hat {N}$ and a measure $\mu $ over $\hat {N}$ which is generically stable over $\hat {K}$ but whose restriction to $\hat {K}$ is not smooth.

Theorem 6.2. Let $M\models T$ . Let $M^{Sh}\prec \bar K$ . Then let $\bar K\prec \bar {N}$ and $(\bar {N},\bar K)\prec (\bar {N}',\bar {K}')$ be sufficiently saturated elementary extensions and define $N,K, N'$ , and $K'$ to be the L-reducts of $\bar {N},\bar {K}, \bar {N}'$ , and $\bar {K}'$ . Let $\mu $ be a measure over $N'$ which is generically stable over K. Then the restriction of $\mu $ to K extends to a measure $\mu ^*$ over $\bar K$ with the following properties $:$

  1. (1) $\mu ^*$ extends to a measure over $\bar {K}'$ which is generically stable over $\bar K$ .

  2. (2) If the restriction of $\mu $ to K is not smooth then $\mu ^*$ is not smooth.

Furthermore, the measure $\mu ^*$ is the unique extension to $\bar K$ of the restriction of $\mu $ to K.

Proof Let X be a definable set of $\bar {K}'$ . Then X is a fibre of a $\emptyset $ -definable set, say $X_1$ . By Fact 2.1, $X_1$ is defined by a quantifier-free formula $R(x,z)\in L(M^{Sh})$ , without parameters. Consider the set, say $X_2$ , defined by $R(x,z)$ in $\bar {K}$ . By compactness, as is well known, $X_2$ will itself be externally definable with respect to the structure K and so there will exist an L-formula $\varphi (x,y,z)$ and parameter b from N such that $X_2$ is the set of all $(a,c)\in K$ for which $N\models \varphi (a,b,c)$ . Using compactness one can choose b so that, for every L-formula $\theta (w,y)$ , the set $\{d\in K:N\models \theta (d,b)\}$ is $\emptyset $ -definable in the structure $\bar {K}$ . We assume b has been chosen with this property. Then $X_1$ will be the set externally defined by $\varphi (x,b,z)$ in $K'$ . So, finally, we have an L-formula $\varphi (x,y,z)$ and parameters b from N and c from $K'$ such that $X=\{a\in K':N'\models \varphi (x,b,c)\}$ . Define $\mu '$ over $\bar {K}'$ such that $\mu '(X)$ is the value assigned by $\mu $ to the set defined by $\varphi (x,b,c)$ in $N'$ .

One checks that $\mu '$ is a measure over $\bar {K}'$ . Note that it is well-defined because $\varphi (x,b,c)$ is always unique up to a $\mu $ -measure zero symmetric difference, using the fact that $\mu $ is finitely realisable in K. Furthermore, $\mu '$ is definable over $\bar K$ and finitely satisfiable in $\bar K$ . For definability, we use definability of $\mu $ for the formula $\varphi (x,y,z)$ and then restrict the type-definable set to $y=b$ and project to the z-coordinate. From the way b was chosen it is clear that the resulting type-definable set is defined by a partial type using only formulas in the language of $\bar {K'}$ , with parameters in $\bar {K}$ . Finite realisability of $\mu '$ in $\bar {K}$ is immediate from the finite realisability of $\mu $ in K. So then the measure $\mu '$ over $\bar {K}'$ is generically stable over $\bar K$ . We define $\mu ^*$ to be its restriction to $\bar K$ .

For uniqueness of $\mu ^*$ (the “furthermore” statement) one uses the fact that every measure over $\bar K$ comes from a measure over $N'$ which agrees with it on K and is finitely realisable in K. Since $\mu $ is generically stable over K, it is known (by Proposition 3.3 in [Reference Hrushovski, Pillay and Simon4]) that its restriction to K has only one finitely realisable (in K) extension to $N'$ . Therefore $\mu ^*$ is unique.

Now suppose the restriction of $\mu $ to K is not smooth. Since $K\prec N$ is sufficiently saturated, this is witnessed over N and so there are two distinct extensions $\mu _1$ and $\mu _2$ to N. These extend, respectively, to measures $\mu _1^*$ and $\mu _2^*$ over $\bar {N}$ . Trivially, $\mu _1^*$ and $\mu _2^*$ are distinct. They both restrict to measures on $\bar K$ which extend the restriction of $\mu $ to K. By uniqueness of $\mu ^*$ , they both extend $\mu ^*$ . So $\mu ^*$ is not smooth.

One quickly deduces Theorem 1.1 from this as follows. Suppose T is not distal and let $M\models T$ . Let $L_M$ be L together with a new constant symbol for every element of M. Let $T_M$ be the $L_M$ -theory of M. By Corollary 2.9 in [Reference Simon7], $T_M$ is not distal. Then, by Fact 6.1, there exist a model $\hat K\models T_M$ , a sufficiently saturated elementary extension $\hat K\prec \hat N'$ and a measure $\hat \mu $ over $\hat N'$ which is generically stable over $\hat K$ and whose restriction to $\hat K$ is not smooth. Let $N'$ and K be the L-reducts of $\hat N'$ and $\hat K$ and let $\mu $ be the restriction of $\hat \mu $ to $N'$ . Then $\mu $ is generically stable over K and its restriction to K is not smooth. By the “moreover” part of Fact 6.1, we may assume $N'$ , K, and $\mu $ are as in Theorem 6.2 and so there exist $\bar K, \bar {K}'$ , and $\bar {N}'$ as in the statement of that result. It follows that there is a non-smooth measure $\mu ^*$ over $\bar {K}$ which extends to a measure over $\bar K'$ which is generically stable over $\bar K$ . By Fact 6.1, $Th(M^{Sh})$ is not distal.

Acknowledgment

We thank Artem Chernikov for alerting us to the problem addressed in this paper and for helpful discussions. We thank Ehud Hrushovski and Anand Pillay for Section 6. We thank the referee for careful reading and several comments and suggestions which helped to correct errors and improve the paper.

Funding

This work is based on the research supported in part by the National Research Foundation of South Africa (Grant Number 96234, to G.B.). C.K. is supported by LMS travel grant 41605 and Leverhulme Project grant RPG-2017-179.

References

REFERENCES

Adler, H., An introduction to theories without the independence property, preprint, 2008.Google Scholar
Aschenbrenner, M., Chernikov, A., Gehret, A., and Ziegler, M., Distality in valued fields and related structures . Transactions of the American Mathematical Society, vol. 375 (2022), no. 7, pp. 46414710.Google Scholar
Chernikov, A. and Simon, P., Externally definable sets and dependent pairs II . Transactions of the American Mathematical Society, vol. 367 (2015), no. 7, pp. 52175235.CrossRefGoogle Scholar
Hrushovski, E., Pillay, A., and Simon, P., Generically stable and smooth measures in NIP theories . Transactions of the American Mathematical Society, vol. 365 (2013), no. 5, pp. 23412366.CrossRefGoogle Scholar
Shelah, S., Classification theory for elementary classes with the dependence property—A modest beginning . Scientiae Mathematicae Japonicae, vol. 59 (2004), no. 2, pp. 265316, special issue on set theory and algebraic model theory.Google Scholar
Shelah, S., Dependent first-order theories, continued . Israel Journal of Mathematics, vol. 173 (2009), pp. 160.Google Scholar
Simon, P., Distal and non-distal NIP theories . Annals of Pure and Applied Logic, vol. 164 (2013), no. 3, pp. 294318.Google Scholar
Simon, P., A Guide to NIP Theories, Cambridge University Press, Cambridge, 2015, Cambridge Books Online.Google Scholar
Simon, P., Type decomposition in NIP theories . Journal of the European Mathematical Society (JEMS), vol. 22 (2020), no. 2, pp. 455476.Google Scholar