Dividing lines in unstable theories and subclasses of Baire 1 functions
Karim Khanaki

TL;DR
This paper introduces new characterizations of the strict order property in model theory, linking dividing lines in theories to subclasses of Baire 1 functions and refining Shelah's theorem on order and independence properties.
Contribution
It provides a novel functional analytic perspective on dividing lines in first order theories and introduces new classes of theories based on these characterizations.
Findings
Characterization of SOP via formula behavior in models
Refinement of Shelah's theorem relating OP, IP, and SOP
Connections between dividing lines and subclasses of Baire 1 functions
Abstract
We give a new characterization of (the strict order property) in terms of the behaviour of formulas in any model of the theory as opposed to having to look at the behaviour of indiscernible sequences inside saturated ones. We refine a theorem of Shelah, namely a theory has (the order property) if and only if it has (the independence property) or , in several ways by characterizing various notions in functional analytic style. We point out some connections between dividing lines in first order theories and subclasses of Baire 1 functions, and give new characterizations of some classes and new classes of first order theories.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Dividing lines in unstable theories and subclasses of
Baire 1 functions
Karim Khanaki
Arak University of Technology Partially supported by IPM grant 99030117
Abstract
We give a new characterization of (the strict order property) in terms of the behaviour of formulas in any model of the theory as opposed to having to look at the behaviour of indiscernible sequences inside saturated ones. We refine a theorem of Shelah, namely a theory has (the order property) if and only if it has (the independence property) or , in several ways by characterizing various notions in functional analytic style. We point out some connections between dividing lines in first order theories and subclasses of Baire 1 functions, and give new characterizations of some classes and new classes of first order theories.
1 Introduction
This paper aims to continue a new approach to Shelah stability theory (in classical logic), which was followed in [12], [13]. This approach is based on the fact that the study of the model-theoretic properties of formulas in ‘models’ instead of only these properties in ‘theories’ develops a sharper stability theory and establishes important links between model theory and other areas of mathematics, such as functional analysis. These links lead to new results, in both model theory and functional analysis, as well as better understanding of the known results.
Let us give the background and our own point of view. In the 70’s Saharon Shelah developed local (formula-by-formula) stability theory and combinatorial properties of formulas and used them to gain global properties of theories. The independence property and the strict order property of a formula for a ‘theory’ were introduced in 1971 in [19]. It is quite natural to try to develop local stability theory for formulas in ‘models’ instead of only theories. Such a theory was developed in [15], [20], [1] for the order property and recently in [12] and [13] for the independence property. In [12], even a further step was taken and the strict order property was studied and a connection between a theorem of Shelah and an important theorem in functional analysis was discovered. What is interesting is that some model-theoretic notions appeared independently in topology and function theory, and moreover various characterizations yield, via routine translations, the characterization of in a model or set , and some important theorems in model theory have twins there.
Recall that in [19] Shelah introduced the strict order property as complementary to the independence property:
Shelah’s Theorem111In this article, when we refer to Shelah’s theorem, we mean this theorem.: ([18, Theorem II.4.7]) A complete first order theory has the order property () if and only if it has the independence property () or the strict order property ().
Later many classes of independent theories, such as simple and , were found. In [12], it is shown that there is a correspondence between Shelah’s theorem above and the well known compactness theorem of Eberlein and Šmulian. In the current paper, we complete some results of [12] and give a new characterization of for classical logic. In fact, the correspondence mentioned above is completed in this article. What is substantial is that there are connections between classification in model theory and classification of Baire class 1 functions which lead to a better understanding of both of these topics.
It is worth recalling more historical points. Stability in a model is not a new notion. In [14], [15], [20] and [9] this notion was studied in the various contexts. (Although, the work of Krivine–Maurey [14] is about the stability of the formula inside a fixed Banach space and not the models of its theory.) In [4] some variants of in a type were defined and a local version of Shelah’s theorem was proved. Recently, in [8], [12] and [21] the connection between and functional analysis was noticed. The notion “ of in a model” was introduced in [12]. We emphasize that our aim, approach and results in [12], [13] and the present paper are different from the previous works. In fact, the crucial idea in the paper is to study the model theoretic properties of theories by studying model theoretic properties of formulas in models.
This paper is organized as follows. In the next section we first review some basic notions from functional analysis and translate them into model theory. We then give a characterization of that does not involve indiscernible sequences and allows us to relate the property to the behaviour of a class of Baire 1 functions (Proposition 2.10 and Remark 2.11 below). We also refine Shelah’s theorem (Theorem 2.6 below) using a criteria for formulas inside a model. We remark some equivalences on in the terms of function spaces (Proposition 2.14 and Remark 2.15) and define the notion “ in a model” (Definition 2.12). In Section 3, we point out connections between some dividing lines in first order theories and subclasses of Baire class 1 functions (Remarks 3.2, 3.4 and Proposition 3.6).
2 Model theory and function spaces
We work in classical (-valued) model theory context, although similar results are valid in the continuous logic framework. Our model theory notation is standard, and a text such as [18] will be sufficient background for the model theory part of the paper. For the function theory part, read this paper with [12] and [13] in your hand. We frequently switch from model theory to function theory and vice versa, so we provide some necessary functional analysis background.
First we recall some definitions and facts from functional analysis and then translate them into model theoretic language.
Function spaces
We give definitions of the function spaces with which we shall be concerned, with some of elementary relations between them.
Let be a set and a subset of . The topology of pointwise convergence on is that inherited from the usual product topology on ; namely the coarsest topology on for which the map that sends each to is continuous for every .
Let be some collection of real valued functions on , containing . is said to be relatively compact (or precompact) in if the closure of in is compact. In this case is closed (and compact) in the space , so in particular it implies that the closure of in is contained in .
Recall that for a topological space , denotes the space of all bounded continuous functions on ; it is a linear space under pointwise addition. We can equip the space with the uniform norm topology, the uniform metric defined by . The weak topology on is the coarsest topology such that every bounded linear functional on is continuous. So, has three different topologies; namely the topology of pointwise convergence, the uniform topology, and the weak topology.
A well known fact in functional analysis states that for a compact space , the weak topology and the pointwise convergence topology on norm-bounded subsets of are the same. (See Proposition 462E in [3].)
For a complete metric space , a real-valued function on is said to be of the first Baire class or Baire 1, if it is the pointwise limit of a sequence of continuous functions on . This means that for each and each there is a natural number such that for all . The set of Baire 1 functions on is denoted by .
A real-valued function on a topological space is upper (resp. lower) semi-continuous if and only if (resp. ) is closed for every real number . A function is called semi-continuous if is either upper or lower semi-continuous. A known classical theorem, due to Baire, asserts that:
Fact 2.1** ([6], p. 274).**
A real-valued function on a complete metric space is lower semi-continuous if and only if there is a sequence of continuous functions such that and converges pointwise to (for short we write ).
A real-valued function on is called a difference of bounded semi-continuous functions (short ) if there exist bounded semi-continuous functions and on with . The class of such functions is denoted by . Since every lower (or upper) semi-continuous function is the limit of a monotone sequence of continuous functions, so . It is a well known fact that, in general, is a proper subclass of (see Remark 2.15 below). To summarize, . (More details can be found in [2].)
We will see shortly, the order property corresponds to and the strict order property has connection to .
In this paper, typically will be a subset of , the set of bounded continuous functions on . Moreover, it suffices to assume that is countable and is compact and Polish, i.e. a separable completely metrizable topological space. Note that the uniform closure of is contained in but in general the poinwise closure of is not contained in , or even in .
Model theory translation
We fix an -formula , a complete -theory and a subset of the monster model of . We let . Let be the space of complete -types on , namely the Stone space of ultrafilters on Boolean algebra generated by formulas for . Each formula for defines a function , which takes to 1 if and to 0 if . Note that is compact and these functions are continuous, and as is fixed we can identify this set of functions with .222We should be more careful with this assertion; if the variables are just dummy variables that play no role, we can not recover from . This result is true for the space of full types, but not necessarily for just the -types. However, for the sake of simplicity we continue to write . So, is a subset of all bounded continuous functions on , denoted by . Just as we did above, one can define and .
To summarize, for an -formula and a subset of an -structure , we can assume that is a subset of where and has the topology of pointwise convergence as above. Moreover, every is continuous, i.e. .
The only additional thing we need to remark on is the following result (see [12, Corollary 2.10] and [16, Proposition 2.2]):
Fact 2.2** (Eberlein–Grothendieck Criterion).**
Let be a sequence in some model of and a formula. Then the following are equivalent:
(i) There is no any sequence such that holds iff .
(ii) For any sequence , when the limits on both sides exist.
(iii) Every function in the closure of is continuous.
History The equivalence (ii) (iii) in the general case, i.e. for real-valued functions on arbitrary compact spaces, is due to Grothendieck [5], which he says it is based on an idea of Eberlein. Pillay [15] proved the equivalence (i) (iii) and pointed out that these conditions are equivalent to definability of coheirs (see [16]). In [9], Iovino also provided a proof of Fact 2.2 for real-valued formulas.
2.1 A new characterization of
First, we recall some notions and facts. Let be formula and a natural number. We say that a formula is a --formula if it is of the forms \exists y\big{(}\bigwedge_{i\in E}\phi(x_{i},y)\wedge\bigwedge_{j\in F}\neg\phi(x_{j},y)\big{)} or \forall y\big{(}\bigvee_{i\in E}\phi(x_{i},y)\vee\bigvee_{j\in F}\neg\phi(x_{j},y)\big{)} where are disjoint subsets of . In this case, has free variables and a bounded variable . If is a model of a theory and , the --type of , denoted by , is the set of all --formulas such that .333Although these notions seems very restrictive and unnatural, they are very useful for proving the main theorem of this section, i.e., Theorem 2.6 below. Note that the notion --type is completely different from the notion -type we defined earlier.
Definition 2.3** ([18], Definition I.2.3).**
Let be a complete -theory, an -formula, a number and a sequence in some model. The sequence is a --indiscernible sequence (over the empty set) if for each , ,
[TABLE]
Fact 2.4**.**
Let be a complete -theory, an -formula, a model of , and a natural number.
(i) If is an infinite sequence in , there is an infinite subsequence which is a --indiscernible sequence.
(ii) If are two (infinite) linear ordered sets and is an infinite --indiscernible sequence in , there is a sequence (possibly in an elementary extension of ) which is a --indiscernible sequence and has the same --type as .
Proof.
(i) follows from (infinite) Ramsey’s theorem (see Theorem I.2.4 of [18]) and (ii) follows from the compactness theorem. ∎
Definition 2.5** ( for a theory).**
(i) Let be a complete -theory, the monster model of , and an -formula. We say that has the strict order theory (for the theory ) if there exists a sequence such that for all ,
[TABLE]
(ii) A complete theory has the strict order property if there is a formula which has the strict order property (for ).
* stands for the strict order property, and for not the strict order property.*
In Definition 2.12 below we give a localized version of . (See also Remark 2.13 below.)
As we will see shortly, the following localized version of Shelah’s theorem leads to a new characterization of for a theory. In the following theorem, we will follow the argument in Theorem 4.7, chapter 2 [18].
Theorem 2.6** (Localized Shelah’s theorem).**
Let be a complete -theory and an -formula. Suppose that there are infinite sequences (not necessarily indiscernible) , in some model, a natural number and a set such that
- (i)
for each , holds, where
[TABLE]
- (ii)
* holds if and only if .*
Then the theory has .
Before giving the proof let us remark:
Remark 2.7**.**
(i) Note that Theorem 2.6(i) identifies a weaker condition than such that implies , where and means that witness has the order property. We will see shortly, in fact, is equivalent to the existence of and such that holds. (See Proposition 2.10 below.)
(ii) We will establish a connection between this presentation of and a well-known subclass of Baire 1 functions. (See Remark 2.11 below.)
Proof of Theorem 2.6.
By Fact 2.4, we can assume that is a --indiscernible sequence. Now, we repeat the argument of Theorem 4.7, chapter 2 of [18]. By (i), there are the natural number and defined by if , and otherwise, such that is inconsistent. (Recall that for a formula , we use the notation to mean and to mean .) Starting with that formula, we change one by one instances of to . Finally, we arrive at a formula of the form . By (ii), the tuple satisfies that formula. Therefore, there is some , such that
[TABLE]
is inconsistent, but
[TABLE]
is consistent. Let us define . By Fact 2.4, we may increase the sequence to a --indiscernible sequence . Then for , the formula is consistent, but is inconsistent. Thus the formula has the strict order property. ∎
Note that the formula above has parameters. However it is clear that if the formula has , where are parameters, then so does the formula .
Now we want to establish a connection between and a class of functions. Recall that a real-valued function on a complete metric space is said to be of the first Baire class, or Baire 1, if it is the pointwise limit of a sequence of continuous functions. The following lemma provides a connection between and a proper subclass of Baire 1 functions, namely .
For easier reading, we note that the conditions (i), (ii) in Lemma 2.8 below are abstractions of the notion alternation number in model theory. Of course, they are not equivalent to the notion for a formula. (See the explanations after Proposition 2.10 below.) It seems that the direction (i) (iii) of Lemma 2.8 is new to model theorists.
Lemma 2.8**.**
Let be a sequence of -valued functions on a set . Then the following are equivalent:
(i) There are a natural number and a set such that for each ,
[TABLE]
(ii) There is a natural number such that for all .
Suppose moreover that is a compact metric space and ’s are continuous, then (ii) above (or equivalently (i)) implies (iii) below:
(iii) converges pointwise to a function which is .
Proof.
(i) (ii): Suppose that (i) holds. Note that (i) states that we have a special pattern that never exists; that is, . Suppose, for a contradiction, that there is an element such that . Therefore, there are such that for all . Let be in such that the value of is the same as the pattern above, i.e. iff . Let be in such that the value of is the same as the pattern above. We can choose similarly. Note that . This is the special pattern above, a contradiction. The other direction is even easier. Indeed, let , and . Then .
(ii) (iii): Clearly, converges pointwise to a function . (We can define for all .) Set and . (Recall that for a function , and .) Then and are both lower semi-continuous. (Note that and since the limit of an increasing sequence of continuous functions is lower semi-continuous (Fact 2.1), so is lower semi-continuous. Similarly for .) ∎
Remark 2.9**.**
(i) Note that Lemma 2.8(i) is an abstraction of the condition (i) of Theorem 2.6. Indeed, let where is a parameter in some model.
(ii) Let us do a model theoretic translation, we set and where . Clearly, is continuous and since is countable, so is a metric space. This means that additional assumptions of (iii) in Lemma 2.8 hold.
(iii) We can expect a converse to (ii) (iii) of the above lemma. Indeed, by Fact 2.1 above, if is a compact metric space and is the then there are a sequence of (bounded) continuous functions and a natural number such that converges pointwise to and for all .
(iv) Note that Lemma 2.8(ii) guarantees that the sequence converges pointwise, but there are Baire 1 functions which are not (see Remark 2.15(i) below).
The following gives a new characterization of (for a theory) and shows that the converse of Theorem 2.6 above is also true.
Proposition 2.10** (Characterization of ).**
Let be a complete -theory and the monster model of . Then the following are equivalent:
(i) is .
(ii) There are no formula and sequences and in , a natural number and a set such that two conditions (i) and (ii) in Theorem 2.6 hold, simultaneously.
(iii) There are no formula and indiscernible sequences and in , a natural number and a set such that two conditions (i) and (ii) in Theorem 2.6 hold, simultaneously.
(iv) For any formula and any sequence (not necessarily indiscernible) , if there is a natural number such that for any , , then there is no infinite sequence such that holds iff .
(v) For any formula and any indiscernible sequence , if there is a natural number such that for any , , then there is no infinite sequence such that holds iff .
Moreover, if is then is iff for any formula there is a natural number such that for any sequence (not necessarily indiscernible) , if for any , , then there is no infinite sequence such that holds iff .
Proof.
(i) (ii) is Theorem 2.6. (ii) (iii) is evident, and (iii) (ii) follows from Ramsey’s theorem and the compactness theorem. (i) (iv) follows from Theorem 2.6 and Lemma 2.8. (iv) (ii) follows from Lemma 2.8. (iv) (v) is evident.
(ii) (i): Suppose, in order to get a contradiction, that has for the theory . This means that there is an indiscernible sequence such that iff . So, there is some sequence such that holds iff , i.e., the condition (ii) in Theorem 2.6 holds. Let us define . So, for , does not hold. Let and and be as above. Then the condition (i) in Theorem 2.6 holds as well. This is a contradiction.
(v) (i): By Lemma 2.8 and an argument similar to the direction (ii) (i), the proof is completed. ∎
Recall that for a formula , an indiscernible sequence and a parameter , the alternation of on is bounded by a natural number , if there are at most increasing indices such that for all . A theory has if for any formula there is a natural number such that for any indiscernible sequence and any parameter , the alternation of on is bounded by . Note that in case, such numbers depend just on formulas.
Using this notion, Proposition 2.10(ii) above asserts that a theory is if for any formula and any sequence , if there is a natural number such that for any the alternation of on is bounded by , then there is no infinite sequence such that holds iff . Note that the sequences are not necessarily indiscernible and such natural numbers depend on both the formulas and the sequences; not just on formulas. Thus, Lemma 2.8 above presents a ‘localized and wider’ notion of alternation number.
Remark 2.11**.**
Recall that, for a set of an -structure and an -formula , one can consider the continuous function defined by if and [math] if . (Here is the same formula as , but we have exchanged the role of variables and parameters, and is the space of complete -types over .) If is countable, is a compact Polish space. Recall that, using a crucial result due to Eberlein and Grothendieck (Fact 2.2), for a sequence (not necessarily indiscernible) there is no infinite sequence such that if and only if every function in the pointwise closure of is continuous.
By Lemma 2.8 and Proposition 2.10, corresponds to the class of functions which are difference of bounded semi-continuous functions () on the type spaces. For a formula we set there exist and natural number such that converges pointwise to and for all . Similarly, we set there exists such that converges pointwise to on and is continuous. Using these definitions and the facts above, a complete theory has if and only if there is a formula such that . (See Fact 2.2 above.) Notice that the above characterization of is of the form “if … then …”. Indeed, by Fact 2.2 and Proposition 2.10, a theory is if and only if
“for any formula and any (infinite) sequence , if for some natural number , for all , then converges to a continuous function.”
In [13], the notions and/or relative to a set or model were studied. We are now ready to introduce the analogous notion of in a model or a set.
Definition 2.12** ( in a model).**
Let be a complete -theory, an -formula, and a model of .
(i) A set of -tuples from is said to be a -witness for if the following conditions (1),(2) hold, simultaneously.
- (1)
there are a natural number and a set such that for each , where
[TABLE]
- (2)
for each natural number and ,
[TABLE]
(ii) Let be a set of -tuples from . Then has -witness in if there is a countably infinite sequence of elements of which is a -witness for .
(iii) Let be a set of -tuples in . We say that has -witness in if it does not have -witness in .
(iv) has -witness in if it has -witness in the set of -tuples from .**
Remark 2.13**.**
*(i) If has -witness in , then a Boolean combination of instances of has for the theory . Of course, if has for , then it has -witness in some models of .
(ii) has for the theory iff it has -witness in every model of iff it has -witness in some model of in which all types over the empty set in countably many variables are realised.
(iii) If has -witness in some model of , then there are arbitrarily long -witness for (of course in different models).*
We will shortly give examples that indicate why this notion is useful (see Examples 2.17 and 2.18 below).
2.2 Remarks on
We already knew that a theory is iff for any formula and any sequence in the monster model there is a subsequence such that for any element (in the monster model) there is an eventual truth value of . In the language of function theory, the subsequence converges to a (Baire 1) function . In the following we will see that the criterion presented in Lemma 2.8 makes it possible to say more: the limit should be .
Proposition 2.14** (Characterization of ).**
Let be a complete -theory, an -formula and the monster model of . Then the following are equivalent:
(i) has for .
(ii) For any sequence (not necessarily indiscernible) , there is a subsequence such that for any there is an eventual truth value of .
(iii) For any sequence (not necessarily indiscernible) , there are a subsequence and a natural number such that for each .
(iv) For any sequence (not necessarily indiscernible) , there is a subsequence such that the sequence converges to a function which is .
Proof.
The equivalence (i) (ii) is folklore. The direction (iii) (iv) follows from Lemma 2.8. The direction (iv) (ii) is evident.
(i) (iii): Suppose, for a contradiction, that there is a sequence such that (iii) fails. Let be an arbitrary natural number and be an arbitrary formula. By Fact 2.4, we can assume that is --indiscernible. Then, by Lemma 2.8, there is a (finite) subsequence and such that holds iff is even. As and are arbitrary, the following set is a type
[TABLE]
By the compactness theorem, there are an indiscernible sequence and an element such that holds if and only if is even, a contradiction. ∎
Proposition 2.14(iv) above and the following remark show that the approach of the present paper would be useful.
Remark 2.15**.**
(i) Recall that for a compact metric space and a subset , then the indicator function is Baire 1 if and only if is both and . (See Definition 24.1 and Theorem 24.10 of [10]. In this case, notice that the sets and are both ; that is, they are countable intersections of open sets.) Notice that the class of functions which are difference of bounded semi-continuous functions is a proper subclass of Baire 1 functions. Furthermore, every -valued function is the if and only if there exist disjoint differences of closed sets such that (see [2, Proposition 2.2]). This result makes clear why is a proper subclass of .
(ii) As Pierre Simon pointed out to us, it is known that for every sequence in the monster model of a theory one can find a subsequence that their types converges to a finitely satisfiable type and it is known that invariant types in theories have definitions which are finite Boolean combinations of closed sets (see **[7, Proposition 2.6]**). In fact, by the above remark, that is equivalent to Proposition 2.14(iv).
The following statement clearly indicates why some people– not all them– say that the independence property and the strict order property are orthogonal. That is, Shelah’s theorem is of the form “ stability.”
Corollary 2.16** (Shelah’s Theorem, revisited).**
Let be a complete -theory. Then the following are equivalent:
- (1)
* is stable.*
- (2)
The following two properties hold:
- (i)
(): For any formula and any sequence (not necessarily indiscernible) , there are a subsequence and a natural number such that the sequence converges to a function and for any in the monster model, , and
- (ii)
(): For any formula and any sequence (not necessarily indiscernible) , if the sequence converges to a function and there is some natural number such that for any in the monster model, , then is continuous.
Proof.
By Proposition 2.14, is equivalent to (i). By Proposition 2.10 and Fact 2.2 (or just Remark 2.11), is equivalent to (ii). Now, by the usual form of Shelah’s theorem the proof is completed. ∎
We can give a proof of Shelah’s theorem above using a well-known theorem of functional analysis, namely the Eberlein–Šmulian Theorem (Fact 3.1 below). Also, one can provide a local version of Shelah’s theorem: A formula is stable for the theory iff the conditions (i),(ii) above hold for . We will compare shortly the above observations with the Eberlein–Šmulian Theorem.
2.3 Examples
To clarify the results, we build some examples. First, we give a model and a formula such that has and in , and has . This example is not interesting in itself but it is a step towards an example with interesting properties.
Example 2.17**.**
Let and . We define a binary relation on as follows:
(1) holds iff ,
(2) For each , we define:
(2–k) for any , holds iff is even, and for any or , holds.
(3) For any other , does not hold.
(Note that (1) says that has the order in . It is easy to verify that the formula is in .)
Moreover, has . Indeed, notice that for all odd numbers .
In the following, we give a model and a formula such that has and in , and moreover has and has for .
Example 2.18**.**
Let and for any infinite subsequence of , let . We define a binary relation on as follows:
(1) holds iff ,
(2) For each infinite subset of and each , the condition (2–k) in the above example holds for and .
(3) For any other , does not hold.
Now, it is easy to verify that the formula is in but it has in . Also, (2) guarantees that the complete theory of this structure has (see Proposition 2.14(iii)). But, by Lemma 2.8, one can show that its theory does not have . In fact, the type of (for any formula) is not consistent with . Indeed, notice that for any natural number , there is some natural number such that there is no any subsequence of such that for each , , where is the formula in Theorem 2.6(i) with (or any other formula).
This example confirms that there is a formula for a theory and a sequence such that the sequence pointwise converges to a non-continuous function. This statement contrasts with the theory of Random Graph (see Example 3.5 below).
3 Dividing lines in model theory and Baire class 1 functions
This part is mainly expository but is (in our view) very illuminating. We point out some parallels between model theoretic dividing lines for first order theories and subclasses of Baire 1 functions, and propose a new thesis. For this, we recall some notions and the following well-known theorem of functional analysis.
If is a topological space then denotes the space of bounded continuous functions on . A subset is relatively weakly (pointwise) compact if it has compact closure in the weak (pointwise) topology on . Notice that for a compact space , a subset of is weakly compact if and only if it is norm-bounded and pointwise compact (cf. [3, Theorem 462E(ii)]).
Fact 3.1** (Eberlein–Šmulian Theorem).**
Let be a compact Hausdorff space and a norm-bounded subset of . Then for the topology of pointwise convergence the following are equivalent:
- (1)
* is relatively compact in .*
- (2)
The following two properties hold:
- (i)
() is relatively sequentially compact in , and
- (ii)
() has the sequential completeness property.
Explanation. See [22] for a proof of the Eberlein–Šmulian theorem. Recall that, is relatively sequentially compact in if every sequence of has a convergent subsequence in , and has the sequential completeness property if the limit of every convergent sequence of is continuous. (2) is precisely the condition in the main theorem of [22]. Indeed, each sequence contains a subsequence converging to an element of if and only if (i) each sequence has a convergent subsequence in , and (ii) the limit of every convergent sequence is continuous. Also, (1) is the condition in [22].
Remark 3.2**.**
Recall from [17] (or Proposition 2.14 above) that implies 2.(i) in the Eberlein–Šmulian Theorem. By Proposition 4.6 of [12] (or Remark 3.4 below), if for every countable set of the monster model and every formula the condition 2.(ii) holds, then the theory is . Notice that, by Proposition 2.10 (or Remark 2.11) and Proposition 2.14, the converses do not hold. Recall from [12] that 2.(ii) is called the weak sequential completeness property (short ), and 2.(i) is called the relative sequential compactness (short ). Notice that relative compactness of corresponds to stability, by a criterion due to Eberlein and Grothendieck (Fact 2.2). Now, we can complete the diagram presented in [12]:
Shelah
Stable
* Eberlein–Grothendieck *
Eberlein–Šmulian
Weak Compactness RSC
We will shortly prove that is equivalent to under compactness, and and are not equivalent. We make a point that together with many conditions correspond to stability, so of course there is no reason to expect that all notions agree.
A thesis
In the Eberlein–Šmulian Theorem, notice that (ii) is the weakest topological property such that (i) and (ii) imply relative compactness. This leads to the following definition.
Definition 3.3**.**
Let be a complete -theory. We say that has
(i) the relative sequential compactness property (short ) if
* for any formula and any infinite sequence , there is a subsequence such that for any parameter there is an eventual truth value of .*
(ii) the sequential completeness property (short ) if
* for any formula and any infinite sequence , if for every in the monster model there is an eventual truth value of the sequence , then there is no infinite sequence such that holds iff .*
Remark 3.4**.**
(i) Every stable theory has the .
(ii) A theory is if it has the .
(iii) A theory is if and only if it has .
(iv) A theory is stable if and only if it is and has the .
Proof.
(i): Immedaite.
(ii): Suppose that there are sequences and formula such that the conditions of Theorem 2.6 hold. (Equivalently, the theory is .) Then converges to a function which is not continuous. (See Fact 2.2.) So, the fails.
(iii): This is the equivalence (i) (ii) of Proposition 2.14. (Note that in function theory the condition (iv) of Proposition 2.14 (equivalently ) strictly implies , but their equivalence in model theory is due to compactness theorem.)
(iv): By (ii) above, implies . So, and imply stability, by Shelah’s theorem. (One can give a proof using the Eberlein–Šmulian Theorem and Fact 2.2.) The converse is evident. ∎
Example 3.5**.**
(i) The theory of Random Graph has the . Indeed, for any formula , either is stable, or there is no infinite sequence such that for any in the monster model there is an eventual truth value of the sequence . Recall that the theory of Random Graph has quantifier elimination. Therefore, one can easily check that atomic formulas are either stable, or satisfy the second alternative. By quantifier elimination, this holds for every formula.
(ii) The theory in Example 2.18 is but it does not have the .
Note that in Lemma 2.8 we did not give a converse to (ii) (iii). This suggests the following definition: A complete theory has the if and only if for any formula and any infinite sequence , if the sequence converges to a function which is , then there is no infinite sequence such that holds iff . Clearly, if a theory is then it is . Now we want to continue this process to create a hierarchy of theories. Let be some subclass of Baire 1 functions, containing . We say that a theory is (or has) if
for any formula and any infinite sequence , if the sequence converges to a function which is , then there is no infinite sequence such that holds iff .
Now we can give other Shelah-like theorems.
Proposition 3.6**.**
Let be complete theory and as above. Then is stable if and only if it is both and .
Proof.
The proof is similar to the argument of Remark 3.4(iv). (Note that implies and so .) ∎
Notice that the () asserts that for any formula , every Baire 1 () function in the closure of ’s is continuous. Set there exists such that converges pointwise to , there exists such that converges pointwise to and is and there exists such that converges uniformly to as Remark 2.11 above. (Notice the difference between and in Remark 2.11.) By these notations, we say that has Baire 1 property (equivalently the ) iff for any formula , . Similarly, we say that is (or has) iff for any formula , . We can do this process for each subclass of Baire 1 functions in the sense of [11]; a theory is (or has) iff for any formula , .
Notation: In the rest of this part, the symbol (generated by frak{P}) denotes an arbitrary model theoretic property such that implies (for example, or simplicity), and denotes an arbitrary subclass of Baire 1 functions on compact Polish spaces, containing . For a theory and a formula we set there exist such that converges pointwise to and , and as Remark 2.11 above. For a model theoretic property , if there is a subclass of Baire 1 functions such that any theory is if and only if for any formula , , then we write . Similarly, for a subclass , if there is a model theoretic property such that any theory has if and only if for any formula , , then we write .
Recall that implies , and stability (or ) corresponds to the class of continuous functions (short Continuous). With these notations, , and , . Now, one can suggest the following diagram:
[TABLE]
[TABLE]
There are so many questions: for a model theoretic property , what is the right class ? And converse, for a subclass , what is the right model theoretic property ?
Let us discuss possible answers. There are four possibilities. First: there are correspondences between some model theoretic classes and subclasses of Baire 1 functions. (See Question 3.7 below.) Second: some model theoretic dividing lines imply some subclasses of Baire 1 functions, or vice versa. Third: some model theoretic classes are divided by some subclasses of Baire 1 functions, or vice versa. Fourth: there are connections between subclasses of Baire 1 functions and classes in Keisler’s order. Everything that is the case is good.
Question 3.7**.**
Are there any interesting relations between subclasses of Baire 1 functions and notions like ?
Finally, we point out that the notion says that if any sequence of the form converges with a ‘special rate’, then the limit is continuous. One can expect other properties also have the same nature. If that is the case, the special rate for is stronger than the special rate for . The above points strongly inspire us to believe that model theoretic classification is correlated with a classification of Baire class 1 functions similar to the work of Kechris and Louveau in [11].
Acknowledgements. I am very much indebted to Professor John T. Baldwin for his kindness and his helpful comments. I want to thank Pierre Simon for his interest in reading a preliminary version of this article and for his comments. I thank the anonymous referee for his/her detailed suggestions and corrections; they helped to improve significantly the exposition of this paper.
I would like to thank the Institute for Basic Sciences (IPM), Tehran, Iran. Research partially supported by IPM grant no 99030117.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] I. Ben-Yaacov, A. Usvyatsov, Continuous first order logic and local stability, Transactions of the American Mathematical Society 362 (2010), no. 10, 5213-5259.
- 2[2] F. Chaatit, V. Mascioni and H. Rosenthal, On functions of finite Baire index, J. Funct. Anal. 142 (1996), no. 2, 277–295
- 3[3] D. H. Fremlin, Measure Theory , vol.4, (Topological Measure Spaces, Torres Fremlin, Colchester, 2006).
- 4[4] R. Grossberg, O. Lessmann, Local order property in nonelementary classes, Arch. Math. Logic (2000) 39: 439-457
- 5[5] A. Grothendieck, Critères de compacité dans les espaces fonctionnels généraux, American Journal of Mathematics 74 , 168-186, (1952).
- 6[6] F. Hausdorff, Set Theory , Chelsea, New York, 1962.
- 7[7] E. Hrushovski, A. Pillay, On N I P 𝑁 𝐼 𝑃 NIP and invariant measures, Journal of the European Mathematical Society, 13 (2011), 1005-1061.
- 8[8] T. Ibarlucía, The dynamical hierachy for Roelcke precompact Polish groups, Israel J. of Math., vol. 215 (2016), no. 2, pp 965-1009.
