Semi-algebraic triangulation over p-adically closed fields
Luck Darni\`ere (LAREMA)

TL;DR
This paper establishes a triangulation theorem for semi-algebraic sets over p-adically closed fields, enabling new applications like flexible retractions and splitting, similar to real algebraic geometry.
Contribution
It introduces a triangulation theorem for semi-algebraic sets over p-adically closed fields, extending real algebraic geometry techniques to the p-adic context.
Findings
Triangulation theorem for semi-algebraic sets over p-adic fields
Existence of flexible retractions for semi-algebraic sets
Splitting properties for semi-algebraic sets
Abstract
We prove a triangulation theorem for semi-algebraic sets over a p-adically closed field, quite similar to its real counterpart. We derive from it several applications like the existence of flexible retractions and splitting for semi-algebraic sets.
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.
Taxonomy
TopicsAdvanced Topology and Set Theory · Polynomial and algebraic computation · Topological and Geometric Data Analysis
Semi-algebraic triangulation over -adically closed fields
Luck Darnière
Abstract
We prove a triangulation theorem for semi-algebraic sets over a -adically closed field, quite similar to its real counterpart. We derive from it several applications like the existence of flexible retractions and splitting for semi-algebraic sets.
Contents
- 1 Introduction
- 2 Prerequisites and notation
- 3 Applications
- 4 Largely continuous cell decomposition
- 5 Cellular complexes
- 6 Cellular monoplexes
- 7 Cartesian morphisms
- 8 Triangulation
1 Introduction
Our knowledge of geometric objects in affine spaces over -adic fields, that is the field of -adic numbers or a finite extension of it, has grown tremendously in the past decades. Several remarkable analogies have emerged with real geometry, in spite of the striking differences between the real and the -adic metrics. The present paper raises a new such analogy: we prove a triangulation theorem over -adically closed fields, quite similar to its real counterpart. Let us first recall the classical results in -adic geometry which will be used here.
Semi-algebraic sets over a field are the finite unions of sets defined by finitely many conditions “” or “ has a non-zero -th root in ”, where is a polynomial function with variables. Of course if is real closed we can restrict the last conditions to (that is to “”) and if is algebraically closed to (that is to ). It is shown in [Mac76] that semi-algebraic sets over are stable under the taking of boolean combinations and projections (from to , for every ). This is a -adic version of Tarski’s theorem for real closed fields (and of Chevalley’s theorem for algebraically closed fields). Prestel and Roquette (see [PR84]) have generalized it to arbitrary -adically closed fields (a -adic version of real closed fields).
Denef has proved in [Den84] a Cell Decomposition Theorem for -adic semi-algebraic sets very similar to its real counterpart, and derived from it the rationality of Poincaré series. Another major application of cell decomposition is that it provides a good dimension theory for semi-algebraic sets (see [SvdD88]). Nowadays a cell over is generally defined as the set of such that
[TABLE]
where , , are semi-algebraic functions (that is functions whose graph is semi-algebraic), and are , or no relation, and is or a coset of some semi-algebraic subgroup of . We call it a cell mod . Denef worked with cells mod and implicitly with cells mod , the multiplicative group of non-zero -th powers. This use of cells mod was then made more explicit by Cluckers. Gradually, people began to replace them by cells mod
[TABLE]
where denotes the ring of -adic integers (and the ring of integers). Indeed the Cell Decomposition Theorem only asserts that every semi-algebraic set has a finite partition in cells mod for some . But it usually comes with a Cell Preparation Theorem (similar to Weierstrass preparation) which says that, given semi-algebraic functions from to , for some positive integers , , there is a partition of in finitely many cells mod on each of which
[TABLE]
where is a semi-algebraic function, and is as in (1). Using such a preparation, Cluckers has proved in [Clu01] that for every two infinite semi-algebraic sets , over a -adically closed field, there is a semi-algebraic bijection from to if and only if and have the same dimension.
Note that these semi-algebraic bijections are not continuous in general: for example Clucker’s theorem applies to the valuation ring , which is compact, and to , which is not. This lack of global continuity conditions is due to the fact that the cell decomposition techniques treat the various cells of the partition independently, without giving any information on how their frontiers touch each other. This is where triangulations come into the picture111A different improvement of cell decompositions facing this question is given by stratifications. Such stratifications have been recently introduced in -adically closed field [CCL12], and in more general non-standard Henselian valued fields [Hal14]. However their relationship with the -adic triangulation is quite unclear at the moment, due to the very peculiar conditions involved in the definition of -adic simplexes..
The real Triangulation Theorem says that every semi-algebraic set over is semi-algebraically homeomorphic to the union of a simplicial complex, that is (informally) a finite family of simplexes which touch each other along their faces. We have introduced in [Dar17] a notion of polytopes and simplexes adapted to . We delay precise definitions to Section 2 but give here some intuition on it. The -adic polytopes share many structural properties with their real counterpart:
- •
As inverse images by the valuation (in ) of subsets of , they are defined by very special (simple) systems of -linear inequalities.
- •
There is a notion of “faces” attached to them with good properties: every face of a polytope is itself a polytope; if is a face of and a face of then is a face of ; the union of the proper faces of is a partition of its frontier.
- •
Among the -adic polytopes, the simplexes are those whose number of facets is minimal222Real simplexes can be characterised, among the polytopes of a given dimension , as those whose number is minimal (namely ). in a very strong sense: a simplex has at most one facet, which is itself a simplex.
- •
Last but not least, every -adic polytope can be divided in simplexes by a certain uniform process of “Monotopic Division” which offers a good control both on their shapes and their faces.
Just as in the real case, we can then define a simplicial complex over essentially as a finite family of simplexes in , for some positive integer , which touch each other along their faces (again, see Section 2 for a more precise definition). A simplified version of our main result, the Triangulation Theorem 2.20, can then be stated as follows.
Theorem** (Triangulation).**
For every semi-algebraic set there is a semi-algebraic homeomorphism whose domain is the union of a simplicial complex .
Moreover, given semi-algebraic functions from to , can be chosen so that on every the valuation of each is a -linear function of the valuations of the coordinates of .
**Remark 1.1. ** The simplexes in the above complex are not contained in but in finitely many copies of for various , usually much larger than . This is the main, but harmless, difference with the triangulation in the real case.
In the real case, cell decomposition and triangulation hold not only for semi-algebraic sets over but also over any real-closed fields, and more generally for definable sets in -minimal expansions of such fields. In the -adic case, Denef’s Cell Decomposition Theorem holds in arbitrary -adically closed fields. Several variants of it, sometimes weaker, have been proved to hold in some, if not all, -minimal expansions of such fields (see [DvdD88] and [Clu04] for subanalytic sets, [HM97], [CKDL17], [CKL16], [CCKL17] and [DH17] for definable sets in -minimal and -optimal structures).
In the present paper we do not restrict ourselves to and its finite extensions, but work in an arbitrary -adically closed field fixed once and for all. Apart of the -adic fields there are many natural examples of such: the algebraic closure of inside (which is not complete), the -adic completion of the field of Puiseux series over (whose value group is not , but lexicographically ordered), and many others (every ultraproduct of -adically closed fields is still -adically closed). We let denote the (unique) -adic valuation of , its valuation ring and its value group. As usual is augmented by an element for , and we let .
Almost all the arguments in our proofs remain valid for definable sets in -optimal structures on satisfying the Extreme Value Property (see [DH17]). Unfortunately there is one single exception: the proof of the Good Direction Lemma 4.5, which involves polynomial functions, does not generalize to the more general “basic functions” involved in the definable sets in -optimal structures. Thus we will stick to the semi-algebraic framework in all this paper.
It is organised as follows. All the needed prerequisites, in particular those concerning -adic simplexes, are recalled in Section 2, which culminates with the final statement of the Triangulation Theorem for semi-algebraic sets and functions in variables (Theorem 2.20). We denote it . All the applications presented below are then derived from in Section 3. By means of these applications and Denef’s Cell Preparation Theorem we prove in Section 4 a “largely continuous cell preparation up to a small deformation” for semi-algebraic functions in variables (Theorem 4.7). Sections 5 to 7 are then devoted to our main constructions, which are summarized in Lemma 6.1 and Lemma 7.11 (see also Remark 1 below). In Section 8, we finally derive from by means of these two technical lemmas, which finishes the proof of our -adic triangulation theorem for every .
**Remark 1.2. ** Denef’s Cell Decomposition Theorem gives a partition of any semi-algebraic set in finitely many cells, but we do not control how these cells touch each other. On the other hand, if a cell is defined by functions , , which extend to continuous functions , , on the closure of , the frontier of naturally decomposes in cells, each of which is defined by means of , , . These auxiliary cells can be seen as “faces” of . It allows us to speak of “complexes of cells”, in a sense which will be made precise in sections 5 and 6. The main results of these sections prove that after only a linear deformation of , which can be chosen arbitrarily “small” (that is close to the identity), it is possible to decompose the image of in a complex of cells. Moreover one can require this complex to be a tree with respect to the specialisation order.
We now present several other applications of the Triangulation Theorem, all of which will be proved in Section 3.
Theorem** (Lifting).**
For every semi-algebraic function such that is continuous, there is a continuous semi-algebraic function such that .
In the above theorem is the usual -adic norm if . Otherwise this -adic norm is not defined but can be replaced without inconvenience by the following generalization: we let for every , and . The latter is naturally ordered by inclusion, and isomorphic to with the reverse order : if and only if . So is just a multiplicative notation for : we have and , and of course if and only if .
The real counterpart of the above result is quite obvious. On the contrary, the next two results do not hold in real geometry. In the same vein as Clucker’s result on classification of semi-algebraic sets up to semi-algebraic bijection [Clu01], they confirm the intuition that the lack of connectedness and of “holes” (in the sense of algebraic topology, see below) makes semi-algebraic sets over -adically closed fields much more flexible than over real closed fields.
Recall that a retraction of a topological space onto a subspace is a continuous map such that for every . When such a retraction exists on a Hausdorff space , then necessarily is closed in .
Over the reals, the main obstruction for the existence of retractions is the existence of “holes” which are detected by homotopy. This does not work over -adic fields. Indeed, replacing the unit interval in the reals by the unit ball in , that is the ring of the -adic valuation of , we may say that a non-empty semi-algebraic set is “semi-algebraically contractible” if there is a continuous semi-algebraic function and such that and for every . But this is always true: given any the function if is invertible in and otherwise, has all the required properties. However it is another story to prove that retractions actually exist.
Theorem** (Retraction).**
For every non-empty semi-algebraic sets , there is a semi-algebraic retraction of onto if and only if is closed in .
It is worth mentioning that it is the next Splitting Theorem, already conjectured in [Dar06], which was the main motivation for the research presented in this paper. Here denotes the topological frontier of , see Section 2.
Theorem** (Splitting).**
Let be a relatively open non-empty semi-algebraic subset of without isolated points, and a collection of closed semi-algebraic subsets of such that333Note that are not assumed to be disjoint. All of them can be equal to , for example. . Then there is a partition of into non-empty444A partition of a set is for us a family of two-by-two disjoint subsets of covering . We do not assume that the pieces must be non-empty. So when it happens by exception, like here, that this property is required and does not follow from the context, we explicitly mention it. semi-algebraic sets such that for .
The trivial remark that every ball is disconnected can be seen as a very special case of the above Splitting Property (applied to with ). This property is actually (in a sense which can be made precise, see [Dar]) the strongest possible form of disconnectedness that can be observed in a finite dimensional topological space whose points are closed. It is a versatile property which we encountered in different contexts with minor changes (see [Dar], [DJ18]). In the present paper, it plays a key role in the induction step.
A limit value for a function at a point adherent to , is a value such that is adherent to the graph of . Of course tends to at if and only if is the unique limit value of at . Let us say that is largely continuous on a subset of if the restriction of to has a unique limit value at every point adherent to , that is if extends to a continuous function on the topological closure of . If is not mentioned it simply means that is largely continuous on its domain . Finally is piecewise largely continuous if there exists a finite partition of in semi-algebraic pieces on which is largely continuous. Of course in that case has finitely many limit values at every point adherent to .
Theorem** (Largely Continuous Splitting).**
*Let be a semi-algebraic function whose graph has bounded555This boundedness assumption could easily be removed. It suffices to add to a point at infinity and require that has finitely many limit values in at every point of the closure of in , using the same construction as in the preparation of the proof of Lemma 3.3.
domain. If has finitely many limit values at every point adherent to then is piecewise largely continuous.*
The real counterpart of this result is easily seen to be true, by means of a triangulation and the trivial remark that every real simplex is connected (see Section 3). This last argument is no longer valid in the -adic case but, as we will see, the existence of retractions allows us to bypass this problem and recover the full result in the -adic context.
We can also mention two other applications of the Triangulation Theorem, to -adic semi-algebraic geometry and to model theory, which are outside of the scope of this paper.
- (i)
One of the main advantages of proving the Triangulation Theorem for every -adically closed field, not only for -adic fields, is that it allows us to combine it with the very powerful model theoretic compactness theorem. This in turn provides “uniform” triangulations, which almost give us for free a -adic analogue of Hardt’s Theorem666Hardt’s Theorem in real geometry says that the fibers of a semi-algebraic projection have finitely many homeomorphism types.. Some difficulties still remain because it is much less easy to construct homeomorphisms between -adic simplexes than between real simplexes (see Problem 2). Hopefully this will be addressed in a further paper. 2. (ii)
By [Dar06] the Splitting Property for -adic sets (which was only conjectural at this time) ensures that the complete theory of the lattice of closed semi-algebraic subsets of is decidable. This is in contrasts with the real case, since we know from [Grz51] that the complete theory of is undecidable for every . Moreover the theory of only depends on , not on the -adically closed field involved and not even on , hence it is the same for and (see [Dar]).
Finally let us present a few open problems tightly connected with the present work.
Problem 1**.**
Extend the Triangulation Theorem to -adic subanalytics sets, and more generally to definable sets in some -optimal expansions of .
Problem 2**.**
By giving reasonable sufficient conditions for different -adic simplexes to be homeomorphic, classify -adic semi-algebraic sets up to semi-algebraic homeomorphisms.
Problem 3**.**
For any semi-algebraic set , construct a triangulation such that the image of by is a stratification of . Or conversely use existing stratifications of (see footnote 1) to construct a better (or a more general) triangulation.
2 Prerequisites and notation
We let denote the set of positive integers and . For all integers we let be the set of integers such that (hence an empty set if ).
Recall that we have fixed once and for all a -adically closed field . Following [PR84], this is the fraction field of a (unique) Henselian valuation ring such that the residue field of is finite, the value group of has a least strictly positive element, and has exactly elements for every integer . We fix once and for all a generator of the maximal ideal of , and let denote the multiplicative group of invertible elements of .
Let denote the divisible hull of and . As an ordered group, identifies naturally to the smallest non-trivial convex subgroup of . We consider and as embedded into via this identification.
For every subset of we let . However, if is a subgroup of the multiplicative group of , we denote it in order to highlight this property (so but ). For every subgroup of we let for every , and . For example and . Abusing the notation, will be denoted [math] whenever the context makes it unambiguous.
In order to ease the notation, given , and we will often write for , for the direct image , for the composite , and similarly for and .
At some rare places it will be convenient to add to a new element (and to and new elements and respectively) with the natural convention that , , , , and for every . We also let and when needed.
2.a Topology and coordinate projections
When an -tuple is given, it is understood that are its coordinates, except if otherwise specified. For every we let
[TABLE]
This should not be confused with . For the (clopen) ball of center and radius is defined as
[TABLE]
The valuation induces a topology on , which is inherited by and . The topology generated on by the open intervals and the intervals for , extends the topology of . The direct products of these topological spaces are endowed with the product topology. For every subset of any of these spaces, denotes the topological closure of . In particular and . Note that is closed in . The specialisation preorder on the subsets of is defined by iff .
We let denote the frontier of . We say that is relatively open if it is open in , that is if .
When a function is largely continuous (see Section 1) we usually denote the continuous extension of to the closure of its domain. On the contrary, the restriction of to some subset of its domain is denoted .
The support of an element of (or ), denoted , is the set of indexes such that . The support of an element of , denoted , is the set of indexes such that . Note that with this definition, one has that for every
[TABLE]
For every subset of (resp. , resp. ) and every we let
[TABLE]
When we call it the face of with support . The coordinate projection of (resp. , ) onto its face with support will be denoted . So is the unique point with support such that for every .
For every (resp. , resp. ) we let denote the tuple of the first coordinates of , so that . If is a set of -tuples we let , and if is a family of such sets we let
[TABLE]
We call (resp. ) the socle of (resp. ).
Given two families , of subsets of we say that is finer than if every which meets a set is contained in . If moreover is a partition of we say that refines . We will often distinguish between “horizontal refinements” for which , and “vertical refinement” for which is the family of where ranges over and over a refinement of the socle of .
2.b Semi-algebraic sets
For every integer let with777The notation is sometimes used for the set of non-zero -th powers. The conventions used here leads to denote it , so as to highlight its multiplicative group structure.
[TABLE]
is a clopen subgroup of with finite index, and . Hence a subset is a semi-algebraic set if it is a boolean combination of finitely many sets defined by conditions
[TABLE]
where the ’s are -ary polynomial functions. A semi-algebraic map is a function whose graph is semi-algebraic. Rational functions, root functions and monomial functions (see below) are semi-algebraic, among many others.
Abusing a little bit the terminology, we also say that a subset of is semi-algebraic if is semi-algebraic. Similarly a function is semi-algebraic if its graph is. When a map is defined on the disjoint union of finitely many semi-algebraic sets living in different copies of , we say that is semi-algebraic if its restriction to each is semi-algebraic in the classical sense.
**Remark 2.1. ** If divides then is a clopen subgroup of with finite index. For this reason, all the integers appearing in (2) can be replaced by any common multiple . Note also that is an empty condition, equivalent to , hence all the ’s can be assumed to be non-zero polynomials.
Theorem 2.2** (Macintyre).**
If is semi-algebraic then is semi-algebraic.
This fundamental result has many consequences. The most prominent one is that a subset of is semi-algebraic if and only if there is a first-order formula888For the notion of first order formula, we refer the reader to any introductory book of model-theory, such as [Hod97] for example. in (the language of rings), possibly with parameters in , such that
[TABLE]
**Remark 2.3. ** Given -ary definable functions , , the set of points in satisfying the condition “” is known to be semi-algebraic999This follows from the non-trivial fact that is definable by means of the Kochen operator (see [PR84]).. Thus we will consider these expressions as abbreviations for some first order formulas in the language of rings stating the same property). Similarly, if is a formula with variables and is definable by a formula then we will consider as a formula since it is an abbreviation for the genuine formula .
Another important consequence of Macintyre’s theorem is that every -adically closed field is elementarily equivalent to a finite extension of (see [PR84]). In other words, there is a finite extension of such that and satisfy exactly the same parameter-free formulas in . The following property transfers from to by means of this elementary equivalence. Recall that a family of semi-algebraic subsets of is uniformly semi-algebraic if is definable and there is a formula with free variables such that for every .
Theorem 2.4**.**
Let be a uniformly definable family of non-empty, closed and bounded subsets of , such that implies that . Then is non-empty.
The next classical properties can easily be derived from this theorem (or transfered from to by elementary equivalence).
Theorem 2.5**.**
For every continuous semi-algebraic function whose domain is closed and bounded, is closed and bounded. As a consequence:
* is bounded and attains its bounds.* 2. 2.
If is injective then it is a homeomorphism from to .
Corollary 2.6**.**
For every bounded semi-algebraic subset of which is non-empty, there is an element such that is maximal on .
Another crucial property of the semi-algebraic structure on a -adically closed fields is the existence of so called “built-in Skolem functions” (see [vdD84], or the appendix of [DvdD88] for a more constructive proof). Basically, this property says that for every semi-algebraic subset of , the coordinate projection of onto has a semi-algebraic section.
Theorem 2.7** (Skolem functions).**
Let be semi-algebraic set and a formula with free variables. If, for every there is such that , then there exists a semi-algebraic function (called a Skolem function) such that for every .
For example, if a semi-algebraic function takes values in , then Theorem 2.7 applied to the formula saying that “” gives a semi-algebraic function such that .
There is a good dimension theory for semi-algebraic sets over -adically closed fields, see [SvdD88] and [vdD89]. We will repeatedly use the following properties of this dimension, for every semi-algebraic sets , and semi-algebraic map defined on . By convention .
if and only if is finite non-empty. 2. 2.
. 3. 3.
If , . 4. 4.
.
The local dimension of a semi-algebraic set at a point is the minimum of , for every semi-algebraic neighbourhood of in (with respect to the relative topology, induced by on ). is pure dimensional if it has the same local dimension at every point. Note that if a semi-algebraic set is open in and is pure dimensional then so is , and that a cell is pure dimensional if and only if its socle is. This last point, combined with Denef’s Cell Decomposition Theorem 4.1 and a straightforward induction, shows that every semi-algebraic set is the union of finitely many pure dimensional ones.
2.c Root functions and monomial functions
Following Lemma 1.3 in [CL12] there is for each integer a unique group homomorphism from to such that and for every . The construction of given in [CL12] shows that for each integer the set
[TABLE]
is semi-algebraic. is a clopen subgroup of with finite index. When then so the above definition of is compatible with the notation of the introduction.
If , Hensel’s Lemma implies that , hence is contained in . The importance of comes from the following property, which also follows from Hensel’s lemma (see for example lemma 1 and corollary 1 in [Clu01]).
Lemma 2.8**.**
The function is a group endomorphism of . If this endomorphism is injective and its image is .
In particular defines a continuous bijection from to . We let denote the reverse continuous bijection. In particular it is defined on for every , such that divides and .
For all positive integers , we let
[TABLE]
Analogously to Landau’s notation of calculus, we let denote any semi-algebraic function in the multi-variable with values in . Any such function is the product of two semi-algebraic functions, with values in and respectively. So, given a family of functions , on the same domain , we write that for every , when there are semi-algebraic functions and such that for every in
[TABLE]
is simply denoted .
**Remark 2.9. ** If for some then is well defined and takes values in . Therefore we can write .
A function is **-**monomial on if either it is constantly equal to or there exists and such that
[TABLE]
In this definition we use when necessary our convention that . A function is **-**monomial mod if with an -monomial function.
2.d Discrete and -adic simplexes
We say that is affine if either it is constantly equal to , or there are elements and for such that
[TABLE]
Polytopes101010In [Dar17] we introduced discrete polytopes in as “largely continuous precells mod ”, for an arbitrary -tuple of positive integers. In the present paper will not play any role so we remove it from the definition. in are defined by induction on . The only polytope in is itself (which is a one-point set). For every , a subset of is a discrete polytope of if is a discrete polytope of and if there is a pair of largely continuous affine maps from to , called a presentation of , such that and
[TABLE]
**Example 2.10. **
- •
is a discrete polytope with two facets and .
- •
is a discrete simplex, with proper faces and .
- •
and is a subset of defined by linear inequalities, whose proper faces and are linearly ordered by specialization. However the linear map defining is not largely continuous on : it has no limit when tends to in . Note that can not be defined by linear inequalities. Thus is definitely not a polytope, and so neither is .
All the references in the next proposition are taken from [Dar17].
Proposition 2.11**.**
Let and be a discrete polytope. Let be a largely continuous presentation of , let be a subset of , and . Finally let . Then if and only if either and on , or and on (Proposition 3.11). When this happens:
* (Proposition 3.3).* 2. 2.
The socle of is a face of : (Proposition 3.7). 3. 3.
* is a discrete polytope and is a presentation of it (Proposition 3.11):*
[TABLE]
We will also use the next result (Proposition 3.5 in [Dar17]).
Proposition 2.12**.**
Let be a discrete polytope, be an affine map and a face of . Assume that extends to a continuous map . Then is affine and if then . In particular if then .
A discrete simplex is a discrete polytope whose faces are linearly ordered by specialization. This is a “monohedral largely continuous precell mod ” in [Dar17]. Of course every face of a simplex is a simplex (see Remark 3.12 of [Dar17]).
For every we let and define **-**adic simplexes of index as the inverse images of discrete simplexes by the restriction of the valuation to . The faces of a simplex of index are obviously the pre-images in of the faces of . In particular they are linearly ordered by specialization. is closed if and only if is a singleton in . If is not closed, its largest proper face is called its facet and .
**Remark 2.13. ** With the notation of Proposition 2.12, if and then , and so by Proposition 2.12 . We will sometimes refer to the restriction of to (resp. ) as to “the coordinate projection of onto (resp. of onto )”.
**Example 2.14. ** is a simplex of index (it is the inverse image in of the discrete simplex in example 2.d). Intuitively we can visualise it (more exactly its image in ) in the next figure, with its faces and . More general simplexes will be defined by triangular systems of inequalities between norms of largely continuous monomial functions with rational exponents, hence their intuitive representations will usually have curved shapes.
\bullet$$F_{\{1\}}(S)$$F_{\emptyset}(S)$$S
2.e Simplicial complexes
We will have to consider complexes of sets, of cells and of simplexes. All of them are finite families of subsets of a topological space , organised in a such a way that one controls how the closures of these sets intersect.
Recall first that an ordered set is a tree if for every in , the set of elements in smaller than is linearly ordered. It is a rooted tree if it has one smallest element. A lower subset of is a subset of such that whenever an element of is smaller than an element of , it belongs to .
Now, given a finite family of pairwise disjoint subsets of , we call a closed complex if every is relatively open and if its frontier is a union of elements of . The specialization preorder is then an order on . If , ordered by specialization, is a tree (resp. a rooted tree) we call it a closed monoplex (resp. rooted closed monoplex). A complex (resp. monoplex) is then an arbitrary subfamily of a closed complex (resp. closed monoplex). Of course a complex is a closed complex if and only if is closed.
**Remark 2.15. ** Using that every semi-algebraic set is the disjoint union of finitely many pure dimensional ones, and that for every semi-algebraic set , a straightforward induction shows that every finite family of semi-algebraic subsets of can be refined by a complex of pure dimensional semi-algebraic sets.
A simplicial complex in (resp. in ) is a complex of simplexes in (resp. in ).
**Remark 2.16. ** We do not require in our definition of a simplicial complex in that different simplexes must have different supports. However it will follow from our construction that the simplicial complexes produced by do have this additional property and more: for every , if and only if (see Remark 7). So the tree , ordered by specialisation, is isomorphic to the set ordered by inclusion.
Let be a finite family of simplexes in (or ). Then is a simplicial complex if and only if for every , is the union of the common faces of and . When this happens:
is a monoplex; 2. 2.
every subset of in is again a simplicial complex; 3. 3.
is closed in if and only if is a lower subset of .
Let denote the family of all the faces of the elements of . We call it the closure of , and say that is closed if . Note that is a complex (resp. a closed complex) if and only if (resp. ) and the elements of are pairwise disjoint.
If is a simplicial complex, we say is a simplicial subcomplex of of if is a simplicial complex such that refines a lower subset of , and is a closed subset of .
The following results are respectively Theorem 6.3 and Proposition 6.4 of [Dar17].
Theorem 2.17** (Monotopic Division).**
Let be a simplex in and a simplicial complex in which is a partition of . Let be a definable function such that the restriction of to every proper face of is continuous. Then there exists a finite partition of such that is a simplicial complex in , contains for every a unique simplex with facet , and moreover \big{\|}u-\pi_{J}(u)\big{\|}\leq\big{|}\varepsilon(\pi_{J}(u))\big{|} for every , where .
Proposition 2.18**.**
Let be a relatively open set. Assume that is the union of a simplicial complex in . Then for every integer there exists a finite partition of in semi-algebraic sets such that for every .
Finally, a simplicial complex of index is a collection of finitely many111111Possibly zero if the index set is empty. rooted simplicial complexes in , for various integers . The closure of is the collection of the closures of the ’s. It has separated supports if each is. If is a collection of families of subsets of we let denote the disjoint union of the ’s. We say that is a simplicial subcomplex of if each is a simplicial subcomplex of .
Given a semi-algebraic homeomorphism from to a subset of , we will let
[TABLE]
If is closed, is obviously a closed monoplex of pure dimensional semi-algebraic sets partitioning .
**Remark 2.19. ** With as above, is closed if and only if is closed and bounded. Indeed, each is clopen in , hence its homeomorphic image by is clopen in . In particular is closed and bounded in if and only if so is each . Let be the semi-algebraic homeomorphism from to induced by restriction of . Note that is bounded (it is contained in ). By Theorem 2.5 applied to and it follows that is closed in , that is is closed, if and only if is closed and bounded in .
We can now state precisely our main result.
Theorem 2.20** (Triangulation ).**
Given a finite family of semi-algebraic functions and integers , for some integers which can be made arbitrarily large121212The exact meaning of “, can be made arbitrarily large” is a bit special here: it says that for any given integers and , the integers , can be chosen so that divides and . , there exists a simplicial complex of index and a semi-algebraic homeomorphism from the disjoint union of the simplexes in to such that for every in :
* is a partition of .* 2. 2.
* such that , is -*monomial mod .
We call the pair given by a triangulation of the ’s with parameters . When a finite family of semi-algebraic sets is given, the result of the application of to the indicator functions of the ’s is called a triangulation of .
3 Applications
In all this section we assume and derive some applications. The proof of the Triangulation Theorem goes by induction on , and most of the following applications are actually needed in the induction step. So it is important to emphasize that throughout this section, the integer will be fixed.
Theorem 3.1**.**
If is semi-algebraic and is continuous, then there exists a function semi-algebraic and continuous such that on .
*Proof: * gives a triangulation of with parameters . On every , with a -monomial function. Thus for some such that is contained in , there are in and in such that:
[TABLE]
Let and be defined by:
[TABLE]
By construction for every (in particular only depends on , even if the coefficients in (3) are not uniquely determined by on ). By assumption is continuous on hence so is on . In particular extends continuously to for every face of in , and the restriction to of such an extension is precisely . By proposition 2.12 it follows that if (that is if on ) then where denotes the coordinate projection of to (see Remark 2.d).
Now, for every in let be defined (by induction on ordered by specialization) as follows:
If on , . 2. 2.
If is minimal (with respect to the specialisation preorder) among the simplexes in on which then for every :
[TABLE] 3. 3.
Otherwise where is the coordinate projection (see Remark 2.d) of onto its smallest proper face in on which .
By construction for every hence on . Moreover for every face of in and every , tends to as tends to in (because if , and otherwise because on , on and is continuous by assumption).
The function defined by on every with in , is clearly semi-algebraic. By construction on , and by the above argument is continuous on .
Theorem 3.2**.**
For all non-empty semi-algebraic sets , there is a semi-algebraic retraction of onto if and only if is closed in .
*Proof: * One direction is general. For the converse we assume that is closed in . Let be a triangulation of , given by , and let be the family of simplexes in such that . It suffices to construct a continuous retraction of onto .
Let and be the identity map on . Because is closed in , is a lower subset of . Let be a positive integer and assume that there is a lower subset of containing , and a retraction of to . If we are done. Otherwise let be a minimal element (with respect to the specialisation order) in , and let131313We are abusing the notation here: is a finite collection of simplicial simplexes in for various , is a collection of lower subsets of , there is an index such that belongs to , and what we have denoted abusively is actually the collection of all the ’s for and of . . It only remains to build a retraction of onto . Indeed will then be a continuous retraction of onto , and the result will follow by induction.
If has no proper face in then it is clopen in . So the map which is the identity map on and which sends every point of to an arbitrary given point of is continuous on , and a retraction of onto .
Otherwise let be the largest proper face of in . By minimality of , belongs to . Let be the coordinate projection of onto . The frontier of inside is the closure of in , hence the function which coincides with the identity map on and with on is continuous. It is then a retraction onto , which finishes the proof.
The Splitting Theorem 3.4 is a strengthening of the next lemma using retractions.
Lemma 3.3**.**
Let be a relatively open semi-algebraic set without isolated points and an integer. Then there exists a partition of in semi-algebraic sets for such that for every .
We are going to prove Lemma 3.3 by using a triangulation of and applying Proposition 2.18 to . In order to ensure that this set is still relatively open, we first reduce to the case where is bounded by means of the following construction.
Let and for every let where
[TABLE]
Let , and for every let be defined by if , and otherwise. Clearly is semi-algebraic homeomorphism from to which extends uniquely to a homeomorphism from to .
*Proof: * Note first given a partition of in finitely many semi-algebraic pieces which are clopen in , it suffices to prove the result separately for each . Indeed, each will then be relatively open with (because is clopen in ), and (because and ). So, if a partition of each in semi-algebraic pieces is found such that for every , then the union of for defines a partition of in semi-algebraic pieces and we have (same argument as above) hence .
Now, as ranges over the subsets of , the sets form a partition of in semi-algebraic sets clopen in . By the argument above we can deal separately with each of these sets, hence we can reduce to the case where for some .
Let and be the closure of in . Note that . The fact that is closed in , hence in , implies that is closed in . It follows that its image under , which is precisely , is closed in , hence in . Thus is relatively open. It then suffices to prove the result for , that is we can assume that is bounded. Of course we can assume as well that is non-empty (otherwise and for is obviously a solution).
gives a triangulation of . is the disjoint union of finitely many simplicial complexes in for . Let for every , this defines a partition of in semi-algebraic sets clopen in . By using again the initial remark in this proof, it suffices to check the result for each separately. So we can assume that itself is a simplicial complex in for some .
By construction is semi-algebraic, closed and bounded, and is semi-algebraic and continuous, so for every semi-algebraic141414For every continuous map and every , if is closed then . The reverse inclusion holds if is compact, or if , , are semi-algebraic and is closed and bounded (see Theorem 2.5). . Let , we have hence is closed, that is is relatively open. Proposition 2.18 then applies to and gives a partition of in semi-algebraic sets such that for every .
For let . These semi-algebraic sets form a partition of , because form a partition of . Moreover, since is semi-algebraic, closed and bounded, we have for every semi-algebraic151515See footnote 14 set contained in . It follows that for we have , which proves the result.
Theorem 3.4**.**
Let be a relatively open non-empty semi-algebraic subset of without isolated points, and a collection of closed semi-algebraic subsets of such that . Then there is a partition of in non-empty semi-algebraic sets such that for .
*Proof: * is non-empty and has no isolated point, hence is infinite. The result is obvious for (there is nothing to prove) and (take ). By induction it suffices to prove it for . Indeed, if and the result is proved for , then the result for applied to with and gives a partition in two pieces , such that for , and the induction hypothesis applied to with gives a partition of in pieces such that for . The conclusion follows, by taking . So from now on we assume that .
It suffices to prove the weaker result that a partition exists with all the required properties for except possibly the condition that they are non-empty. Indeed, if such a partition is found and for example then necessarily . In that case pick any , and choose a clopen neighbourhood of such that is empty (this is possible because is relatively open). Then and give the conclusion.
Let be a continuous retraction of onto given by Theorem 3.2. Let be any semi-algebraic set open in , its closure and . We are claiming that . Note that is closed in by continuity of , because is the inverse image of the closed set by . So it suffices to prove that , or equivalently that contains and is contained in . For the first inclusion let be any element of , and any neighbourhood of . We have to prove that . By continuity of at there is a neighbourhood of such that is contained in . In particular
[TABLE]
so . On the other hand, because is a neighbourhood of and . A fortiori is non-empty. This proves that , hence that . Conversely, if is any element of , there is a neighbourhood of such that is disjoint from . By continuity of , is then a neighbourhood of in . It is disjoint from hence . So is disjoint from . That is , which proves our claim.
Let and . For let . Let be the closure of and . The above claim gives that for . Let be the set of non-isolated points of . Clearly since is finite. In particular is relatively open, and Lemma 3.3 gives two semi-algebraic sets , partitioning such that . So if we set and we get the conclusion.
Theorem 3.5**.**
Let be a semi-algebraic function with bounded graph (that is is a bounded function on a bounded domain). If it has finitely many limit values at every point of then is piecewise largely continuous.
Note that the counterpart of Theorem 3.5 for real-closed fields holds. Indeed, by triangulation we can reduce to the case of a continuous function on a simplex . The assumption that has finitely many limit values at every point of then implies directly that is largely continuous. Indeed, this follows easily from the fact that over real-closed fields the direct image by a continuous semi-algebraic map of any semi-algebraically connected set (such as with a ball centered at any point of ) is again semi-algebraically connected.
On the contrary, -adic simplexes are not at all semi-algebraically connected and it can happen that a function satisfying all these assumptions on a -adic simplex is not largely continuous. For example on the simplex the semi-algebraic function defined by if and otherwise is a continuous, bounded function having two distinct limit values at [math]. Thus is not largely continuous. It is obviously piecewise largely continuous, though.
*Proof: * Every semi-algebraic function is piecewise continuous (see for example [Mou09]). So, replacing by its restriction to the pieces of an appropriate partition of if necessary, we can assume that is continuous. Removing if necessary (using a straightforward induction on and the fact that ) we can even assume that is relatively open. The proof then goes by induction on the lexicographically ordered tuples where and . If is empty, that is is closed, then is largely continuous and the result is obvious. So let us assume that (hence ) and the result is proved for smaller tuples .
Let . The projection of onto has finite fibers hence is a union of cells of type [math]. The number of these cells, say , then bounds the cardinality of these fibers, that is the number of limit values of at every point of . For every let . We first show that , that is for every . For every let . This is a uniformly semi-algebraic family of closed and bounded semi-algebraic subsets of . Each of them is non-empty because contains for any in (which is non-empty since ). Obviously whenever , so is non-empty by Theorem 2.4. This last set is equal to , which proves our claim.
For let be the set of such that has exactly elements. These sets form a partition of in semi-algebraic pieces. By Theorem 2.7 (and a straightforward induction) there are semi-algebraic functions such that for every . Since , by the induction hypothesis these functions are piecewise largely continuous. This gives a partition of in semi-algebraic pieces for , and a family of largely continuous semi-algebraic functions for such that and is the union of the graphs of all these functions .
Theorem 3.4 applied to and the sets for gives a partition of in semi-algebraic pieces such that . It suffices to prove that the restrictions of to each is piecewise largely continuous. So we can assume that and . That is, we have a semi-algebraic set dense in and largely continuous functions for such that has elements for every . Replacing by if necessary we can assume that is relatively open.
Let be a continuous retraction given by Theorem 3.2. For let
[TABLE]
Each is open in by continuity of , and the ’s. Their complements are closed in , hence . Moreover, for every , the limit values of at being by construction the pairwise distinct for , there exists such that every point of belongs to one of the ’s. In other words hence does not belong to the closure of . So , in particular hence the induction hypothesis applies to the restriction of to .
It only remains to check that the restrictions of to each are piecewise largely continuous. We are claiming that has only one limit value at every point of . Note that is the disjoint union of and , and that . Obviously, if then by continuity of , tends to as tends to in . Now if then , and for every . Hence by definition of , is closer to than to every other , so is the only possible limit value of as tends to in , which proves our claim. So the semi-algebraic function which coincides with on and with on is continuous. The frontier of its domain is contained in and is disjoint from , hence is contained in . By the induction hypothesis, is then piecewise largely continuous, hence so is since and coincide on .
4 Largely continuous cell decomposition
This section recalls the main theorem of [Den84] in order to emphasize some details which appear only in its proof. These details are important for us because they ensure that the functions defining the cells involved in the conclusions inherit certain properties, defined below, from the functions in the assumptions. Using them we are going to derive from a new preparation theorem for semi-algebraic functions “up to a small deformation” (Theorem 4.7). The point is that after such a deformation, we get a Cell Preparation Theorem involving only cells defined by largely continuous functions.
In order to do so, it is crucial for us to control the boundary of any cell we are dealing with. Ideally, we would like it to decompose naturally in cells defined by functions obtained for the functions defining by passing to the limits, just as it is done for the faces of discrete polytopes (Item 3 of Proposition 2.11). With this aim in mind, we now introduce a sharper notion of cell mod , for any clopen semi-algebraic subgroup of with finite index.
A presented cell mod in is a tuple with a semi-algebraic function on a non-empty domain with values in (called the center of ), and either semi-algebraic functions on with values in or constant functions on with values [math] or (called the bounds of ), and an element of (called the coset of ), having the property that for every there is such that:
[TABLE]
We say that is largely continuous if its center and bounds are. In any case the set of tuples satisfying (4) is a cell, in the general sense given in the introduction. When we want to distinguish this set from the presented cell we call it the cellular set underlying . Nevertheless, abusing the notation, we will also denote it most often. The conditions enumerated above (4) ensure that the domain of , , is exactly the socle of . When two presented cells and have the same underlying cellular set we write it .
From now onwards we will use the word “cell” mostly for presented cells but also very often for the underlying cellular sets, the difference being clear from the context. For instance we will freely talk of disjoint (presented) cells, of bounded (presented) cells, of (presented) cells partitioning some set and so on, meaning that the corresponding cellular sets have these properties. Also for any we will write both for this (cellular) set and for the presented cell . The latter will also be denoted . Similarly both denotes the graph of and the presented cell .
A presented cell is of type [math] if , of type otherwise. The type of is denoted . We say that is well presented if either is unbounded or . We call a fitting cell if it has fitting bounds, that is, for every :
[TABLE]
[TABLE]
Sometimes it will be convenient to write for some . We will always do this uniformly, so that whenever . To that end a set of representatives of is fixed once and for all, and when we consider a presented cell mod it is understood that is the unique element of . In addition, we require from this set of representatives that every has the smallest possible positive valuation. In particular if or and is a cell mod of type then .
For every family of presented cells in we let161616Here the letters stand for “center and boundaries”. denote the family of all the functions , , for . Given another family of presented cells in we say that:
belongs to if for every , are -linear combinations of functions for , and either is such a linear combination as well or . 2. 2.
belongs to if is finer than and for every , every contained in and every :
- (a)
either ; 2. (b)
or where is the product of (finitely many) linear combinations of functions such that and .
These somewhat cumbersome definitions help us to express Denef’s Cell Decomposition Theorem in a slightly more precise way than in [Den84].
Theorem 4.1** (Denef).**
Given a semi-algebraic subgroup of with finite index, let be a finite family of presented cells mod in . Then for every positive integer there exists a finite family of fitting cells mod refining such that is a partition of and belongs to and to .
This is essentially theorem 7.3 of [Den84]. Indeed, for any given integer , if is large enough then . Hence in conditions (2a), (2b) of the definition of can be written with a semi-algebraic function from to (thanks to Theorem 2.7). This is how the above result is stated in [Den84] with . Our slightly more precise form, as well as the additional properties involving and , appear only in the proof of theorem 7.3 in [Den84] (still with ). The generalization to fitting cells mod an arbitrary clopen semi-algebraic group with finite index in is straightforward171717Here is a sketchy proof. For each let be the cell mod with the same center of bounds as . Denef’s construction applied to the family of all these cells gives a family of cells mod refining . Each in is the union of a finite family of cells mod with the same center and bounds as , each of which is clopen in (because is clopen in with finite index). For each let be the family all the cells in contained in . The family gives the conclusion..
Given a polynomial function , we say that a function belongs to if there exists a finite partition of into definable pieces , on each of which the degree in of is constant, say , and such that the following holds. If then is identically equal to [math] on . Otherwise there is a family of -linearly independent elements in an algebraic closure of and a family of definable functions for and , and such that for every in
[TABLE]
and
[TABLE]
with the ’s in . If is any family of polynomial functions we let denote the set of linear combinations of functions in for in .
Theorem 4.2** (Denef).**
Let be a finite family of polynomials, with an -tuple of variables and one more variable. Let be an integer and a family of boolean combinations of subsets of the form with . For every integer there is a finite family of fitting cells mod refining , with center and bounds in , and for every such cell a positive integer and a semi-algebraic function such that for every :
[TABLE]
*Proof: * W.l.o.g. we can assume that every in is non constant and that is large enough so that . Theorem 7.3 in [Den84] gives a finite family of cells mod partitioning , and for each of them a positive integer and semi-algebraic functions and such that:
[TABLE]
Moreover the functions constructed in the proofs of lemma 7.2 and theorem 7.3 in [Den84] are precisely of the form for some semi-algebraic function on , and the functions , , constructed there belong to . Refining the socle of if necessary we can ensure that is constant as ranges over . On the other hand splits into finitely many cells mod , with the same center and bounds as , because has finite index in . On each of these cells , is constant by (5). Hence is either contained or disjoint from , for every . So the family of all these cells which are contained in gives the conclusion.
Using that every semi-algebraic function is piecewise continuous, the cells mod given by Theorem 4.2 can easily be chosen with continuous center and bounds. However it is not possible to ensure that they are largely continuous (think of the case where consists of a single semi-algebraic set which is itself the graph of a semi-algebraic function which is not largely continuous). Our aim, in the remainder of this section, is to find a work-around. We are going to prove that it can be done, not exactly for but for a function where can be chosen arbitrarily small and is the linear automorphism of defined by:
[TABLE]
**Remark 4.3. ** The smaller is, the closer is to the identity map since is also the norm (in the usual sense for linear maps) of . So the functions can be considered as “arbitrarily small deformations” of .
In [vdD98] a good direction for a subset of is defined as a non-zero vector such that every line directed by has finite intersection with . It is more convenient to identify such collinear vectors hence we redefine good directions for as the points in the projective space such that every affine line in directed by has finite intersection with .
Analogously we call a geometrically good direction for a family of polynomials in if for every algebraic extension of and every , is a good direction for the zero set of in .
**Remark 4.4. ** With the above notation, is a good direction for if and only if the projection of onto has finite fibers. Indeed for every and every we have:
[TABLE]
Therefore is a geometrically good direction for if and only if for every algebraic extension of and every , the projection onto of the zero set of in has finite fibers.
Lemma 4.5** (Good Direction).**
For every finite family of non-zero polynomials in , the set of geometrically good directions for contains a non-empty Zariski open subset of . In particular, for every non-zero there is such that and is a good direction for .
*Proof: * Let be the product of the polynomials in , and its total degree. Then can be written as with a non zero homogeneous polynomial of degree and a polynomial of total degree .
Let be non-zero and the corresponding point in . It is not a geometrically good direction for if and only if for some algebraic extension of and some the line is contained in the zero set of in , that is for every or equivalently . This implies that the degree in of is . In particular the coefficient of in is zero. A straightforward computation shows that this coefficient is just .
So every element in which is outside the zero set of is a geometrically good direction for . This proves the main point. Now if is identified with its image in by the mapping then every ball in is Zariski dense in , so the last claim of the lemma holds.
Lemma 4.6**.**
Assume . Let be such that is a geometrically good direction for . Let be as in (6) and . Then every function in whose graph is bounded is piecewise largely continuous.
*Proof: * The functions in are linear combinations of functions in for , hence it suffices to fix any in and prove the result for . Let be the degree in of , and a Galois extension of in which every polynomial in of degree factors. Given a basis of over , for each integer let be the coefficient of in , let be the set of elements such that has degree in , and choose a family of semi-algebraic functions such that for every
[TABLE]
Let denote the zero set of in , and be the list of -automorphisms of . Fix an integer , and for every let
[TABLE]
For every we have
[TABLE]
Inverting the matrix gives for every the function as a linear combination of for . By construction is contained in . This set is closed, hence is contained in too.
The projection of onto has finite fibers since is a good direction for (see Remark 4). So the same holds for the closure of the graph of . This means that each has finitely many different limit values at every point of . Obviously each inherits this property, hence so does every . If moreover the graph of is bounded, it then follows from Theorem 3.5 (using ) that is piecewise largely continuous.
Now we can turn to the “largely continuous cell preparation up to small deformation” which was the aim of this section. We obtain it by combining the above construction based on good directions and the classical cell preparation theorem for semi-algebraic functions from Denef (Corollary 6.5 in [Den84]) revisited by Cluckers (Lemma 4 in [Clu01]).
Theorem 4.7**.**
Assume . Let be a finite family of semi-algebraic functions whose domains are bounded. Then for some integer and all integers there exists a tuple , an integer , an integer divisible by , and a finite family of largely continuous fitting cells mod , such that refines and such that for every , every contained in and every
[TABLE]
where is as in (6), is a semi-algebraic function and .
Moreover the set of having this property is Zariski dense (in particular can be chosen arbitrarily small), and the integers , can be chosen arbitrarily large (in the sense of footnote 12).
**Remark 4.8. ** The above expression of is well defined because divides , and belongs to for every (see the definition of on after Lemma 2.8). Of course if is of type [math], then and we use our conventions that and .
If we were only interested in the existence of such a preparation theorem with largely continuous cells for , the integer would be of no use and could be taken equal to . However it will be convenient to allow different values of when we will use Theorem 4.7 in the proof the Triangulation Theorem.
*Proof: * Let be arbitrary integers. Corollary 6.5 in [Den84] applied to each gives an integer and a family of semi-algebraic sets partitioning such that for every every in and every in :
[TABLE]
where is a semi-algebraic function from to and , are polynomial functions such that on . Replacing if necessary each by a common multiple of them and of , we can assume that for every and is divisible by . Let be a refinement of .
Fix any two integers and any integer such that and . Since is a subgroup of with finite index, every splits into finitely many semi-algebraic pieces on each of which is constant modulo (for every such that ). Thus, refining if necessary, (8) can be replaced, for every in contained in and every in , by
[TABLE]
with .
Each in is semi-algebraic. So there is a finite family of semi-algebraic sets refining , an integer and a finite list of non-zero polynomials in variables such that every element of is a boolean combinations of sets with . By Remark 2.b, can be chosen divisible by . Expanding if necessary, we can assume that all the polynomials and in (9) also belong to , except those which are equal to the zero polynomial.
Lemma 4.5 gives such that is a geometrically good direction for , where . Note that every set in is a boolean combination of sets with . Denef’s Theorem 4.2 applied to gives a finite family of fitting cells mod which refines and whose center and bounds belong to , such that for every , every and every
[TABLE]
where is a semi-algebraic function and is a positive integer. We removed the zero polynomial from , but obviously (10) holds for as well, by taking in that case. Each is bounded hence so is their union as well as . So the center and bounds of every cell in must be bounded functions with bounded domain. By Lemma 4.6 (assuming ) these functions are piecewise largely continuous. Refining the socle of if necessary, and accordingly, we can then reduce to the case where every cell in is largely continuous. Note that , so by combining (9) and (10) we get that for every , every contained in and every
[TABLE]
where , is a semi-algebraic function and . For any integer , is a subgroup with finite index in hence every such cell mod splits into finitely many cells mod with the same center, bounds and type as . The integer can be chosen arbitrarily large, in particular greater than . Let be the family of all these cells . From (11) and Lemma 2.8 we derive that for every , every contained in and every
[TABLE]
where and with the unique cell in containing . The factor in (12) can be written by Remark 2.c. Thus (12) implies that takes values in . So by Theorem 2.7 there is a semi-algebraic function such that . As a consequence, from (12) it follows that there is a semi-algebraic function with values in such that for every
[TABLE]
By construction hence the factor can a fortiori be replaced by . Then (which is just ) replaces in (13), which proves the result.
5 Cellular complexes
For this and the next section, let be a fixed semi-algebraic clopen subgroup of with finite index. Then is a subgroup of with finite index, hence for some integer . Our aim in these two sections is to prove that every finite family of bounded largely continuous fitting cells mod , such as the one given by Theorem 4.7, can be refined in a complex of cells mod satisfying certain restrictive assumptions defined below.
Notation.
For every largely continuous fitting cell mod in with socle , recall that is a presented cell. For every semi-algebraic set contained in , is then also a largely continuous presented cell mod , provided the restrictions to of and either take values in or are constant, and the underlying set of tuples defined by
[TABLE]
is non-empty. Similarly, the sets and defined below are (if non-empty) largely continuous fitting cells mod contained in .
- •
if on , otherwise;
- •
if on , otherwise.
If non empty the underlying set of is the graph of the restriction of to , while the underlying set of is the set of satisfying (14). For example, when on and on , we can intuitively represent these sets as follows.
Y$$X$$\bullet$$c_{A}$$A$$\bullet$$\partial_{Y}^{0}A$$\partial_{Y}^{1}A
Provided that on , and either take values in or are constant, and are (if non-empty) largely continuous fitting cells mod contained in .
**Remark 5.1. ** If is a partition of , the family of non-empty for and form a partition of .
Given two cells , in and an integer , we write if and if there exists and a semi-algebraic function such that for every in :
[TABLE]
We call a **-transition for . If , are families of cells in we write if for every and such that meets . A -**system for is then the data of one -transition for each possible in .
**Remark 5.2. ** For any two finite families , of cells mod , if refines and belongs to then .
A closed -complex of cells mod is a finite family of largely continuous fitting cells mod such that is closed, the socle of is a complex of sets and for every if meets then for some , is a cell181818The condition is a cell means that on , and either take values in or are constant. and , with . If moreover we call a closed cellular complex mod . As the terminology suggests, we are going to prove that closed - and cellular complexes are complexes of sets in the general sense of Section 2 (see Proposition 5.3). Any subset of a closed -complex (resp. closed cellular complex) is a **-**complex (resp. a cellular complex. As usually we call them monoplexes if they form a tree with respect to the specialization order.
When is a -complex of cells mod , for all and for all cells , in such that meets , there is an integer and a semi-algebraic function such that for every in :
[TABLE]
An inner -system for is the data of one function as above for every possible .
Proposition 5.3**.**
Let be a closed -complex of cells mod . Then is a closed complex of sets. Moreover, for every and every if meets then .
*Proof: * By assumption the socle of every cell in is relatively open and pure dimensional. Thanks to the restrictions we made on the bounds in our definition of presented cells, it follows that is also relatively open and pure dimensional.
In order to show that is a partition, let , be two cells in which are not disjoint and let . Both and belong to and are not disjoint, hence . Since meets , by assumption is contained in with . But then meets , hence obviously is equal to . So , and equality holds by symmetry.
Now let be any cell in and . Since is a closed complex, every point of belongs to a unique . Since meets , by assumption with and . In particular , which proves that is a union of cells in (hence so is since is a partition and is disjoint from ). This proves that is a closed complex of sets.
The last point follows. Indeed, if meets then it is contained in for some , with . In particular meets . They are two pieces of a partition of (see Remark 5) hence . Therefore and , so . That is, is of type [math] and on , so .
Proposition 5.4**.**
Let be a finite family of largely continuous fitting cells mod and an integer. There exists a –complex of cells mod refining such that .
In the next section we will prove that one can even require that is a cellular monoplex mod .
*Proof: * The proof goes by induction on . If a -complex is found which proves the result for a family of cells mod containing then obviously the family of cells in contained in proves the result for . Thus, enlarging if necessary, we can assume that and are closed. By Denef’s Theorem 4.1 and Remark 5 there is a finite family of largely continuous fitting cells mod refining such that . Replacing by this refinement if necessary we can also assume that is a partition.
If is any vertical refinement of then obviously . Thus, by taking if necessary a finite partition refining and replacing by the corresponding vertical refinement (that is the family of all cells with and contained in ), we can assume that is a partition. By the same argument we can assume as well that for every and every contained in , the restrictions of and to take values in or are constant, hence (resp. ) is a cell with socle whenever it is non-empty. By Remark 2.e we can even assume that it is a complex of pure dimensional sets. Let be the family of with dimension . Note that every is open in because is a complex and .
For every let be the family of cells in with socle . For every cell of type such that , is contained in hence in since is closed and is a partition. It may happen that does not belong to . With Proposition 5.3 in view we have to remedy this. Every point in belongs to some cell in . This cell must be of type [math] otherwise the fiber would be open, hence it would contain a neighbourhood of and so would be contained in and meet , which implies that since is partition, in contradiction with the fact that meets . So there is a finite partition of in semi-algebraic pieces on each of which there is a unique cell of type [math] whose center coincides with on . Repeating the same argument for every and every gives a finite partition of finer then every such . Let be a complex of pure dimensional semi-algebraic sets refining . Replacing if necessary by the vertical refinement defined by , we can then assume from now on that for every in and every with socle , if then belongs to .
Let and be the union of and of the family of non-empty for , and . Clearly so the induction hypothesis gives a –complex of cells mod refining such that . A fortiori because the latter is contained in . So if we let , then refines and . It only remains to check that is a -complex, and first that is a complex of sets.
Note that hence is a partition, and every set in is pure dimensional and relatively open (by induction hypothesis for and by construction for ). For every , we have to prove that is a union of sets in . If this is clear because is a complex. Otherwise hence is a union of sets in (because is a complex). All these sets have dimension hence belong to . But refines , which contains , whose socle is , hence refines . Thus is also the union of sets in , hence of .
Now let be such that meets , let and . By construction and are cells (if non-empty) and cover . So there is such that is a cell which meets . We have to prove that . Note that meets the socle of , which is contained in , hence or because is a complex. So, if then also hence . In that case because is a –complex. Thus we can assume that , that is . We know that or . In the first case hence by construction, so because is a partition. In the second case hence . Now is contained in some because refines , and meets . By construction belongs to . Since it follows that hence a fortiori because and .
Before entering in more complicated constructions, let us mention here two elementary properties of fitting cells which will be of some use later.
Proposition 5.5**.**
Let be a cell mod of type . Then:
- •
* is a fitting bound if and only if or .*
- •
* is a fitting bound if and only if or ).*
*Proof: * The case where being trivial, we can omit it. If is a fitting bound then obviously because for every . Conversely assume that . Let be any element of . We have to prove that where . is bounded since , hence by Corollary 2.6 it contains an element of maximal norm. By construction . Assume for a contradiction that , that is . By construction and belong to hence . Thus , that is . Pick any such that and let . We have , and , hence . So and , a contradiction. The proof for is similar and left to the reader.
Proposition 5.6**.**
For every fitting cell mod in , if then .
Since , one may naively expect that , that is . The presented cell is a counterexample in : it is contained in (it is actually equal to ) and .
*Proof: * Assume the contrary, that is for some . Since is a fitting cell there is such that and . Since , hence implies that . So there are and such that and . In particular so . Now let , then since and . On the other hand and
[TABLE]
So and . Thus , a contradiction since and .
6 Cellular monoplexes
We keep as in Section 5 a semi-algebraic clopen subgroup of with finite index, and an integer such that . Lemma 6.1 below (together with Lemma 7.11) is the technical heart of this paper. This section is entirely devoted to its proof.
Lemma 6.1**.**
Assume . Let be a finite set of bounded, largely continuous, fitting cells mod in . Let be a finite family of definable functions with domains in . Let be a pair of integers. For some integers , which can be made arbitrarily large (in the sense of footnote 12), there is a tuple such that:
- •
* is a cellular monoplex mod refining such that .*
- •
* is a -*system for .
- •
* is a triangulation of191919Recall that denotes the family of center and bounds of the cells in . with parameters , such that .*
Note that, in order to obtain this result, it does not suffice to find a continuous monoplex of well presented cells mod refining such that , and then to select an arbitrary -system for and to apply to . Indeed, this will give a triangulation of . But will then be a refinement of , not itself. It is then tempting to vertically refine , that is to replace by the family of cells for and such that . This ensures that and is a cellular complex such that . But is no longer a monoplex.
In order to break this vicious circle we have to build , and simultaneously. The remainder of this section is devoted to this construction. It is divided in three parts: (6.a) preparation, (6.b) vertical refinement, (6.c) horizontal refinement.
6.a Preparation
Given a family of subsets of , we let denote the family of all the restrictions with and contained in the domain of . By the same argument as in the beginning of the proof of Proposition 5.4, we can assume that is closed. Finally, replacing if necessary by a refinement given by Proposition 5.4 and by with , we are reduced to the case where is a closed –complex of bounded cells mod . Enlarging if necessary, we can, and will, assume that it contains and an inner -system for . For some integers , which can be made arbitrarily large, gives a triangulation of with parameters . For every we let .
Since is bounded and closed in , its image by the coordinate projection is closed in by Theorem 2.5. Now is a homeomorphism from to , hence is closed by Remark 2.e.
Let be the family of cells for and such that , and let . Since every cell in has the same center and bounds as the unique cell in which contains it, clearly is still a closed –complex, contains and an inner -system for , and is still a triangulation of . Thus, replacing by if necessary, we can assume that , that is for every .
A preparation for is a tuple such that:
(P1)
is a simplicial subcomplex of . We let , and be the family of cells such that . Note that:
- •
is closed because is closed in .
- •
By Remark 2.e it follows that the image by of , that is the socle of , is closed too.
- •
Hence is closed because is the inverse image of its socle by the (continuous) coordinate projection of onto .
(P2)
is a cellular monoplex mod refining such that . For every we let . Note that is closed because .
(P3)
and is a -system for .
(P4)
together with the restriction of to , which we will denote , is a triangulation of with parameters . Note that, since refines and is a triangulation of , is also a triangulation of with .
**Remark 6.2. ** Obviously is preparation for . Given an arbitrary preparation for such that , and a minimal element in , it suffices to build from it a preparation such that . Indeed, contains one more element of than thus, starting from and repeating the process inductively we will finally get a preparation such that , hence . (P4) then implies that is a triangulation of with parameters . So the tuple satisfies the conclusion of Lemma 6.1, which finishes the proof.
So from now on, let be a given preparation for such that . Let be a minimal element in and . The minimality of ensures that every proper face of belongs to , hence and are closed.
Claim 6.3**.**
Let be a cell of type in , a simplex in contained in , and . If on then belongs to . If moreover on then is covered by the cells in that it meets, and among them there is a unique cell whose closure meets . More precisely:
[TABLE]
and either on , or on . In particular the closure of contains .
*Proof: * Note first that for every , is contained in hence in since it is closed by assumption. Every cell in which meets is contained in it since is a -complex, and belongs to (otherwise its socle would not meet since ). Since refines it follows that is the union of the cells in which it contains.
In particular, if on then hence it contains a cell . Necessarily is of type [math] since so is , and thus since they have the same socle . This proves the first point.
For the second point, since on both and are non-empty. Now is contained in the closure of , which is the union of the closure of the cells in contained in . Hence necessarily the closure of at least one of them, say , meets .
meets and both of them belong to so . Since meets and is disjoint from , must be of type with because otherwise would be closed in . It follows that is the union of and , and the latter meets . By the first point . By Proposition 5.3 applied to , . Thus , in particular they have the same center so . Pick any , so that . is contained in hence . Since it follows that hence .
This proves that . The uniqueness of follows. Indeed if is any cell in contained in whose closure meets , the same argument shows that . This implies that for any such that is small enough and belongs to , the point will belong both to and , so .
If we are done, so let us assume the contrary. Then for some . is a fitting cell so let be such that and . We have because , so . We are going to show that on . Since is a fitting cell it follows that is not contained in , so there is at least one other cell in contained in . Now is contained in and both of them belong to so . For each in fix in such that . Since is contained in we have:
[TABLE]
Necessarily because otherwise would belong both to and , a contradiction. Hence a fortiori . By Proposition 5.5 this implies that because and are fitting cells mod , and . So in that case, which proves our claim.
We can now begin our construction of a preparation for such that . We are going to refine twice. First “vertically”, according to the image by of a certain partition of which, together with , forms a simplicial subcomplex of refining (Claim 6.5). Then “horizontally” by enlarging the cells in contained in the closure of in such a way that the family of these new cells, together with , forms a cellular monoplex mod refining such that . The point of the construction is to ensure that comes with a -system for such that is a preparation for .
6.b Vertical refinement
Let be the list of proper faces of . We first deal with the case where is not closed, that is . For every in let:
[TABLE]
For every and every let be the formula saying that and that one of the following conditions hold, with :
(A1)t,ε:
and for every such that :
[TABLE]
and and
(A2)t,ε:
, and for every such that :
[TABLE]
and where is the cell given by Claim 6.3.
(A3)t:
.
Let be the conjunction of the (finitely many) ’s as ranges over and over . Finally let be the formula saying that that is maximal among the elements in such that . Obviously implies .
By continuity of the center and bounds of , for every there exists such that . Hence for every there is such that (every such that for every is a solution). For every , the set of elements of such that is semi-algebraic, bounded and non-empty. So by Corollary 2.6 there is such that is maximal in , that is . Theorem 2.7 then gives a semi-algebraic function such that for every , hence a fortiori:
[TABLE]
Claim 6.4**.**
Let be the semi-algebraic function defined above. Then the restriction of to every proper face of is continuous.
*Proof: * Note first that if for some and then for every where is the ball with center and radius .
Indeed, assume for example that , hence (A1) holds. It claims that for every
[TABLE]
and and . Now hence, as tends in to any given we get
[TABLE]
and and . By combining (16) and (17) with the triangle inequality we obtain that for every
[TABLE]
and , that is (A1).
Assume now that , hence , that is (A3)t holds. Then and imply that on because is a closed –complex (see footnote 18). So on , and (A3) follows.
The intermediate case (A2)t,ε where and is similar, and left to the reader.
Now it follows that if and , then if and only if . So for every such that . Thus is locally constant, hence continuous on .
Theorem 2.17 applies to , and the function . It gives a partition of such that is a simplicial complex, for each there is a unique with facet , and for every :
[TABLE]
where is the coordinate projection of onto (see Remark 2.d). On let . This is a continuous retraction of onto .
For every and every let
[TABLE]
Let if is closed, and be the facet of otherwise. Finally let .
Claim 6.5**.**
With the notation above, is a simplicial subcomplex of refining and containing . For every in and every , is a largely continuous fitting cell mod . Moreover if is not closed then:
If on , then for every :
[TABLE]
[TABLE] 2. 2.
If on , then for every :
[TABLE]
[TABLE]
where is the cell given by Claim 6.3.
*Proof: * By construction is clearly a simplicial complex refining , hence refining since refines . For every in and every , is a largely continuous fitting cell mod by (19), because so is . If moreover is not closed let be its facet, let be any element of , and , where is the coordinate projection of onto (see Remark 2.d). Note that hence , and similarly for and . By (15) we have .
If on then hence says that (A1)t,ε(t) holds for . By (18), so (20) and (21) follow from (A1)t,ε(t). Similarly, if on then (22) and (23) follow from (A2)t,ε(t).
This finishes the construction of the vertical refinement of if is not closed. When is closed we simply take . Claim 6.5 holds in this case too, for the trivial reason that there is no non-closed in .
**Remark 6.6. ** For every , if then for some . Indeed implies that (thanks to our definition of presented cells) hence belongs to : it is contained in , hence in since the latter is closed, in particular it meets at least one cell in , and the last point of Proposition 5.3 then gives that . Thus , and clearly .
6.c Horizontal refinement
For every we are going to construct for each a partition of , and for each in a semi-algebraic function such that:
(Pres)
and is a largely continuous fitting cell mod .
(Fron)
One of the following holds:
()
.
()
and for some .
()
for some , in which case is not closed, and:
[TABLE]
(Out)
and is a -transition for .
(Mon)
, , and are -monomial mod .
This last construction will finish the proof of Lemma 6.1. Indeed, assuming that it is done, let be the union of and all the cells in for and . Let be the union of the family of the corresponding functions and of . By Claim 6.5, is a simplicial subcomplex of such that . The assumption (P2) for , together with (Pres) and (Fron), give that is a cellular monoplex mod refining and that . The assumption (P3) for and , together with (Out) above, give that and is a -system for . Finally the assumption (P4) for together with (Mon) ensure that is a triangulation of with parameters . So is a preparation of , and since we conclude by Remark 6.a.
So let and be fixed once and for all in the remainder.
**Remark 6.7. ** Recall that is a triangulation of , and contains . In particular is -monomial mod hence a fortiori so is . By (19) hence . Thus is -monomial mod , and so are and by the same argument.
Let us first assume that is closed. We distinguish two elementary cases.
Case 1.1:
or .
Then is closed. We let and . (Pres), (), (Out) and (Mon) are obvious (using Remark 6.c for the latter).
Case 1.2:
.
We let and . Again (Pres), (Out) and (Mon) are obvious (same as Case 1.1). Moreover , which belongs to by Remark 6.b. If we let , we have and hence by the previous case. So and , which finishes the proof of the statement that () holds.
These cases being solved, we assume in the remainder that is not closed. Recall that is then the facet of and belongs to . By construction . For the convenience of the reader, each of the following cases is illustrated by a geometric representation of its conditions (almost like if we were dealing with a cell over a real closed field, except that the vertical intervals representing the fibres of over can be clopen). In these figures is represented by a gray area in , its bounds by dotted lines, its socle by the horizontal axe, by a dot on the left bound of , and by a thick line or dot on the vertical axe above .
Case 2.1:
on .
\bullet$$\bullet$$c_{A}$$E=A_{U}or\bullet$$\bullet$$c_{A}$$E=A_{U}
We let and . (Pres), (Out) and (Mon) are obvious as in the previous cases.
- •
Sub-case 2.1.a: or . Then is the closure of . The latter belongs to by Claim 6.3, which proves ().
- •
Sub-case 2.1.b: . Then is the closure of . By Remark 6.b, there is a cell such that . Then (because is a fitting cell) hence by the previous sub-case. So and , which proves that () holds.
Case 2.2:
on .
\bullet$$c_{A}$$E_{B_{1}}$$E_{B_{3}}$$c_{B_{2}}\circ\sigma_{U}=E_{B_{2}}$$B_{1}$$\bullet$$B_{2}$$B_{3}
In this case, by Claim 6.3, is the union of the cells which it contains. For every such , (because and ) and we let:
[TABLE]
These ’s form a family of two by two disjoint largely continuous cells because the various cells involved are so and:
[TABLE]
Each has socle and for every , belongs to . If is of type [math], then so is and (because is a fitting cell of type [math]) hence is a fitting cell. If is of type , then by Proposition 5.5 (because is a fitting cell of type ). That is hence is a fitting bound by Proposition 5.5. Similarly is a fitting bound, so is a fitting cell. This proves (Pres), and one can easily derive from (24) that so that () holds. Note also that is -monomial mod because so is and . The same reasoning applies to and . So the next claim finishes to prove that is a partition of and that (out), (Mon) hold.
Claim 6.8**.**
* and there is a semi-algebraic -transition for such that is -monomial mod .*
*Proof: * For every in , let us prove that belongs to . Since it suffices to prove that . By construction belongs to hence to so:
[TABLE]
By (21) and . Moreover by (20):
[TABLE]
Thus and by (25):
[TABLE]
Moreover by :
[TABLE]
Recall that , in particular hence by Hensel’s lemma. Since by (25) and , it follows that . So which proves that .
It remains to check that , and to find a -transition for . For every let:
[TABLE]
By (27) takes values in hence in since , thus for every :
[TABLE]
with in this case. We have and by (P3) . Since is a closed -complex this implies that for some we have . Let be a -transition function for , and a -transition function for . Then for some and every in we have
[TABLE]
and
[TABLE]
hence with and . So is a -transition function for . Moreover and are -monomial mod by (P4), hence so is . For every in , so
[TABLE]
Combining this with (28) and the definition of we get
[TABLE]
So and is a -transition for . Moreover by definition of . The coordinate projection of onto is obviously -monomial, and is -monomial mod by construction. So is also -monomial mod and we can take .
Case 2.3:
on and .
\bullet$$c_{A}$$E$$D$$\mu_{B_{1}}\circ\sigma_{U}=\mu_{E}$$\bullet$$B_{0}$$B_{1}$$\dots B_{3},B_{2}
Let and the two cells in given by claim 6.3. Let:
[TABLE]
If on then on by (23). Thus and have the same underlying set. In this case we let and properties (Pres), (Mon), () are trivially true. So is (out), using Remark 6.c for , , and (P4) for .
Otherwise on by Claim 6.3 and we let:
[TABLE]
on by Claim 6.3, on by (23), so on . Moreover is a fitting cell hence for every there is such that and , so . Thus is indeed a cell, with socle . It is actually a largely continuous cell, and is a fitting bound. Let us check that is a fitting bound too. is a fitting cell of type with socle hence by Proposition 5.5. But by Claim 6.3, and by construction, and so . Thus is indeed a fitting bound by Proposition 5.5.
Clearly is the disjoint union of and . Moreover the cells in contained in are exactly those contained in except and . Thus the construction that we have done for in case 2.2 applies to because on and because the analogues of conditions (20) and (21) that we used for in case 2.2 hold for in the present case. Indeed by (22) we have
[TABLE]
This is just condition (20) for since and . Moreover condition (21) for is:
[TABLE]
The first equality is true by definition of as . The second one is true because and because of (23).
So the construction of Case 2.2 gives a partition of and for each a semi-algebraic function202020Case 2.2 applied to actually gives for each a -transition for . But and so is also a -transition for and we can set . satisfying conditions (Pres), (), (out) and (Mon). Since also has these properties (with since on ) we can take .
Case 2.4:
on and .
\bullet$$c_{A}$$E$$D$$\mu=\nu_{D}$$\bullet$$B_{0}$$\dots B_{2},B_{1}
Let again be the cell given by claim 6.3. We are going to split in two cells and to which previous cases apply. In order to do so, choose any . For every let , the -th coordinate of . Clearly is largely continuous and on . So the function:
[TABLE]
is largely continuous on and on , hence also on . Note that is -monomial mod . Let:
[TABLE]
[TABLE]
and are largely continuous fitting cells mod which define a partition of . (Here we use that is a fitting cell: for every there is such that and so , which proves that is really a cell. That , are fitting cells and then follows from Proposition 5.5.) In particular satisfies condition (Pres). Since and on , we have . By Remark 6.b, for some , and by Sub-case 2.1.1 applied to , . This proves () for since . Let , this is a -transition for since they have the same center, so satisfies (out). It also satisfies (Mon), thanks to Remark 6.c for and because is -monomial mod .
Case 2.3 applies to because , on and on , and because the analogues of conditions (22) and (23) that we used for in case 2.3 hold for in the present case. Indeed (22) holds for because it holds for , and because and have the same center. Condition (23) for is:
[TABLE]
The first inequality is true because by construction, the second one is true by claim 6.3 and because , and the last equality is true because it is true for by (23) and because .
So the construction of case 2.3 gives a partition of and for each a semi-algebraic function212121Same remark as in footnote 20. satisfying conditions (Pres), (Fron), (out) and (Mon). Since also has these properties we can take .
7 Cartesian morphisms
Let be a cellular monoplex mod such that is a closed subset of . Let be a triangulation of with parameters such that for every , (we will denote it ). Note that this is essentially the data given by the conclusion of Lemma 6.1. The aim of this section is to build a triangulation of with the same parameters , together with a continuous projection such that the following diagram is commutative.
[TABLE]
We will make the assumption that with and . In addition we temporarily assume that is a rooted tree, and a simplicial complex in for some . We keep these data and assumptions until the end of this section, where we finally state our result in a more precise and slightly more general form.
The construction is done below through a series of claims, which are connected in the following way. The idea is to prepare the construction of , , by building first the tree of supports222222See Remark 2.e. of for , together with an epimorphism of trees from to . In order to do so, we construct a pair of trees of finite subsets of ordered by inclusion, and , which come naturally with increasing maps232323, and are ordered by specialisation, while and are ordered by inclusion. making the following diagram commutative (see Claim 7.3 and the comments after).
[TABLE]
For each , a simplex will then be constructed inside (for some large enough), together with a semi-algebraic isomorphism and a semi-algebraic projection defined by means of these maps from to and from to . This will ensure not only that the following diagram is commutative (Claim 7.7)
[TABLE]
but also that is a simplicial complex (Claim 7.8) and that the resulting maps , defined by glueing all the local maps , are continuous on (Claims 7.5 and 7.9).
Claim 7.1**.**
The faces of are exactly the sets with in .
*Proof: * Let in , and . Then, with the notation of Section 5, because is a cellular complex. Since is bounded, the socle of is closed hence must be contained in it. Since , it follows that is a face of . Conversely for every face of , the set (resp. ) is non-empty if (resp. ) hence belongs to . One of these two cases necessarily happens (because on ), which gives such that .
Claim 7.2**.**
Given any two cells in , if and only if either or . In particular if is the predecessor of in then either is the facet of , or , in which case and
*Proof: * Recall that with and . In particular with and . Thus if and only if or . Since by the previous claim, and obviously (otherwise ) this proves the equivalence. In particular if then hence and .
If is the predecessor of in and , then by Claim 7.1. Let be the facet of . Then hence . On the other hand is the predecessor of in , hence . So and finally .
Given a strictly increasing map with and , we let be defined by where if , and otherwise. We say that a function is a Cartesian map if for every the restriction of to is of that form, that is if there is and a strictly increasing map such that for every with support . If is the disjoint union of finitely many sets for various , then a Cartesian map on is simply the data of a Cartesian map on each . A Cartesian morphism is a continuous Cartesian map.
Claim 7.3**.**
There exists a pair of functions , from to such that is strictly increasing and for every and every in :
(C0)
If then .
(C1)
If then for some .
(C2)
.
(C3)
* (in particular is increasing and ).*
(C4)
If denotes the increasing bijection given by (C2) then .
(C5)
If then .
According to this claim, is an increasing bijection and an increasing surjection. Thus is an increasing surjection. and are respectively the maps and in the diagram (29) at the beginning of this section. The maps and are and respectively. The last242424The dashed map from to is just the compositum of . map, from to , is . This is a well defined increasing map by (C5), and obviously a surjective one. The commutativity of the diagram follows by construction.
**Remark 7.4. ** Since and are strictly increasing, (C4) implies that for every .
*Proof: * The construction goes by induction in . For the root of we let , if , and if (recall that is a simplicial complex in ). If we are done. Otherwise let be a maximal element of and apply the induction hypothesis to . This defines , for every so that is strictly increasing on and properties (C0) to (C4) hold for every in .
Let be the predecessor of in and . For every let and . Clearly and inherit all the properties of and . Thus, replacing if necessary and by and we can assume that for every .
Let be the maximum of the integers in all these sets . We have to define and so that the resulting maps , satisfy: (C0) to (C5) for every and every in ; and if . By the induction hypothesis it suffices to check these properties when , and .
We are going to build first, and then let . Let be an enumeration of . Let and . For every there is a unique such that . We then let (if we let in this definition). Note that and hence
[TABLE]
It follows immediately that is strictly increasing. Let , by construction (C2) and (C4) hold, and is strictly contained in except if . Note also that in any case . Finally (C5) holds because:
- •
If then by construction (because hence ). So by the induction hypothesis, and since we get .
- •
If then in particular , hence by construction and . This last point implies that , hence since . On the other hand implies that by the induction hypothesis. So altogether and a fortiori .
It remains to define and to check (C1) and (C3). We distinguish four cases, according to the types of and , and apply Claim 7.2 to each of them.
Case 1:
, hence and is the facet of . In particular is strictly contained in , hence so is in . By the induction hypothesis (C0), . Let , then , and (C0), (C3) are obvious.
Case 2:
, and . Then by construction, and by the induction hypothesis (C0). Let , then , and (C1) are obvious because , and which proves (C3).
Case 3:
, and is the facet of . We let . By the induction hypothesis (C0) . By construction . So , and (C1) are obvious because . As in Case 2, which proves (C3).
Case 4:
and is the facet of . By the induction hypothesis (C1), is strictly contained in . Let . Then , because , which proves (C3), and (C1) follows because then is a singleton by the induction hypothesis (C1).
With the notation of Claim 7.3, let be the maximal element of and . For every let . Finally let be the resulting Cartesian map.
Claim 7.5**.**
* is continuous, hence a Cartesian morphism.*
*Proof: * We have to show that for every in and every , tends to as tends to in . By construction there are , in such that , , and . Since is obviously continuous, it tends to so we have to prove that . Let and . Recall that and for every , if , otherwise, if , and otherwise.
Since we have , that is , hence since is strictly increasing. In particular hence for every , we have if , and by Remark 7 if , that is in this case too. The remaining case occurs when , so that and . We have to prove that , that is . By (C4) and the assumption on , . By (C3), . So , and we are done since .
For every , is -monomial mod so there are and some integers for such that for every
[TABLE]
If then by Proposition 5.5, and by the above displayed equation . So there is such that . Let be defined by252525We remind the reader that is a cell mod with . . If then we let for every . Define accordingly. By construction, for every we have
[TABLE]
In particular (resp. ) is uniquely determined by (resp. ), even if the coefficients are not.
**Remark 7.6. ** Since is a fitting cell mod contained in , by Proposition 5.6. On the other hand (see Section 2). So, for every we have by (30):
[TABLE]
Let be defined as follows.
- •
If , is the set of such that .
- •
If , is the set of such that and .
In both cases, for every let
[TABLE]
where (if , which happens when is a point, then is not defined but in that case , hence and we can let by convention).
Claim 7.7**.**
* and is a bijection from to .*
*Proof: * If the result is trivial because in that case hence the restriction of to is a bijection onto . So from now onwards we assume that , hence and by (C1).
Let be such that . Then and
[TABLE]
These two equations imply that . Since and it follows that by Lemma 2.8. On the other hand implies (because is one-to-one), that is for every (because by construction). Thus for every , that is since . This proves that is one-to-one.
Let us check now that . Pick any , let and . Since and we have . Recall that , hence by Lemma 2.8 there is a unique such that , hence . On the other hand we have so by (30)
[TABLE]
In particular by Remark 7 so . Similarly by (31). Let be such that if , if , otherwise. Then , and since , so belongs to . By construction , which proves that .
We turn now to . For every , so there is such that . The above construction gives such that . In particular , so , which proves that . Since by definition of we get that .
It only remains to show that . Pick any , let and . Since , we have . Since , by Lemma 2.8 . Hence belongs to . We have by definition of , so by (30)
[TABLE]
The left hand side is equal to . For the right hand side we have
[TABLE]
So , that is . Similarly hence .
Claim 7.8**.**
* is a simplex in , whose faces are exactly the sets with in .*
*Proof: * Let and . Let (resp. ) be the strictly increasing map from to (resp. from to ). By construction and by Claim 7.5 the following diagram is commutative (vertical arrows are the natural coordinate projections).
[TABLE]
The horizontal arrows in this diagram are isomorphisms. All of them are obtained simply by an order-preserving renumbering of the coordinates, hence they preserve the faces and the property of being a simplex. It will then be convenient here to identify isomorphic spaces, hence to consider and . Since by Claim 7.7, after this identification is just the image of by the coordinate projection of to . Since we identify also with , and with .
If then , and the vertical arrows are identity maps. Thus identifies with . In particular is a simplex. Every is also of type [math] and identifies to . The conclusion follows by Claim 7.1.
From now on, let us assume that . Then hence is just the socle of . Similarly, is the socle of for every (if we have ). By construction is the inverse image of by the valuation (restricted to ) and
[TABLE]
Since and are largely continuous on , (30) and (31) imply that is largely continuous on . They are affine maps by definition. Since by Remark 7, and because , it follows that is a polytope in . We are going to check that its faces are exactly the sets for in . This will finish the proof since will then have the expected faces, which implies that is a simplex because these faces form a chain by specialisation (because is a tree).
Step 1.
Let in , then with and . Let and . Since , if we have by construction
[TABLE]
This remains true also if because in that case and on (because on ) so the right hand side is just , that is (because when ). In both cases we also have , because is a face of by Claim 7.1 and . So the description of given by (32) coincides with the description of given by Proposition 2.11, which proves that .
Step 2.
Conversely let be a face of , for some , and let . By Proposition 2.11 the socle of is (because is the socle of ) and two cases can happen: and on , or and on . In both cases
[TABLE]
Since is a face of , by Claim 7.1 there is in such that . Let .
If then by Proposition 2.11, on . That is on , hence . Let and apply Step 1 to . Since is the support of and of (because ), we deduce from (32) and (33) that .
If then by Proposition 2.11, on . That is on , hence . Let and apply Step 1 to . Since is the support of and is the support of (because ), we deduce from (32) and (33) that .
Finally let and be defined by for each .
Claim 7.9**.**
* is a homeomorphism from to .*
*Proof: * We already know by Claim 7.7 that is a bijection from to . It follows from Claim 7.8 that is closed, and it is obviously bounded. Thus by Theorem 2.5 it suffices to show that is continuous. Since each is obviously continuous on , we only have to prove that for every and , tends to as tends to . By Claim 7.8 there is in such that , hence . By Claim 7.5, tends to . By Claim 7.7, and hence tends to , which is equal to since . Thus it only remains to check that tends to .
If then also hence and we are done, since . If then (because is a cellular complex) and (because by (C1) and (C3), implies that is not contained in , hence since ). Hence obviously tends to in that case. Finally if and then (because by (C0) and (C3), ), hence since . Thus tends to , which proves the result because since .
**Remark 7.10. ** By construction and for every , hence if and only if (because is strictly increasing), which implies that by Claim 7.9. So for every we have
[TABLE]
We can recap now our construction and state the result which was the aim of this section.
Lemma 7.11**.**
Let be a cellular monoplex mod such that is a closed subset of . Let be a triangulation of with parameters such that and for every , (let us denote it ). Then there exists a simplicial complex of index , a Cartesian morphism and a semi-algebraic homeomorphism such that for every , (let us denote it ) and for every
[TABLE]
where262626If then is not defined but in that case is a point, hence so is so and we can let by convention. .
*Proof: * Let be the list of minimal elements in , and for each let be the family of elements in greater than . This is a rooted, cellular monoplex mod . For every , is the union of the cells in since is a cellular complex and is closed. All these cells belong to hence is closed. Since is the union of the finitely many other it is closed, hence is clopen in . Let , this is a lower subset of with smallest element hence a rooted simplicial complex in for some . Finally let be the restriction of to .
Claims 7.1 to 7.9 apply to and give a simplicial complex in for some , a Cartesian morphism and a semi-algebraic homeomorphism satisfying all the required properties. Since each is clopen in , and each is clopen in , the conclusion follows by taking for the family and for (resp. ) the map obtained by glueing together the various (resp. ).
8 Triangulation
We have come up to the moment when we can show that . As is rather obvious, this will finish the proof of for every .
Theorem 8.1**.**
Assume . Let be a finite family of semi-algebraic functions, and be any integers. Then for some integers which can be chosen arbitrarily large (in the sense of footnote 12), there exists a simplicial complex of index and a semi-algebraic homeomorphism such that for every in :
* is a partition of .* 2. 2.
* such that , is -*monomial mod .
*Proof: * By using the same partition of as in the proof of Lemma 3.3 we are reduced to the case where each is contained in . We can also extend each to by an arbitrary value, and add to this family the indicator functions of each inside , hence assume that all these functions have domain , which is closed and bounded. Let and be any integers.
Theorem 4.7 applies to . It gives an integer , a tuple , a linear automorphism of (note that since ), a pair of integers and such that divides , and a finite family of largely continuous cells mod partitioning such that for every , every and every
[TABLE]
where is a semi-algebraic function and .
Let , Lemma 6.1 applied to and the family gives a pair of integers and , a cellular monoplex mod refining such that , a -system for , and a triangulation of with parameters . Moreover can be chosen arbitrarily large, in the sense of footnote 12, so we can require that divides and , and that and .
is a subgroup of (because ) with finite index. Hence every cell in is the disjoint union of finitely many cells mod with the same socle and bounds as . Since , these cells are still fitting cells by Proposition 5.5. One easily sees that they form a cellular monoplex refining such that and is a -system for . Moreover and so is a triangulation of with parameters such that for every .
Since , Lemma 7.11 applies to and . It gives a simplicial complex of index , a Cartesian morphism and a semi-algebraic homeomorphism such that maps each in onto some in , and for every in
[TABLE]
where272727See footnote 26. . Let , this is a semi-algebraic homeomorphism from to . We are going to check that is -monomial mod for every and every . This will prove the result, with and .
So pick any , let and be as above. There is a unique containing , a unique containing . For every let . Let and be defined accordingly. Note that on because has the same center as by construction. For every , by (34) and (35) we have
[TABLE]
We have so the factor can be replaced by . Recalling that is a triangulation of with parameters , that is a Cartesian morphism and , we get that the second factor is -monomial mod hence a fortiori -monomial mod since divides and . So it only remains to prove that the last factor is -monomial mod . It suffices to prove it for .
We can assume that otherwise and the result is trivial (see Remark 4). Recall that and is a -system for . For every we then have
[TABLE]
with and (depending on , ). So by (35) we have
[TABLE]
is a triangulation of with parameters hence is -monomial mod . So (36) implies that is -monomial mod , hence so is . Let and be semi-algebraic functions that for every
[TABLE]
with , . Let , by construction divides hence . Since , each (because ) hence . A fortiori belongs to hence takes values in and is -monomial:
[TABLE]
But also takes values in because for every , and since divides and . Thus takes values in as well. So does the factor since . Hence finally for every , so is well defined. Note that hence . Pick any such that , and for every let . This is a semi-algebraic function taking values in because
[TABLE]
By Remark 2.c, because , and by definition . Altogether this gives that
[TABLE]
Thus is -monomial mod (because so is ). It is a fortiori -monomial mod since by construction.
Acknowledgement.
The idea of the proof of the Good Direction Lemma 4.5 was given to me at the beginning of this research (more than fifteen years ago) by my colleague Daniel Naie. I would also like to thank Immanuel Halupczok and Georges Comte for very helpful recent discussions on stratifications.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[CCKL 17] Saskia Chambille, Pablo Cubides Kovacsics, and Eva Leenknegt. Clustered cell decomposition in P 𝑃 P -minimal structures. Ann. Pure Appl. Logic , 168(11):2050–2086, 2017.
- 2[CCL 12] Raf Cluckers, Georges Comte, and François Loeser. Local metric properties and regular stratifications of p 𝑝 p -adic definable sets. Comment. Math. Helv. , 87(4):963–1009, 2012.
- 3[CKDL 17] Pablo Cubides-Kovacsics, Luck Darnière, and Eva Leenknegt. Topological cell decomposition and dimension theory in p 𝑝 p -minimal fields. J. Symb. Log. , 82(1):347–358, 2017.
- 4[CKL 16] Pablo Cubides-Kovacsics and Eva Leenknegt. Integration and cell decomposition in P-minimal structures. J. Symb. Log. , 81(3):1124–1141, 2016.
- 5[CL 12] Raf Cluckers and Eva Leenknegt. A version of p 𝑝 p -adic minimality. J. Symbolic Logic , 77(2):621–630, 2012.
- 6[Clu 01] Raf Cluckers. Classification of semi-algebraic p 𝑝 p -adic sets up to semi-algebraic bijection. J. Reine Angew. Math. , 540:105–114, 2001.
- 7[Clu 04] Raf Cluckers. Analytic p 𝑝 p -adic cell decomposition and integrals. Trans. Amer. Math. Soc. , 356(4):1489–1499, 2004.
- 8[Dar] Luck Darnière. Model completion of scaled lattices and co-heyting algebras of p 𝑝 p - adic semi-algebraic sets. Math. Logic Quart. (to appear).
