
TL;DR
This paper proves that in certain o-minimal expansions of real closed fields with dense subgroups, small definable sets can be embedded into finite powers of the subgroup, extending previous results to a more general setting.
Contribution
It establishes elimination of imaginaries for the induced structure on dense subgroups with the Mann property in a broad o-minimal context, generalizing prior work.
Findings
Small sets in the structure can be embedded into finite powers of the dense subgroup.
Elimination of imaginaries holds for the induced structure on the dense subgroup.
Results apply to a general class of o-minimal expansions with tameness conditions.
Abstract
Let be an expansion of a real closed field by a dense subgroup of with the Mann property. We prove that the induced structure on by eliminates imaginaries. As a consequence, every small set definable in can be definably embedded into some , uniformly in parameters. These results are proved in a more general setting, where is an expansion of an o-minimal structure by a dense set , satisfying three tameness conditions.
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.
Small sets in Mann pairs
Pantelis E. Eleftheriou
Department of Mathematics and Statistics, University of Konstanz, Box 216, 78457 Konstanz, Germany
Abstract.
Let be an expansion of a real closed field by a dense subgroup of with the Mann property. We prove that the induced structure on by eliminates imaginaries. As a consequence, every small set definable in can be definably embedded into some , uniformly in parameters. These results are proved in a more general setting where is an expansion of an o-minimal structure M by a dense set , satisfying three tameness conditions.
Key words and phrases:
Mann pairs, elimination of imaginaries, small sets
2010 Mathematics Subject Classification:
Primary 03C64, Secondary 06F20
Research supported by an Independent Research Grant from the German Research Foundation (DFG) and a Zukunftskolleg Research Fellowship.
1. Introduction
This note is a natural extension of the work in [6]. In that reference, expansions of an o-minimal structure by a dense predicate were studied, and under three tameness conditions, it was shown that the induced structure on by eliminates imaginaries. The tameness conditions were verified for dense pairs of real closed fields, for expansions of by an independent set , and for expansions of a real closed field by a dense subgroup of with the Mann property (henceforth called Mann pairs), assuming is divisible. As pointed out in [6, Remark 4.10], without the divisibility assumption in the last example, the third tameness condition no longer holds, and in [6, Question 4.11] it was asked whether in that case still eliminates imaginaries. In this note, we prove that it does. Indeed, we replace the third tameness condition by a weaker one, which we verify for arbitrary Mann pairs, and prove that together with the two other tameness conditions it implies elimination of imaginaries for .
Let us fix our setting. Throughout this text, denotes an o-minimal expansion of an ordered group with a distinguished positive element . We denote by its language, and by the usual definable closure operator in M. An ‘-definable’ set is a set definable in with parameters. We write ‘-definable’ to specify that those parameters come from . It is well-known that admits definable Skolem functions and eliminates imaginaries ([4, Chapter 6]).
Let . The -induced structure on by M, denoted by , is a structure in the language
[TABLE]
whose universe is and, for every tuple ,
[TABLE]
If , by a trace on we mean a set of the form , where is -definable. We call a full trace.
For the rest of this paper we fix some and denote . We let denote the language of ; namely, the language augmented by a unary predicate symbol . We denote by the definable closure operator in . Unless stated otherwise, by ‘(-)definable’ we mean (-)definable in , where . We use the letter to denote an arbitrary, but not fixed, subset of .
Tameness Conditions (for and ):
- (OP)
(Open definable sets are -definable.) For every set such that is -independent over , and for every -definable set , its topological closure is -definable.
- (dcl)D
Let and
[TABLE]
Then
[TABLE]
- (ind)D
Let be definable in . Then is a finite union of traces on sets which are -definable in . That is, there are -definable sets , and sets that are -definable in , such that
[TABLE]
Conditions (OP) and (dcl)D are the same with those in [6], and are already known to hold for Mann pairs ([6, Remark 4.11]). Condition (ind)D is weaker than the corresponding one in [6], in three ways: (a) is now a finite union of traces (instead of a single trace), (b) the traces are on subsets of (instead of on the whole ), and (c) there is no control in parameters for the ’s (although we achieve this in Corollary 3.5 below). These differences result in several non-trivial complications in the proof of our main theorem, which are handled in Section 3. For now, let us state the main theorem.
Theorem 1.1**.**
Assume (OP), (dcl)D and (ind)D, and that is -independent over . Then eliminates imaginaries.
Condition (ind)D is modelled after the current literature on Mann pairs, which we now explain. Assume is a real closed field, and a dense subgroup of . For every , a solution to the equation
[TABLE]
is called non-degenerate if for every non-empty , . We say that has the Mann property, if for every , the above equation has only finitely many non-degenerate solutions in .111 The original definition only involved equations with coefficients in the prime field of , but, by [5, Proposition 5.6], the two definitions are equivalent. Let us call such a pair a Mann pair. Examples of Mann pairs include all multiplicative subgroups of of finite rank ([8]), such as and . Van den Dries - Günaydin [5, Theorem 7.2] showed that in a Mann pair, where moreover is divisible (such as ), every definable set is a full trace; in particular, (ind)D from [6] holds. Without the divisibility assumption, however, this is no longer true. Consider for example and let be the subgroup of consisting of all elements divisible by . That is, . This set is clearly dense and co-dense in , and cannot be a trace on any subset of .
A substitute to [5, Theorem 7.2] was proved by Berenstein-Ealy-Günaydin [1], as follows. Consider, for every , the set of all elements of divisible by ,
[TABLE]
Under the mild assumption that for every prime , has finite index in , [5, Theorem 7.5] provides a near model completeness result, which is then used in [1] to prove that every definable set is a finite union of traces on -definable subsets of (Fact 3.10 below). Note this mild assumption is still satisfied by all multiplicative subgroups of of finite rank (as noted in [9]).
Corollary 1.2**.**
Assume is a Mann pair, such that for every prime , has finite index in . Let be -independent over . Then (OP), (dcl)D and (ind)D hold. In particular, eliminates imaginaries.
Observe that Corollary 1.2 stands in contrast to the current literature, as it is known that in Mann pairs both existence of definable Skolem functions and elimination of imaginaries (for ) fail ([2]). Note also that the assumption of being -independent over is necessary; namely, without it, need not eliminate imaginaries ([6, Example 5.1]).
Theorem 1.1 has the following important consequence. Recall from [3] that a set is called -bound over if there is an -definable function such that . The recent work in [7] provides an analysis for all definable sets in terms of ‘-definable-like’ and -bound sets. Using Theorem 1.1, we further reduce the study of -bound sets to that of definable subsets of .
Corollary 1.3**.**
Assume (OP), (dcl)D and (ind)D hold for every which is -independent over . Let be an -definable set. If is -bound over , then there is an -definable injective map . If itself is -independent over , then the extra parameters from can be omitted.
Note that the assumption of Corollary 1.3 holds for as in Corollary 1.2. Note also that allowing parameters from is standard practice when studying definability in this context; see for example [7, Lemma 2.5 and Corollary 3.26].
Structure of the paper. In Section 2, we fix notation and recall some basic facts. In Section 3, we prove our results.
2. Preliminaries
We assume familiarity with the basics of o-minimality and pregeometries, as can be found, for example, in [4] or [10]. Recall that is our fixed o-minimal expansion of an ordered group with a distinguished positive element and denotes the usual definable closure operator. We denote the corresponding dimension by . If are two sets, we often write for . We denote by the graph of a function . If and , we write for
[TABLE]
The topological closure of a set is denoted by and its frontier by . If , the relative interior of in is denoted by . It is not hard to see that
[TABLE]
Fact 2.1**.**
Let be two -definable sets. Then
[TABLE]
Proof.
If , we are done. Assume and, towards a contradiction, that the inequality fails. Then there is a set with , such that . By cell decomposition, it is not hard to find open such that , and hence contains elements in , a contradiction. ∎
2.1. Elimination of imaginaries
We recall that a structure eliminates imaginaries if for every -definable equivalence relation on , there is a -definable map such that for every ,
[TABLE]
In the order setting, we have the following criterion (extracted from [10, Section 3]; for a proof see [6, Fact 2.2]).
Fact 2.2**.**
Let be a sufficiently saturated structure with two distinct constants in its language. Suppose the following property holds.
- (*)
Let and . If is -definable and -definable, then is -definable.
Then eliminates imaginaries.
2.2. The induced structure
Recall from the introduction that
[TABLE]
Remark 2.3*.*
For , we have:
- (1)
if is -definable in , and is -definable, then is -definable in . Indeed, . 2. (2)
in general, if is -definable in , then it is -definable. The converse will be true for Mann pairs, by Corollary 3.11 below.
3. Proofs of the results
In this section we prove elimination of imaginaries for under our assumptions (Theorem 1.1) and deduce Corollaries 1.2 and 1.3 from it. Our goal is to establish () from Fact 2.2 for (Lemma 3.8 below). As in [6], the strategy is to reduce the proof of () to [10, Proposition 2.3], which is an assertion of (*) for . This reduction takes place in the proof of Lemma 3.8 below, and requires the key Lemma 3.4. The analogous key lemma in [6] (namely, [6, Lemma 3.1]) cannot help us here, because its assumptions are not met in the proof of Lemma 3.8. Furthermore, the proof of Lemma 3.4 requires an entirely new technique.
We begin with some preliminary observations.
Fact 3.1**.**
Assume (OP). Then for every , .
Proof.
Take . That is, the set is -definable in . By (OP), we have that is -definable. But . ∎
Lemma 3.2**.**
Assume (OP). Let be an -definable set which is also -definable, for some with -independent over . Then is -definable.
Proof.
We work by induction on . For , is finite, and hence every element of it is in . By Fact 3.1, it is in . Now assume . By (OP), is -definable. By o-minimality, . Since is both -definable and -definable, by inductive hypothesis, it is -definable. So is -definable. ∎
Lemma 3.3**.**
Let and
[TABLE]
where are -definable sets, and are -definable in . Then
[TABLE]
for some -definable disjoint sets , and sets which are -definable in .
Proof.
For , let
[TABLE]
and
[TABLE]
It is then easy to check that for any two distinct , we have , and that
[TABLE]
as required. ∎
Now, the key technical lemma.
Lemma 3.4**.**
Assume (OP) and (ind)D, and that is -independent over . Let and be -definable and -definable in . Then there are , that are both -definable and -definable, and sets , that are -definable in , such that
[TABLE]
Proof.
First note that is both -definable and -definable in . Since , by (OP) it follows that is -definable and -definable.
We perform induction on the dimension of . For , is finite and , as needed. Suppose now that . By (ind)D and Lemma 3.3, there are -definable disjoint sets , and sets , each -definable in , such that
[TABLE]
For every , define
[TABLE]
Let . It is immediate from the definition, that each , and hence , is relatively open in . Therefore, by (OP), it is -definable. On the other hand, each is -definable and -definable, because is, and is -definable. Hence, by Lemma 3.2, each , and hence , is -definable and -definable.
Claim. .
Proof.
Observe first that , and hence it suffices to show that for each ,
[TABLE]
We may write
[TABLE]
By Fact 2.1, it suffices to show that . Clearly, , and hence it suffices to show:
[TABLE]
Let . Since , there is a relatively open containing , with , and hence . Therefore . Since and the ’s are disjoint, we must also have . Hence , as needed. ∎
By Remark 2.3(1), the set is both -definable and -definable in . Hence, by inductive hypothesis and the claim, the conclusion holds for this set. Now, for each , by definition of , we have . Hence
[TABLE]
and we are done.∎
Corollary 3.5**.**
Assume (OP) and (ind)D, and that is -independent over . Let and be -definable in . Then there are -definable sets , and sets that are -definable in , such that
[TABLE]
Proof.
By Lemma 3.4 for . ∎
Our next goal is to prove the promised Lemma 3.8. Denote by the definable closure operator in . We first prove that, under (OP) and (ind)D, defines a pregeometry (Corollary 3.7).
Lemma 3.6**.**
Assume (OP) and (ind)D, and that is -independent over . Let be an -definable map in . Then there is an -definable map that extends .
Proof.
By Corollary 3.5, there are finitely many -definable sets and -definable sets , such that . Fix , and let be the map whose graph equals . It clearly suffices to prove the lemma for . By (OP) and o-minimality, each fiber is dense in a finite union of open intervals and points. Hence, without loss of generality, we may assume that for every , the fiber is a singleton. Denote by the projection onto the first coordinates. The set
[TABLE]
is -definable. So, . Now let
[TABLE]
Then is -definable, it is the graph of a function , and , as required. ∎
Corollary 3.7**.**
Assume (OP) and (ind)D, and that is -independent over . Then for every , . In particular, defines a pregeometry.
Proof.
The inclusion is immediate from the definitions, whereas the inclusion is immediate from Lemma 3.6. Since defines a pregeometry in , it follows easily that so does in . ∎
Lemma 3.8**.**
Assume (OP), (dcl)D and (ind)D, and that is -independent over . Let and . If is -definable and -definable in , then is -definable in .
Proof.
Let be -definable and -definable in . By Lemma 3.4, there are , each both -definable and -definable, and , each -definable in , such that
[TABLE]
By [10, Proposition 2.3], each is L-definable over . By (dcl)D, is L-definable over . Hence is definable over in . But
[TABLE]
and hence is -definable in . ∎
We can now conclude our results.
Proof of Theorem 1.1.
For the proof of Corollary 1.3, we additionally need the following lemma.
Lemma 3.9**.**
Assume (OP and (ind)D, and that is -independent over . Let be the expansion of with constants for all elements in , and . Then (ind)D holds for and .
Proof.
Denote by the -induced structure on by . Let be -definable in . It follows that is -definable in . By Corollary 3.5, there are -definable sets , and , which are -definable in , such that
[TABLE]
Such ’s are -definable in , and the ’s are of course -definable in , as required. ∎
Proof of Corollary 1.3.
The proof when is -independent over is identical to that of [6, Theorem B]. The proof of the general case is identical to that of [6, Corollary 1.4], after replacing in [6, Lemma 3.4] the clause about (ind)D with Lemma 3.9 above. ∎
We finally turn to our targeted example of Mann pairs. The proof of Corollary 1.2 will be complete after we recall the fact below, which is extracted from [1]. First, observe that if is a Mann pair, then for every , is -definable in . Indeed, is the projection onto the first coordinate of the set
Fact 3.10**.**
Let be a Mann pair, such that for every prime , has finite index in . Let a definable set. Then is a finite union of traces on sets which are -definable in . That is, (ind)D holds.
Proof.
By [1, Corollary 57], is as a finite union of traces on sets of the form , . As pointed out in the proof of [1, Theorem 1], each such can be chosen to be -definable (in ). By Fact 3.1, . By the above observation, is -definable in . ∎
Proof of Corollary 1.2.
By Fact 3.10, (ind)D hold. By [6], as explained in Remark 4.11 therein, (OP) and (dcl)D holds. By Theorem 1.1, we are done. ∎
A byproduct of our work is the following corollary.
Corollary 3.11**.**
Let and be as in Corollary 1.2. Let be -definable, with . Then is -definable in . In particular, the conclusion of Corollary 3.5 holds.
Proof.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. Berenstein, C. Ealy and A. Günaydin, Thorn independence in the field of real numbers with a small multiplicative group , Annals of Pure and Applied Logic 150 (2007), 1-18.
- 2[2] A. Dolich, C. Miller, C. Steinhorn, Structures having o-minimal open core , Trans. AMS 362 (2010), 1371-1411.
- 3[3] L. van den Dries, Dense pairs of o-minimal structures , Fundamenta Mathematicae 157 (1988), 61-78.
- 4[4] L. van den Dries, Tame topology and o-minimal structures , Cambridge University Press, Cambridge, 1998.
- 5[5] L. van den Dries, A. Günaydın, The fields of real and complex numbers with a small multiplicative group , Proc. London Math. Soc. 93 (2006), 43-81.
- 6[6] P. Eleftheriou, Small sets in dense pairs , Israel J. Math, to appear.
- 7[7] P. Eleftheriou, A. Günaydin, and P. Hieronymi, Structure theorems in tame expansions of o-minimal structures by dense sets , Preprint, upgraded version (2017).
- 8[8] J.-H. Everste, H. P. Schlickewei, W. M. Schmidt, Linear equations in variables which lie in a multiplicative subgroup , Annals of Mathematics 155 (2002) 807-836.
