Definable compactness in o-minimal structures
Abstract
We characterize the notion of definable compactness for topological spaces definable in o-minimal structures, answering questions in [PS99] and [Joh18]. Specifically, we prove the equivalence of various definitions of definable compactness in the literature, including those in terms of definable curves, definable types and definable downward directed families of closed sets.
Mathematics Subject Classification 2020. 03C64 (Primary); 54A05, 54D30 (Secondary).
Key words. o-minimality, types, definable compactness, definable topological spaces.
1 Introduction
In the study of first-order topological theories various definable notions of topological compactness have been helpful tools in tame settings by isolating classes of topological objects with desirable properties. The first of such notions was introduced in o-minimal theories for definable manifold spaces by Peterzil and Steinhorn [PS99], and corresponds to the property that every definable curve converges (here curve-compactness). This property was crucial in formulating Pillay’s conjecture about o-minimal definably compact groups and their relationship with compact Lie groups [Pil04, Conjecture 1.1]. The research that led to the solution of this conjecture provided a deeper understanding of the relationship between neostability and tame topology, in particular results in o-minimal forking were used to reach another reasonable notion of o-minimal definable compactness [PP07]: for every definable family of closed sets with the finite intersection property there exists a finite set that intersects each set in the family (here transversal-compactness). On the other hand, Thomas [Tho12] and Walsberg [Wal15] generalized and applied curve-compactness to study topologies arising from o-minimal definable norms and metrics respectively. In collaboration with the author [AGTW21], they also explored a third notion of definable compactness within o-minimality: every downward directed definable family of nonempty closed sets has nonempty intersection (here filter-compactness). This definition has been independently studied by Johnson [Joh18] in the context of o-minimal quotient spaces, and in a general model-theoretic setting by Fornasiero [For]. The o-minimal exploration of definable compactness (through the various notions mentioned above) has yielded in particular that, in many cases, definably compact spaces are definably homeomorphic to a set with the canonical o-minimal “Euclidean” topology (see Chapter 7 in [AG21a]). Hrushovski and Loeser explored the tame topology of valued fields [HL16], including the introduction of yet another notion of definable compactness: every definable type has a limit (here type-compactness), where a limit is a point in every closed set in the type. Recently, some of these notions have also been approached in the p-adic setting by Johnson and the author [AGJ22], and in the local o-minimal setting by Fujita [Fuj23].
In the present paper we prove the equivalence of all the above notions of definable compactness in the setting of Hausdorff definable topological spaces (Definition 5.1) in o-minimal structures. We also show that, if we drop the Hausdorffness assumption, curve-compactness is strictly weaker than all the other properties. Our main result is the following (see Sections 2.2 and 5.1 for definitions).
Theorem A.
Fix an o-minimal structure . Let be a definable topological space in . The following are equivalent.
-
(1)
Every downward directed definable family of nonempty -closed sets has nonempty intersection (filter-compactness).
-
(2)
Every definable type has a limit, i.e. there is a point in the intersection of every -closed set in (type-compactness).
-
(3)
Every definable family of -closed sets that extends to a definable type in has nonempty intersection.
-
(4)
Every consistent definable family of -closed sets admits a finite transversal, i.e. there exists a finite set that intersects every set in the family (transversal-compactness).
-
(5)
Every definable family of -closed sets with the -property, where , has a finite transversal.
-
(6)
Every definable family of -closed sets with the -property, where and is greater than the VC-codensity of , has a finite transversal.
Moreover all the above imply and, if is Hausdorff or has definable choice, are equivalent to:
-
(7)
Every definable curve in is -completable (curve-compactness).
Theorem A and Remark 5.17 provide a positive answer to [Joh18, Question 4.14], where Johnson asks whether curve-compactness and filter-compactness are equivalent for o-minimal definable manifold spaces.
In light of Theorem A we may present the following definition.
Definition 1.1.
We also prove that, if is an o-minimal expansion of the real line , then every definable topological space in is definably compact if and only if it is compact in the classical sense (Corollary 5.19), which provides a positive answer (Remark 5.20) to part of [PS99, Question 2.5]. Furthermore, we show that definable compactness is definable uniformly in families (Proposition 5.22). Additionally, throughout the paper we comment on other reasonable notions of definable compactness, including definitions in terms of externally definable sets (Remark 5.9), chains (paragraph above Lemma 5.14) and nets (Remark 5.18).
We prove Theorem A using o-minimal combinatorial and geometrical facts which are either known to hold in more general settings or can be conjectured to do so. These facts include known characterizations of o-minimal non-forking formulas, the Alon-Kleitman-Matoušek -theorem for VC classes, and two geometrical facts of independent interest about o-minimal types (Propositions 4.1 and 4.3), the first of which can be understood as a strong form of distal cell decomposition. Hence this paper can be seen as a road map to characterizing definable compactness in various NIP settings.
The structure of the paper is as follows. In Section 2 we include preliminaries. In Section 3 we gather the necessary literature results on Vapnik-Chervonenkis theory and on forking, extracting some easy corollaries. In Section 4 we prove our two main results about o-minimal types. In Section 5 we introduce our topological framework and prove Theorem A through a series of propositions, as well our other results on definable compactness.
This paper has been largely extracted from [AG21b], which includes independent proofs within o-minimality of Fact 3.6 and of a version of Corollary 3.7 where is substituted by , thus avoiding largely the use of forking or VC literature.
Acknowledgements
The author thanks Sergei Starchenko for the idea of a characterization of definable compactness in terms of VC theory and finite transversals, which motivated much of the work in this paper. He also thanks Margaret Thomas, Pantelis Eleftheriou, Matthias Aschenbrenner, and the anonymous referee, for extensive feedback on various versions of the paper. In particular, he thanks Professor Aschenbrenner for suggesting the terminology “-consistent” and “-inconsistent”. The author also thanks Antongiulio Fornasiero for sharing his unpublished notes on definable compactness [For]. Finally, the author is deeply indebted to Will Johnson for some very helpful conversations on the contents of Section 4, which resulted in the current proof to Proposition 4.3, and in Johnson’s authoring of [AG21b, Appendix A], a counterexample to a parameter version of Proposition 4.3.
During the research into the contents of this paper the author was supported by the Institute Henri Poincare (during the 2018 Program on Model Theory, Combinatorics and Valued Fields), the Canada Natural Sciences and Engineering Research Council (NSERC) Discovery Grant RGPIN-06555-2018, the Graduate School and Department of Mathematics at Purdue University, the Fields Institute for Research in Mathematical Sciences (during the 2021 Thematic Program on Trends in Pure and Applied Model Theory), and the Engineering and Physical Sciences Research Council (EPSRC) Grant EP/V003291/1.
2 Preliminaries
2.1 Conventions
We fix a language and a first-order -structure expanding a dense linear order without endpoints. For a set of parameters we denote by the expansion of by symbols for elements in . Throughout unless otherwise specified “definable” means “-definable in ”. All variables and parameters are -tuples for some . We denote the length of a variable or parameter by . We denote ordered pairs of tuples by . We use , , and to denote natural numbers.
Unless stated otherwise, any formula we consider is in . For any formula and set , let . For simplicity we write to mean . A (uniformly) definable family of sets is a family of the form for some formulas and , where we may always assume that (i.e. a formula without parameters). For any two formulas and , we write to mean . For sets of formulas and on free variables , we write to mean that, for every formula , there is a finite subset such that .
For a given , let denote the projection onto the first coordinates, where will often be omitted and clear from context. For a family of subsets of let .
Recall that is o-minimal if every definable subset of is a finite union of points and intervals with endpoints in . For background in o-minimality we direct the reader to [vdD98]. We will use, in particular, the existence of uniform cell decompositions [vdD98, Chapter 3, Proposition 3.5]. We use the following notation related to o-minimal cells: given two partial functions , with domains and respectively, let (we relax thus the classical notation throughout by allowing that and have different domains). Whenever is o-minimal, we refer jointly to the order topology on and induced product topology on as the Euclidean topology. Given a definable set , we denote its closure in the Euclidean topology by , and its frontier by . We also denote the o-minimal dimension of by .
2.2 Intersecting families of sets and refinements
We say that a family of sets is -consistent if every subfamily of cardinality at most has nonempty intersection. A family is consistent if it is -consistent for every . We say that is -inconsistent if every subfamily of cardinality has empty intersection.
A family of sets has the -property, for cardinals , if the sets in are nonempty and, for every distinct sets in , there exists among them with nonempty intersection. Note that does not have the -property if and only if it either contains the empty set or there exists a subfamily of of size that is -inconsistent.
A family of sets is downward directed if, for every , there exists such that . Equivalently if for every finite there exists with .
Given a family of sets and a set let . Observe that, if is downward directed, then, for every set , it holds that is downward directed too.
Given two families of sets and , we say that is a refinement of , or that refines if, for every , there exists with . Observe that, if is a downward directed refinement of , then, for every finite subfamily , there exists some with .
Given a family of sets and a set we say that is a transversal of if it intersects every set in (i.e. ). In this paper we are interested in the property that a definable family of sets has a finite transversal, as a weakening of the property of having nonempty intersection (i.e. having a transversal of size one).
The following lemma will be used throughout the paper. We leave the easy proof to the reader.
Lemma 2.1.
Let be a downward directed family of sets and be a finite covering of a set . If for every , then there exists some such that for every . In particular, if has a finite transversal, then .
2.3 Type preliminaries
All the types that we consider are consistent and, unless otherwise specified, complete over . We denote the set of these types by . We denote by the set of -types in . We resort often and without warning to the common model-theoretic convention of identifying types with the family of sets defined by formulas in it. For a definable set , we denote by the family of all types with (namely types that concentrate on ). We will investigate partial types which are downward directed111In the literature this property among types is also denoted -compressible., and the refinement relation between partial types.
Recall that a type is definable if, for every formula , there is another formula such that . It is definable over if these formulas can be chosen in . Note that, if a type is definable, then its projection is definable too.
Given a formula let and . Given a type and a formula , recall that the restriction of to is the subtype . We denote by the restriction of to “positive” instances of , i.e. .
3 O-minimal VC theory and forking
3.1 VC theory
The following is an ad hoc presentation of the notion of VC-codensity and related results, with applications in Sections 3.2 and 5. For a more standard treatment of Vapnik-Chervonenkis (VC) theory in a model-theoretic context see [ADH+16].
A pair , where is a set and is a family of subsets of , is called a set system. For a subfamily , let denote the collection of Boolean atoms of , by which we mean the family of all maximal nonempty intersections of sets in . The dual shatter function of is the function given by
The VC-codensity of , denoted by , is the infimum over all real numbers such that (that is, is bounded at infinity). Observe that is independent of the ambient set , and so throughout we omit it from our terminology. A theory is NIP (Not the Independence Property) if every definable family of sets in every model of has finite VC-codensity. Every o-minimal theory is NIP [vdD98, Chapter 5].
For convenience we state the Alon-Kleitman-Matoušek -theorem in terms of VC-codensity. For a finer statement see [Mat04, Theorem 4].
Fact 3.1 (Alon-Kleitman-Matoušek -theorem [Mat04]).
Let be natural numbers and let be a set system such that . Then there is such that, for every finite subfamily , if has the -property, then it has a transversal of size at most .
The following easy corollary will be used in the proof of Corollary 3.7.
Corollary 3.2.
Let be natural numbers and let be a set system such that . If has the -property, then, for every , there exists some natural number such that has the -property. In particular, has the -property for every .
Proof.
The following fact is a reformulation of the main result for weakly o-minimal structures (a class which contains o-minimal structures) in [ADH+16] by Aschenbrenner, Dolich, Haskell, Macpherson and Starchenko. It was previously proved for o-minimal structures by Wilkie (unpublished) and Johnson-Laskowski [JL10], and for o-minimal expansions of the field of reals by Karpinski-Macintyre [KM00].
Fact 3.3 ([ADH+16], Theorem 6.1).
Let be an o-minimal structure and let be a definable family of subsets of . Then .
We will apply Fact 3.3 in subsequent sections through the slight improvement given by the next corollary.
Corollary 3.4.
Let be an o-minimal structure and let be a definable family of sets with . Then .
The proof of Corollary 3.4 follows immediately from the following lemma and o-minimal cell decomposition, the latter implying that, if is a definable set in an o-minimal structure with , then admits a finite partition into definable subsets, each of which is in definable bijection with a subset of .
Lemma 3.5.
Let be a set system and let be sets such that . Then
Proof.
First note that, for every and finite subfamily , , meaning that for every , and consequently .
For the opposite inequality, let be a finite subfamily of . Observe that
Consequently
for every . It follows that, for any real number , if for all , then . Hence there must exist some such that . ∎
Since throughout this paper and are employed as terminology for types, in subsequent sections we address the -property in terms of and , e.g. the -property.
3.2 Forking, dividing and definable types
In this section we recall some facts about non-forking formulas in o-minimal theories, and derive some consequences which we will need in Section 5. This is the subject of ongoing research among NIP theories [Sim15]. Throughout we fix a -saturated elementary extension of .
Recall that a formula is said to -divide over , for some , if there exists a sequence of elements in , with for every , such that is -inconsistent. Equivalently, is said to -divide over if the family does not have the -property. A formula divides if it -divides for some . Conversely, a formula does not divide over if and only if the family has the -property for every . Hence, not dividing is an intersection property.
A formula forks over if it implies a finite disjunction of formulas that divide each over . In theories (a class which includes NIP and simple theories) forking and dividing over a model are equivalent notions [CK12, Theorem ].
The next equivalence was proved first for o-minimal expansions of ordered fields222Dolich specifically works with “nice” o-minimal theories, a certain class of theories which includes o-minimal expansions of ordered fields. by Dolich [Dol04] (where he considers forking over small sets and not just models) and for unpackable VC-minimal theories, a class which includes o-minimal theories, by Cotter and Starchenko [CS12]. The best generalization up to date is due to Simon and Starchenko [SS14], and applies to a large class of dp-minimal theories (for details and precise definitions of unpackable VC-minimal and dp-minimal theory see [CS12] and [SS14] respectively). We state the result for o-minimal theories.
Fact 3.6.
Let be an o-minimal -theory with monster model . Let and . The following are equivalent.
-
(i)
does not fork (equivalently, by [CK12], does not divide) over .
-
(ii)
extends to an -definable type in .
Corollary 3.7.
Let be an o-minimal structure and be a definable family of nonempty subsets of . If there exist natural numbers such that has the -property, then there exists a finite covering of by definable subfamilies such that, for every , the family extends to a definable type in .
Proof.
Let and be formulas such that . If does not admit a covering as described in the corollary then, by model-theoretic compactness, there exists some such that does not extend to an -definable type in . On the other hand, by Corollary 3.2, the family has the -property for every , and consequently the formula does not divide over . So, by Fact 3.6, extends to an -definable type in , contradiction. ∎
Remark 3.8.
Remark 3.9.
There is a close relation between -theorems and so-called Fractional Helly theorems (see [Mat04]), both of which branched from the classical Helly theorem. In its infinite version, this classical theorem states that every family of closed and bounded convex subsets of that is -consistent has nonempty intersection. Aschenbrenner and Fischer proved [AF11, Theorem B] a definable version of Helly’s Theorem (i.e. for definable families of closed and bounded convex sets) in definably complete expansions of real closed fields.
Our Theorem A and the arguments in [AF11, Section ] allow an obvious generalization of the o-minimal part of Aschenbrenner’s and Fischer’s definable Helly Theorem, by asking that the sets be definably compact and closed in some (any) definable topology, instead of closed and bounded in the Euclidean sense. Perhaps more interestingly, by using Corollary 3.7 to adapt the second proof of Theorem B in [AF11] (the one right below Theorem 3.7), one may show that, in an o-minimal expansion of an ordered field, every definable family of convex subsets of that is -consistent extends to a definable type in .
4 O-minimal types
Throughout this section we assume that our structure is o-minimal. Our aim is to investigate the relationship between definable types and definable downward directed families of sets, in order to apply the results in Section 5. Our two main results, Propositions 4.1 and 4.3, are of independent interest.
Proposition 4.1 below can be seen as a strong non-parameter form of distal cell decomposition within o-minimality (see Theorem 21(2) in [CS15]). It implies that every definable family of sets that extends to a definable type admits a refinement given by a definable downward directed family.
Proposition 4.1.
Let be a type and be a formula. There exists another formula such that is downward directed and
In particular, for every finite subtype , there exists such that and
To prove the above proposition we will use the following easy lemma, whose proof we leave to the reader.
Lemma 4.2.
Let be a type and be finitely many partial subtypes of . Suppose that, for every , there exists a formula such that is downward directed and . Then the conjunction
satisfies that is downward directed and
We now present the proof of the proposition.
Proof of Proposition 4.1.
We proceed by induction on . We may assume throughout that is not realized, since otherwise it suffices to have be the formula where .
Case .
By o-minimality it suffices to have , with , be one of the following three formulas:
Case .
Throughout let , where . Recall that denotes the projection of the type to the first coordinates, i.e. is the family of all formulas such that is in .
Suppose that there exists a definable partial function whose graph is contained in . By extending if necessary to a constant function outside its domain we may assume that the domain of is in fact . We may apply the induction hypothesis to the type and formula
and obtain a formula as described in the proposition. This allows us to construct our desired formula as follows:
We show that has the desired properties. Observe that, since the graph of is contained in , for every and , the formula belongs in if and only if belongs in . The analogous holds for and . In particular, we may define . Since, by induction hypothesis, the family of formulas is downward directed, then the same clearly holds for . Moreover, for any formula of the form in , where and , there exists such that , and so and . Hence .
Hence onwards we assume that there does not exists a definable partial function whose graph is contained in .
In the next paragraphs we reduce the remaining of the proof to the case where, for every , if the formula is in , then it defines a set of the form for some partial function .
By o-minimal uniform cell decomposition [vdD98, Chapter 3, Proposition 3.5], there exist finitely many formulas such that, for every , the family is an o-minimal cell decomposition of compatible with . Observe that
By Lemma 4.2, it suffices to pass to an arbitrary and prove the proposition for in place of . Hence onwards let us assume that, for every , the formula defines a cell and, moreover, if , then, by assumption on , this cell is of the form , for and partial functions with the same domain and with . Additionally, to prove the proposition it suffices to find such that is downward directed and .
Recall the notation with . Let . Let () denote the formula , and similarly let be the formula . That is, for every , the formulas and define the sets and respectively. In particular, when , the formula is equivalent to the conjunction . So . By Lemma 4.2, to prove the proposition it suffices to find formulas and such that, for every , the restriction is downward directed and . We prove this for , being the remaining case analogous. For simplicity of notation we also assume that is equivalent to .
Consider the formula
For every note that it holds that
(1) |
In particular, if and are in , then defines the set of all such that .
Recall notation for the projection of to the first coordinates. By induction hypothesis on the formula and the type , there exists a formula such that is downward directed and .
Finally, let and
Clearly by construction . We show that that is downward directed.
Let . Note that belongs in if and only of and . Let us fix and . Recall that and . Consider the formula , which defines the intersection of the domains of and . Clearly . Observe that the sets and cover , and so at least one of them belongs in . Without loss of generality we assume that .
Let be such that . By Equation (1) we have that
By downward directedness let be such that
We conclude that
or equivalently
So is downward directed. ∎
It seems likely that Proposition 4.1 is also true in weakly o-minimal structures. As far as the author knows, it is open among distal dp-minimal structures.
The following proposition shows that every definable downward directed family of nonempty sets extends to a definable type , and furthermore that can be chosen so that, for some formula , the restriction is a basis (in the sense of filter basis) of cells for . We present a shorter proof than the one in [AG21b, Lemma 2.7], applying ideas communicated to the author by Will Johnson.
Proposition 4.3.
Let be a formula and be such that the family is consistent and downward directed. Then there exists a type with , and a formula such that defines a family of cells, is downward directed, and . Furthermore, if is definable, then can be chosen definable too.
In particular, for every definable downward directed family of nonempty sets , there exists a definable downward directed family of cells which refines and furthermore generates a definable type in .
Proof.
We devote most of the prove to show the existence of and as described in the proposition except for the condition that defines a family of cells. In the next two paragraphs we describe how, once we have these, by passing if necessary to a formula in a cell decomposition of we may assume that defines a family of cells, completing the proof.
Applying uniform cell decomposition [vdD98, Chapter 3, Proposition 3.5] to the formula , let , for , denote formulas such that, for every , the sets , for , are a cell partition of . We claim that there exists some such that the family is downward directed and (hence ). To see this let and, for every , let . We show that there exists such that, for every , there exists some with (i.e. refines ); hence and, using the facts that and is downward directed, it is also easy to derive that is downward directed.
Towards a contradiction suppose that, for every , there exists some such that for every . By downward directedness of , let be such that . It follows that for every and . However this contradicts the facts that and , which imply that there exists some with (i.e. ) and .
We now begin the prove of the existence of a type extending and a formula satisfying that is downward directed and (i.e. is a basis for ). We prove the case where is definable. In the general case the same proof applies by considering throughout, instead of definable families of sets, subfamilies of fibers of definable sets in general. To make the presentation more succinct, we work explicitly with set notation rather than formulas.
We introduce some useful terminology. For a definable family of nonempty sets , let denote the smallest such that, for every set , there exists with and . Let denote the smallest such that, for every set , there exists with such that has exactly definably connected components.
Let . Recall that a family of sets is a refinement of if, for every , there exists with . Let denote the collection of all definable downward directed refinements of which do not contain the empty set. Throughout we fix and . We also fix with and . We show that generates a (clearly definable) type in .
Towards a contradiction we assume that does not generate a type in , meaning that there exists a definable set satisfying that, for every , and . Let us fix some with .
Consider the boundary of in , i.e. the set . Since , by o-minimality we have that . It follows that is a downward directed refinement of composed of sets of dimension lower than . By definition of , there must exist a set with . Now let . By downward directedness of and definition of the definable family is a downward directed refinement of that does not contain the empty set (i.e. ). By definition of it follows that . We show that , contradicting the definition of .
We show that, for every with , the intersection has strictly less definably connected components than . In particular, this implies that, for every set with , if is a subset of with exactly definably connected components, then has less than definably connected components, and so as desired.
Let denote the interior of in , i.e. . Let be a definably connected set. If , then by definition of clearly must be a subset of either or . Since , then must be a subset of either or . Now let us fix a set with . Since we have that , and so every definably connected component of is a subset of either or . Finally recall that, by definition of , the sets and are both nonempty. Consequently we conclude that the set (as well as ) has a positive number of definably connected components that is lesser than the number of definably connected components of . ∎
In Proposition 4.3, whenever is definable, one may wonder if can always be chosen definable over the same parameters as . This was proved to be false in general by Johnson in [AG21b, Appendix B]. Nevertheless, by [AG21b, Proposition 2.17] it does hold that every definable downward directed family extends to a type in definable over the same parameters as . This can also be proved using Corollary 3.7 and Remark 3.8. For a similar result see [HL16, Lemma 4.2.18].
Remark 4.4.
Observe that Propositions 4.1 and 4.3 together yield a strong density result for types satisfying that there is a formula such that is downward directed and , namely types which have a basis (in the sense of filter basis) given by their restriction to a single formula. This is discussed in [AG21b, Remarks 2.13 and 2.22]. In any o-minimal structure every -type is of this kind (it is either realized or has a basis of open intervals). On the other hand, it was shown in [AGTW21, Corollary 32] that, in an o-minimal expansion of an ordered group, every definable type of this kind contains at least one set of dimension at most (and of dimension at most in o-minimal expansions of ordered fields). Using the Marker-Steinhorn Theorem [MS94, Theorem 2.1] one derives that, in any o-minimal expansion of the group of reals, there are -types that do not have a basis given by their restriction to a single formula, for every ( in o-minimal expansions of the field of reals).
5 O-minimal definable compactness
5.1 Topological preliminaries
We introduce definable (explicitly in the sense of Flum and Ziegler [FZ80]) topological spaces and various related definitions.
Definition 5.1.
A definable topological space , with , is a topological space such that there exists a definable family of subsets of which is a basis for .
Any definable set in an o-minimal structure with its induced Euclidean topology is a definable topological space. For other examples within o-minimality, see the definable manifold spaces studied by Pillay [Pil88] and van den Dries [vdD98, Chapter 10], the definable Euclidean quotient spaces of van den Dries [vdD98, Chapter 10] and Johnson [Joh18], the definable normed spaces of Thomas [Tho12], and the definable metric spaces of Walsberg [Wal15]. See moreover the author’s doctoral dissertation [AG21a] for an exhaustive exploration of o-minimal definable topological spaces. For a foundational treatment of definable tame topology generalizing o-minimality see the work of Pillay [Pil87]. For an exploration of dp-minimal tame topology see the more recent work of Simon and Walsberg [SW19], and related independent work of Dolich and Goodrick [DG22].
Onwards we contextualize topological notions related to a given topological space by adding the prefix , e.g. -open, -closure etc. We recall some standard definitions.
Definition 5.2.
Let be a definable topological space. A definable curve in is a definable map , for some . We say that it -converges to (i.e. is a -limit of ) as if, for every -neighborhood of , there exists such that whenever . The notion of -convergence as is defined analogously. We denote by (respectively ) the set of -limit points of as (respectively ).
We say that is -completable if it -converges as and as .
Given a definable topological space and a set we denote the -closure of by . It is easy to check that a -limit of a definable curve is always contained in . Furthermore, if is Hausdorff, then the sets and are always either empty or a singleton, and in the latter case we abuse terminology by identifying them with their single point. We will use these facts in Section 5.2 without explanation. To erase ambiguity, at times we also use side convergence notation and (e.g. ), with the standard meaning.
The following definition is borrowed from [HL16].
Definition 5.3.
Let be a definable topological space and be a (possibly partial) type with . We say that is a -limit333Fornasiero [For], as well as Thomas, Walsberg and the author [AGTW21], use the word “specialization” (borrowed from real algebraic geometry) to refer to limits of types. Here we use instead the terminology from Hrushovski and Loeser [HL16, Chapter 4]. of if is contained in the -closure of every subset of in . If , then this is equivalent to saying that in contained in every -closed set in .
We now present various definitions extracted from the literature (for references see Section 1) which seek to capture the notion of definable compactness. We mostly maintain consistency with [AGJ22] in the names. (In particular we avoid using the adjective “definable” in our terminology to enable an easier read.) A more general approach to definable compactness, including more definitions than the ones in this paper, can be found in unpublished work of Fornasiero [For].
Definition 5.4.
Let be a definable topological space. Then is:
-
(1)
curve-compact if every definable curve in is -completable.
-
(2)
filter-compact if every downward directed definable family of nonempty -closed subsets of has nonempty intersection,
-
(3)
type-compact if every definable type has a -limit in .
-
(4)
transversal-compact if every consistent definable family of -closed subsets of has a finite transversal.
The equivalence between curve-compactness and filter-compactness was proved for definable topological spaces in o-minimal expansions of ordered fields in [AGTW21, Corollary 44]. In this paper we present a deeper characterization in the general o-minimal setting.
5.2 Characterizing definable compactness
In this section we prove our results on definable compactness for definable topological spaces in o-minimal structures. Throughout we assume that our underlying structure is o-minimal.
We devote most of the section to proving the characterization of definable compactness given by Theorem A, which we divide into three propositions. Proposition 5.5 provides the equivalence (2)(3) in the theorem. In Proposition 5.7 we prove, using results from previous sections, the equivalence between (1), (3), (4), (5) and (6). Finally, in Proposition 5.12 we prove the implication (1)(7), and the reverse implication when is Hausdorff or has definable choice. We follow it with an example (Example 5.16) showing that the implication (1)(7) is strict in general. Throughout we also discuss other notions of definable compactness, and end the section with two additional results: definable compactness is equivalent to classical compactness in o-minimal expansions of (Corollary 5.19), and definable compactness is definable in families (Proposition 5.22).
The equivalence in Proposition 5.5 below corresponds to the equivalence in Theorem A. Note that the proof of this equivalence does not use o-minimality. Hence this characterization of type-compactness holds in any model-theoretic structure. Furthermore, the equivalence of type-compactness with classical compactness always holds whenever the underlying structure satisfies that every type in is definable, as we point out in Remark 5.6 below.
Proposition 5.5.
Proof.
To prove (1)(2), suppose that is type-compact and let be a definable family of -closed sets that extends to a definable type . Let be a -limit of . Then clearly .
The key element to the rest of the proof is the fact that every closed set in a topological space is an intersection of basic closed sets.
To prove (2)(1), let be a definable type. Let denote a definable basis (of opens) for the topology . Now let denote the definable family of basic -closed sets in , i.e. the family of sets in of the form for some . If (2) holds, then there exists some with . In this case it follows that is a -limit of .
Finally, suppose that expands . Clearly, if is compact, then it is type-compact. Conversely, suppose that is type-compact and let be a consistent family of -closed sets. The intersection can be rewritten as an intersection of basic closed sets. In particular, we may assume that contains only definable sets. Now, by the Marker-Steinhorn Theorem [MS94, Theorem 2.1], every type over is definable. Consequently extends to a definable type . Let be a -limit of , then . So is compact. ∎
Remark 5.6.
Note that the equivalence between type-compactness and classical topological compactness shown in Proposition 5.5 holds in every structure satisfying that all types are definable. For example it remains true in the field of p-adic numbers , as observed in [AGJ22, Theorem 8.15].
More specifically, if defines a basis for the topology , i.e. , then to have the equivalence between type-compactness and classical compactness it suffices to have that every maximal consistent subfamily of is definable, which occurs in particular whenever every -type (i.e. restrictions of types in to ) is definable. Observe that the latter always holds whenever is stable although, as already noted in the proof of [Pil87, Proposition 1.2], every infinite topological space that has a basis defined by a stable formula must be discrete, and consequently not compact.
Proposition 5.7 below corresponds to the equivalence between (1), (3), (4), (5) and (6) in Theorem A. Its proof relies on Proposition 4.1 and Corollaries 3.4 and 3.7.
Proposition 5.7.
Let be a definable topological space. The following are equivalent.
-
(1)
is filter-compact.
-
(2)
Every definable family of -closed sets that extends to a definable type in has nonempty intersection.
-
(3)
Every definable family of -closed sets with the -property, where , has a finite transversal.
-
(4)
Every definable family of -closed sets with the -property, where , has a finite transversal.
-
(5)
is transversal-compact.
Proof.
Note that, if a downward directed family of sets has a finite transversal, then, by Lemma 2.1, it has nonempty intersection. Hence (3), (4) and (5) each imply (1). We prove (1)(2) and (2)(3). Observe that implication (3)(4) follows from Corollary 3.4, and implication (4)(5) is trivial, completing the proof.
Suppose that is filter-compact and let be a definable family of -closed sets that extends to a definable type . Let be as given by Proposition 4.1 for and . Let . By Proposition 4.1, is a definable downward directed family of subsets of which refines . Let . Clearly is a definable downward directed family of -closed sets, so by filter-compactness there exists . Moreover observe that, since the sets in are closed, then is still a refinement of , implying that , and so .
Let be a definable family of -closed subsets of with the -property, where . By Corollary 3.7 there exists a finite covering of by definable subfamilies, each of which extends to a definable type in . If property (2) holds, then, for each , there exists some in . The family is clearly a transversal of . ∎
Remark 5.8.
We remark that, although omitted from the proof above, the implication (2)(1) in Proposition 5.7 (i.e. by Proposition 5.5 the implication type-compactness filter-compactness) can be shown to follow easily from Proposition 4.3. In fact we claim that this implication, as well as (2)(5), hold in a more general dp-minimal setting by [SS14, Theorem 5] (see the discussion above Fact 3.6). Additionally, the equivalence holds in all in NIP structures by recent work of Kaplan [Kap22, Corollary 4.9].
Remark 5.9.
It was shown in [PS99, Theorem 2.1] that a definable set with the o-minimal Euclidean topology is curve-compact if and only if it is closed and bounded. In [PP07, Theorem 2.1] Peterzil and Pillay extracted from [Dol04] the following. Suppose that our o-minimal structure has definable choice (e.g. expands an ordered group). Let be a monster model and be a formula in such that is closed and bounded (in the Euclidean topology in ). If the family is consistent, then has a point in . Using a straightforward model-theoretic compactness argument they derive from this that every closed and bounded Euclidean space is transversal-compact [PP07, Corollary 2.2 ].
Let be a definable topological space (in ), whose definition in we denote by . The property that every formula , satisfying that is -closed and the family is consistent, satisfies that , is labelled Dolich’s property in [For]. As mentioned in the previous paragraph, this property implies transversal-compactness (without any assumption on ), and furthermore one may show, using recent work of Kaplan [Kap22, Theorem 1.5], that the converse implication (transversal-compactnessDolich’s property) holds in all NIP structures.
Theorem A completes the characterization of closed and bounded definable sets with the Euclidean topology. Furthermore, it generalizes Peterzil’s and Pillay’s [PP07] aforementioned result in three ways. First, we drop the assumption of having definable choice in . Second, we weaken the consistency assumption to having an appropriate -property (in their work they actually observe that it suffices to have -consistency for some in terms of and ). Third, we establish, by means of the equivalence with transversal-compactness mentioned in the paragraph above, the relationship between Dolich’s property and the other compactness notions in the full generality of any o-minimal definable topological space.
We now prove the connection within o-minimality between filter-compactness and curve-compactness stated in Theorem A. That is, that filter-compactness implies curve-compactness, and that both notions are equivalent when the topology is Hausdorff or when the underlying o-minimal structure has definable choice. This is Proposition 5.12. We follow the proposition with an example of a non-Hausdorff topological space definable in the dense linear order without endpoints that is curve-compact but not filter-compact.
The next lemma allows us to apply definable choice in certain instances even when the underlying structure may not have the property.
Lemma 5.10 (Definable choice in compact Hausdorff spaces).
Let be a definable nonempty -closed set in a curve-compact Hausdorff definable topological space . Let be such that and are -definable. Then there exists a point , where denotes the set of finite tuples of elements in the definable closure of .
Consequently, for every -definable family of nonempty subsets of , there exists an -definable choice function such that for every .
Proof.
We prove the first paragraph of the lemma. The uniform result is derived in the usual way by the use of first-order logic compactness.
For this proof we adopt the convention of the one point Euclidean space . In particular, any projection is simply the constant function , and any relation is definable if and only if its projection to is.
Let , and be as in the lemma, with . Let be such that there exists an -definable function , for a nonempty set. If can be chosen to be zero, then the lemma follows. We prove that this is the case by backwards induction on .
Note that can always be chosen equal to , by letting be the identity on . Consider a positive . For every , let denote the fiber . For each , let , and consider the -definable set .
If , then let be the map . If , then let be the map which, by curve-compactness and Hausdorffness, is well defined. In both cases is an -definable nonempty partial function . ∎
Remark 5.11.
Let and be an -definable family of nonempty -closed sets in a curve-compact Hausdorff -definable topological space . Lemma 5.10 implies that, if has a finite transversal, then it also has one of the same size in . To prove this it suffices to note that, for every , the set of -tuples of points corresponding to a transversal of is -definable and closed in the product topology, which can easily be shown to be -definable and curve-compact.
Proposition 5.12.
Let be a definable topological space. If is filter-compact, then it is curve-compact.
Suppose that either is Hausdorff or has definable choice. Then is filter-compact if and only if it is curve-compact.
We prove the left to right direction through a short lemma.
Lemma 5.13.
Let be a filter-compact definable topological space. Then is curve-compact.
Proof.
Let be a definable curve in . Consider the definable family of -closed nested sets . By filter-compactness, there exists . By o-minimality, observe that satisfies that it -converges to as . Similarly one shows that also -converges as . ∎
We now prove a simpler case of the left to right implication in Proposition 5.12. We do so by implicitly introducing a weakening of filter-compactness corresponding to the property that every definable family of nonempty closed sets that is nested has nonempty intersection (say chain-compactness). We show that, when has definable choice or the underlying topology is Hausdorff, curve-compactness implies chain-compactness (the reverse implication always holds within o-minimality by the proof of Lemma 5.13). On the other hand, Example 5.16 describes a (non-Hausdorff) definable topological space in that is curve-compact but not chain-compact. It is unclear whether chain-compactness is equivalent to definable compactness (Definition 1.1) in the general setting of o-minimal definable topological spaces.
Lemma 5.14.
Let be a definable topological space. Suppose that either is Hausdorff or has definable choice. Let be a nested definable family of nonempty -closed subsets of . If is curve-compact, then .
Proof.
Let and , with , be as in the lemma. We assume that is curve-compact and show that . We proceed by induction on .
Case .
Consider the definable total preorder in given by if and only if . If has a minimum with respect to , then for every , and the result follows. We suppose that does not have a minimum and consider the definable nested family of (necessarily infinite) sets , where for every . Now let , where the infimum and supremum are taken in with respect to the order in . We show that one of the families or is a refinement of . We prove the case where , being the case where similar but more straightforward.
Towards a contradiction suppose that does not have a refinement as described. Then, by o-minimality, there exists some and such that , and similarly there exists and such that . Additionally, by definition of , there exists such that . Finally let be such that . Now let be such that is the minimum with respect to in . Then observe that , contradicting the definition of .
Hence onwards we assume that the family of intervals is a refinement of , being the case where the refinement is given by the family analogous. This means that, for every , there exists an element such that for every .
Since either has definable choice or is Hausdorff there exists, by Lemma 5.10, a definable function satisfying that for every . By the above paragraph it follows that, for every , if , then . Let be such that and be the restriction of to . We derive that, for every , it holds that . Since is curve-compact we conclude that .
Case .
For every , let denote the family , where }, and set . By the case the definable family of -closed sets does not contain the empty set. Clearly . We observe that the family is nested and the result follows from the induction hypothesis.
Given , if, for every , there is with , then . Otherwise, there is such that, for every , it holds that , in which case . ∎
We may now prove Proposition 5.12.
Proof of Proposition 5.12.
By Lemma 5.13 we must only prove the right to left implication in the second paragraph. Let , with , be a curve-compact definable topological space, where either is Hausdorff or otherwise has definable choice. Let be a definable downward directed family of nonempty subsets of , not necessarily -closed. We show that .
We proceed by induction on . Applying Proposition 4.3, after passing to a refinement of if necessary, we may assume that is a downward directed family of cells that generates a type in . If , then there exists a finite set in and so (see Lemma 2.1) . Hence onwards we assume that . We begin by proving the case . Hence suppose that every is an open cell , for functions with . Onwards recall the notation fixed in the last paragraph of Section 2.1. For every , consider the definable set .
Claim 5.15.
For every it holds that .
Proof.
Let us fix and, for every , let denote a point in . If is Hausdorff then, for every , there is a unique choice for , otherwise we use definable choice to pick definably in . The definable set has dimension at most . For every , since , the definable set is nonempty, and so .
Note that, because is downward directed, the definable family of nonempty sets is downward directed. Since , by inductive hypothesis there is a point that belongs in the -closure of –in particular in – for all . Hence . ∎
Note that, for every , it holds that . We now show that the definable family of nonempty (by Claim 5.15) -closed sets is nested. Then, by Lemma 5.14, , and thus .
Let us fix and in . We may partition into the definable sets
Since is a basis (i.e. a downward directed generating family) for a type in , there exists some and such that . Without loss of generality suppose that , and let us fix with . For an arbitrary set , let be such that . Then, clearly . It follows that . This completes the proof of the case .
Finally, we describe how the proof in the case can be obtained by adapting the arguments above. Fix with and a projection such that is a bijection. By passing to a refining subfamily of if necessary we may assume that every set in is contained in . By definition of it follows that the definable downward directed family contains only open cells in . Note moreover that this family is a basis for a type in .
Set and, for every , let . Then the proof in the case can be applied by letting be the intersection , and letting be a set given by points in chosen definably in .
∎
The following is an example of a non-Hausdorff definable topological space in the unbounded dense linear order that is curve-compact but not definably compact. In particular, the space admits a definable nested family of nonempty closed sets with empty intersection (see the comments above Lemma 5.14).
Example 5.16.
Let . Consider the family of subsets of of the form
definable uniformly in .

Given any and in , and any , since every set in is open in the Euclidean topology, we may find such that the box is a subset of . Let and . Then . Hence the family is a definable basis for a topology on .
This topology is , i.e. every singleton is -closed. For every , , and, for every , and . In particular, is not Hausdorff.
Now suppose that . By quantifier elimination we know that in this structure any definable partial map is piecewise either constant or the identity. Let be an injective definable curve in , where and are the projections to the first and second coordinates respectively. Let be an interval where and are either constant or the identity. Since the graph of the identity is disjoint from and is injective it must be that is constant and is the identity on for some .
Suppose that is constant with value . Then, by the observations made above about the topology , the curve satisfies that it -converges as to either (if ) or (if ). On the other hand, if has a constant value , then -converges as to either (if ) or the whole space (if ). Analyzing the limit as similarly allows us to conclude that is -completable. Hence the space is curve-compact.
Meanwhile, the definable nested family of -closed sets has empty intersection. In particular, is not definably compact.
Remark 5.17.
In [Joh18, Question 4.14] Johnson asks whether curve-compactness and filter-compactness are equivalent for o-minimal definable manifold spaces [vdD98, Chatper 10, Section 1]. While these spaces are not necessarily Hausdorff observe that, because they admit a covering by finitely many Hausdorff open subspaces, every definable curve in them converges to only finitely many points. It follows that the proofs of Lemmas 5.10 and 5.14 and Proposition 5.12 adapt to these spaces without any assumption that they are Hausdorff or that has definable choice. Hence we can answer Johnson’s question in the affirmative. In fact, by Theorem A, every definable manifold space is curve-compact if and only if it is definably compact.
In the next remark we relate definable compactness to definable nets.
Remark 5.18.
In [AGTW21, Section 6], Thomas, Walsberg and the author introduce the notion of definable net to mean a definable map from a definable directed set into a definable topological space . Recall that (Kelley) subnet of is a net such that , where satisfies that, for every , there exists satisfying that for every . We say that such a net is definable if and are definable.
Classically, a topological space is compact if and only if every net in it has a converging subnet. Following the classical proof of this result one may show that, in any model-theoretic structure (regardless of the axiom of o-minimality), filter-compactness implies that every definable net has a definable converging subnet (say net-compactness). The reverse implication follows whenever the structure has definable choice. In the o-minimal case one may easily show that net-compactness implies curve-compactness and so, by Theorem A, net-compactness implies definable compactness whenever the topology is Hausdorff or has definable choice. See [AGTW21, Corollary 44] for a detailed proof of the equivalence between net-compactness, curve-compactness and filter-compactness in o-minimal expansions of ordered groups. Furthermore, one may show that Example 5.16 above is not net-compact. The author is unaware of whether net-compactness implies definable compactness always within o-minimality.
In general topology there are further characterizations of compactness, such as the property that every net has a cluster point, which are not addressed in this paper.
Corollary 5.19.
Suppose that is an o-minimal expansion of and let be a definable topological space. Then is definably compact if and only if it is compact.
Remark 5.20.
Part of [PS99, Question 2.5] asks whether curve-compactness is equivalent to classical compactness among definable manifold spaces in o-minimal expansions of . Theorem A, Remark 5.17 and Corollary 5.19 above provide a positive answer to this question. The other part of [PS99, Question 2.5] asks whether curve-compactness for o-minimal definable manifold spaces is maintained after passing to an o-minimal expansion. Recall that Example 5.16 describes a (non-Hausdorff) definable topological space in an arbitrary dense linear order which is curve-compact but not definably compact. The linear order could be chosen to have an o-minimal expansion with definable choice, in which case, by Theorem A, in the space would lose the property of curve-compactness. Hence the above question has a negative answer when directed at all (non-Hausdorff) definable topological spaces. On the other hand, by Corollary 5.19, definable compactness is always maintained after passing to an expansion in o-minimal structures over . It remains open however whether the same is true in arbitrary o-minimal structures.
Notice that all the characterizations of definable compactness in Theorem A are upfront expressible with infinitely many sentences (possibly with parameters) in the language of , i.e. you have to check all relevant definable families of closed sets or all definable curves. Recall that, by [PS99, Theorem 2.1] (or alternatively [Joh18, Proposition 3.10]) and Theorem A, a definable set with the Euclidean topology is definably compact if and only if it is closed and bounded. Being closed and bounded is expressible by a single formula (in the same parameters used to define the set). Furthermore, given a definable family of sets with the Euclidean topology, the subfamily of those that are closed and bounded is definable.
We generalize this last observation to all definably compact spaces definable in o-minimal structures, showing along the way that definable compactness is expressible with a single formula (in the same parameters that define the topological space). We prove this for type-compactness and apply Theorem A. We use the following fact regarding strict pro-definability of the space of definable types from [CKHY21], which can also be proved using Propositions 4.1 and 4.3, together with the Marker-Steinhorn Theorem [MS94, Theorem 2.1]. Recall that throughout this section our structure is o-minimal.
Fact 5.21 ([CKHY21] Theorems 2.4.8 and 3.2.1).
For every formula , there exists a formula and a definable (over ) set with the following properties. For every , there exists a definable type such that
(2) |
and vice versa for every definable type there exists some satisfying equation (2).
Proposition 5.22.
Let , be a definable family of topological spaces, i.e. there exists a definable set and some formula , with and , such that is the projection of to the last coordinates and, for every , the family , where , is a basis for . Then the subfamily of all definably compact spaces is definable, i.e. there exists a definable set such that is definably compact if and only if .
In particular, given any definable family of subsets of a definable topological space, the subfamily of those that are definably compact is definable.
Proof.
Let be a formula such that, for every , the family is a basis of closed sets for . Recall that, as observed in the proof of Proposition 5.5, a type has a limit if and only if the intersection of all basic closed sets in it is nonempty.
Let and be as given by Fact 5.21 with . It follows that, for any fixed , the space is type-compact if and only if either is empty or the following holds:
Since the set is definable, this completes the proof. ∎
In the case where is an o-minimal expansion of an ordered field, the completeness of the theory of tame pairs [vdDL95] can be used to circumvent some of the proofs in this paper. In particular Thomas, Walsberg and the author [AGTW21, Corollary 47] use it to prove the equivalence between curve-compactness and type-compactness among definable topological spaces, drawing inspiration from Walsberg’s previous proof [Wal15, Proposition 6.6] of the equivalence between curve-compactness and sequential compactness among definable metric spaces in the case where expands the field of reals.
References
- [ADH+16] Matthias Aschenbrenner, Alf Dolich, Deirdre Haskell, Dugald Macpherson, and Sergei Starchenko. Vapnik-Chervonenkis density in some theories without the independence property, I. Trans. Amer. Math. Soc., 368(8):5889–5949, 2016.
- [AF11] Matthias Aschenbrenner and Andreas Fischer. Definable versions of theorems by Kirszbraun and Helly. Proc. Lond. Math. Soc. (3), 102(3):468–502, 2011.
- [AG21a] Pablo Andújar Guerrero. Definable Topological Spaces in O-minimal Structures. PhD thesis, Purdue University, 2021.
- [AG21b] Pablo Andújar Guerrero. Types, transversals and definable compactness in o-minimal structures. arXiv e-prints, 2021. arXiv:2111.03802.
- [AGJ22] Pablo Andújar Guerrero and Will Johnson. Around definable types in -adically closed fields. arXiv e-prints, 2022. arXiv:2208.05815.
- [AGTW21] Pablo Andújar Guerrero, Margaret Thomas, and Erik Walsberg. Directed sets and topological spaces definable in o-minimal structures. J. London Math. Soc. (2), 104(3):989–1010, 2021.
- [CK12] Artem Chernikov and Itay Kaplan. Forking and dividing in theories. J. Symbolic Logic, 77(1):1–20, 2012.
- [CKHY21] Pablo Cubides Kovacsics, Martin Hils, and Jinhe Ye. Beautiful pairs. arXiv e-prints, 2021. arXiv:2112.00651.
- [CS12] Sarah Cotter and Sergei Starchenko. Forking in VC-minimal theories. J. Symbolic Logic, 77(4):1257–1271, 2012.
- [CS15] Artem Chernikov and Pierre Simon. Externally definable sets and dependent pairs II. Trans. Amer. Math. Soc., 367(7):5217–5235, 2015.
- [DG22] Alfred Dolich and John Goodrick. Tame topology over definable uniform structures. Notre Dame J. Form. Log., 63(1):51–79, 2022.
- [Dol04] Alfred Dolich. Forking and independence in o-minimal theories. J. Symbolic Logic, 69(1):215–240, 2004.
- [vdD98] Lou van den Dries. Tame Topology and O-minimal Structures, volume 248 of London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge, 1998.
- [vdDL95] Lou van den Dries and Adam H. Lewenberg. -convexity and tame extensions. J. Symbolic Logic, 60(1):74–102, 1995.
- [For] Antongiulio Fornasiero. Definable compactness for topological structures. Unpublished.
- [Fuj23] Masato Fujita. Definable compactness in definably complete locally o-minimal structures. arXiv e-prints, 2023. arXiv:2303.01644.
- [FZ80] Jörg Flum and Martin Ziegler. Topological model theory, volume 769 of Lecture Notes in Mathematics. Springer, Berlin, 1980.
- [HL16] Ehud Hrushovski and François Loeser. Non-archimedean tame topology and stably dominated types, volume 192 of Annals of Mathematics Studies. Princeton University Press, Princeton, NJ, 2016.
- [JL10] H. R. Johnson and M. C. Laskowski. Compression schemes, stable definable families, and o-minimal structures. Discrete Comput. Geom., 43(4):914–926, 2010.
- [Joh18] Will Johnson. Interpretable sets in dense o-minimal structures. J. Symb. Log., 83(4):1477–1500, 2018.
- [Kap22] Itay Kaplan. A definable -theorem for nip theories. arXiv e-prints, 2022. arXiv:2210.04551.
- [KM00] Marek Karpinski and Angus Macintyre. Approximating volumes and integrals in o-minimal and -minimal theories. In Connections between model theory and algebraic and analytic geometry, volume 6 of Quad. Mat., pages 149–177. Dept. Math., Seconda Univ. Napoli, Caserta, 2000.
- [Mat04] Jiří Matoušek. Bounded VC-dimension implies a fractional Helly theorem. Discrete Comput. Geom., 31(2):251–255, 2004.
- [MS94] David Marker and Charles I. Steinhorn. Definable types in -minimal theories. J. Symbolic Logic, 59(1):185–198, 1994.
- [Pil87] Anand Pillay. First order topological structures and theories. J. Symbolic Logic, 52(3):763–778, 1987.
- [Pil88] Anand Pillay. On groups and fields definable in -minimal structures. J. Pure Appl. Algebra, 53(3):239–255, 1988.
- [Pil04] Anand Pillay. Type-definability, compact Lie groups, and o-minimality. J. Math. Log., 4(2):147–162, 2004.
- [PP07] Ya’acov Peterzil and Anand Pillay. Generic sets in definably compact groups. Fund. Math., 193(2):153–170, 2007.
- [PS99] Ya’acov Peterzil and Charles Steinhorn. Definable compactness and definable subgroups of o-minimal groups. J. London Math. Soc. (2), 59(3):769–786, 1999.
- [Sim15] Pierre Simon. Invariant types in NIP theories. J. Math. Log., 15(2):1550006, 26, 2015.
- [SS14] Pierre Simon and Sergei Starchenko. On forking and definability of types in some DP-minimal theories. J. Symb. Log., 79(4):1020–1024, 2014.
- [SW19] Pierre Simon and Erik Walsberg. Tame topology over dp-minimal structures. Notre Dame J. Form. Log., 60(1):61–76, 2019.
- [Tho12] Margaret E. M. Thomas. Convergence results for function spaces over o-minimal structures. J. Log. Anal., 4(1), 2012.
- [Wal15] Erik Walsberg. On the topology of metric spaces definable in o-minimal expansions of fields. arXiv e-prints, 2015. arXiv:1510.07291.