AN INTRODUCTION

TO O-MINIMAL GEOMETRY

Michel COSTE
Institut de Recherche Mathématique de Rennes
[email protected]

November 1999
Preface

These notes have served as a basis for a course in Pisa in Spring 1999. A parallel
course on the construction of o-minimal structures was given by A. Macintyre.
The content of these notes owes a great deal to the excellent book by L. van
den Dries [vD]. Some interesting topics contained in this book are not included
here, such as the Vapnik-Chervonenkis property.
Part of the material which does not come from [vD] is taken from the paper
[Co1]. This includes the sections on the choice of good coordinates and the
triangulation of functions in Chapter 4 and Chapter 5. The latter chapter
contains the results on triviality in families of sets or functions which were the
main aim of this course.
The last chapter on smoothness was intended to establish property “DC k -
all k” which played a crucial role in the course of Macintyre (it can be easily
deduced from the results in [vDMi]). It is also the occasion to give a few results
on tubular neighborhoods.
I am pleased to thank Francesca Acquistapace, Fabrizio Broglia and all
colleagues of the Dipartimento di Matematica for the invitation to give this
course in Pisa and their friendly hospitality. Also many thanks to Antonio
Diaz-Cano, Pietro Di Martino, Jesus Escribano and Federico Ponchio for read-
ing these notes and correcting mistakes.

1
2
Contents

1 O-minimal Structures 5
1.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
1.2 Semialgebraic Sets . . . . . . . . . . . . . . . . . . . . . . . . . 6
1.3 Definition of an O-minimal Structure . . . . . . . . . . . . . . . 9

2 Cell Decomposition 15
2.1 Monotonicity Theorem . . . . . . . . . . . . . . . . . . . . . . . 15
2.2 Cell Decomposition . . . . . . . . . . . . . . . . . . . . . . . . . 18

3 Connected Components and Dimension 25

3.1 Curve Selection . . . . . . . . . . . . . . . . . . . . . . . . . . . 25
3.2 Connected Components . . . . . . . . . . . . . . . . . . . . . . 28
3.3 Dimension . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31

4 Definable Triangulation 37
4.1 Good Coordinates . . . . . . . . . . . . . . . . . . . . . . . . . . 37
4.2 Simplicial Complex . . . . . . . . . . . . . . . . . . . . . . . . . 40
4.3 Triangulation of Definable Sets . . . . . . . . . . . . . . . . . . 42
4.4 Triangulation of Definable Functions . . . . . . . . . . . . . . . 44

5 Generic Fibers for Definable Families 49

5.1 The Program . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49
5.2 The Space of Ultrafilters of Definable Sets . . . . . . . . . . . . 50
5.3 The O-minimal Structure κ(α) . . . . . . . . . . . . . . . . . . . 52
5.4 Extension of Definable Sets . . . . . . . . . . . . . . . . . . . . 57
5.5 Definable Families of Maps . . . . . . . . . . . . . . . . . . . . . 58
5.6 Fiberwise and Global Properties . . . . . . . . . . . . . . . . . . 59
5.7 Triviality Theorems . . . . . . . . . . . . . . . . . . . . . . . . . 61
5.8 Topological Types of Sets and Functions . . . . . . . . . . . . . 65

3
4 CONTENTS

6 Smoothness 69
6.1 Definable Functions in One Variable . . . . . . . . . . . . . . . . 69
6.2 C k Cell Decomposition . . . . . . . . . . . . . . . . . . . . . . . 71
6.3 Definable Manifolds and Tubular Neighborhoods . . . . . . . . . 72

Bibliography 79

Index 81
Chapter 1

O-minimal Structures

1.1 Introduction
The main feature of o-minimal structures is that there are no “monsters” in
such structures. Let us take an example of the pathological behaviour that is
ruled out. Let Γ ⊂ R2 be the graph of the function x → sin(1/x) for x > 0,
and let clos(Γ) be the closure of Γ in R2 . This set clos(Γ) is the union of Γ
and the closed segment joining the two points (0, −1) and (0, 1). We have

dim(clos(Γ) \ Γ) = dim Γ = 1.

Observe also that clos(Γ) is connected, but not arcwise connected: there is
no continuous path inside clos(Γ) joining the origin with a point of Γ. The
o-minimal structures will allow to develop a “tame topology” in which such
bad things cannot happen. The model for o-minimal structures is the class of
semialgebraic sets.
A semialgebraic subset of Rn is a subset defined by a boolean combination
of polynomial equations and inequalities with real coefficients. In other words,
the semialgebraic subsets of Rn form the smallest class SAn of subsets of Rn
such that:
1. If P ∈ R[X1 , . . . , Xn ], then {x ∈ Rn ; P (x) = 0} ∈ SAn and {x ∈
Rn ; P (x) > 0} ∈ SAn .

2. If A ∈ SAn and B ∈ SAn , then A ∪ B, A ∩ B and Rn \ A are in SAn .

On the one hand the class of semialgebraic sets is stable under many con-
structions (such as taking projections, closure, connected components. . . ), and
on the other hand the topology of semialgebraic sets is very simple, without

5
6 CHAPTER 1. O-MINIMAL STRUCTURES

pathological behaviour. The o-minimal structures may be seen as an axiomatic

treatment of semialgebraic geometry. An o-minimal structure (expanding the
field of reals) is the data, for every positive integer n, of a subset Sn of the
powerset of Rn , satisfying certain axioms. There are axioms which allow to
perform many constructions inside the structure, and an “o-minimality axiom”
which guarantee the tameness of the topology.
One can distinguish two kinds of activities in the study of o-minimal struc-
tures. The first one is to develop the geometry of o-minimal structures from
the axioms. In this activity one tries to follow the semialgebraic model. The
second activity is to discover new interesting classes statisfying the axioms of
o-minimal structures. This activity is more innovative, and the progress made
in this direction (starting with the proof by Wilkie that the field of reals with
the exponential function defines an o-minimal structure) justifies the study of
o-minimal structures. The subject of this course is the first activity (geometry
of o-minimal structures), while the course of A. Macintyre is concerned with
the construction of o-minimal structures.

1.2 Semialgebraic Sets

The semialgebraic subsets of Rn were defined above. We denote by SAn the
set of all semialgebraic subsets of Rn . Some stability properties of the class of
semialgebraic sets follow immediately from the definition.

1. All algebraic subsets of Rn are in SAn . Recall that an algebraic subset

is a subset defined by a finite number of polynomial equations

P1 (x1 , . . . , xn ) = . . . = Pk (x1 , . . . , xn ) = 0 .

2. SAn is stable under the boolean operations, i.e. finite unions and in-
tersections and taking complement. In other words, SAn is a Boolean
subalgebra of the powerset P(Rn ).

3. The cartesian product of semialgebraic sets is semialgebraic. If A ∈ SAn

and B ∈ SAp , then A × B ∈ SAn+p .

Sets are not sufficient, we need also maps. Let A ⊂ Rn be a semialgebraic

set. A map f : A → Rp is said to be semialgebraic if its graph Γ(f ) ⊂ Rn ×Rp =
Rn+p is semialgebraic.
√ For instance, the polynomial maps are semialgebraic.
The function x → 1 − x2 for |x| ≤ 1 is semialgebraic.
1.2. SEMIALGEBRAIC SETS 7

The most important stability property of semialgebraic sets is known as

“Tarski-Seidenberg theorem”. This central result in semialgebraic geometry is
not obvious from the definition.

4. Denote by p : Rn+1 → Rn the projection on the first n coordinates.

Let A be a semialgebraic subset of Rn+1 . Then the projection p(A) is
semialgebraic.

The Tarski-Seidenberg theorem has many consequences. For instance, it

implies that the composition of two semialgebraic maps is semialgebraic. We
shall say more on the consequences of the stability under projection in the
context of o-minimal structures.
The semialgebraic subsets of the line are very simple to describe. Indeed,
a semialgebraic subset A of R is described by a boolean combination of sign
conditions (< 0, = 0 or > 0) on polynomials in one variable. Consider the
finitely many roots of all polynomials appearing in the definition of A. The
signs of the polynomials are constant on the intervals delimited by these roots.
Hence, such an interval is either disjoint from or contained in A. We obtain
the following description.

5. The elements of SA1 are the finite unions of points and open intervals.

We cannot hope for such a simple description of semialgebraic subsets of

R , n > 1. However, we have that every semialgebraic set has a finite partition
n

into semialgebraic subsets homeomorphic to open boxes (i.e. cartesian product

of open intervals). This is a consequence of the so-called “cylindrical algebraic
decomposition” (cad), which is the main tool in the study of semialgebraic
sets. Actually, the Tarki-Seidenberg theorem can be proved by using cad. A
cad of Rn is a partition of Rn into finitely many semialgebraic subsets (which
are called the cells of the cad), satisfying certain properties. We define the cad
of Rn by induction on n.

• A cad of R is a subdivision by finitely many points a1 < . . . < a . The

cells are the singletons {ai } and the open intervals delimited by these
points.

• For n > 1, a cad of Rn is given by a cad of Rn−1 and, for each cell C of
Rn−1 , continuous semialgebraic functions

ζC,1 < . . . < ζC,C : C → R .

8 CHAPTER 1. O-MINIMAL STRUCTURES

The cells of Rn are the graphs of the functions ζC,i and the bands in the
cylinder C × R ⊂ Rn delimited by these graphs. For i = 0, . . . , C , the
band (ζC,i , ζC,i+1 ) is

(ζC,i , ζC,i+1 ) = {(x , xn ) ∈ Rn ; x ∈ C and ζC,i (x ) < xn < ζC,i+1 (x )} ,

where we set ζC,0 = −∞ and ζC,C +1 = +∞.

Observe that every cell of a cad is homeomorphic to an open box. This is
proved by induction on n, since a graph of ζC,i is homeomorphic to C and a
band (ζC,i , ζC,i+1 ) is homeomorphic to C × (0, 1).
Given a finite list (P1 , . . . , Pk ) of polynomials in R[X1 , . . . , Xn ], a subset A
of Rn is said to be (P1 , . . . , Pk )-invariant if the sign (< 0, = 0 or > 0) of each
Pi is constant on A. The main result concerning cad is the following.

Theorem 1.1 Given a finite list (P1 , . . . , Pk ) of polynomials in R[X1 , . . . , Xn ],

there is a cad of Rn such that each cell is (P1 , . . . , Pk )-invariant.

It follows from Theorem 1.1 that, for every semialgebraic subset A of Rn ,

there is a cad such that A is a union of cells (such a cad is called adapted
to A). Indeed, A is defined by a boolean combination of sign conditions on a
finite list of polynomials (P1 , . . . , Pk ), and it suffices to take a cad such that
each cell is (P1 , . . . , Pk )-invariant.
We illustrate Theorem 1.1 with the example of a cad of R3 such that each
cell is (X12 + X22 + X32 − 1)-invariant (a cad adapted to the unit sphere). Such
a cad is shown on Figure 1.1.

Exercise 1.2 How many cells of R3 are there in this cad? Is it possible to
have a cad of R3 , adapted to the unit sphere, with less cells?

We refer to [Co2] for an introduction to semialgebraic geometry.

Semialgebraic geometry can also be developed over an arbitrary real closed
field, instead of the field of reals. A real closed field R is an ordered field
satisfying one of the equivalent conditions:
• Every positive element is a square and every polynomial in R[X] with
odd degree has a root in R.

• For every polynomial F ∈ R[X] and all a, b in R such that a < b and
F (a)F (b) < 0, there exists c ∈ R, a < c < b, such that F (c) = 0.
√
• R[ −1] = R[X]/(X 2 + 1) is an algebraically closed field.
1.3. DEFINITION OF AN O-MINIMAL STRUCTURE 9

Figure 1.1: A cad adapted to the sphere

A semialgebraic subset of Rn is defined as for Rn . The properties of semial-

gebraic sets that we have recalled in this section also hold for semialgebraic
subsets of Rn . We refer to [BCR] for the study of semialgebraic geometry over
an arbitrary real closed field.

1.3 Definition of an O-minimal Structure

We shall now define the o-minimal structures expanding a real closed fied R.
The fact that we consider a situation more general than the field of reals will
be important only in Chapter 5. Otherwise, the reader may take R = R.
An interval in R will always be an open interval (a, b) (for a < b) or (a, +∞)
or (−∞, b). We insist that an interval always has endpoints in R∪{−∞, +∞}.
For instance, if R is the field of real algebraic numbers (which is the smallest
real closed field), the set of x in R such that 0 < x < π (π = 3.14 . . .) is not an
interval, because there is no right endpoint in R. Occasionally, we shall also
use the notation [a, b] for closed segments in R.
The field R has a topology for which the intervals form a basis. Affine
spaces Rn are endowed with the product topology. The open boxes, i.e. the
10 CHAPTER 1. O-MINIMAL STRUCTURES

cartesian products of open intervals (a1 , b1 ) × · · · × (an , bn ) form a basis for this
topology. The polynomials are continuous for this topology.
Exercise 1.3 Prove that the polynomials are continuous.
When dealing with the topology, one should take into account that a real
closed field is generally not locally connected nor locally compact (think of
real algebraic numbers).
Definition 1.4 A structure expanding the real closed field R is a collection
S = (S n )n∈N , where each S n is a set of subsets of the affine space Rn , satisfying
the following axioms:
1. All algebraic subsets of Rn are in Sn .
2. For every n, Sn is a Boolean subalgebra of the powerset of Rn .
3. If A ∈ Sm and B ∈ Sn , then A × B ∈ Sm+n .
4. If p : Rn+1 → Rn is the projection on the first n coordinates and A ∈
Sn+1 , then p(A) ∈ Sn .
The elements of Sn are called the definable subsets of Rn . The structure S is
said to be o-minimal if, moreover, it satisfies:
5. The elements of S1 are precisely the finite unions of points and intervals.
In the following, we shall always work in a o-minimal structure expanding
a real closed field R.
Definition 1.5 A map f : A → Rp (where A ⊂ Rn ) is called definable if its
graph is a definable subset of Rn ×Rp . (Applying p times property 4, we deduce
that A is definable).
Proposition 1.6 The image of a definable set by a definable map is definable.
Proof. Let f : A → Rp be definable, where A ⊂ Rn , and let B be a definable
subset of A. Denote by Γf = {(x, f (x)) ; x ∈ A} ⊂ Rn+p the graph of f .
Let ∆ be the algebraic (in fact, linear) subset of Rp+n+p consisting of those
(z, x, y) ∈ Rp ×Rn ×Rp such that z = y. Then C = ∆∩(Rp ×Γ)∩(Rp ×B ×Rp )
is a definable subset of Rp+n+p . Let pp+n+p,p : Rp+n+p → Rp be the projection
on the first p coordinates. We have pp+n+p,p (C) = f (B), and, applying n + p
times property 4, we deduce that f (B) is definable. 


Observe that every polynomial map is a definable map, since its graph is
an algebraic set.
1.3. DEFINITION OF AN O-MINIMAL STRUCTURE 11

Exercise 1.7 Every semialgebraic subset of Rn is definable (Hint: the set

defined by P (x1 , . . . , xn ) > 0 is the projection of the algebraic set with
equation x2n+1 P (x1 , . . . , xn ) − 1 = 0). Hence, the collection of SAn is
the smallest o-minimal structure expanding R.

Exercise 1.8 Show that every nonempty definable subset of R has a least
upper bound in R ∪ {+∞}.

Exercise 1.9 Assume that S is an o-minimal structure expanding an ordered

field R (same definition as above). Show that R is real closed. (Hint:
one can use the second equivalent condition for a field to be real closed,
the continuity of polynomials and property 5 of o-minimal structures.)

Exercise 1.10 Let f = (f1 , . . . , fp ) be a map from A ⊂ Rn into Rp . Show that

f is definable if and only if each of its coordinate functions f1 , . . . , fp
is definable

Exercise 1.11 Show that the composition of two definable maps is definable.
Show that the definable functions A → R form an R-algebra.

Proposition 1.12 The closure and the interior of a definable subset of Rn

are definable.

Proof. It is sufficient to prove the assertion concerning the closure. The case
of the interior follows by taking complement. Let A be a definable subset of
Rn . The closure of A is

clos(A) =
 

n
x ∈ R ; ∀ε ∈ R, ε > 0 ⇒ ∃y ∈ R , y ∈ A and
n n
(xi − yi ) < ε
2 2
.
i=1

where x = (x1 , . . . , xn ) and y = (y1 , . . . , yn ). The closure of A can also be

described as
  
clos(A) = Rn \ pn+1,n Rn+1 \ p2n+1,n+1 (B) ,

where
 

n
B = (R × R × A) ∩ (x, ε, y) ∈ R × R × R ;
n n n
(xi − yi ) < ε
2 2
,
i=1
12 CHAPTER 1. O-MINIMAL STRUCTURES

pn+1,n (x, ε) = x and p2n+1,n+1 (x, ε, y) = (x, ε). Then observe that B is defin-
able. 


The example above shows that it is usually boring to write down projections
in order to show that a subset is definable. We are more used to write down
formulas. Let us make precise what is meant by a first-order formula (of the
language of the o-minimal structure). A first-order formula is constructed
according to the following rules.
1. If P ∈ R[X1 , . . . , Xn ], then P (x1 , . . . , xn ) = 0 and P (x1 , . . . , xn ) > 0 are
first-order formulas.
2. If A is a definable subset of Rn , then x ∈ A (where x = (x1 , . . . , xn )) is
a first-order formula.
3. If Φ(x1 , . . . , xn ) and Ψ(x1 , . . . , xn ) are first-order formulas, then “Φ and
Ψ”, “Φ or Ψ”, “not Φ” , Φ ⇒ Ψ are first order formulas.
4. If Φ(y, x) is a first-order formula (where y = (y1 , . . . , yp ) and x =
(x1 , . . . , xp )) and A is a definable subset of Rn , then ∃x ∈ A Φ(y, x)
and ∀x ∈ A Φ(y, x) are first-order formulas.

Theorem 1.13 If Φ(x1 , . . . , xn ) is a first-order formula, the set of (x1 , . . . , xn )

in Rn which satisfy Φ(x1 , . . . , xn ) is definable.

Proof. By induction on the construction of formulas. Rule 1 produces semi-

algebraic sets, which are definable. Rule 2 obviously produces definable sets.
Rule 3 works because SAn is closed under boolean operation. Rule 4 re-
flects the fact that the projection of a definable set is definable. Indeed, if
B = {(y, x) ∈ Rp+n ; Φ(y, x)} is definable and pp+n,p : Rp+n → Rp denotes the
projection on the first p coordinates, we have

{y ∈ Rp ; ∃x ∈ A Φ(y, x)} = pp+n,p ((Rp × A) ∩ B) ,

{y ∈ Rp ; ∀x ∈ A Φ(y, x)} = Rp \ pp+n,p ((Rp × A) ∩ (Rp+n \ B)) ,

which shows that both sets are definable. 



One should pay attention to the fact that the quantified variables have to
range over definable sets. For instance,

{(x, y) ∈ R2 ; ∃n ∈ N y = nx}

is not definable (why ?).

We refer the reader to [Pr] for notions of model theory.
1.3. DEFINITION OF AN O-MINIMAL STRUCTURE 13

Exercise 1.14 Let f : A → R be a definable function. Show that {x ∈

A ; f (x) > 0} is definable. Hence, we can accept inequalities involving
definable functions in formulas defining definable sets.

Exercise 1.15 Let A be a non empty definable subset of Rn . For x ∈ Rn ,

 dist(x, A) as the greatest lower bound of the set of y − x =
define
i=1 (yi − xi ) for y ∈ A. Show that dist(x, A) is well-defined and
n 2

that x → dist(x, A) is a continuous definable function on Rn .

Exercise 1.16 Let f : A → R be a definable function and a ∈ clos(A). For

ε > 0, define

m(ε) = inf{f (x) ; x ∈ A and x − a < ε} ∈ R ∪ {−∞} .

Show that m is a definable function (this means that m−1 (−∞) is

definable and m|m−1 (R) is definable). Show that lim inf x→a f (x) exists
in R ∪ {−∞, +∞}.
14 CHAPTER 1. O-MINIMAL STRUCTURES
Chapter 2

Cell Decomposition

In this chapter we prove the cell decomposition for definable sets, which gener-
alizes the cylindrical algebraic decomposition of semialgebraic sets. This result
is the most important for the study of o-minimal geometry. The proofs are
rather technical. The main results come from [PS, KPS], and we follow [vD]
rather closely.

2.1 Monotonicity Theorem

Theorem 2.1 (Monotonicity Theorem) Let f : (a, b) → R be a definable
function. There exists a finite subdivision a = a0 < a1 < . . . < ak = b such
that, on each interval (ai , ai+1 ), f is continuous and either constant or strictly
monotone.
The key of the proof of the Monotonicity Theorem is the following Lemma.
Lemma 2.2 Let f : (a, b) → R be a definable function. There exists a subin-
terval of (a, b) on which f is constant, or there exists a subinterval on which
f is strictly monotone and continuous.
Proof. Suppose that there is no subinterval of (a, b) on which f is constant.
First step: there exists a subinterval on which f is injective. It follows from
the assumption that, for all y in R, the definable set f −1 (y) is finite: otherwise,
f −1 (y) would contain an interval, on which f = y. Hence the definable set
f ((a, b)) is infinite and contains an interval J. The function g : J → (a, b)
defined by g(y) = min(f −1 (y)) is definable and satisfies f ◦ g = IdJ . Since
g is injective, g(J) is infinite and contains a subinterval I of (a, b). We have
g ◦ f |I = IdI , and f is injective on I.

15
16 CHAPTER 2. CELL DECOMPOSITION

Second step: there exists a subinterval on which f is strictly monotone. We

know that f is injective on a subinterval I of (a, b). Take x ∈ I. The sets

I+ = {y ∈ I ; f (y) > f (x)}

I− = {y ∈ I ; f (y) < f (x)}

form a definable partition of I \ {x}. Therefore, there is ε > 0 such that

(x−ε, x) (resp. (x, x+ε)) is contained in I+ or in I− . There are four possibilities
Φ+,+ (x), Φ+,− (x), Φ−,+ (x) and Φ−,− (x) which give a definable partition of I.
For instance, Φ+,− (x) is

∃ε ∀y ∈ I (x − ε < y < x ⇒ f (y) > f (x)) and

(x < y < x + ε ⇒ f (y) < f (x)) .

We claim that Φ+,+ and Φ−,− are finite. It is sufficient to prove the claim
for Φ+,+ (for Φ−,− , replace f with −f ). If Φ+,+ is not finite, it holds on a
subinterval of I, which we still call I. Set

B = {x ∈ I ; ∀y ∈ I y > x ⇒ f (y) > f (x)} .

If B contains an interval, then f is strictly increasing on this interval, which

contradicts Φ+,+ . Hence, B is finite. Replacing I with (max(B), +∞) ∩ I if
B = ∅, we can assume

(∗) ∀x ∈ I ∃y ∈ I (y > x and f (y) < f (x)) .

Take x ∈ I. The definable set Cx = {y ∈ I ; y > x and f (y) < f (x)}

is nonempty. If Cx were finite, its maximum would be an element of I con-
tradicting the property (*). Therefore, Cx contains an interval. Let z be the
greatest lower bound of the interior of Cx . We have z > x because f > f (x)
on some interval (x, x + ε). We have also f > f (x) on some interval (z − ε, z)
and f < f (x) on some interval (z, z + ε). Hence, the following formula Ψ+,− (z)
holds:

∃ε > 0 ∀t ∈ I ∀u ∈ I (z − ε < t < z < u < z + ε ⇒ f (t) > f (u)) .

We have shown

(∗∗) ∀x ∈ I ∃z ∈ I (x < z and Ψ+,− (z)) .

The definable set of elements of I satisfying Ψ+,− is not empty and it is not
finite: otherwise, its maximum would contradict (**). It follows that, replacing
2.1. MONOTONICITY THEOREM 17

I with a smaller subinterval, we can assume that Ψ+,− holds on I. Consider the
definable function h : −I → R defined by h(x) = f (−x). The property Φ+,+
for h holds on −I. Hence, by the preceding argument, there is a subinterval
of −I on which Ψ+,− for h holds. This means that there is a subinterval of I
on which Ψ−,+ for f holds (exchange left and right). On this subinterval we
have both Ψ+,− and Ψ−,+ , which are contradictory. This contradiction proves
the claim.
Since Φ+,+ and Φ−,− are finite, replacing I with a smaller subinterval, we
can assume that Φ−,+ holds on I or Φ+,− holds on I. Say Φ−,+ holds on I.
Then f is strictly increasing on I. Indeed, for all x ∈ I, the definable set
{y ∈ I ; y > x and f > f (x) on (x, y)} is nonempty and its least upper bound
is necessarily the right endpoint of I (Otherwise, this l.u.b. would not satisfy
Φ−,+ ). Similarly, if Φ+,− holds on I, f is strictly decreasing on I.
Last step: there is a subinterval on which f is strictly monotone and con-
tinuous. Recall that f is strictly monotone on I. The definable set f (I) is
infinite and contains an interval J. The inverse image f −1 (J) is the interval
(inf(f −1 (J)), sup(f −1 (J))). Replacing I with this interval, we can assume that
f is a strictly monotone bijection from the interval I onto the interval J. Since
the inverse image of a subinterval of J is a subinterval of I, f is continuous.



Proof of the Monotonicity Theorem. Let X= (resp. X , resp. X ) be the

definable set of x ∈ (a, b) such that f is constant (resp. continuous and strictly
increasing, resp. continuous and strictly decreasing) on an interval containing
x. Then
(a, b) \ (X= ∪ X ∪ X )
is finite: otherwise, it would contain an interval, and we get a contradiction
by applying Lemma 2.2 to this interval. Hence, there is a subdivision a =
a0 < a1 < . . . < ak = b such that each (ai , ai+1 ) is contained in X= or in
X or in X . Clearly, f is continuous on each (ai , ai+1 ). Take x in (ai , ai+1 ).
If (ai , ai+1 ) is contained in X= (resp. X , resp. X ), let Dx be the set of
y ∈ (ai , ai+1 ) such that x < y and f = f (x) (resp. f > f (x), resp. f < f (x))
on (x, y). The definable set Dx is nonempty and its least upper bound is
necessarily ai+1 . It follows that f is constant or strictly monotone on (ai , ai+1 ).


Exercise 2.3 Let f : (a, b) → R be a definable function. Then limx→b− f (x)

and limx→a+ f (x) exist in R ∪ {−∞, +∞}.
18 CHAPTER 2. CELL DECOMPOSITION

2.2 Uniform Finiteness, Cell Decomposition and

Piecewise Continuity
The notion of a cylindrical definable cell decomposition (cdcd) of Rn is a gen-
eralization of cylindrical algebraic cell decomposition. We define the cdcd by
induction on n

Definition 2.4 A cdcd of Rn is a finite partition of Rn into definable sets

(Ci )i ∈ I satisfying certain properties explained below. The Ci are called the
cells of the cdcd.

n = 1: A cdcd of R is given by a finite subdivision a1 < . . . < a of R. The

cells of R are the singletons {ai }, 0 < i ≤ , and the intervals (ai , ai+1 ),
0 ≤ i ≤ , where a0 = −∞ and a+1 = +∞.

n > 1: A cdcd of Rn is given by a cdcd of Rn−1 and, for each cell D of Rn−1 ,
continuous definable functions

ζD,1 < . . . < ζD,(D) : D −→ R .

The cells of Rn are the graphs

{(x, ζD,i (x)) ; x ∈ D} , 0 < i ≤ (D) ,

and the bands

(ζD,i , ζD,i+1 ) = {(x, y) ; x ∈ D and ζD,i (x) < y < ζD,i+1 (x)}

for 0 ≤ i ≤ (D), where ζD,0 = −∞ and ζD,(D)+1 = +∞.

Note that the fact that a cell of a cdcd is definable follows immediately
from the definition and the axioms of o-minimal structure. Note also that if
pn,m : Rn → Rm , m < n, is the projection on the first m coordinates, the
images by p of the cells of a cdcd of Rn are the cells of a cdcd of Rm .
We define by induction the dimension of a cell. The dimension of a single-
ton is 0 and the dimension of an interval is 1. If C is a cell of Rn , its dimension
is dim(pn,n−1 (C)) if C is a graph and dim(pn,n−1 (C)) + 1 if C is a band.

Proposition 2.5 For each cell C of a cdcd of Rn , there is a definable home-

omorphism θC : C → Rdim(C) .
2.2. CELL DECOMPOSITION 19

Proof. Let D = pn,n−1 (C) and assume θD : D → Rdim(D) is already defined.

Let (x, y) ∈ C, where x ∈ D. We define θC (x, y) as θD (x) if C is a graph, and
as

1 1
θD (x) , +y+
ζD,i (x) − y ζD,i+1 (x) − y
if C is the band (ζD,i , ζD,i+1 ) (fractions where infinite functions appear in the
denominator have to be omitted). 


Exercise 2.6 Prove (by induction on n) that a cell is open in Rn if and only
if its dimension is n. Prove that the union of all cells of dimension n
is dense in Rn (hint: show by induction on n that every open box in
Rn meets a cell of dimension n).

We have already said that the notion of connectedness does not behave
well if R = R. It has to be replaced by the notion of definable connectedness.

Definition 2.7 A definable set A is said to be definably connected if, for all
disjoint definable open subsets U and V of A such that A = U ∪ V , one has
A = U or A = V . A definable set A is said to be definably arcwise connected
if, for all points a and b in A, there is a definable continuous map γ : [0, 1] → A
such that γ(0) = a and γ(1) = b.

Exercise 2.8 Prove the following facts: The segment [0, 1] is definably con-
nected. Definably arcwise connected implies definably connected. Ev-
ery box (0, 1)d is definably connected. Every cell of a cdcd is definably
connected.

We now state the three main results of this section. In the following, we
denote by +S the number of elements of a finite set S.

Theorem 2.9 (Uniform Finiteness UFn ) Let A be a definable subset of Rn

such that, for every x ∈ Rn−1 , the set

Ax = {y ∈ R ; (x, y) ∈ A}

is finite. Then there exists k ∈ N such that +Ax ≤ k for every x ∈ Rn−1 .

Theorem 2.10 (Cell Decomposition CDCDn ) Let A1 , . . . , Ak be definable

subsets of Rn . There is a cdcd of Rn such that each Ai is a union of cells.
20 CHAPTER 2. CELL DECOMPOSITION

A cdcd of Rn satisfying the property of the theorem will be called adapted

to A1 , . . . , Ak .

Exercise 2.11 Prove the following consequence of CDCDn : Let X be a de-

finable subset of Rn such that clos(X) has nonempty interior. Then X
has nonempty interior. (Hint: use Exercise 2.6 for a convenient cdcd
of Rn .)

Theorem 2.12 (Piecewise Continuity PCn ) Let A be a definable subset of

Rn and f : A → R a definable function. There is a cdcd of Rn adapted to A
such that, for every cell C contained in A, f |C is continuous.

Exercise 2.13 Prove the following consequence of PCn : Let X be an open

definable subset of Rn and f : X → R a definable function. Then there
is an open box B ⊂ X such that f |B is continuous (hint: use Exercise
2.6).

We prove the three theorems simultaneously by induction on n. For n = 1,

UF1 is trivial (R0 is just one point), CDCD1 follows immediately from the o-
minimality, and PC1 is a consequence of the Monotonicity Theorem 2.1. In the
following we assume n > 1 and UFm , CDCDm and PCm hold for all integers
m such that 0 < m < n.
Proof of UFn . We can assume that, for every x ∈ Rn−1 , the set Ax is contained
in (−1, 1). Let √ µ : R2 → (−1, 1) be the semialgebraic homeomorphism defined
by µ(y) = y/ 1 + y . We can replace A with its image by (x, y) → (x, µ(y)),
which satisfies the assumption.
For x ∈ Rn−1 and i = 1, 2, . . ., define fi (x) to be the i-th element of Ax ,
if it exists. Note that the function fi is definable. Call a ∈ Rn−1 good if
f1 , . . . , f(Aa ) are defined and continuous on an open box containing a and a
does not belong to the closure of the domain of f(Aa )+1 . In other words, a is
good if and only if there is an open box B a in Rn−1 , such that (B × R) ∩ A
is the union of graphs of continuous definable functions

ζ1 < . . . < ζ(Aa ) : B → (−1, 1) (ζi = fi |B) .

Call a ∈ Rn−1 bad if it is not good.

First step: the set of good points is definable. Let a be a point of Rn−1 . If
b belongs to [−1, 1], we say that (a, b) ∈ Rn is normal if there is an open box
C = B × (c, d) ⊂ Rn containing (a, b) such that A ∩ C is either empty or the
graph of a continuous definable function B → (c, d).
2.2. CELL DECOMPOSITION 21

Clearly, if a is good, (a, b) is normal for every b ∈ [−1, 1]. Now assume
that a is bad. Let f be the first function fi such that a is in the closure of the
domain of fi and there is no open box containing a on which fi is defined and
continuous. We set β(a) = lim inf x→a f (x) ∈ [−1, 1]. We claim that (a, β(a))
is not normal. Suppose (a, β(a)) is normal. There is an open box B × (c, d)
containing (a, β(a)) whose intersection with A is the graph of a continuous
function g : B → (c, d). We can assume that f (x) > c for all x ∈ B such that
f (x) is defined. If  > 1 and β(a) = f−1 (a), we would deduce g = f−1 |B
since B is definably connected. We would have f (x) ≥ d for all x ∈ B such
that f (x) is defined, which contradicts β(a) < d. Hence, we can assume  = 1
or f−1 < c on B. It follows that g = f |B , which contradicts the definition of
. Therefore the claim is proved.
We have shown that a ∈ Rn−1 is good if and only if, for all b ∈ [−1, 1], (a, b)
is normal. From this we deduce easily that the set of good points is definable.
Second step: the set of good points is dense. Otherwise, there is an open
box B ⊂ Rn−1 contained in the set of bad points. Consider the definable
function β : B → [−1, 1] defined as in Step 1. By PCn−1 , we can assume that
β is continuous (see Exercise 2.13). For x ∈ B, we define β− (x) (resp. β+ (x))
to be the maximum (resp. minimum) of the y ∈ Ax such that y < β(x) (resp.
y > β(x)), if such y exist. Using PCn−1 and shrinking the box B, we can
assume that β− (resp. β+ ) either is nowhere defined on B or is continuous on
B. Then the set of (x, y) ∈ A ∩ (B × R) such that y = β(x) is open and closed
in A ∩ (B × R). Shrinking further the box B, we can assume that the graph of
β|B is either disjoint from A or contained in A. The first case contradicts the
definition of β. In the second case, (x, β(x)) would be normal for every x ∈ B,
which contradicts what was proved in the first step. We have proved that the
set of good points is dense.
Third step. By CDCDn−1 , there is a cdcd of Rn−1 adapted to the set of
good points. Let C be a cell of dimension n − 1 of Rn−1 . Since good points
are dense, every x ∈ C is good. Take a ∈ C. The set of x ∈ C such that
+(Ax ) = +(Aa ) is definable, open and closed in C. By definable connectedness
of C, it is equal to C. If D is a cell of Rn−1 of smaller dimension, we can use
the definable homeomorphism of θD : D → Rdim(D) and the assumption that
UFdim(D) holds to prove that +(Ax ) is uniformly bounded for x ∈ D. Since
there are finitely many cells, the proof of UFn is completed. 


Proof of CDCDn . Let A be the set of (x, y) ∈ Rn−1 × R such that y belongs
to the boundary of one of A1,x , . . . , Ak,x (the boundary of S in R is clos(S) \
int(S)). Clearly A is definable and satisfies the assumptions of UFn . Hence
22 CHAPTER 2. CELL DECOMPOSITION

+(Ax ) has a maximum  for x ∈ Rn−1 , and A is the union of the graphs of
functions f1 , . . . , f defined at the beginning of the proof of UFn . We define
the type of x in Rn−1 to consist of the following data:
• +(Ax ),
• the sets of j ∈ {1, . . . , k} such that fi (x) ∈ Aj,x for i = 1, . . . , +(Ax ),
• the sets of j ∈ {1, . . . , k} such that (fi (x), fi+1 (x)) ⊂ Aj,x , for i =
0, . . . , +(Ax ) (where f0 (x) = −∞ and f(Ax )+1 (x) = +∞).
Since there are finitely many possible types and the set of points in Rn−1
with a given type is definable, we deduce from CDCDn−1 that there is a cdcd
of Rn−1 such that two points in the same cell of Rn−1 have the same type.
Moreover, using PCn−1 , we can assume that the cdcd of Rn−1 is such that, for
each cell C and i = 1, . . . , , either fi is defined nowhere on C or fi is defined
and continuous on C. The cdcd of Rn−1 we have obtained, together with the
restrictions of the functions fi to the cells of this cdcd, define a cdcd of Rn
adapted to A1 , . . . , Ak . 


Proof of PCn .
First step. Assume that A is an open box B × (a, b) ⊂ Rn−1 × R. We claim
that there is an open box A ⊂ A such that f |A is continuous.
For every x ∈ B, let λ(x) be the least upper bound of the set of y ∈ (a, b)
such that f (x, ·) is continuous and monotone on (a, y). The Monotonicity
Theorem 2.1 implies λ(x) > a for all x ∈ B. The function λ is definable.
Applying PCn−1 to λ and replacing B with a smaller open subbox, we can
assume that λ is continuous (see Exercise 2.13). Replacing again B with a
smaller subbox, we can assume that there is c > a such that λ > c. Replacing
b with c, we can assume that, for every x ∈ B, f (x, ·) is continuous and
monotone on (a, b).
Now consider the set C of points (x, y) ∈ B × (a, b) such that f (·, y) is
continuous at x. The set C is definable. It follows from PCn−1 that, for every
y ∈ (a, b), the set of x such that f (·, y) is continuous at x is dense in B. Hence,
C is dense in A. Applying CDCDn , we deduce that C contains an open subbox
of A. Replacing A with this smaller subbox, we can assume that, for every
y ∈ (a, b), f (·, y) is continuous.
So it suffices to consider the case where f (x, ·) is continuous and monotone
on (a, b) for every x ∈ B and f (·, y) is continuous on B for every y ∈ (a, b). In
this situation, f is continuous on B × (a, b). Indeed, take (x0 , y 0 ) ∈ B × (a, b)
and I an interval containing f (x0 , y 0 ). By continuity of f (x0 , ·), we find y 1 <
2.2. CELL DECOMPOSITION 23

y 0 < y 2 such that f (x0 , y i ) ∈ I for i = 1, 2. By continuity of f (·, y i ), we find

an open box B  x0 in B such that f (B  × {y i }) ⊂ I for i = 1, 2. It follows
from the monotonicity of f (x, ·) that f (B  × (y 1 , y 2 )) is contained in I. This
proves the continuity of f and completes the proof of the claim.
Second step. Now we can prove PCn . Consider the set D of points of A
where f is continuous. The set D is definable. By CDCDn , there is a cdcd of
Rn adapted to A and D. If E is an open cell contained in A, the first step shows
that E ∩ D is nonempty, therefore E ⊂ D and f is continuous on E. If F is
a cell of dimension d < n contained in A, there is a definable homeomorphism
θF : F → Rd . Composing f with θF−1 and applying PCd , we obtain a finite
partition of F into definable subsets Fi such that f |Fi is continuous. Hence,
there is a finite partition of A into definable subsets A1 , . . . , Ak such that f |Ai
is continuous for i = 1, . . . , k. Using CDCDn , we obtain a cdcd of Rn adapted
to A1 , . . . , Ak . So we can assume that the Ai are cells of a cdcd of Rn .


24 CHAPTER 2. CELL DECOMPOSITION
Chapter 3

Connected Components and

Dimension

3.1 Curve Selection

We begin with a useful result. It says that, if a formula “∀x ∈ X ∃y ∈
Y (x, y) ∈ Z” holds, where X, Y and Z are definable sets, then y can be
choosed as a definable function of x ∈ X.

Theorem 3.1 (Definable Choice) Let A be a definable subset of Rm × Rn .

Denote by p : Rm × Rn → Rm the projection on the first m coordinates. There
is a definable function f : p(A) → Rn such that, for every x ∈ p(A), (x, f (x))
belongs to A.

Proof. It is sufficient to consider the case n = 1. The general case follows

by decomposing the projection Rm+n → Rm as Rm+n → Rm+n−1 → . . . →
Rm+1 → Rm .
Make a cdcd of Rm+1 adapted to A. The projection p(A) is the union of the
images by p of cells contained in A. Hence, we can assume that A is a cell of
Rm+1 , and consequently p(A) is a cell of Rm . If A is the graph of ζi : p(A) → R,
we take f = ζi . If A is a band (ζi , ζi+1 ), where both functions are finite, we take
f = 12 (ζi + ζi+1 ). If for instance ζi is finite and ζi+1 = +∞, we take f = ζi + 1.


We introduce a notation.
 Given x = (x1 , . . . , xn ) and y = (y1 , . . . , yn ) in
R , we set x − y =
n
i=1 (xi − yi ) . Given r > 0 in R, we define the open
n 2

25
26 CHAPTER 3. CONNECTED COMPONENTS AND DIMENSION

and closed balls

B(x, r) = {z ∈ Rn ; z − x < r} ,
B(x, r) = {z ∈ Rn ; z − x ≤ r} .

The open balls B(x, r) form a basis of open neighborhoods of x.

Theorem 3.2 (Curve Selection Lemma) Let A be a definable subset of

Rn , b a point in clos(A). There is a continuous definable map γ : [0, 1) → Rn
such that γ(0) = b and γ((0, 1)) ⊂ A.

Proof. Set X = {(t, x) ∈ R × Rn ; x ∈ A and x − b < t}. Let

p : R × R → R be the projection on the first coordinate. Since b ∈ clos(A),
n

we have p(X) = {t ∈ R ; t > 0}. Applying Definable Choice 3.1 and the
Monotonicity Theorem 2.1, we find ε > 0 and a continuous definable map
δ : (0, ε) → A such that δ(t) − b < t. Clearly, δ extends continuously to
δ : [0, ε) → Rn with δ(0) = b, and we define γ : [0, 1) → Rn by γ(t) = δ(tε).



The curve selection lemma replaces the use of sequences in many situations.

Exercise 3.3 Show that a definable function f : A → R is continuous if and

only if, for every continuous definable γ : [0, 1) → A, limt→0+ f (γ(t)) =
f (γ(0)).

We have seen that compactness is a problem for a general real closed field.
However, the following result shows that we retain the good properties of
compactness if we deal with definable objects.

Theorem 3.4 Let A be a definable subset of Rn . The following properties are

equivalent.

1. A is closed and bounded.

2. Every definable continuous map (0, 1) → A extends by continuity to a

map [0, 1) → A.

3. For every definable continuous function f : A → R, f (A) is closed and

bounded.
3.1. CURVE SELECTION 27

Proof. 1 ⇒ 2. A definable continuous map (0, 1) → A extends by continuity

to a map [0, 1) → Rn : every coordinate of the map has a limit as t → 0+ (cf.
Exercise 2.3), and this limit is in R since A is bounded. Since A is closed, the
value of the extension at 0 belongs to A.
2 ⇒ 3. Suppose that f (A) is not bounded. Set
X = {(t, x) ∈ R × Rn ; x ∈ A and t |f (x)| = 1} .
Then the projection of X on the first coordinate contains some interval (0, ε).
Using Definable Choice 3.1 and the Monotonicity Theorem 2.1, and rescaling
the interval of definition, we can assume that there is a continuous map δ :
(0, 1) → A such that limx→0+ |f (δ(t))| = +∞. This implies that δ cannot be
extended continuously to a map [0, 1) → A, which contradicts 2. Hence, f (A)
is bounded. Now let b belong to clos(f (A)). Set
Y = {(t, x) ∈ R × Rn ; x ∈ A and |b − f (x)| < t} .
The same argument as above shows that there is a continuous map γ : (0, 1) →
A such that limt→0+ f (γ(t)) = b. By 2, γ extends continuously to a map
[0, 1) → A and its value at 0 is an element a of A such that f (a) = b. This
shows that f (A) is closed.
3 ⇒ 1. Since the image of A by each coordinate function is bounded, A is
bounded. Let b belong to clos(A). Since the image of A by x → x − b is
closed, it contains 0. Therefore b belongs to A, which shows that A is closed.


Exercise 3.5 Show that a definable continuous function on a closed and
bounded definable set is uniformly continuous.
Corollary 3.6 Let A be a closed and bounded definable set. If B is a definable
set definably homeomorphic to A, then B is also closed and bounded.
The preceding corollary shows that the property of being closed and
bounded, for a definable set, is intrisic (in the sense that it does not depend
on an imbedding in affine space). The property of being locally closed is also
intrisic, in the same sense. Recall that a subset of Rn is said to be locally
closed if it is open in its closure.
Proposition 3.7 1) A definable set A ⊂ Rn is locally closed if and only if
every point x ∈ A has a basis of closed and bounded definable neighborhoods in
A.
2) If A is a locally closed definable set, and B, a definable set definably
homeomorphic to A, then B is locally closed.
28 CHAPTER 3. CONNECTED COMPONENTS AND DIMENSION

Proof. 1) First assume that A is locally closed. Take x ∈ A. There is

r0 > 0 such that the intersection of the ball B(x, r0 ) ⊂ Rn with clos(A) is
contained in A. Then the intersections of clos(A) with the closed balls B(x, r),
for 0 < r < r0 , form a basis of closed and bounded definable neighborhoods of
x in A.
Conversely, assume that every point x ∈ A has a closed neighborhood N
in A. Take s > 0 such that B(x, s) ∩ A ⊂ N . Since B(x, s) ∩ (Rn \ N ) is open
and disjoint from A, we have B(x, s) ∩ clos(A) ⊂ N ⊂ A. This shows that A
is locally closed.
2) This follows from 1) and Corollary 3.6. 


Exercise 3.8 Show:

1) A cell of a cdcd is locally closed. (Use 3.7, statement 2.)
2) Every definable set is the union of finitely many locally closed de-
finable sets.

3.2 Connected Components

Theorem 3.9 Let A be a definable subset of Rn . There is a partition of A
into finitely many definable subsets A1 , . . . , Ak such that each Ai is nonempty,
open and closed in A, and definably arcwise connected. Such a partition is
unique. The A1 , . . . , Ak are called the definable connected components of A.

Proof. Make a cdcd of Rn adapted to A. We say that a cell C is adjacent to

a cell D if C ∩ clos(D) = ∅, and we denote this fact by C ≺ D.
We claim that, if C ≺ D, every x ∈ C can be joined to every y ∈ D by
a definable continuous path in C ∪ D. Take c ∈ C ∩ clos(D). By the Curve
Selection Lemma, there is a continuous definable γ : [0, 1) → C ∪ D such
that γ(0) = c and γ((0, 1)) ⊂ D. Set d = γ(1/2). The points c and d are
joined by a continuous definable path in C ∪ D. Since every cell is definably
homeomorphic to an affine space, every point x ∈ C can be joined to c by a
definable continuous path in C and every point y ∈ D can be joined to d by a
definable continuous path in D. This proves the claim.
Let ∼ be the smallest equivalence relation on the set of cells contained in
A containing the adjacency relation: we have C ∼ D if and only if there is a
chain C = C0 ≺ C1 $ C2 ≺ . . . $ C2k = D where all cells Ci are contained in
A (note that we can have Ci = Ci+1 ). Let E1 , . . . , Ek be the equivalence classes
for ∼, and let Ai be the union of all cells in Ei . The Ai form a finite partition
of A into definable sets. The claim proved above and the definition of ∼ imply
3.2. CONNECTED COMPONENTS 29

that each Ai is definably arcwise connected. If a cell C ⊂ A has a nonempty

intersection with clos(Ai ), it is adjacent to a cell in Ei , which implies C ⊂ Ai .
Hence, each Ai is closed in A. Since the Ai form a finite partition of A, they
are also open in A.
Assume that A = B1 ∪. . .∪B is another partition with the same properties.

We have Ai = j=1 (Ai ∩Bj ), and each (Ai ∩Bj ) is definable, open and closed in
Ai . Since Ai is definably connected, there is exactly one j such that Ai ⊂ Bj .
For the same reason, for every j there is exactly one i such that Bj ⊂ Ai . This
shows that the two partitions coincide up to order. 


Remark that it follows from the proof that the number of definable con-
nected components of A is not greater that the number of cells contained in A
for any cdcd of Rn adapted to A.

Corollary 3.10 A definably connected definable set is definably arcwise con-

nected.

Consider the case where R = R, i.e. the o-minimal structure expands the
field of real numbers. It is clear that a connected definable set is definably
connected. It is also clear that a definably arcwise connected definable set
is arcwise connected. Hence, a definable set is connected if and only it is
definably connected, and the definable connected components of a definable
set are its usual connected components. It follows that a definable set has
finitely many connected components, which are definable.
We shall prove now that there is a uniform bound for the number of con-
nected components in a definable family of subsets of Rn . First we make
precise this notion of definable family. Let A be a definable subset of Rm × Rn .
For x ∈ Rm , set Ax = {y ∈ Rn ; (x, y) ∈ A}. We call the family (Ax )x∈Rm a
definable family of subsets of Rn parametrized by Rm .
The next result allows to regard a cdcd of Rm ×Rn as a “definable family of
cdcd of Rn ”. Assume that a cdcd of Rm ×Rn is given. Let pm+n,m : Rm ×Rn →
Rm be the projection on the first m coordinates. Recall that the pm+n,m (C),
for all cells C of Rm × Rn , are the cells of a cdcd of Rm .

Proposition 3.11 Let B be a cell of Rm , a ∈ B. For all cells C ⊂ Rm × Rn

such that pm+n,m (C) = B, we set Ca = {y ∈ Rn ; (a, y) ∈ C}. Then these
Ca are the cells of a cdcd of Rn . The dimension of the cell Ca is equal to
dim(C) − dim(B).
30 CHAPTER 3. CONNECTED COMPONENTS AND DIMENSION

Ca

Rn
C

B a Rm

Figure 3.1: The slice Ca of a cell C.

Proof. We proceed by induction on n. The case n = 0 is trivial. Now assume

that n > 0 and the proposition is proved for n−1. The cdcd of Rm ×Rn induces
by the projection pm+n,m+n−1 : Rm ×Rn → Rm ×Rn−1 a cdcd of Rm ×Rn−1 . For
each cell D of Rm ×Rn−1 , there are continuous definable functions ζD,1 < . . . <
ζD,(D) : D → R, and the cells C of Rm × Rn such that pm+n,m+n−1 (C) = D
are graphs of ζD,i or bands (ζD,i , ζD,i+1 ). By the inductive assumption, the
Da , for all cells D of Rm × Rn−1 such that pm+n−1,m (D) = B, are the cells of
a cdcd of Rn−1 and dim(Da ) = dim(D) − dim(B). For such cells D, define
(ζD,i )a : Da → R by (ζD,i )a (y) = ζD,i (a, y). Now C ⊂ Rm × Rn is the graph of
ζD,i (resp. the band (ζD,i , ζD,i+1 )) if and only if Ca ⊂ Rn is the graph of (ζD,i )a
(resp. the band ((ζD,i )a , (ζD,i+1 )a )). Hence the Ca , for all cells C such that
B = pm+n,m (C), form a cdcd of Rn . If C is a graph over D = pm+n,m+n−1 (C),
dim(Ca ) = dim(Da ) = dim(D) − dim(B) = dim(C) − dim(B). If C is a
band, dim(Ca ) = dim(Da ) + 1 = dim(D) − dim(B) + 1 = dim(C) − dim(B).



Theorem 3.12 Let A be a definable subset of Rm × Rn . There is β ∈ N such

that, for every x ∈ Rm the number of definable connected components of Ax is
not greater than β.

Proof. We choose a cdcd of Rm × Rn adapted to A. We adopt the notation

of Proposition 3.11 and its proof. Take x ∈ Rm and let B be the cell of
3.3. DIMENSION 31

Rm containing x. The collection of all Cx , for C cell of Rm × Rn such that

pm+n,m (C) = B, is a cdcd of Rn adapted to Ax . Hence, the number of definable
connected components of Ax is not greater that the number of cells of Rm ×Rn
contained in A. 


Exercise 3.13 The aim of this exercise is to prove the following fact:

(+) Let A be a definable subset of Rn . There exists β(A) ∈ N such that,

for every affine subspace L of Rn , the number of definable connected
components of L ∩ A is not greater than β(A).

1) (The Grassmannian of affine subspaces of Rn as an algebraic subset

2
of Rn +n .) Let M be a n × n matrix with coefficients in R, which
2
we identify with an element of Rn , and let v be a vector in Rn . We
2
associate to g = (M, v) ∈ Rn × Rn the affine subspace Lg = {x ∈
Rn ; M x = v} of Rn . Show that the mapping g → Lg restricted to
the algebraic subset
2
G = {g = (M, v) ∈ Rn ×Rn ; M 2 = M and t M = M and M v = v}

is a bijection onto the set of all affine subspaces of Rn .

2) Let A be a definable subset of Rn . Construct a definable set A ⊂
G × Rn such that, for all g ∈ G, Ag = A ∩ Lg (where Ag is defined as
{x ∈ Rn ; (g, x) ∈ A}).
3) Prove (+).

3.3 Dimension
We have already defined the dimension of a cell of a cdcd. Now let A be a
definable subset of Rn . Take a cdcd of Rn adapted to A. A “naive” definition
of the dimension of A is the maximum of the dimension of the cells contained
in A. But this definition is not intrinsic. We have to prove that the dimension
so defined does not depend on the choice of a cdcd adapted to A. We shall
rather introduce an intrisic definition of dimension, and show that it coincides
with the “naive” one

Definition 3.14 The dimension of a definable set A is the sup of d such

that there exists a injective definable map from Rd to A. By convention, the
dimension of the empty set is −∞.
32 CHAPTER 3. CONNECTED COMPONENTS AND DIMENSION

Remark that it is not obvious for the moment that the dimension is always
< +∞. It is also not clear that this definition of dimension agrees with the
one already given for cells. Both facts will follow from the next lemma.

Lemma 3.15 Let A be a definable subset of Rn with nonempty interior. Let

f : A → Rn be an injective definable map. Then f (A) has nonempty interior.

Proof. We prove the lemma by induction on n. If n = 1, A is infinite, hence

f (A) ⊂ R is infinite and contains an interval. Assume that n > 1 and the
lemma is proved for all m < n. Using Piecewise Continuity 2.12, we can assume
moreover that f is continuous. Take a cdcd of Rn adapted to f (A). If f (A) has
empty interior, it contains no open cell. Hence f (A) is the union of nonopen
cells C1 , . . . , Ck and, for i = 1, . . . , k, there is a definable homeomorphism
Ci → Rmi with mi < n. Take a cdcd of Rn adapted to the f −1 (Ci ). Since

A = ki=1 f −1 (Ci ) has nonempty interior, one of the f −1 (Ci ), say f −1 (C1 ),
must contain an open cell B. The restriction of f to B gives an injective
continuous definable map B → C1 . Since B is definably homeomorphic to Rn
and C1 definably homeomorphic to Rm with m < n, we obtain an injective
continuous definable map g : Rn → Rm . Set a = (0, . . . , 0) ∈ Rn−m and
consider the mapping ga : Rm → Rm defined by ga (x) = g(a, x). We can apply
the inductive assumption to ga . It implies that ga (Rm ) has nonempty interior
in Rm . Take a point c = ga (b) in the interior of ga (Rm ). Since g is continuous
we can find x ∈ Rn−m , x = a and close to a, such that g(x, b) ∈ ga (Rm ). There
is y ∈ Rm such that g(x, b) = ga (y) = g(a, y), which contradicts the fact that
g is injective. Hence, f (A) has nonempty interior. 


Corollary 3.16 The dimension of Rd (according to Definition 3.14) is d. The

dimension of a cell, as defined in Section 2.2, agrees with its dimension ac-
cording to Definition 3.14.

Proof. There is no injective definable map from Re to Rd if e > d. Otherwise,

the composition of such a map with the embedding of Rd in Re = Rd × Re−d
as Rd × {0} would contradict Lemma 3.15. This shows the first part of the
corollary. The second part follows, using the fact that the dimension according
to 3.14 is invariant by definable bijection. 


Proposition 3.17 1. If A ⊂ B are definable sets, dim A ≤ dim B.

2. If A and f : A → Rn are definable, dim(f (A)) ≤ dim(A). If moreover f

is injective, dim(f (A)) = dim(A).
3.3. DIMENSION 33

3. If A and B are definable subsets of Rn , dim(A∪B) = max(dim A, dim B).

4. Let A ⊂ Rn be definable and take a cdcd of Rn adapted to A. Then the
dimension of A is the maximum of the dimension of the cells contained
in A.
5. If A and B are definable sets, dim(A × B) = dim A + dim B.
Proof. 1 is clear from the definition.
2. The second part is obvious since dimension is invariant by definable
bijection. If f is definable, we get by Definable Choice a definable mapping
g : f (A) → A such that f ◦ g = Idf (A) . Hence, g is injective and dim(f (A)) =
dim(g(f (A))) ≤ dim(A).
3. The inequality dim(A∪B) ≥ max(dim A, dim B) follows from 1. Now let
f : Rd → A ∪ B be a definable injective map. Taking a cdcd of Rd adapted to
f −1 (A) and f −1 (B), we see that f −1 (A) or f −1 (B) contains a cell of dimension
d. Since f is injective, we have dim A ≥ d or dim B ≥ d. This proves the
reverse inequality dim(A ∪ B) ≤ max(dim A, dim B).
4 is an immediate consequence of 3.
5. By 3, it is sufficient to consider the case where A and B are cells. Since
A × B is definably homeomorphic to Rdim A × Rdim B , the assertion in this case
follows from Corollary 3.16. 


Now we study the variation of dimension in a definable family. Recall

that a definable subset A of Rm × Rn can be considered as a definable family
(Ax )x∈Rm of subsets of Rn , where Ax = {y ∈ Rn ; (x, y) ∈ A}.
Theorem 3.18 Let A be a definable subset of Rm × Rn . For d ∈ N ∪ {−∞},
set Xd = {x ∈ Rm ; dim(Ax ) = d}. Then Xd is a definable subset of Rm , and
dim(A ∩ (Xd × Rn )) = dim(Xd ) + d.
Proof. We take a cdcd of Rm × Rn adapted to A and use Proposition 3.11.
Let B be a cell of Rm . For every x in B, Ax is the union of the cells Cx ⊂ Rn ,
for all cells C ⊂ Rm × Rn contained in A such that pm+n,m (C) = B. Moreover,
dim(Cx ) = dim C − dim B. It follows that, for every x ∈ B, we have dim Ax =
dim(A ∩ (B × Rn )) − dim B. Hence, each Xd is the union of some cells B of
Rm . This implies that Xd is definable. Since dim(A ∩ (B × Rn )) = dim B + d
for a cell B ⊂ Xd , we have dim(A ∩ (Xd × Rn )) = dim Xd + d. 

Exercise 3.19 Let A and B be subsets of Rm ×Rn , with A nonempty. Assume
that, for every x ∈ Rm , dim(Bx ) < dim(Ax ) or Bx is empty. Prove
that dim B < dim A.
34 CHAPTER 3. CONNECTED COMPONENTS AND DIMENSION

Exercise 3.20 Let f : A → Rm be a definable map. Prove that the set

Yd of x ∈ Rm such that dim(f −1 (x)) = d is definable. Prove that
dim(Yd ) = dim(f −1 (Yd )) − d.

We finish this section on dimension by showing that the dimension behaves

well with respect to closure. The following lemma will be useful.

Lemma 3.21 Let A be a definable subset of Rm × Rp . Let M be the set of

x ∈ Rm such that the closure of Ax in Rp is different from (clos(A))x . Then
M is definable and dim M < m. In particular, if m = 1, M is finite.

Proof. Note that we have always clos(Ax ) ⊂ (clos(A))x , since (clos(A))x is

closed and contains Ax .
We leave the verification of the definability of M as an exercise. Suppose
that dim(M ) = m. Then M contains an open cell C of a cdcd of Rm . For

every x ∈ C, we can find a box B = pi=1 (ai , bi ) such that B ∩ (clos(A))x = ∅
and B ∩ Ax = ∅. By Definable Choice 3.1 and Piecewise Continuity 2.12, we
can assume that all ai and bi are definable continuous functions of x ∈ C.
Let U be the set of (x, y1 , . . . , yp ) ∈ C × Rp such that ai (x) < yi < bi (x)
for i = 1, . . . , p. The set U is open in Rm × Rp , disjoint from A and has
nonempty intersection with clos(A). This is impossible. Hence, dim M < m.



Theorem 3.22 Let A be a nonempty definable subset of Rn . Then

dim(clos(A) \ A) < dim(A) .

It follows from the theorem that dim(clos(A)) = dim A.

Proof. We proceed by induction on n. The theorem is obvious for n = 1.
We assume that n > 1 and the theorem is proved for n − 1. We denote by
ξ1 , . . . , ξn the coordinate functions on Rn . For i = 1, . . . , n, let closi (A) be the
set of x ∈ Rn such that x belongs to the closure of the intersection of A with
the hyperplane ξi−1 (ξi (x)).
First step. We claim that clos(A) \ A has dimension not greater than the
maximum of 0 and dim(closi (A) \ A) for i = 1, . . . , n. We have closi (A) ⊂
clos(A). Applying Lemma 3.21 after a permutation of the coordinates which
puts the i-th coordinate in the first place, we obtain that the difference clos(A)\
closi (A) is contained in finitely many hyperplanes ξi−1 (ai,j ), for j = 1, . . . , (i).

Hence, clos(A) \ ni=1 closi A is contained in the finite set consisting of the
n
i=1 (i) points (a1,j1 , . . . , an,jn ) ∈ R . The claim follows.
n
3.3. DIMENSION 35

Second step. We claim that dim(closi (A) \ A) < dim A for i = 1, . . . , n.

Take a ∈ R. Since the hyperplane ξ1−1 (a) has dimension n − 1, the inductive
assumption implies that clos(A∩ξ1−1 (a))\(A∩ξ1−1 (a)) is empty or has dimension
strictly smaller than the dimension of A ∩ ξ1−1 (a); note that the first set is
(clos1 (A) \ A) ∩ ξ1−1 (a). Hence, applying the result of Exercise 3.19, we obtain
dim(clos1 (A) \ A) < dim A. Permuting the coordinates, we prove the claim.
Now we can complete the proof of the theorem. Steps 1 and 2 imply that
dim(clos(A) \ A) ≤ 0 or dim(clos(A) \ A) < dim A. If dim A = 0, A is closed.
Hence, for every nonempty A, dim(clos(A) \ A) < dim A. 
36 CHAPTER 3. CONNECTED COMPONENTS AND DIMENSION
Chapter 4

Definable Triangulation

In this chapter we show that the topology of definable sets can be entirely
encoded in finite terms. This will be done by means of a triangulation.

4.1 Good Coordinates

As we have seen in the last chapter, the cdcd is a very powerful tool. But it
does not give sufficient control on the relative disposition of the cells, when they
are not contained in the same cylinder. In particular, one cannot, in general,
reconstruct the topology of a definable set from its decomposition into cells
of an adapted cdcd. The main difficulty is that we have no control on how a
definable continuous function ζ : C → R on a cell C behaves as one approaches
the boundary of C. The function ζ, even if it is bounded, may not extend to a
continuous function on clos(C). For instance, the definable continuous function
ζ defined on the set of (x, y) ∈ R2 such that x > 0 by ζ(x, y) = 2xy/(x2 + y 2 )
does not extend continuously to (0, 0). All points (0, 0, z) with −1 ≤ z ≤ 1
belong to the closure Γ of the graph of ζ. The definable set Γ ⊂ R3 has
dimension 2, but the restriction to Γ of the projection R3 → R2 on the first
two coordinates is not finite-to-one (see Figure 4.1).
In this section, we consider the following problem: given a definable subset
G of Rn of dimension < n, can we make a polynomial change of coordinates
in Rn such that the restriction to G of the projection on the first n − 1 new
coordinates becomes finite-to-one? In other words, we want a polynomial
automorphism u : Rn → Rn such that pn,n−1 |u(G) : u(G) → Rn−1 is finite-
to-one. We look for u of the form u(x , xn ) = (x − v  (xn ), xn ), where x =
(x1 , . . . , xn−1 ) and v  : R → Rn−1 is a polynomial map. The condition that

37
38 CHAPTER 4. DEFINABLE TRIANGULATION

Figure 4.1: Γ ⊂ R3 near the origin

pn,n−1 |u(G) is finite-to-one reads:


for all y  ∈ Rn−1 , the set of xn ∈ R
(∗)
such that (y  + v  (xn ), xn ) ∈ G is finite.

We introduce the definable set

W = {(y  , x , xn ) ∈ Rn−1 × Rn−1 × Rn ; (y  + x , xn ) ∈ G} ,

and we set, for y  ∈ Rn−1 , Wy = {x ∈ Rn ; (y  , x) ∈ W }. Note that, for

all y  ∈ Rn−1 , Wy = G − (y  , 0) has dimension < n. We can translate the
condition (∗) as follows:

for all y  ∈ Rn−1 , the set of xn ∈ R such that (v  (xn ), xn ) ∈ Wy is finite.

Hence, our problem will be solved by the following lemma. In the statement of
the lemma, we exchange x1 and xn ; it will make the proof by induction easier
to write.

Lemma 4.1 Let W ⊂ Rm × Rn (n ≥ 2) be a definable set. For s ∈ Rm , define

Ws = {y ∈ Rn ; (s, y) ∈ W }. Assume that, for all s in Rm , dim(Ws ) < n.
Then there exist a polynomial map v  : R → Rn−1 of degree not greater than
m such that, for all s in Rm , the set of x1 ∈ R such that (x1 , v  (x1 )) ∈ Ws is
finite.
4.1. GOOD COORDINATES 39

Proof. We proceed by induction on n. We begin with n = 2. Let V be a

definable subset of dimension 1 of R2 . A cdcd of R2 adapted to V decomposes
V as the disjoint union of finitely many points, vertical open intervals and
graphs of definable continuous functions ζi : Ii → R, where Ii is an interval.
Consider such a function ζi . For a = (a0 , a1 , . . . , am ) ∈ Rm+1 , define fa : R →

R by fa (t) = m i
i=0 ai t . The set

x1 ∈ Ii ; ∃a ∈ Rm+1 ∃? ∈ R
 
? > 0 and ∀y ∈ Ii (|y − x1 | < ? ⇒ fa (y) = ζi (y))

is a definable open subset of R. It has finitely many definable connected

components which are open intervals. If U is one of its definable connected
components, there is a unique a such that fa |U = ζi |U . Hence, there are
finitely many a ∈ Rm+1 such that the set of x1 ∈ R such that (x1 , fa (x1 )) ∈ V
is infinite. From this we deduce that, for all s ∈ Rm , there are finitely many
a ∈ Rm+1 such that the set Ba,s = {x1 ∈ R ; (x1 , fa (x1 )) ∈ Ws } is infinite.
Therefore the definable set of (a, s) such that Ba,s is infinite has dimension at
most m. Then also the set of a ∈ Rm+1 , such that there is s ∈ Rm such that
Ba,s is infinite, has dimension at most m. Hence, there exists a polynomial fa
of degree not greater than m such that, for all s ∈ Rm , the set Ba,s is finite.
Given n > 2, assume the lemma proved for n − 1. Let Z be the definable
set of (s, x1 , u) ∈ Rm × R × Rn−2 such that {xn ∈ R ; (s, x1 , u, xn ) ∈ W } is
infinite. For all s ∈ Rm , the set Zs has dimension at most n−2 because Ws has
dimension at most n − 1. Therefore, we can apply the inductive assumption
to obtain a polynomial map g : R → Rn−2 of degree at most m such that, for
all s ∈ Rm , the set of x1 ∈ R such that (x1 , g(x1 )) ∈ Zs is finite. Consider the
definable subset of Rm × R2

M = {(s, x1 , xn ) ∈ Rm × R2 ; (s, x1 , g(x1 ), xn ) ∈ W } .

For all s ∈ Rm , the set Ms has dimension at most 1. Therefore, by the

argument above, there is a polynomial f of degree at most m such that for all
s ∈ Rm the set of x1 ∈ R such that (x1 , f (x1 )) ∈ Ms is finite. Set v  = (g, f ),
and the proof is complete. 


The lemma actually solves more than our initial problem.

Proposition 4.2 Let G be a definable subset of Rq × Rn . Assume that, for

every t in Rq , the dimension of Gt = {x ∈ Rn ; (t, x) ∈ G} is < n. Let
40 CHAPTER 4. DEFINABLE TRIANGULATION

pq+n,q+n−1 : Rq × Rn → Rq × Rn−1 be the projection on the first q + n − 1

coordinates. Then there is a polynomial automorphism u of Rn such that

∀(t, x ) ∈ Rq × Rn−1 p−1 

q+n,q+n−1 (t, x ) ∩ (R × u(Gt )) is finite .
q

Proof. Set

W = {(t, y  , x , xn ) ∈ Rq × Rn−1 × Rn−1 × R ; (t, y  + x , xn ) ∈ G}

W(t,y ) = {(x , xn ) ∈ Rn−1 × R ; (t, y  , x , xn ) ∈ W } .

For all (t, y  ) in Rq × Rn−1 , the dimension of W(t,y ) = Gt − (y  , 0) is < n. By

Lemma 4.1 (exchanging x1 and xn ), there is a polynomial mapping v  : R →
Rn−1 such that the set of xn in R such that (v  (xn ), xn ) ∈ W(t,y ) is finite. Now
set u(x , xn ) = (x − v  (xn ), xn ). Then u is a polynomial automorphism of Rn
which satisfies the condition of the proposition. 


The case q = 0 is our initial problem. In fact, this problem can be solved
with u a linear automorphism (see [vD], Theorem 4.2). The case q = 1 will be
useful for the triangulation of functions. The point of having a finite-to-one
projection is explained by the following proposition.

Proposition 4.3 Let F be a closed and bounded definable subset of Rn , such

that pn,n−1 |F is finite-to-one. Let X ⊂ pn,n−1 (F ) be a definable subset of Rn−1
such that every x ∈ clos(X) has a basis of neighborhoods U such that U ∩ X
is definably connected (this is the case, for instance, if X is convex). Then
every continuous definable function ζ : X → R whose graph is contained in F
extends continuously to clos(X).

Proof. Let Γ ⊂ F be the graph of ζ. Its closure is bounded, and

pn,n−1 (clos(Γ)) = clos(X). Take x ∈ clos(X). The set clos(Γ) ∩ p−1 
n,n−1 (x )

is nonempty and finite. Take a ∈ R and δ > 0 such that ({x } × (a − δ, a +
δ)) ∩ clos(Γ) = (x , a). For every ε such that 0 < ε < δ, there is neighborhood
U of x such that U ∩ X is definably connected, U ∩ ζ −1 (a − ε, a + ε) = ∅, and
ζ(y  ) = a ± ε for every y  ∈ X ∩ U . It follows that ζ(U ∩ X) ⊂ (a − ε, a + ε).
This proves that ζ extends continuously to x , with value a. 


4.2 Simplicial Complex

We recall some definitions concerning simplicial complexes that we shall need.
Let a0 , . . . , ad be points of Rn which are affine independent (i.e. not contained
4.2. SIMPLICIAL COMPLEX 41

in an affine subspace of dimension d−1). The d-simplex with vertices a0 , . . . , ad

is

[a0 , . . . , ad ] =

d
{x ∈ Rn ; ∃λ0 , . . . , λd ∈ [0, 1] λi = 1 and x = λ0 a0 + . . . + λd ad } .
i=0

a1 a1

a1 a3
a0 a0
a0 a0 a2 a2
0-simplex 1-simplex 2-simplex 3-simplex

Figure 4.2: Simplices

The corresponding open simplex is


d
{x ∈ Rn ; ∃λ0 , . . . , λd ∈ (0, 1] λi = 1 and x = λ0 a0 + · · · + λd ad }
i=0

We shall denote by σ the open simplex corresponding to the simplex σ. A face

of the simplex σ = [a0 , . . . , ad ] is a simplex τ = [b0 , . . . , be ] such that

{b0 , . . . , be } ⊂ {a0 , . . . , ad } .

A finite simplicial complex in Rn is a finite collection K = {σ 1 , . . . , σ p } of

simplices σ i ⊂ Rn such that, for every σ i , σ j ∈ K, the intersection σ i ∩ σ j is a
common face of σ i and σ j (see Figure 4.3).

We set |K| = σi ∈K σ i ; this is a semialgebraic subset of Rn . A polyhedron
in Rn is a subset P of Rn , such that there exists a finite simplicial complex K
in Rn with P = |K|. Such a K will be called a simplicial decomposition of P .
Note that a polyhedron is a closed and bounded definable set. In the following,
it will be convenient to agree that if a simplex σ belongs to a finite simplicial
complex K, then all faces of σ also belong to K. With this convention, |K| is
the disjoint union of all open simplices σ for σ ∈ K.
42 CHAPTER 4. DEFINABLE TRIANGULATION

We shall also use the notion of a cone. Let B be a polyhedron in Rn , and

a ∈ (Rn \ B) such that every half-line from a intersects B in at most one point
(i.e., for every x ∈ B, [a, x] ∩ B = {x}). The cone with base B and vertex a is
the polyhedron

a ∗ B = {tx + (1 − t)a ; x ∈ B and t ∈ [0, 1]} .

Given a simplicial decomposition of B, we obtain a simplicial decomposition

of a ∗ B by taking all a ∗ σ, for σ a simplex of the simplicial decomposition of
B

4.3 Triangulation of Definable Sets

Theorem 4.4 Let A be a closed and bounded definable subset of Rn and let
Bi , i = 1, . . . , k, be definable subsets of A. Then there exist a finite simplicial
complex K with vertices in Qn and a definable homeomorphism Φ : |K| → A
such that each Bi is a union of images by Φ of open simplices of K.

Proof. We proceed by induction on n. The case of n = 1 is obvious. We can

subdivide R with finitely many points x1 < . . . < xp such that A and the Bi
are unions of points xi and intervals (xj , xj+1 ). Then we choose a definable
homeomorphism τ : R → R such that τ (xi ) = i for i = 1, . . . , p. We take for
Φ the restriction of τ −1 to τ (A).
Now assume that n > 1 and the theorem is proved for n − 1. Since every
definable set is a finite union of locally closed definable sets (cf. Exercise 3.8),
we may assume that the Bi are locally closed. Then we can replace Bi with its
closure clos(Bi ) and the difference clos(Bi ) \ Bi . Hence, we can assume that
all Bi are closed. Let F0 be the boundary A ∩ clos(Rn \ A) of A and Fi the

boundary of Bi , for i = 1, . . . , k. Set F = ki=0 Fi . Then F is a closed and
bounded definable set of dimension < n. Let p = pn,n−1 : Rn → Rn−1 be the

not a simplicial complex a simplicial complex

Figure 4.3: Simplicial complex

4.3. TRIANGULATION OF DEFINABLE SETS 43

projection on the first n − 1 coordinates. By Proposition 4.2, we can assume

that, for all x ∈ Rn−1 , p−1 (x ) ∩ F is finite.
We make a cdcd of Rn adapted to F0 , F1 , , . . . , Fk . We get a finite partition
of p(A) = p(F0 ) into definably connected definable subsets Xλ of Rn−1 , and
definable continuous functions
ζλ,1 < . . . < ζλ,m(λ) : Xλ −→ R ,
such that every graph of ζλ,µ is contained in some Fi and every Fi is a union
of graphs of ζλ,µ . Since every band (ζλ,µ , ζλ,µ+1 ) is definably connected and
disjoint from the boundaries Fi , it is contained in or disjoint from each one of
A, B1 , . . . , Bk .
Applying the inductive assumption, we obtain a simplicial complex L with
vertices in Qn−1 and a definable homeomorphism Ψ : |L| → p(A) and such
that all Xλ are the images by Ψ of unions of open simplices of L. Replacing
A with {(x , xn ) ∈ |L| × R ; (Ψ(x ), xn ) ∈ A}, we can assume that Ψ is the
identity. Moreover, we can partition the Xλ and assume that they are the
open simplices σλ of L (the open simplices are no longer cells of a cdcd). We
denote by (Cα )α=1,..., the collection of all graphs of ζλ,µ : σλ → R and all
bands (ζλ,µ , ζλ,µ+1 ) ⊂ σλ × R which are contained in A. By Proposition 4.3,
since F is closed and bounded and p|F : F → Rn−1 is finite-to-one, every
ζλ,µ : σλ → R can be continuously extended to the closed simplex σ λ . We
denote the extension by ζ λ,µ . The graph of this extension is contained in F .
It follows that, if σλ is contained in σ λ , the restriction of ζ λ,µ to σλ coincides
with some ζλ ,µ . We denote by C α the closure of Cα . It is either the graph of
some ζ λ,µ or some closed band [ζ λ,µ , ζ λ,µ+1 ] ⊂ σ λ × R (obvious notation). The
set ∂Cα = C α \ Cα is a union of Cβ with dim(Cβ ) < dim(Cα ).
For every simplex σ λ of L, let b(σλ ) ∈ Qn−1 be its barycenter. If Cα is
the graph of ζλ,µ : σλ → R, we set bα = (b(σλ ), µ) ∈ Qn . If Cα is the band
(ζλ,µ , ζλ,µ+1 ), we set bα = (b(σλ ), µ + 12 ) ∈ Qn . Now we associate to each C α
a polyhedron Dα , by induction on dim(C α ). Moreover, we give a simplicial
decomposition of Dα . If C α is a point, we set Dα = {bα }. If dim(Cα ) > 0,
then Dα is the cone with vertex bα and base the union ∂Dα of all Dβ such
that Cβ ⊂ ∂Cα . We decompose Dα by taking the cones with vertex bα over
all simplices of the simplicial decompositions of Dβ ⊂ ∂Dα . We obtain in this

way a finite simplicial complex K such that |K| = α=1 Dα . The simplices of
K are all simplices [bα0 , bα1 , . . . , bαq ] such that Cαi−1 ⊂ ∂Cαi for i = 1, . . . , q.
The complex K has all its vertices in Qn . Note that, by construction, p(Dα ) =
p(C α ). We construct a definable homeomorphism θα : Dα → C α such that
p◦θα = p|Dα . If C α is the graph of ζ λ,µ , we must have θα (x , xn ) = (x , ζ λ,µ (x )).
44 CHAPTER 4. DEFINABLE TRIANGULATION

If C α is the closed band [ζ λ,µ , ζ λ,µ+1 ], we choose θα so that, for every x ∈ σ λ , it

carries the segment ({x }×R)∩Dα onto the segment {x }×[ζ λ,µ (x ), ζ λ,µ+1 (x )]
in an affine way (note that ({x } × R) ∩ Dα is reduced to a point if and only
if ζ λ,µ (x ) = ζ λ,µ+1 (x )). The homeomorphism θα carries ∂Dα onto ∂Cα .

b6
C6
b5
C5
b4 b9 C1 C8 C9
b8
b3 C4
b1 C7
C3
b2 b7 C2
D1 C1

Figure 4.4: The construction of K

We finish the proof by constructing a definable homeomorphism Φ : |K| →
A such that p◦Φ = p|K| and Φ(Dα ) = C α for α = 1, . . . , . We cannot just take
Φ|Dα = θα , because θα |Dβ may be different from θβ for Dβ ⊂ ∂Dα (see what
happens for D3 ⊂ ∂D1 in Figure 4.4). So we modify θα to obtain a definable
homeomorphism Φα : Dα → C α verifying Φα |Dβ = Φβ and p ◦ Φα = p|Dα .
We proceed by induction on dim(Dα ). We take Φα = θα if Dα is a point. If
dim(Dα ) > 0, denote by ρα : ∂Dα → ∂Dα the homeomorphism defined by
ρα |Dβ = θα−1 ◦ Φβ for all Dβ ⊂ ∂Dα . We extend the homeomorphism ρα to a
homeomorphism ηα : Dα → Dα using the conic structure of Dα = bα ∗ ∂Dα :
for every x ∈ ∂Dα and t ∈ [0, 1], we set ηα (tx + (1 − t)bα ) = tρα (x) + (1 − t)bα .
Then we set Φα = θα ◦ ηα . Observe that p ◦ η = p|Dα and p ◦ Φα = p|Dα . Now
we can take Φ defined by ΦDα = Φα for α = 1, . . . , . 


4.4 Triangulation of Definable Functions

Theorem 4.5 Let X be a closed and bounded definable subset of Rn and f :
X → R a continuous definable function. Then there exist a finite simplicial
complex K in Rn+1 and a definable homeomorphism ρ : |K|R → X such that
f ◦ ρ is an affine function on each simplex of K.
4.4. TRIANGULATION OF DEFINABLE FUNCTIONS 45

Moreover, given finitely many definable subsets B1 , . . . , Bk of X, we may

choose the triangulation ρ : |K|R → X so that each Bi is a union of images of
open simplices of K.

We replace X with the set A = {(f (x), x) ∈ R × Rn ; x ∈ X} which is

definably homeomorphic to X. This set is a closed and bounded definable
subset of Rn+1 . Let π = pn+1,1 : Rn+1 → R be the projection on the first
coordinate. In order to prove Theorem 4.5, it is sufficient to construct a finite
simplicial complex K in Rn+1 and a definable homeomorphism Φ : |K| → A
such that π ◦Φ = π||K| . Indeed, the composition of π with the homeomorphism
X → A is f . So Theorem 4.5 follows from the next proposition.

Proposition 4.6 Let A be a closed and bounded definable subset of R × Rn

and let Bi , i = 1, . . . , k, be definable subsets of A. Let π : R × Rn → R be the
projection on the first coordinate. Then there exist a finite simplicial complex
K with vertices in R × Qn and a definable homeomorphism Φ : |K| → A such
that π ◦ Φ = π||K| and each Bi is a union of images by Φ of open simplices of
K.

Proof. We proceed by induction on n. The case of n = 0 is obvious. We can

subdivide R with finitely many points x1 < . . . < xp such that A and the Bi
are unions of points xi and intervals (xj , xj+1 ). We choose for K the collection
of points xi and closed and bounded intervals [xj , xj+1 ] contained in A.
Assume that n > 0 and the proposition is proved for n − 1. As in the proof
of Theorem 4.4, we can assume that all Bi are closed.
Let G0 be the boundary of A and Gi the boundary of Bi , for i = 1, . . . , k.

Set G = ki=0 Gi . Then G is a closed and bounded definable set of dimension at
most n. Denote by C the finite set of points c ∈ R such that {x ∈ Rn ; (c, x) ∈
G} is of dimension n. Let Fi , i = 0, . . . , k be the union of the closure of

Gi \ (C × Rn ) with the boundary of Gi ∩ (C × Rn ) in C × Rn . Set F = ki=0 Fi .
Each Fi is a closed and bounded definable set. We claim that, for every t in R,
the dimension of Ft = {x ∈ Rn ; (t, x) ∈ F } is < n. Since Gi ∩ (C × Rn ) has
dimension n, the dimension of its boundary is at most n − 1. Hence, it suffices
to check that the dimension of (clos(Gi \ (C × Rn )))t is not greater than n − 1.
This follows from the next lemma applied to X = Gi \ (C × Rn ).

Lemma 4.7 Let X be a definable subset of R × Rn such that, for every t ∈ R,

the dimension of Xt is < n. Then, for every t ∈ R, we have dim((clos(X))t ) <
n.
46 CHAPTER 4. DEFINABLE TRIANGULATION

Proof. It follows from the assumption that dim X ≤ n. Hence, the dimension
of the boundary of X is < n. Since (clos(X))t \Xt is contained in the boundary
of X, we have dim((clos(X))t ) < n. 


We return to the proof of Proposition 4.6. Let p = pn+1,n : R × Rn →

R×Rn−1 be the projection on the first n coordinates. By Proposition 4.2, since
dim(Ft ) < n for every t ∈ R, we can assume that for all (t, x ) ∈ R × Rn−1 ,
(p−1 (t, x ) ∩ F ) is finite. We choose a cdcd of R×Rn adapted to F0 , . . . , Fk and
to {c} × Rn for every c ∈ C. We get a finite partition of p(A) into definably
connected definable subsets Xλ of R×Rn−1 , and definable continuous functions
ζλ,1 < . . . < ζλ,mλ : Xλ −→ R ,
such that every graph of ζλ,µ is contained in some Fi and every Fi is a union
of graphs of ζλ,µ . Note that every graph of ζλ,µ and every band (ζλ,µ , ζλ,µ+1 )
is either contained in Gi or disjoint from Gi . It follows that A and the Bi are
unions of such cells.
Applying the inductive assumption, we may assume that there is a sim-
plicial complex L with vertices in R × Qn−1 and a definable homeomorphism
Ψ : |L| → p(A) such that pn,1 ◦ Ψ = pn,1 ||L| and all Xλ are unions of images of
open simplices of L by Ψ. From now on, we can follow the proof of Theorem
4.4 and construct a triangulation Φ : |K| → A such that all vertices of K are
in R × Qn , each Bi is the image by Φ of a union of open simplices of K, and
p ◦ Φ = Ψ ◦ p||K| . It follows that
π ◦ Φ = pn,1 ◦ p ◦ Φ = pn,1 ◦ Ψ ◦ p||K| = pn,1 ◦ p||K| = π||K| .



The vertices of the simplicial complex constructed in Proposition 4.6 have

all their coordinates rational but the first. We shall need to have also the first
coordinate rational. But this has to be paid with some extra complication.
Proposition 4.8 Let A be a closed and bounded definable subset of R × Rn
and let Bi , i = 1, . . . , k, be definable subsets of A. Let π : R × Rn → R be
the projection on the first factor. Then there exist a finite simplicial complex
K with vertices in Q × Qn and definable homeomorphisms Φ : |K| → A and
τ : R → R such that τ ◦ π ◦ Φ = π||K| and each Bi is a union of images by Φ
of open simplices of K.
Proof. We just modify the step n = 0 of the proof of the preceding proposition.
We can subdivide R with finitely many points x1 < . . . < xp such that A
4.4. TRIANGULATION OF DEFINABLE FUNCTIONS 47

and the Bi are unions of points xi and intervals (xj , xj+1 ). We choose for K
the collection of points 1, . . . , p and segments [j, j + 1] such that [xj , xj+1 ] is
contained in A. We choose for τ a piecewise affine homeomorphism sending
xi to i. The rest of the proof is the same, using the appropriate inductive
assumption. 


The result of triangulation of continuous definable functions cannot be

generalized to all continuous definable maps. Consider for instance, the map
f : [0, 1]2 → R2 defined by f (x, y) = (x, xy). There is no way to choose
triangulations Φ : |K| → [0, 1]2 and Ψ : |L| → f ([0, 1]2 ) such that Ψ−1 ◦ f ◦ Φ
is affine on every simplex of K.

Exercise 4.9 Prove the preceding assertion. Hint: Setting a = (0, 0) ∈ R2

and A = f ((0, 1)2 ), remark that a ∈ clos(A), dim(clos(f −1 (A)) ∩
f −1 (a)) = 1 and dim(f −1 (x)) < 1 for all x ∈ A. Show that this
cannot happen for a map which is defined on a polyhedron and affine
on each simplex of a simplicial decomposition.

Note that the crucial point in the proof of Theorem 4.5 which is only valid
for functions with values in R is the claim that dim(Ft ) is < n for every t in
R. Indeed, Lemma 4.7 is no longer true if the parameter t varies in Rm with
m > 1. The counterexample above also gives a counterexample to the lemma
for m > 1: take

X = {(x, z, y) ∈ R2 × R ; x = 0 and z = xy} .

Then, for all (x, z) ∈ R2 , dim(X(x,z) ) < 1, but dim(clos(X)(0,0) ) = 1.

We can deduce from the triangulation of definable functions a result which
is usually proved in other ways (as a consequence of Hardt’s theorem in [vD]).
If a ∈ Rn and r > 0, we denote by S(a, r) the sphere with center a and radius
r.

Theorem 4.10 (Local Conic Structure) Let A ⊂ Rn be a closed definable

set, a a point in A. There is r > 0 such that there exists a definable homeo-
morphism h from the cone with vertex a and base S(a, r) ∩ A onto B(a, r) ∩ A,
satisfying h|S(a,r)∩A = Id and h(x) − a = x − a for all x in the cone.

Proof. We triangulate the function f : x → x − a restricted to A ∩ B(a, 1).

We obtain a definable homeomorphism Φ : |K| → A ∩ B(a, 1) such that f ◦ Φ
is affine on each simplex of K. Since f takes its minimum in a, this point a
48 CHAPTER 4. DEFINABLE TRIANGULATION

is the image of vertex w of K. Let µ > 0 be the minimum of the values of

f ◦ Φ at all other vertices of K, and take r such that 0 < r < µ. Take a point
y ∈ |K| such that f ◦ Φ(y) = r, i.e. Φ(y) ∈ S(a, r) ∩ A. The point y belongs
 
to a simplex [v0 , . . . , vd ] of K. We have y = di=0 λi vi with di=0 λi = 1. Since

f ◦ Φ(y) = di=0 λi f ◦ Φ(vi ), one of the vi , say v0 , must be w. Define h on the
cone with vertex a and base S(a, r)∩A by h(ta+(1−t)Φ(y)) = Φ(tw+(1−t)y).
It is easily checked that h has the properties stated in the theorem. 


The following exercise is a generalization of the local conic structure theo-

rem.

Exercise 4.11 Prove the following result:

Let Z ⊂ S be two closed and bounded definable sets. Let f be a nonneg-
ative continuous definable function on S such that f −1 (0) = Z. Then
there are δ > 0 and a continuous definable map h : f −1 (δ) × [0, δ] →
f −1 ([0, δ]), such that f (h(x, t)) = t for every (x, t) ∈ f −1 (δ) × [0, δ],
h(x, δ) = x for every x ∈ f −1 (δ), and h|f −1 (δ)× ]0,δ] is a homeomorphism
onto f −1 (]0, δ]).
Hints: 1) Triangulate f , so that one can assume S = |K| for a finite
simplicial complex, Z is a union of simplices and f is affine on each
simplex.
2) Choose δ > 0 so small that, for every vertex a of K such that a ∈ Z,
δ < f (a).
3) Let x ∈ f −1 (δ). The point x belongs to a simplex [a0 , . . . , ad ] of
K. We can assume that ai ∈ Z, for i = 0, . . . , k, and ai ∈ Z, for
 
i = k + 1, . . . , d. Let x = di=0 λi ai with di=0 λi = 1. Show that
k
α = i=0 λi satisfies 0 < α < 1.
4) For t ∈ [0, δ], define h(x, t) as the point y in the segment joining
k
i=0 (λi /α)ai to x such that f (y) = t. Check that h is well defined and
satisfies the required properties.
Chapter 5

Generic Fibers for Definable

Families

5.1 The Program

We motivate what we are going to do with a very simple example from algebraic
geometry. Consider the family of conics x2 − t(1 + y 2 ) = 0 in C2 , parametrized
by t ∈ C. We can also regard x2 − t(1 + y 2 ) = 0 as the equation of a conic
defined over the field C(t). This conic is the “generic fiber of the family”.
The fact that the generic fiber of the family is a nondegenerate conic (the
discriminant is t2 , which is invertible in C(t)) corresponds to the fact that the
conics in the family are non degenerate for almost all values of t (the only
exception is t = 0). This is formalized by using the prime spectrum Spec(C[t])
of the ring C[t]. We have C embedded in Spec(C[t]), each z ∈ C corresponding
to the maximal ideal (t − z) of C[t]. The residue field at these maximal ideals
is C. There is another point in Spec(C[t]): the ideal (0), whose residue field is
C(t). This point is the “generic point” of C.
We are going to embed Rm into a bigger space R  m . We shall associate to

each point α ∈ R a real closed field κ(α) with an o-minimal structure. Then,
m

given a definable family X ⊂ Rm ×Rn and α ∈ R m , we shall define the fiber X

α
n
which will be a definable subset of κ(α) . If α is the image by the imbedding
of a point t ∈ Rm , then κ(α) will be R and Xα will be the usual fiber Xt .
The interesting things will happen for “generic fibers” Xα corresponding to
points α ∈ R  m \ Rm . We shall relate the properties of the generic fiber X
α
with properties of the family X over “large” subsets of the parameter space
Rm . This will be used to deduce results of triviality for definable families from
the triangulation theorems of the preceding chapter.

49
50 CHAPTER 5. GENERIC FIBERS FOR DEFINABLE FAMILIES

The tools that we are going to introduce are actually a reformulation of clas-
sical model-theoretic notions and results (m-types, definable ultrapower,. . . ).
This reformulation is modelled upon the theory of the real spectrum (cf.
[BCR]).

5.2 The Space of Ultrafilters of Definable Sets

Let Sm be the Boolean algebra of definable subsets of Rm . The content of
this section is nothing but the construction of the Stone space of the Boolean
algebra Sm (cf. [BS]). Nevertheless, we give a more or less self-contained
account of this construction for the reader who is not familiar with ultrafilters
and Stone spaces.
We denote by R  m the set of ultrafilters of S . Recall that an ultrafilter of
m
Sm is a subset α of Sm such that
1. Rm ∈ α
2. A ∩ B ∈ α if and only if A ∈ α and B ∈ α
3. ∅ ∈ α
4. A ∪ B ∈ α if and only if A ∈ α or B ∈ α
We say that a family F of definable subsets of Rm generates the ultrafilter α
if α is the set of definable sets A ⊂ Rm such that there exists B ∈ F with
B ⊂ A. If F is a nonempty family of definable subsets of Rm , closed under
finite intersections, then it generates an ultrafilter if and only if ∅ ∈ F and,
for every A ∈ Sm , either A or Rm \ A contains a B ∈ F.
If t is a point of Rm , the definable subsets of Rm containing t form an
ultrafilter αt . This is called the principal ultrafilter generated by t. The map
t → αt embeds Rm as a subset of R  m . The following exercises give examples

of points of R m\R m

Exercise 5.1 Points of R.  Show that that the following families generate
ultrafilters of S1 :
1) The family of all intervals (x, +∞) for x ∈ R.
2) The family of all intervals (−∞, x) for x ∈ R.
3) For a fixed a ∈ R, the family of all intervals (a, a + ε) for ε > 0.
4) For a fixed a ∈ R, the family of all intervals (a − ε, a) for ε > 0.
If R = R, show that all points of R  \ R correspond to one of the four
cases above.
5.2. THE SPACE OF ULTRAFILTERS OF DEFINABLE SETS 51


Exercise 5.2 Construction of points of R m by induction. Let α be a point of

R . Show that the family of definable subsets of Rm+1 of the form
m

{(x, y) ∈ Rm × R ; x ∈ A and 0 < y < f (x)} ,

where A ∈ α and f : A → R is a positive definable function, generates
an ultrafilter α↑ of Sm+1 . Hint: given a definable subset B of Rm+1 ,
use a cdcd of Rm+1 to show that either B or its complement belongs
to α↑ .

Exercise 5.3 Dimension of a point of R m . For α ∈ Rm , define dim α as the

minimum of dim A for A ∈ α. Show that dim α = d if and only if α

is generated by a family of definable sets of dimension d. Show that
dim(α↑ ) = dim α + 1 (with the notation of Exercise 5.2). Show that
there is an ultrafilter of dimension m in Rm . Show that dim A is the

maximum of dim α for α A.

Now we put a topology on R  
m . We consider R m as a subset of the powerset

2Sm , identifying an ultrafilter α with its characteristic function 1α : Sm → 2 =

{0, 1}. We equip 2 with the discrete topology and 2Sm with the product topol-
ogy. By Tychonoff theorem, 2Sm is compact Hausdorf. We take as topology
on R m the topology induced by the topology of 2Sm .

Proposition 5.4 The topology of Rm has a basis of open and closed sets con-

sisting of all A = {α ∈ R
 m ; α A} for A ∈ Sm . The space R  m is compact

Hausdorf.
Proof. First note that the operation A → A preserves finite unions, finite
intersections and taking complement.

The product topology of 2Sm induces on R m the topology which has as

basis of open sets the sets of the form


U = {α ∈ R m ; 1 (A ) = . . . = 1 (A ) = 1 and 1 (B ) = . . . = 1 (B ) = 0} ,
α 1 α k α 1 α 

where (A1 , . . . , Ak ) and (B1 , . . . , B ) are finite families of elements of Sm . Note

that U = A, where A = k A ∩  (Rm \B ). This proves the first assertion
i=1 i j=1 j
of the proposition.
Finally, note that each one of the four conditions of the definiton of an
ultrafilter defines a closed subset of 2Sm . Hence, R  m is closed in 2Sm . This

proves the second assertion. 


Exercise 5.5 Prove that the application A → A is a bijection from Sm to the

set of open and closed subsets of R m.
52 CHAPTER 5. GENERIC FIBERS FOR DEFINABLE FAMILIES

5.3 O-minimal Structure Associated with an

Ultrafilter
If A is a definable subset of Rm , we denote by Def(A, R) the ring of definable
functions A → R. Given α ∈ R  m , we define κ(α) as the inductive limit of

Def(A, R) for A ∈ α. This means the following. We form the disjoint union

A∈α Def(A, R). We say that two elements f : A → R and g : B → R of
this disjoint union are equivalent if there exists C ∈ α, C ⊂ A ∩ B, such that
f |C = g|C . Then κ(α) is the set of equivalence classes for this equivalence
relation. We denote by f (α) ∈ κ(α) the equivalence class of f : A → R.
By definition, f (α) = g(α) if and only if f and g coincide on a definable
set belonging to α. The inductive limit κ(α) has a canonical structure of
commutative R-algebra: The sum f (α) + g(α) is (f + g)(α), where f + g is
defined on the intersection of the domains of f and g, which belongs to α. We
have a similar definition for the product f (α)g(α). The images of elements of
R are the classes of the constant functions. The verifications are easy.
We define f (α) ∈ κ(α) to be positive if f is positive on a definable set
belonging to α. This does not depend on the choice of the representant f .

Proposition 5.6 The commutative R-algebra κ(α), with positive elements de-
fined as above, is an ordered field which is an ordered extension of R.

Proof. We check that, for an element f (α) of κ(α), we have exactly one of
the three possibilities f (α) > 0, f (α) = 0 and −f (α) > 0. This is because
the domain of f is partitioned into the three definable sets where f is positive,
zero or negative, respectively. Exactly one of these three sets belongs to α.
Moreover, if f (α) = 0, then 1/f is defined on a definable set belonging to α.
Hence, (1/f )(α) is the inverse of f (α) in κ(α). The other verifications are also
easy. 

Now we shall construct an o-minimal structure on κ(α). For this we need

the notion of the fiber of a definable family X ⊂ Rm × Rn at α ∈ R m . If

f = (f1 , . . . , fn ) : A → Rn is a definable map and A ∈ α, we denote by f (α)

the point (f1 (α), . . . , fn (α)) ∈ κ(α)n .

Definition 5.7 Let X be a definable subset of Rm × Rn . The fiber of X at

α∈R  m is the set X of those f (α) in κ(α)n such that there exist A ∈ α on
α
which f is defined and (t, f (t)) ∈ X for all t ∈ A.
5.3. THE O-MINIMAL STRUCTURE κ(α) 53

In other words, f (α) belongs to Xα if and only if there is A ∈ α such that

f (t) ∈ Xt for all t ∈ A. This definition makes sense because, if we take another
representant g of f (α) (i.e. g(α) = f (α)), g and f coincide on some B ∈ α
and, therefore, g(t) ∈ Xt for all t ∈ A ∩ B, with A ∩ B ∈ α.
It is worth looking at what the preceding constructions and definitions give
in the case of a principal ultrafilter αt corresponding to a point t ∈ Rm . Since
the ultrafilter αt is generated by the singleton {t}, the inductive limit κ(αt )
is (canonically isomorphic to) Def({t}, R) = R. Moreover, if f : A → R is a
definable function and A t, then f (αt ) = f (t) ∈ R. Finally, given a definable
set X ⊂ Rm ×Rn , its fiber Xαt is simply the set of x ∈ Rn such that (t, x) ∈ X,
i.e. Xt .
Now we can define the o-minimal structure on κ(α). Let Sn (α) be the
family of all fibers Xα , for X a definable subset of Rm × Rn .

Theorem 5.8 The collection (Sn (α))n∈N is an o-minimal structure expanding

the ordered field κ(α). In particular, κ(α) is real closed.

Proof. We have to check the five properties in the definition of an o-minimal

structure.
1) For every n ∈ N, Sn (α) is a Boolean subalgebra of the powerset of κ(α)n .
It is sufficient to check the following fact. Let X and Y be definable subsets
of Rm × Rn . Then we have:

(X ∩ Y )α = Xα ∩ Yα , (X ∪ Y )α = Xα ∪ Yα ,
((Rm × Rn ) \ X)α = κ(α)n \ Xα .

Let us check the last equality. Let f (α) be an element of κ(α)n , with fi ∈
Def(A, R) and A ∈ α. The two definable sets B = {t ∈ A ; f (t) ∈ Xt } and
C = {t ∈ A ; f (t) ∈ ((Rm × Rn ) \ X)t } partition A. Therefore, exactly one of
B and C belongs to α. This means that f (α) belongs to ((Rm × Rn ) \ X)α if
and only if it does not belong to Xα .
The verification of the other equalities is left to the reader.
2) All algebraic subsets of κ(α)n are in Sn (α). It is sufficient to check this
for an algebraic set V ⊂ κ(α)n given by one equation

ai (α)xi = 0 ,
i∈I
54 CHAPTER 5. GENERIC FIBERS FOR DEFINABLE FAMILIES

where I is a finite subset of Nn , i = (i1 , . . . , in ) and xi = xi11 · · · xinn . Let A ∈ α

be such that all definable functions ai are defined on A. Set

X = {(t, x) ∈ Rm × Rn ; t ∈ A and ai (t)xi = 0} .
i∈I

Then X is a definable set. We have f (α) ∈ V if and only if there exists B ∈ α


such that i∈I ai (t)f i (t) = 0 for all t ∈ B, i.e. f (t) ∈ Xt for all t ∈ B. Hence,
V = Xα .
3) If Xα ∈ Sn (α) and Yα ∈ Sp (α), then Xα × Yα ∈ Sn+p (α). Set

X ×Rm Y = {(t, x, y) ∈ Rm × Rn × Rp ; (t, x) ∈ X and (t, y) ∈ Y } .

Note that (X ×Rm Y )t = Xt × Yt for all t ∈ Rm . It follows that (X ×Rm Y )α =

Xα × Yα .
4) If p : κ(α)n+1 → κ(α)n is the projection on the first n coordinates and
Xα ∈ Sn+1 (α), then p(Xα ) ∈ Sn (α). Let π : Rm × Rn+1 → Rm × Rn be the
projection on the first m + n coordinates. It is sufficient to check that

p(Xα ) = π(X)α .

Let f (α) be an element of κ(α)n . If f (α) belongs to p(Xα ), there is g(α) ∈ κ(α)
and A ∈ α such that (f (t), g(t)) ∈ Xt for all t ∈ A. Hence f (t) ∈ π(X)t for all
t ∈ A, which shows f (α) ∈ π(X)α . Conversely, assume f (α) ∈ π(X)α . Then
there is B ∈ α such that, for all t ∈ B, there exists y ∈ R with (f (t), y) ∈ Xt .
By Definable Choice 3.1, we can choose such a y as a definable function g :
B → R. It follows that (f (α), g(α)) ∈ Xα and f (α) ∈ p(Xα ).
5) The elements of S1 (α) are precisely the finite unions of points and in-
tervals in κ(α). Take Xα ∈ S1 (α) and choose a cdcd of Rm × R adapted
to X. We have a partition of Rm into cells C1 , . . . , Ck and, for each cell Ci ,
continuous definable functions ζi,1 < . . . < ζi,(i) : Ci → R such that X is
a union of graphs of ζi,j and bands (ζi,j , ζi,j+1 ). Exactly one of the Ci be-
longs to the ultrafilter α, say C1 ∈ α. We claim that Xα is the union of the
points ζ1,j (α) such that the graph of ζ1,j is contained in X and the intervals
(ζ1,j (α), ζ1,j+1 (α)) such that the band (ζ1,j , ζ1,j+1 ) is contained in X. Since
C1 ∈ α, we can replace X with X ∩ (C1 × R). Since taking the fiber at α
commutes with union, we can assume that X is a graph or a band over C1 .
If X is the band (ζ1,j , ζ1,j+1 ), then f (α) ∈ Xα if and only if there is B ∈ α
such that ζ1,j (t) < f (t) < ζ1,j+1 (t) for all t ∈ B, i.e. f (α) ∈ (ζ1,j (α), ζ1,j+1 (α)).


5.3. THE O-MINIMAL STRUCTURE κ(α) 55

Note that there are two crucial points in the proof: the use of Definable
Choice in the proof of the stability by projection (point 4) and the use of the
cdcd to prove the o-minimality (point 5). All the rest is rather formal.
The proof of Theorem 5.8 shows that taking fibers at α commutes with
the boolean operations and the projections. We shall formalize this remark
in order to have a useful tool for translating properties of the fiber Xα to
properties of the fibers Xt for all t in a definable set belonging to α. First we
introduce some notation. We consider the definable families of formulas Φt (x),
where t ranges over Rm , which are constructed according to the following rules:
1. If X ⊂ Rm × Rn is definable, x ∈ Xt is a definable family of formulas.

2. A polynomial equation P (x) = 0 or inequality P (x) > 0 with coefficients

in R is a definable (constant) family of formulas.

3. If Φt (x) and Ψt (x) are definable families of formulas, then Φt (x) ∗ Ψt (x)
(where ∗ is one of “and”, “or”, ⇒, ⇔) and the negation “not Φt (x)” are
definable families of formulas.

4. If Φt (x, y) is a definable family of formulas (with y ranging over Rp ) and

Y ⊂ Rm × Rp is definable, the existential quantification ∃y ∈ Yt Φt (x, y)
and the universal quantification ∀y ∈ Yt Φt (x, y) are definable families of
formulas.

Given a definable family of formulas Φt (x) and α ∈ R m , we define the fiber

formula Φα (x) in the following way:

1. If Φt (x) is x ∈ Xt , Φα (x) is x ∈ Xα

2. If Φt (x) is the constant family P (x) = 0 or P (x) > 0, Φα (x) is P (x) = 0

or P (x) > 0.

3. If Φt (x) is Θt (x) ∗ Ψt (x), or “not Θt (x)”, Φα (x) is Θα (x) ∗ Ψα (x) or “not

Θα (x)”, respectively.

4. If Φt (x) is ∃y ∈ Yt Ψt (x, y) or ∀y ∈ Yt Ψt (x, y), Φα (x) is ∃y ∈ Yα Ψα (x, y)

or ∀y ∈ Yα Ψα (x, y), respectively.
Note that, if Φα (x) is a fiber formula with x = (x1 , . . . , xn ), the set of x ∈ κ(α)n
such that Φα (x) holds is definable in the o-minimal structure on κ(α).
Let us take an example. To the definable family of formulas

∀x ∈ Xt ∃ε > 0 ∀y ∈ Rn (x − y < ε ⇒ y ∈ Xt )

56 CHAPTER 5. GENERIC FIBERS FOR DEFINABLE FAMILIES

corresponds the fiber formula

∀x ∈ Xα ∃ε > 0 ∀y ∈ κ(α)n (x − y < ε ⇒ y ∈ Xα ) .

Note that x − y < ε can be expressed as a polynomial inequality.

Proposition 5.9 Let X be a definable subset of Rm × Rn and Φα (x) the fiber

formula of a definable family of formulas Φt (x), with x = (x1 , . . . , xn ). The
equality
Xα = {x ∈ κ(α)n ; Φα (x)}
holds if and only if there exists A ∈ α such that the equality

Xt = {x ∈ Rn ; Φt (x)}

holds for all t ∈ A. In particular, if n = 0 (i.e. there is no free variable), the

fiber formula Φα holds if and only if there exists A ∈ α such that Φt holds for
all t ∈ A.

Proof. We proceed by induction on the construction of the definable family

of formulas according to rules 1-4.
Rule 1: Φt (x) is x ∈ Yt . We have to show that Xα = Yα if and only if there
is A ∈ α such that Xt = Yt for all t ∈ A. The “if” part is easy. To show the
“only if” part, it suffices to consider the case Y = ∅, since taking the fiber at α
preserves the boolean operations. Suppose that the set of t such that Xt = ∅
does not belong to α. Then the projection of X on the space Rm of the first
m coordinates belongs to α. By Definable Choice, there is a definable map
f from this projection to Rn whose graph is contained in X. It follows that
f (α) ∈ Xα , which contradicts Xα = ∅.
Rule 2. Note that we can actually omit this rule. Indeed, if Xt = {x ∈
R ; P (x) = 0} for all t ∈ Rm , then Xα = {x ∈ κ(α)n ; P (x) = 0} and we are
n

reduced to Rule 1 (the same with > instead of =).

Rule 3. Here we use the observation that taking fibers at α commutes with
the boolean operations.
Rule 4. Here we use the observation that taking fibers at α commutes with
the projections (for existential quantification). The universal quantification
reduces to negations and existential quantification. 


Exercise 5.10 Let X and Y be definable subsets of Rm × Rn . Show that Xα

is closed in Yα if and only if there exists A ∈ α such that Xt is closed
in Yt for every t ∈ A.
5.4. EXTENSION OF DEFINABLE SETS 57

5.4 Extension of Definable Sets

Let α be an element of R m . We begin with the extension of polyhedra from R

to κ(α). This will be needed for the proof of Hardt’s Theorem 5.22.
Let a0 , . . . , ad be points of Rn which are affine independent. We denote
by [a0 , . . . , ad ]R the simplex they generate in Rn , and by [a0 , . . . , ad ]κ(α) the
simplex they generate in κ(α)n . If K is a finite simplicial complex with vertices
in Rn , we denote by |K|R its realization in Rn , and by |K|κ(α) its realization
in κ(α)n , i.e. the union of the simplices [a0 , . . . , ad ]κ(α) for all [a0 , . . . , ad ]R in
K. If VR is a union of open simplices of K, we define Vκ(α) as the union of the
corresponding open simplices in κ(α)n .

Lemma 5.11 |K|κ(α) = (Rm × |K|R )α . Vκ(α) = (Rm × VR )α .

Proof. Since taking fibers at α preserves finite unions, it is sufficient to prove

the lemma for an open simplex σ with vertices a0 , . . . , ad . The open simplex
σ is the set of x ∈ Rn satisfying the formula

∃λ1 ∈ R . . . ∃λd ∈ R λ1 > 0 and . . . and λd > 0 and

d 
d 
λi = 1 and λi ai = x .
i=1 i=1

Hence, the fiber (Rm × σ)α is described by the fiber formula of the constant
family of formulas:

∃λ1 ∈ κ(α) . . . ∃λd ∈ κ(α) λ1 > 0 and . . . and λd > 0 and

d 
d 
λi = 1 and λi ai = x .
i=1 i=1

This fiber formula describes σκ(α) . 



The notation for polyhedra will also be used for fibers of constant definable
families. Let S be a definable subset of Rn . Then Rm × S can be regarded as
a constant definable family. We denote by Sκ(α) ⊂ κ(α)n the fiber (Rm × S)α ,
and we call Sκ(α) the extension of S to κ(α).

Exercise 5.12 Show that Sκ(α) ∩ Rn = S.

In model-theoretic terms, the o-minimal structure over κ(α) is an extension

of the o-minimal stucture over R. Any first-order formula of the o-minimal
58 CHAPTER 5. GENERIC FIBERS FOR DEFINABLE FAMILIES

structure over R can be interpreted in the o-minimal structure over κ(α),

taking the extension to κ(α) of the definable sets appearing in this formula.
Proposition 5.9 implies that κ(α) is an elementary extension of R: every for-
mula without free variables holds over R if an only if it holds over κ(α).

5.5 Definable Families of Maps

Let X and Y be definable subsets of Rm × Rn and Rm × Rp , respectively. We
regard them as definable families parametrized by Rm . A definable family of
maps from X to Y is a definable map f : X → Y such that the following
diagram commutes,
f ✲
X Y
❅
❅
❅❘
❅ ✠
Rm

where the maps to Rm are the projections on the first m coordinates. We

obtain a family of maps ft : Xt → Yt for t ∈ Rm defined by f (t, x) = (t, ft (x)).
Given α ∈ R  m , we shall define f : X → Y , which will be a definable
α α α
map for the o-minimal structure on κ(α). Set

Γ = {(t, x, y) ∈ Rm × Rn × Rp : (t, x) ∈ X and f (t, x) = (t, y)} .

The set Γ is a definable family parametrized by Rm and, for every t ∈ Rm , Γt

is the graph of ft : Xt → Yt . Hence, the formulas in the definable families of
formulas

 ∀x
 ∈ Rn ((∃y ∈ Rp (x, y) ∈ Γt ) ⇔ x ∈ Xt )
(∗)t ∀x ∈ Rn ∀y ∈ Rp ((x, y) ∈Γt ⇒ y ∈ Yt ) 

 ∀x ∈ Rn ∀y ∈ Rp ∀z ∈ Rp ((x, y) ∈ Γ and (x, z) ∈ Γ ) ⇒ y = z
t t

hold true for every t ∈ Rm . By Proposition 5.9, the fiber formulas for α, which
are



∀x ∈ κ(α)n ((∃y ∈ κ(α)p (x, y) ∈ Γα ) ⇔ x ∈ Xα )


 ∀x ∈ κ(α)n ∀y ∈ κ(α)p ((x, y) ∈ Γα ⇒ y ∈ Yα )
(∗)α
 ∀x ∈ κ(α) ∀y ∈ κ(α) ∀z ∈ κ(α) ((x, y) ∈ Γα and (x, z) ∈ Γα )
n p p


 

⇒y=z
5.6. FIBERWISE AND GLOBAL PROPERTIES 59

also hold true. These fiber formulas express the fact that Γα is the graph of
a map fα : Xα → Yα . Since Γα is definable, the map fα is definable for the
o-minimal structure on κ(α).
The next proposition says that all definable maps are obtained in this way.
We introduce a notation. If X is a definable subset of Rm × Rn and A a
definable subset of Rm , we denote by XA the definable subset X ∩ (A × Rn )
of Rm × Rn . In other words, XA is the definable family X restricted to A.
Proposition 5.13 Let ϕ : Xα → Yα be a definable map for the o-minimal
structure on κ(α). Then there exist A ∈ α and a definable family of maps
f : XA → YA such that ϕ = fα .
Proof. Let Γα be the graph of ϕ. Then the fiber formulas (∗)α above hold
true. By Proposition 5.9, there exists A ∈ α such that the formulas (∗)t hold
true for every t ∈ A. This means that, for every t ∈ A, Γt is the graph of a map
ft : Xt → Yt . We obtain in this way a definable family of maps f : XA → YA ,
which satisfies fα = ϕ. 

Exercise 5.14 Show that fα = gα if and only if there is A ∈ α such that
ft = gt for every t ∈ A.
Exercise 5.15 Let f : X → Y and g : Y → Z be definable families of maps

parametrized by Rm , X  a definable subset of X. For α ∈ R m , show
 
that (g ◦ f )α = gα ◦ fα . Show that f (X )α = fα (Xα ).
Exercise 5.16 Show that fα is continuous if and only if there is A ∈ α such
that ft is continuous for every t ∈ A. (Use Proposition 5.9.)

5.6 Fiberwise and Global Properties

We have seen several examples which show that a property holds for the fiber
at α if and only if there is A ∈ α such that the same property holds for
the fibers at t for all t ∈ A. In this section we are interested in topological
properties which hold globally for the family. An example of a global property
is the property “X is closed”, which is stronger than the fiberwise property
“every fiber Xt is closed”.
The main tool will be the following.
Lemma 5.17 Let X be a definable subset of Rm × Rn . There is a partition
of Rm into definable sets C1 , . . . , Ck such that, for i = 1, . . . , k, and for every
t ∈ Ci , we have clos(Xt ) = (clos XCi )t (recall that XCi denotes X ∩ (Ci × Rn )).
60 CHAPTER 5. GENERIC FIBERS FOR DEFINABLE FAMILIES

Proof. We proceed by induction on m. So we assume that the lemma is

proved for all d, 0 ≤ d < m. Let G be the definable subset of those t ∈ Rm
such that clos(Xt ) = (clos X)t . Lemma 3.21 implies that the complement of
G in Rm has dimension < m. Choose a cdcd of Rm adapted to G. Every
open cell C of this cdcd is contained in G, and for every t ∈ C we have
clos(Xt ) = (clos X)t = (clos XC )t . Now let D be a cell of dimension d < m.
There is a definable homeomorphism θD : D → Rd . We apply the inductive
−1
assumption to the definable family of (u, x) ∈ Rd × Rn such that (θD (u), x) ∈
X. It follows that we can partition D into finitely many definable subsets
Dj such that clos(Xt ) = (clos XDj )t for every t ∈ Dj . The lemma is proved.


Proposition 5.18 Let X ⊂ Y be definable subsets of Rm × Rn . Let α ∈ R m.

The fiber Xα is closed (resp. open) in Yα if and only if there exists A ∈ α such
that XA is closed (resp. open) in YA .
Proof. It suffices to prove the closed version. The open version follows by
taking the relative complement of X in Y .
If XA is closed in YA , then Xt is closed in Yt for every t ∈ A. It follows (cf.
Exercise 5.10) that Xα is closed in Yα .
Conversely, assume that Xα is closed in Yα . We use Lemma 5.17 to ob-
tain a partition of Rm into finitely many definable sets C1 , . . . , Ck such that
clos(Xt ) = (clos XCi )t for every t ∈ Ci . Since α is an ultrafilter of definable
sets, it contains exactly one of the Ci , say C1 . From the assumption that
Xα is closed in Yα , it follows that there is A ∈ α such that Xt is closed in
Yt for every t ∈ A (cf. Exercise 5.10). Replacing A with A ∩ C1 , we can
assume A ⊂ C1 . Then clos(Xt ) = (clos XA )t for every t ∈ A. We deduce
(clos XA )t ∩ Yt = clos(Xt ) ∩ Yt = Xt for every t ∈ A (for the second equality
we used the fact that Xt is closed in Yt ). This implies (clos XA ) ∩ YA = XA ,
i.e. XA is closed in YA . 

Theorem 5.19 Let f : X → Y be a definable family of maps parametrized by

Rm , and α ∈ R m . Then f is continuous if and only if there exists A ∈ α such
α
that fA : XA → YA is continuous.
Proof. Say Y is a definable subset of Rm × Rp . We can assume that, for
all t, Yt is contained in the bounded box (−1, 1)p (then Yα is contained in the
bounded box (−1, 1)pκ(α) in κ(α)p ). The reason for this is the following. Let
µ : Rp → (−1, 1)p be the semialgebraic homeomorphism defined by
 
y1 yp
µ(y1 , . . . , yp ) =   ,...,   .
1+ y12 1+ yp2
5.7. TRIVIALITY THEOREMS 61

We can replace f with the composition

g = (IdRm × µ) ◦ f : X → Rm × (−1, 1)p .

Note that gα is µκ(α) ◦fα , where µκ(α) : κ(α)p → (−1, 1)pκ(α) is the semialgebraic
homeomorphism defined by the same formula as µ. The continuity of gA is
equivalent to the continuity of fA , and the continuity of gα is equivalent to the
continuity of fα .
Now let

Γ = {(t, x, y) ∈ X × (−1, 1)p ; f (t, x) = (t, y)} .

The map fA : XA → A × (−1, 1)p is continuous if and only if ΓA is closed

in XA × Rp . The map fα : Xα → (−1, 1)pκ(α) is continuous if and only if Γα
is closed in Xα × κ(α)p . Hence, the theorem follows from Proposition 5.18.



Exercise 5.20 Assume that ϕ : Xα → Yα is a definable homeomorphism.

Show that there is A ∈ α and a definable family of maps f : XA → YA ,
such that f is a homeomorphism and fα = ϕ.

Exercise 5.21 Let f be a definable family of maps parametrized by Rm . As-

sume that ft is continuous for every t ∈ Rm . Show that there is a
finite partition of Rm into definable subsets C1 , . . . , Ck such that fCi
is continuous for i = 1, . . . , k. Hint: one can use Lemma 5.17 and the
proof of Theorem 5.19. Another possibility is as follows:
1) Show that for every α ∈ R  m , there is C(α) ∈ α such that f
C(α) is
continuous.
2) Use the compactness of R m to show that Rm is a finite union

R = C(α1 ) ∪ . . . ∪ C(αk ). Modify C(α1 ),. . . , C(αk ) in order to get a

m

partition of Rm .

5.7 Triviality Theorems

Let X ⊂ Rm ×Rn be a definable family. Let A be a definable subset of Rm . We
say that the family X is definably trivial over A if there exist a definable set
F and a definable homeomorphism h : A × F → XA such that the folllowing
62 CHAPTER 5. GENERIC FIBERS FOR DEFINABLE FAMILIES

diagram commutes:
h ✲
A×F XA
❅
projection❅ projection
❅
❘
❅ ✠
A ⊂ Rm
We say that h is a definable trivialization of X over A. Now let Y be a definable
subset of X. We say that the trivialization h is compatible with Y if there is a
definable subset G of F such that h(A × G) = YA . Note that if h is compatible
with Y , its restriction to YA is a trivialization of Y over A.
Theorem 5.22 (Hardt’s Theorem for Definable Families)
Let X ⊂ Rm × Rn be a definable family. Let Y1 , . . . , Y be definable subsets of
X. There exists a finite partition of Rm into definable sets C1 , . . . , Ck such
that X is definably trivial over each Ci and, moreover, the trivializations over
each Ci are compatible with Y1 , . . . , Y .
This theorem was proved by R. Hardt in the semialgebraic case.
Proof. We can assume that X is closed and contained in Rm × [−1, 1]n . The
reason for this is the following. Let µ : Rn → (−1, 1)n be the semialgebraic
homeomorphism defined by
 
x1 xn
µ(x1 , . . . , xn ) =   ,...,   .
1 + x21 1 + x2n

First, we can replace X (and each Yj ) with its image by IdRm × µ, which
is contained in Rm × (−1, 1)n . Then, we can replace X with clos X, which
is closed and contained in Rm × [−1, 1]n , and add X to the list of definable
subsets Y1 , . . . , Y . A definable trivialization of clos(X) over Ci compatible
with X will induce a definable trivialization of X over Ci .
Let α be an element of R m . The assumption above implies that X is
α
bounded and closed in κ(α)n . Hence, by the triangulation theorem 4.4, there
is a finite simplicial complex K with vertices in Qn ⊂ Rn and a definable
homeomorphism Φ : |K|κ(α) → Xα , such that each (Yj )α is the image by Φ of
a union (Vj )κ(α) of open simplices of K. By Lemma 5.11, we have |K|κ(α) =
(Rm × |K|R )α . Hence (cf. Exercise 5.20), there exists C(α) ∈ α and a definable
family of maps h : C(α) × |K|R → XA such that h is a homeomorphism and
hα = Φ. Moreover, since
hα ((Rm × (Vj )R )α ) = hα ((Vj )κ(α) ) = (Yj )α ,
5.7. TRIVIALITY THEOREMS 63

we can assume, replacing C(α) with a smaller definable set still in α, that
h(C(α) × (Vj )R ) = (Yj )C(α) . We have proved the following fact: for every
α∈R m , there exist C(α) ∈ α and a definable trivialization of X over C(α)

compatible with each Yj .

The open and closed subset C(α)  cover R m . Since R m is compact, we can

extract a finite subcover from this cover. Hence, there are α1 , . . . , αk such

that Rm = C(α1 ) ∪ . . . ∪ C(αk ). Replacing C(αi ) with Ci = C(αi ) \ j<i C(αj ),
we obtain a partition of Rm into definable sets C1 , . . . , Ck , and, for each i, a
definable trivialization of X over Ci compatible with each Yj . 

Exercise 5.23 Use Hardt’s theorem to give another proof of the local conic
structure of definable sets (cf. 4.10). Hint: trivialize the definable
family of
Aε = {x ∈ A ; x − a = ε} .

We have a similar trivialization theorem for definable familes of functions

(with values in R). First, we have to define the notion of trivialization for a
family of functions.
Let f : X → Rm × R be definable family of functions parametrized by Rm
and A a definable subset of Rm . We say that f is definably trivial over A if
there exist a definable function g : F → R and definable homeomorphisms
ρ : A × F → XA and λ : A × R → A × R such that the following diagram
commutes,
ρ ✲
A×F XA

IdA × g f
❄ ❄
A × R✛ A×R
λ
❅
❅
❅
❘
❅ ✠
A
where the maps to A are the projections on the first factor. The couple (ρ, λ)
is called a definable trivialization of f over A. If Y is a definable subset of X,
we say that the trivialization (ρ, λ) is compatible with Y if there is a definable
subset G of F such that ρ(A × G) = YA . Note that, in this case, (ρ, λ) induces
a definable trivialization of f |Y over A.

Theorem 5.24 (Definable Triviality of Families of Functions)

Let f : X → Rm × R be a definable family of functions parametrized by Rm .
64 CHAPTER 5. GENERIC FIBERS FOR DEFINABLE FAMILIES

Let Y1 , . . . , Y be definable subsets of X. There exists a finite partition of Rm

into definable sets C1 , . . . , Ck such that f is definably trivial over each Ci and,
moreover, the trivializations over each Ci are compatible with Y1 , . . . , Y .

Proof. We can assume that X is closed in Rm × [−1, 1] × [−1, 1]n and that
f is the restriction to X of the projection p on the first m + 1 coordinates.
The reason for this is the following. Let√ν : R → (−1, 1) be the semialgebraic
homeomorphism defined by ν(y) = y/ 1 + y 2 , and µ : Rn → (−1, 1)n the
semialgebraic homeomorphism defined by µ(x1 , . . . , xn ) = (ν(x1 ), . . . , ν(xn )).
First we replace X with its homeomorphic image Γ ⊂ Rm × (−1, 1) × (−1, 1)n
by the definable map

(t, x) −→ (t, ν(ft (x)), µ(x)) .

We replace also the Yj with their images ∆j ⊂ Γ. We obtain the following com-
mutative diagram, where the horizontal maps are definable homeomorphisms
and the maps to Rm are the projections on the m first coordinates.

Γ ✲ X
p f
❄ ❄
Rm × (−1, 1) ✛ Rm × R
IdRm × ν
❅
❅
❅
❅
❘
❅ ✠
Rm

Now we replace Γ with clos(Γ) ⊂ Rm ×[−1, 1]×[−1, 1]n , and we add Γ to the list
of definable subsets ∆1 , . . . , ∆ . A definable trivialization of p|clos(Γ) compatible
with Γ, ∆1 , . . . , ∆ will induce a definable trivialization of p|Γ compatible with
∆1 , . . . , ∆ . Composing with the definable homeomorphisms represented by
the horizontal arrows in the diagram above, we obtain a definable trivialization
of f compatible with Y1 , . . . , Y .
Let α ∈ R m . The assumption above implies that X is closed and bounded
α
in κ(α) × κ(α)n and fα is the restriction to Xα of the projection π on the
first coordinate. By Proposition 4.8, there exist a finite simplicial complex K
with vertices in Q × Qn and definable homeomorphisms Φ : |K|κ(α) → Xα and
τ : κ(α) → κ(α) such that the following left-hand side diagram commutes and
5.8. TOPOLOGICAL TYPES OF SETS AND FUNCTIONS 65

each Yj is a union of images by Φ of open simplices.

Φ ✲ X ρ ✲
|K|κ(α) α C(α) × |K|R XC(α)

π fα p f
❄ ❄ ❄ ❄
κ(α) ✛ κ(α) C(α) × R ✛ C(α) × R
τ λ
❅
❅
❅
❘
❅ ✠
C(α)

We obtain C(α) ∈ α and definable families of maps ρ : C(α) × |K|R → XC(α)

and λ : C(α) × R → C(α) × R which are homeomorphisms and such that
ρα = Φ and λα = τ . After possibly shrinking C(α), (ρ, λ) is a definable
trivialization of f over C(α), compatible with the Yj . We conclude as in the
proof of Hardt’s theorem. 


5.8 Topological Types of Sets and Functions

Two embeddings Y ⊂ X and Y  ⊂ X  , where all sets are definable, are said
to have the same (definable) topological type if there is a (definable) homeo-
morphism h : X → X  such that h(Y ) = Y  . Two definable maps f : X → Y
and f  : X  → Y  are said to have the same (definable) topological type if
there are (definable) homeomorphisms ρ : X → X  and λ : Y  → Y such that
λ ◦ f ◦ ρ = f.
Assume that the definable family X ⊂ Rm × Rn is definably trivial over
A ⊂ Rm , and that the trivialization is compatible with Y ⊂ X. This means
that there is a definable homeomorphism h : A×F → XA of the form h(t, x) =
(t, ht (x)), and a definable subset G of F such that h(A × G) = YA . Now let
t and t be two points of A. Then ht ◦ h−1 t is a definable homeomorphism

from Xt onto Xt , and the image of Yt by this homeomorphism is Yt . Hence,
all embeddings Yt ⊂ Xt for t ∈ A have the same topological type. From this
discussion and Hardt’s theorem we obtain the following.

Corollary 5.25 Let X ⊂ Rm × Rn be a definable family, Y a definable subset

of X. There are finitely many definable topological types of embeddings Yt ⊂ Xt
for t ∈ Rm .

We give an example of application.

66 CHAPTER 5. GENERIC FIBERS FOR DEFINABLE FAMILIES

Theorem 5.26 Given n and d positive integers, there are finitely many topo-
logical types of embedding V ⊂ Rn , where V is an algebraic subset defined by
equations of degrees at most d.

Proof. If V is defined by equations P1 = . . . = P = 0 of degrees at most d,

it is also defined by the single equation P12 + · · · + P2 = 0 of degree at most
2d. Hence, it suffices to show that there are finitely many topological types of
embedding V ⊂ Rn , where V is defined by one equation of degree at most 2d.
If i = (i1 , . . . , in ) ∈ Nn , we set |i| = i1 + · · · + in and xi = xi11 · · · xinn . Let I2d
be the finite set of i ∈ Nn such that |i| ≤ 2d. We denote by a = (ai )i∈I2d an
element of the affine space RI2d . Set

Y = {(a, x) ∈ RI2d × Rn ; ai xi = 0} ⊂ RI2d × Rn .
i∈I2d

For a ∈ RI2d , Ya is an algebraic subset of Rn defined by one equation of degree

≤ 2d, and we obtain in this way all such algebraic subsets. Hence, the theorem
follows from Corollary 5.25 applied to the semialgebraic families Y ⊂ RI2d ×Rn
parametrized by RI2d . 


We now turn to the case of families of functions. Assume that the definable
family of functions ft : Xt → R parametrized by t ∈ Rm is trivial over A. This
means that there are definable homeomorphism ρ : A × F → XA of the form
ρ(t, x) = (t, ρt (x)) and λ : A × R → A × R of the form λ(t, y) = (t, λt (y)) and
a definable function g : F → R, such that λ ◦ f ◦ ρ = IdA × g. Let t and t be
two points of A. Then ρt ◦ ρ−1 −1
t : Xt → Xt and λt ◦ λt : R → R are definable
homeomorphisms which satisfy

λ−1 −1
t ◦ λt ◦ ft ◦ ρt ◦ ρt = ft .

This shows that all ft for t ∈ A have the same definable topological type. From
this discussion and Theorem 5.24 we obtain the following.

Corollary 5.27 In a definable family of functions ft : Xt → R parametrized

by t ∈ Rm , there are finitely many definable topological types.

The similar statement for definable families of maps is not true. For in-
stance, there is a semialgebraic family of maps R2 → R2 in which there are
infinitely many topological types (cf. [CR]).
We give an example of application for the o-minimal structure Rexp expand-
ing R and which is generated by the exponential function. This means that
5.8. TOPOLOGICAL TYPES OF SETS AND FUNCTIONS 67

Rexp is a structure (Sn )n∈N , where Sn ⊂ P(Rn ) and S2 contains the graph of
the exponential function, and Sn ⊂ Tn for every structure (Tn )n∈N with these
properties. The fact that Rexp is o-minimal (i.e. S1 consists of finite unions of
points and intervals) is a fundamental result of A. Wilkie [Wi]. In Rexp the
function (x, λ) → xλ on {x > 0} × R is definable, since

y = xλ ⇔ ∃z ∈ R(x = exp(z) and y = exp(λz)) .

Theorem 5.28 Given n and k two positive integers, there are finitely many
topological types in the family of polynomials Rn → R with at most k mono-
mials (and no bound on the degree).

Proof. We extend the power function (x, λ) → xλ to two definable functions

M0 : R2 → R for ? = 0, 1, defined by
 λ

 x if x>0,


0 if x = 0 and λ = 0 ,
M0 (x, λ) = 
1


if x = 0 and λ = 0 ,
(−1)0 |x|λ if x<0.

Now consider the family of all functions Rn → R

 

k 
n
(x1 , . . . , xn ) → ai M0i,j (xj , λi,j ) .
i=1 j=1

This is a definable family of functions parametrized by the ((ai ), (λi,j ), (?i,j )) ∈

Rk × Rkn × {0, 1}kn , which is a definable subset of Rk+2kn . In this family we
have all polynomials in n variables with at most k monomials. Hence, the
theorem follows from Corollary 5.27. 


Note that the finiteness of topological types for polynomials Rn → R with

bounded degree (a result of Fukuda [Fu] obtained by completely different meth-
ods) can be obtained by working in the semialgebraic structure (it is not diffi-
cult to put all polynomials Rn → R with degree ≤ d in a semialgebraic family).
Theorem 5.28 is stronger. Its statement does not refer to o-minimal structures,
but its proof uses this theory in an essential way.
68 CHAPTER 5. GENERIC FIBERS FOR DEFINABLE FAMILIES
Chapter 6

Smoothness

In this chapter, we assume for simplicity that R = R, i.e. we consider an o-

minimal expansion of the field R of real numbers. The results of this chapter
still hold for o-minimal structures expanding an arbitrary real closed field. In
order to prove these results, one would first have to establish the basic facts
of analysis (such as the local inversion theorem) for definable mappings. This
is done in [vD].

6.1 Derivability of Definable Functions in One

Variable
If A is a definable subset of Rn , we say that a function g : A → R∪{−∞, +∞}
is definable if the inverse images of −∞ and of +∞ are definable subsets of A
and the restriction of g to g −1 (R) is a definable function with values in R.

Lemma 6.1 Let f : I → R be a definable continuous function on an open

interval I of R. Then f has left and right derivatives in R ∪ {−∞, +∞} at
every point x in I. These derivatives are denoted respectively by f (x) and
fr (x). The functions f and fr from I to R ∪ {−∞, +∞} are definable.

Proof. Apply the monotonicity theorem to the function y → (f (y) −

f (x))/(y − x) to show that it has a limit in R ∪ {−∞, +∞} as y tends to
x from the left or from the right (cf. Exercise 2.3). The definability of the left
and right derivatives is left as an exercise. 


Lemma 6.2 Let f : I → R be a definable continuous function on an open

interval I of R. If f > 0 (resp. fr > 0) on I, f is strictly increasing on I.

69
70 CHAPTER 6. SMOOTHNESS

Proof. Apply the monotonicity theorem to the function f , plus the fact that
there is no subinterval of I on which f is constant or f is strictly decreasing
(otherwise, one would have f ≤ 0 and fr ≤ 0 on such a subinterval). 


Remark that the preceding lemma can be proved without the assumption
that f is definable.
Exercise 6.3 Assume that f is any function having a positive (or +∞) left
derivative at every point of I. Take a ∈ I. Show that
sup{x ∈ I ; f ≥ f (a) on [a, x]}
is the right endpoint of I (or +∞ if I is not bounded from above).
Deduce that f is non decreasing on I and, hence, that f is strictly
increasing.
Theorem 6.4 Let f : I → R be a definable continuous function on an open
interval I of R. Then, for all but finitely many points in I, we have f (x) =
fr (x) ∈ R. Hence, f is derivable outside a finite subset of I.
Proof. First we prove that there is no subinterval of I on which f = +∞, or
f = −∞, or fr = +∞, or fr = −∞. Suppose for instance that f = +∞ on
a subinterval J of I. Take a < b, both in J and set
f (b) − f (a)
g(x) = f (x) − x for x ∈ J .
b−a
We have g = +∞ on J. By Lemma 6.2, g is strictly increasing on J. We
deduce g(b) > g(a), which is clearly impossible. We can show in a similar way
that the other cases lead to a contradiction.
Suppose now that there is a subinterval J of I on which f and fr have
values in R and f < fr . Replacing J with a smaller subinterval, we can
assume that f and fr are continuous. Taking a still smaller subinterval, we
can assume that there is c ∈ R such that f < c < fr . Lemma 6.2 implies that
x → f (x) − cx is at the same time strictly increasing and strictly decreasing
on this subinterval, which is impossible. We can show in a similar way that
there is no subinterval on which f and fr have values in R and f > fr .
The definability of f and fr , together with the facts just proved, imply the
conclusion of the theorem. 

Corollary 6.5 Let f : I → R be a definable function. For all k ∈ N, there
exists a finite subset M (k) of I such that f is of class C k on I \ M (k).
Proof. By induction on k, using Theorem 6.4, the definability of the deriva-
tive, and piecewise continuity. 

6.2. C K CELL DECOMPOSITION 71

6.2 C k Cell Decomposition

A C k cylindrical definable cell decomposition of Rn is a cdcd satisfying ex-
tra smoothness conditions which imply, in particular, that each cell is a C k
submanifold of Rn .

• A C k cdcd of R is any cdcd of R (i.e. a finite subdivision of R).

• If n > 1, a C k cdcd of Rn is given by a C k cdcd of Rn−1 and, for each cell

D of Rn−1 , definable functions of class C k

ζD,1 < . . . < ζD,(D) : D → R .

The cells of Rn are, of course, the graphs of the ζD,i and the bands
delimited by these graphs.

It is clear from the description by induction that the cells of a C k cdcd are
C k submanifolds of Rn . Moreover, for each cell C, there is a definable C k
diffeomorphism θC : C → Rdim C . The diffeomorphism θC can be defined by
induction on n, by the same formulas as in Proposition 2.5.
We now state the two theorems of this section.

Theorem 6.6 (C k Cell Decomposition: C k CDCDn ) Given finitely many

definable subsets X1 , . . . , X of Rn , there is a C k cdcd of Rn adapted to X1 , . . . , X
(i.e. each Xi is a union of cells).

Theorem 6.7 (Piecewise C k : PCnk ) Given a definable function f : A → R,

where A is a definable subset of Rn , there is a finite partition of A into definable
C k submanifolds C1 , . . . , C , such that each restriction f |Ci is C k .

Proof. We prove the two theorems simultaneously, by induction on n. The

case n = 1 is already done: C k CDCD1 is obvious, and PC1k follows from Theo-
rem 6.4. So we assume n > 1 and the theorems proved for smaller dimensions.
1) C k CDCDn . Start with a cdcd of Rn adapted to X1 , . . . , X . Using PCn−1
k
,
partition the cells of the induced cdcd of R n−1
in order to have all ζC,j of class
C k . Then, using C k CDCDn−1 , refine to a C k cdcd of Rn−1 .
2) PCnk . We use the following lemma.

Lemma 6.8 Let g : U → R be a definable function, with U definable open

subset of Rn . Then there is a definable open subset V of U such that f |V is C k
and dim(U \ V ) < n.
72 CHAPTER 6. SMOOTHNESS

Proof. By induction on k, it is sufficient to show that the set Gi where

the partial derivative ∂g/∂xi exists is definable, that its complement in U
has empty interior, and that ∂g/∂xi is definable on Gi . We leave the check-
ing of definability to the reader and prove that U \ Gi has empty interior.
Otherwise, there would exist a nonempty open box where ∂g/∂xi does not
exists. Considering the restriction of g to an interval of a line parallel to the
xi axis contained in this box, we obtain a contradiction with Theorem 6.4.



We return to the proof of PCnk . We choose a cdcd of Rn adapted to A. By

Lemma 6.8, for each open cell Ci of Rn contained in A, there is a definable
open subset Vi such that f |Vi is C k and dim(Ci \ Vi ) < n. By C k CDCDn , we
can refine the cdcd to a C k cdcd of Rn adapted to A and the Vi . On each open
cell of this new cdcd contained in A, f is C k . Let D be a cell of dimension < n
contained in A. Using a C k definable diffeomorphism from D to Rdim D and
the inductive assumption, we can partition D into finitely many definable C k
submanifolds on which f is C k . This completes the proof of the two theorems.



6.3 Definable Manifolds and Tubular Neigh-

borhoods
Let M ⊂ Rn be a definable C k submanifold (we always assume 1 ≤ k < ∞).
We introduce the tangent and normal bundles of M .
The tangent bundle TM is the set of (x, v) ∈ M × Rn such that v is a
tangent vector to M at x. We denote by p : T M → M the projection defined
by p(x, v) = x and by Tx M the tangent space to M at x, i.e. Tx M = p−1 (x)
for x ∈ M . We can argue as follows in order to prove that T M is a definable
subset of Rn × Rn . We consider the set S of triples (x, y, v), where v is a vector
parallel to the line joining two distinct points x and y of M , that is

S = {(x, y, λ(y − x)) ∈ M × M × Rn ; x = y and λ ∈ R} .

This set S is obviously definable. Its closure clos(S) in M × M × Rn is also

definable. We claim that

TM = {(x, v) ∈ M × Rn ; (x, x, v) ∈ clos(S)} ,

which shows that it is definable.

6.3. DEFINABLE MANIFOLDS AND TUBULAR NEIGHBORHOODS 73

Exercise 6.9 Prove the claim and show in the same time that TM is a C k−1
submanifold (this is a classical fact of differential geometry). Hint: One
can assume that the origin 0 belongs to M and work in a neighbor-
hood of 0. One can also assume that the first d = dim(M ) cordinates
x1 , . . . , xd are the coordinates of a chart of M in a neighborhood of 0.
Then the other coordinates are C k functions xj = ξj (x1 , . . . , xd ) on a
neighborhood of 0 in M (for j = d + 1, . . . , n). Then show that (0, 0, v)
belongs to the closure of S if and only if v is a linear combination of
the vectors

n
∂ξj
ei + (0)ej for i = 1, . . . , d ,
j=d+1 xi

where ei denotes the i-th vector of the canonical basis of Rn . These

vectors form a basis of T0 M .

Exercise 6.10 Let f : M → R be a definable C k function. Prove that df :

TM → TR = R × R is a definable map (of class C k−1 ). Hint: construct
the graph of df replacing the set S above with the set of

(x, y, λ(y − x), f (x), λ(f (y) − f (x))) ,

where x and y are distinct point of M and λ ∈ R.

The normal bundle NM is the set of (x, v) in M × Rn such that v is

orthogonal to Tx M . This is a C k−1 submanifold of Rn × Rn , and it is definable
since TM is definable.
Now we introduce a definable C k−1 map

ϕ : NM −→ Rn
(x, v) −→ (x + v)

The map ϕ induces the canonical diffeomorphism from the zero section M ×{0}
of the normal bundle onto M , and it is a local diffeomomorphism at each point
(x, 0). Indeed, the derivative d(x,0) ϕ : Tx M × Nx M → Rn is the isomorphism
which maps (ξ, v) to ξ + v.
Our aim in this section is to prove the following result, which is the definable
version of the tubular neighborhood theorem.

Theorem 6.11 (Definable Tubular Neighborhood) Let M be a definable

C k submanifold of Rn . There exists a definable open neighborhood U of the zero-
section M × {0} in the normal bundle NM such that the restriction ϕ|U is a
74 CHAPTER 6. SMOOTHNESS

C k−1 diffeomorphism onto an open neighborhood Ω of M in Rn . Moreover, we

can take U of the form

U = {(x, v) ∈ NM ; v < ε(x)} ,

where ε is a positive definable C k function on M .

A neighborhood Ω as in the theorem above is called a definable C k−1 tubular

neighborhood of M . We have on Ω a definable C k−1 retraction π : Ω → M and
a definable C k−1 “square of distance function” ρ : Ω → R, which are defined
by

π(ϕ(x, v)) = x
ρ(ϕ(x, v)) = v2 .

For the proof of Theorem 6.11, we need to consider first the case of closed
definable submanifolds.

Lemma 6.12 Let M be a definable C k submanifold of Rn , closed in Rn . Let

ψ : M → R be a positive definable function, which is locally bounded from below
by positive constants (for every x in M , there exist c > 0 and a neighborhood
V of x in M such that ψ > c on V ). Then there exists a positive definable C k
function ε : M → R such that ε < ψ on M .

Proof. For r ∈ R, set

Mr = { x ∈ M ; x2 ≤ r} .

We can assume Mr0 = ∅ for some r0 . Observe that Mr is compact for r ≥ r0 .

For such r, we define µ(r) by µ(r) = inf{ψ(x) ; x ∈ Mr }. The function
µ : [r0 , +∞) → R is definable and nonincreasing. It is positive, since Mr is
covered by finitely many subsets where ψ is bounded from below by positive
constants. By Theorem 6.4, there is a > r0 such that µ is C k on an open
interval containing [a, +∞). Choose a definable C k function θ : R → R such
that θ = 0 on (−∞, a], θ increases from 0 to 1 on [a, a + 1] and θ = 1 on
[a + 1, +∞). Define the function µ1 : R → R by

µ1 (r) = θ(r)µ(r) + (1 − θ(r))µ(a + 1) .

Observe that µ1 is C k , definable, and satisfies µ1 ≤ µ on [r0 , +∞). We set

ε(x) = 12 µ1 (x2 )) for x ∈ M . By construction, the positive, definable, C k
function ε satisfies ε < ψ on M . 

6.3. DEFINABLE MANIFOLDS AND TUBULAR NEIGHBORHOODS 75

Note that Lemma 6.12 also holds if we assume only that there is a definable
C diffeomorphism from M onto a closed submanifold of some Rm . Later we
k

shall show that it holds for every definable submanifold.

Exercise 6.13 Give an explicit formula for θ in the proof above (you can take
for θ on [a, a + 1] a primitive of a well-chosen polynomial).

Exercise 6.14 Having in view the generalization of the lemma to an o-minimal

structure expanding an arbitrary real closed field, replace the argument
for the positivity of µ in the proof of the preceding lemma by an argu-
ment valid in this general situation. (Hint: if ψ(r) = 0, show that there
is b > 0 and a definable path γ : (0, b) → Mr such that ψ(γ(t)) = t.)

Lemma 6.15 The definable tubular neighborhood 6.11 holds if M is closed in

Rn , or definably C k diffeomorphic to a closed submanifold in some Rm (e.g. if
M is a cell of a C k cdcd).

Proof. We want to avoid the following two “bad” situations:

1. ϕ is not a local diffeomorphism at (x, v).

2. there are (x, v) and (y, w) such that ϕ(x, v) = ϕ(y, w).
Let Z be the subset of (x, v) in NM such that

d(x,v) ϕ : T(x,v) (NM ) −→ Rn

is not an isomorphism. The set Z is definable, closed in NM and disjoint

from the zero section M × {0}. For x in M , let ψ(x) be the minimum of 1,
dist((x, 0), Z) and the infimum of r ∈ R such that

∃(y, w) ∈ NM ∃v ∈ Nx M w ≤ v = r and y + w = x + v .

The function ψ : M → R is definable.

We claim that it is locally bounded from below by positive constants. Take
x ∈ M . The inverse function theorem implies that there is cx > 0 such that the
restriction of ϕ to the intersection of NM with the open ball B((x, 0), cx ) ⊂ R2n
is a diffeomorphism onto a neighborhood of x in Rn . We show that ψ ≥ cx /4
on the intersection of M with the open ball B(x, cx /4) ⊂ Rn . We can, of
course, take cx /4 ≤ 1. Since B((x, 0), cx ) is disjoint from Z we have cx /4 ≤
dist((y, 0), Z) for every y ∈ M ∩ B(x, cx /4). Suppose now that there are
(y, v) and (z, w) in NM such that y ∈ B(x, cx /4), w ≤ v < cx /4 and
76 CHAPTER 6. SMOOTHNESS

y + v = z + w. Then (y, v) and (z, w) both belong to B((x, 0), cx ), and we

arrive to a contradiction with the fact that ϕ is injective in restriction to the
intersection of this ball with NM . Hence, the claim is proved. We can apply
Lemma 6.12 to the function ψ. We obtain a definable, positive C k function
ε : M → R such that, in restriction to the definable open subset

U = {(x, v) ∈ NM ; v < ε(x)} ,

the map ϕ is an injective local diffeomorphism. We conclude that ϕ|U is a

diffeomorphism onto an open definable neighborhood of M in Rn . 


Proposition 6.16 Let M be a definable C k submanifold of Rn , closed in Rn or

definably C k diffeomorphic to a closed submanifold of some Rm . Then M has a
nonnegative definable C k−1 equation in the complement of ∂M = clos(M ) \ M .
This means that there exists a nonnegative definable C k−1 function f : Rn \
∂M → R such that M = f −1 (0). Moreover, one can choose f ≤ 1.

Proof. By Lemma 6.15, we can choose a definable tubular neighborhood

Ω of M of radius ε : M → (0, +∞). By Lemma 6.12, we can assume that
ε(x) < min(1, dist(x, ∂M )) for all x in M . Observe that the square of distance
function ρ : Ω → [0, +∞) is a definable nonnegative C k−1 equation of M in Ω.
We are going to extend it to Rn \ ∂M by using a partition of unity. We choose
a C k−1 definable function θ : R → [0, 1] which is 0 on (−∞, 0] , 1 on [1, +∞)
and increases from 0 to 1 on [0, 1]. Then we set

θ(2ρ(x)/ε2 (x)) on Ω
f (x) = .
1 outside ∂M ∪ {x ∈ Ω ; ρ(x) ≤ 12 ε2 (x)}

The function f : Rn \∂M → R is nonnegative, definable, and f −1 (0) = M . The

assumption ε(x) < min(1, dist(x, ∂M )) implies that ∂M ∪ {x ∈ Ω ; ρ(x) ≤
1 2
2
ε (x)} is closed (we leave the proof as an exercise). This shows that f is
indeed C k−1 , and completes the proof of the proposition. 


Theorem 6.17 Let F be a closed definable subset of Rn . For every positive

integer k, there exists a definable, continuous, nonnegative function f : Rn →
R such that f −1 (0) = F and the restriction of f to Rn \ F is of class C k .

Proof. We proceed by induction on the dimension of F . If F is empty, we can

take for f any positive constant function. Now let d = dim F ≥ 0 and assume
that the theorem holds for all closed definable subsets of Rn of dimension < d.
Take a C k+1 cdcd of Rn adapted to F . Let D be the finite set of cells of
6.3. DEFINABLE MANIFOLDS AND TUBULAR NEIGHBORHOODS 77

dimension d contained in F . By Proposition 6.16, every d-cell C ∈ D has a

nonnegative, definable C k equation gC in Rn \ ∂C. Let Z be the union of all
cells of dimension < d contained in F and all ∂C, for C ∈ D. The set Z is
definable and closed in Rn . The product of all functions gC for C ∈ D defines a
function g : U = Rn \Z → R. The function g is of class C k , and it is a definable,
nonnegative equation of F ∩ U in U . Moreover, we can take all gC bounded by
1 and, hence, we have g ≤ 1. By the inductive assumption, there is a definable,
continuous, nonnegative function h : Rn → R such that h−1 (0) = Z and the
restriction of h to U is of class C k . The product f = gh is defined and C k on U .
It can be continuously extended to Rn by setting f = 0 on Z. The zeroset of F
is then Z ∪(F ∩U ) = F . The function f satisfies the properties of the theorem.



Corollary 6.18 Let M be a definable C k submanifold of Rn . Then there is a

definable C k submanifold N of Rn+1 , closed in Rn+1 , such that the projection π :
Rn+1 → Rn on the first n coordinates induces a diffeomorphism from N onto
M . Hence, every definable C k submanifold of Rn is definably C k diffeomorphic
to a closed submanifold of Rn+1 , and Lemma 6.12 and Proposition 6.16 hold
for every definable C k submanifold.

Proof. Let M be a definable C k submanifold of Rn . Since M is locally closed,

∂M = clos(M ) \ M is closed in Rn . By Theorem 6.17, there is a continuous,
nonnegative definable function f : Rn → R such that f −1 (0) = ∂M and f is
C k on Rn \ ∂M . Let

N = {(x, t) ∈ Rn+1 ; x ∈ M and tf (x) = 1} .

Then N is a definable C k submanifold, closed in Rn+1 , and the mapping x →

(x, 1/f (x)) is a definable C k diffeomorphism from M onto N , which is the
inverse of π|N . 


The preceding corollary, together with Lemma 6.15, completes the proof of
the definable tubular neighborhood theorem 6.11. We conclude with a property
which plays an important role in the course of Macintyre on constructing o-
minimal structures.

Proposition 6.19 (DC k - all k) Let A be a definable subset of Rn . For every

positive integer k, there exists a definable C k function f : Rn+1 → R such
that A = π(f −1 (0)), where π = Rn+1 → Rn is the projection on the first n
coordinates.
78 CHAPTER 6. SMOOTHNESS

Proof. Fix k. Take a C k+1 cdcd of Rn adapted to A. By corollary 6.18,

for every cell C there is a definable C k+1 submanifold D of Rn+1 , closed in
Rn+1 , such that π|D is a diffeomorphism onto C. By Proposition 6.16, there
is a definable C k function fC : Rn+1 → R such that fC−1 (0) = D. Let f be
the product of the functions fC for all cells C contained in A. Then f is a
definable C k function on Rn+1 and A = π(f −1 (0)). 
Bibliography

[BS] J.L. Bell, A.R. Slomson: Models and ultraproducts: An introduction.

North Holland (1969)
[BCR] J. Bochnak, M. Coste, M-F. Roy: Real Algebraic Geometry. Springer
1998
[Co1] M. Coste: Topological Types of Fewnomials. In Singularities Sympo-
sium – L
: ojasiewicz 70. Banach Center Pub. 44 (1998), 81–92
[Co2] M. Coste: An Introduction to Semialgebraic Geometry. Dottorato
di Ricerca in Matematica, Dip. Mat. Univ. Pisa. Istituti Editoriali
e Poligrafici Internazionali 2000
[CR] M. Coste, M. Reguiat: Trivialités en famille, dans Real algebraic
geometry, Lect. Notes Math. 1524, Springer 1992, 193–204
[vD] L. van den Dries: Tame Topology and O-minimal Structures. London
Math. Soc. Lecture Note 248. Cambridge Univ. Press 1998
[vDMi] L. van den Dries, C. Miller: Geometric categories and o-minimal
structures, Duke Math. J. 84 (1996) 497–540
[Fu] T. Fukuda: Types topologiques des polynômes, Publ. Math. I.H.E.S.
46 (1976) 87–106
[KPS] J. Knight, A. Pillay, C. Steinhorn: Definable sets in o-minimal struc-
tures II, Trans. Amer. Math. Soc. 295 (1986) 593–605
[PS] A. Pillay, C. Steinhorn: Definable sets in ordered structures I, Trans.
Amer. Math. Soc. 295 (1986) 565–592
[Pr] A. Prestel: Model Theory for the Real Algebraic Geometer. Dot-
torato di Ricerca in Matematica, Dip. Mat. Univ. Pisa. Istituti Ed-
itoriali e Poligrafici Internazionali 1998

79
80 BIBLIOGRAPHY

[Wi] A. Wilkie: Model completeness results for expansion of the real field
by restricted Pfaffian functions and the exponential function, J. of
the Amer. Math. Soc. 9 (1996) 1051–1094
Index

adapted cdcd, 20 graph, 18

band, 18 interval, 9

cell, 7, 18 normal bundle, 73

cone, 42
open box, 9
connected
definable – component, 28 semialgebraic
definably –, 19 – map, 6
definably arcwise –, 19 – set, 5, 6
curve selection lemma, 26 simplex, 41
cylindrical algebraic decomposition, open –, 41
7 structure, 10
cylindrical definable cell decomposi- o-minimal –, 10
tion (cdcd), 18
tangent bundle, 72
definable Tarski-Seidenberg theorem, 7
– choice, 25 trivial family, 61, 63
– map, 10 tubular neighborhood, 74
– set, 10
definable family ultrafilter, 50
– of formulas, 55 principal –, 50
– of maps, 58
– of sets, 29
dimension, 31
– of a cell, 18

extension of a definable set, 57

face, 41
fiber, 52
– formula, 55
first-order formula, 12

81