This paper studies the topological closures of algebraic and definable sets under covering maps on complex and real tori, providing a unified description in both algebraic and o-minimal contexts.
Contribution
It offers a new description of the topological closure of images of algebraic and definable sets under torus covering maps, bridging complex algebraic geometry and o-minimal structures.
Findings
01
Describes closures of algebraic varieties in complex tori.
02
Provides analogous results for definable sets in real tori.
03
Unifies algebraic and o-minimal approaches to torus flows.
Abstract
We consider the covering map π:Cn→T of a compact complex torus. Given an algebraic variety X⊆Cn we describe the topological closure of π(X) in T. We obtain a similar description when T is a real torus and X⊆Rn is a set definable in an o-minimal structure over the reals.
Equations154
cl(π(X))=π(X)∪k=1⋃mZk,
cl(π(X))=π(X)∪k=1⋃mZk,
cl(π(X))=π(X)∪i=1⋃m(π(Ci)+Ti).
cl(π(X))=π(X)∪i=1⋃m(π(Ci)+Ti).
cl(X+Λ)=(x+Λ)∪i=1⋃m(Ci+ViΛ+Λ).
cl(X+Λ)=(x+Λ)∪i=1⋃m(Ci+ViΛ+Λ).
cl(π(X))=π(X)∪i=1⋃m(π(Ci)+Ti).
cl(π(X))=π(X)∪i=1⋃m(π(Ci)+Ti).
cl(X+Λ)=(X+Λ)∪i=1⋃m(Ci+ViΛ+Λ).
cl(X+Λ)=(X+Λ)∪i=1⋃m(Ci+ViΛ+Λ).
st(X∈Σ⋂X♯)=X∈Σ⋂st(X♯).
st(X∈Σ⋂X♯)=X∈Σ⋂st(X♯).
tpval(α/C)={X⊆Cn:α∈X,X is Lval-definable over C},
tpval(α/C)={X⊆Cn:α∈X,X is Lval-definable over C},
tpsa(α/R)={X⊆Cn:α∈X,X is semialgebraic over R}.
tpsa(α/R)={X⊆Cn:α∈X,X is semialgebraic over R}.
{X♯⊆Cn:α∈X♯,X⊆Cn is semialgebraic }.
{X♯⊆Cn:α∈X♯,X⊆Cn is semialgebraic }.
X={z∈Cn:h(z)∈q(z)OC}.
X={z∈Cn:h(z)∈q(z)OC}.
{h(p′(C)):p′(x)⊆p(x) is finite}.
{h(p′(C)):p′(x)⊆p(x) is finite}.
Stabomμ(p)={v∈Rn:v+(p(R)+μRn)=(p(R)+μRn)},
Stabomμ(p)={v∈Rn:v+(p(R)+μRn)=(p(R)+μRn)},
Stabvalμ(p)={v∈Cn:v+(p(C)+μCn)=p(C)+μCn},
Stabvalμ(p)={v∈Cn:v+(p(C)+μCn)=p(C)+μCn},
v+Pαμ=v+p(C)+μnC=q(C)+μnC=Pβμ=Pv+αμ.
v+Pαμ=v+p(C)+μnC=q(C)+μnC=Pβμ=Pv+αμ.
Pαμ=∩{X+μCn:X⊆Cn is Lval-definable over C with α∈X+μCn}.
Pαμ=∩{X+μCn:X⊆Cn is Lval-definable over C with α∈X+μCn}.
Pαμ=p(C)+μCn⊆(X+μCn)+μCn=X+μCn.
Pαμ=p(C)+μCn⊆(X+μCn)+μCn=X+μCn.
β∈∩{X+μCn:X⊆Cn is Lval-definable over C with α∈X+μCn}.
β∈∩{X+μCn:X⊆Cn is Lval-definable over C with α∈X+μCn}.
Stabvalμ(α/C)={v∈Cn:Pαμ=Pv+αμ}.
Stabvalμ(α/C)={v∈Cn:Pαμ=Pv+αμ}.
FX={u∈Cn:α∈u+X+μCn}.
FX={u∈Cn:α∈u+X+μCn}.
GX={v∈Cn:v+FX=FX}
GX={v∈Cn:v+FX=FX}
Stabvalμ(α/C)=∩{GX:X⊆Cn is Lval-definable over C}.
Stabvalμ(α/C)=∩{GX:X⊆Cn is Lval-definable over C}.
AC(X)={AαC:α∈X♯}.
AC(X)={AαC:α∈X♯}.
Xan={(f1,…,fn)∈C({x})n:(f1(z),…,fn(z))∈X for all z near 0}.
Xan={(f1,…,fn)∈C({x})n:(f1(z),…,fn(z))∈X for all z near 0}.
AαC=Av+αC=v+AαC,
AαC=Av+αC=v+AαC,
cl(X+Λ)=A∈AC(X)⋃cl(A+Λ).
cl(X+Λ)=A∈AC(X)⋃cl(A+Λ).
cl(AαC+Λ)=st(p(C)+Λ♯).
cl(AαC+Λ)=st(p(C)+Λ♯).
st(β+Λ♯)⊆cl(AβC+Λ)=cl(AαC+Λ).
st(β+Λ♯)⊆cl(AβC+Λ)=cl(AαC+Λ).
cl(AαC+Λ)⊆st(p(C)+Λ♯).
cl(AαC+Λ)⊆st(p(C)+Λ♯).
AαC⊆st(p(C)+Λ♯).
AαC⊆st(p(C)+Λ♯).
V=Hα⊕V1,
V=Hα⊕V1,
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
Algebraic and o-minimal flows on complex and real tori
We consider the covering map π:Cn→T of a compact complex torus.
Given an algebraic variety X⊆Cn we describe the topological closure of
π(X) in T. We obtain a similar description when T is a real
torus and X⊆Rn is a set definable in an o-minimal structure over the reals.
Both authors thank the Israel-US Binational Science Foundation for its
support. The second author was supported by the NSF research grant DMS-1500671
Let A be a complex abelian variety of dimension n, and let π:Cn→A be its covering map.
It follows from a theorem of Ax (see [ax1, Theorem 3]), that if X⊆Cn
is an algebraic variety then the Zariski closure of π(X) is a union of finitely
many cosets of abelian subvarieties of A.
In [UY, flow], Ullmo and Yafaev attempt to characterize the topological
closure of π(X) in the above setting and also when X is a set
definable in an o-minimal expansion of the real field.
They prove a similar result to Ax’s for algebraic curves (see [UY, Theorem 2.4]:
If X⊆Cn is an irreducible algebraic curve then the topological closure of
π(X) in A is
[TABLE]
where each Zk is a real weakly
special subvariety of A, namely a coset of a real Lie subgroup of A.
They conjecture that the same is true for algebraic
subvarieties X⊆Cn of arbitrary dimension.
In this article we give a full description of cl(π(X)) when X is an algebraic
subvariety of Cn of arbitrary dimension and also when X⊆Rn is
definable in an o-minimal structure over the reals and
π:Rn→T is the covering map of a compact
real torus.
As we
show, the conjecture from [UY] fails as stated (see Section 8)
and we prove a modified version by showing that the frontier of
π(X) consists of finitely many families of real weakly
special subvarieties. Our theorem holds for arbitrary compact
complex tori and not only for abelian varieties.
Theorem 1.1**.**
Let π:Cn→T be the covering
map of a compact complex torus and
let X be an algebraic subvariety of Cn.
Then there are finitely many algebraic subvarieties C1,…,Cm⊆Cn and finitely many real subtori (i.e real Lie subgroups)
T1,…,Tm⊆T of positive
dimension such that
[TABLE]
In addition,
(i)
For every i=1,…,m, we have dimCCi<dimCX.
2. (ii)
If Ti is maximal with respect to inclusion
among the subtori then Ci is finite.
Notice that in general the sets
π(X) and π(Ci) need neither be closed nor definable in any o-minimal
structure. Note also that when dimCX=1 then dimCCi=0
hence Theorem 1.1 implies
the result of Ullmo and Yafaev mentioned above.
In fact, as we show, the choice of Ci depends only on X (and not on
T) and furthermore, each subtorus Ti⊆T in the
above description is of the form cl(π(Vi)) with Vi⊆Cn a complex
linear subspace which also depends only on X.
In order to prove the above result, we find it more convenient to
work in Cn rather than in T. Let Λ=kerπ be the corresponding lattice in Cn and let
cl(X+Λ) denote the topological closure in Cn. It is
easy to see that cl(π(X))=π(cl(X+Λ)) hence the above
theorem can be deduced from our analysis of cl(X+Λ) in
Cn, which we now describe.
For V a complex or real linear subspace of Cn and Λ a lattice
in Cn we denote by VΛ the smallest R-linear subspace of
Cn containing Λ with a basis in Λ (equivalently, this is the
connected component of [math] in the real Lie group cl(V+Λ)).
The following is the main result of the first part of this article.
Main Theorem (algebraic case)[see
Theorem 6.3]. Let X⊆Cn be an
algebraic subvariety. There are linear C-subspaces
V1,…,Vm⊆Cn of positive dimension and algebraic subvarieties C1,…,Cm⊆Cn
such that for any lattice
Λ<Cn we have
[TABLE]
In addition,
(i)
For each i=1,…,m, we have dimCCi<dimCX.
2. (ii)
For each Vi that is maximal among V1,…,Vm, the
set Ci⊆Cn is finite.
Notice that Theorem 1.1 is an immediate corollary of the above.
In the second part of the article we obtain a similar result in the
o-minimal setting, and disprove the analogous o-minimal conjecture from [flow].
In order to formulate the theorem, we fix an o-minimal expansion Rom of the
real field.
Theorem 1.2**.**
Let π:Rn→T be the covering map of a compact real torus and
let X⊆Rn be a closed set definable in Rom. There
are finitely many definable closed sets C1,…,Cm⊆Rn and finitely many real subtori T1,…,Tm⊆missingT of positive dimension such
that
[TABLE]
In addition,
(i)
For every i=1,…,m, we have dimRCi<dimRX (where dimR is the o-minimal dimension).
2. (ii)
If
Ti is maximal with respect to inclusion among
T1,…,Tm then Ci is bounded in
Cn and in particular π(Ci) is closed.
As in the algebraic case, the above result follows from a theorem on the closure of
X+Λ in Rn, for Λ=kerπ.
Main Theorem (o-minimal case) [see
Theorem 7.8]. Let X⊆Rn be a
closed set definable in an o-minimal expansion Rom of the real field.
There are linear R-subspaces V1,…,Vm⊆Rn of positive dimension, and for each i=1,…,m definable closed
Ci⊆Rn, such that for any lattice
Λ<Rn we have
[TABLE]
In addition,
(i)
For each i=1,…,m, we have dimRCi<dimRX.
2. (ii)
For each Vi that is maximal among V1,…,Vm, the
set Ci⊆Rn is bounded, and in particular
Ci+ViΛ+Λ is a closed set.
The proofs of the above theorems are carried out in two main steps. In the
first step we describe the closure of X+Λ in Cn and Rn, as a union of closures
of sets of the form Λ+A, where A is an affine subspace
of Cn or Rn. We call these affine spaces
“affine asymptotes” to X (see Section 4). The analysis of the closure in terms of
affine asymptotes uses the model theoretic notion of types. We
also apply at this step the theory of stabilizers of μ-types
as was developed in [mustab] (see
Section 3.3 below). Furthermore, using
model theory of valued fields
and of o-minimal structures we show that the family of affine
asymptotes to X is itself constructible (in the algebraic case)
and definable (in the o-minimal case). We introduce these model theoretic preliminaries in Section 2 and
Section 3.
In the second step we use Baire Category Theorem to replace the infinitely many
affine spaces by finitely many (each possibly infinite) families of translates of
fixed linear spaces thus yielding Theorem 6.3 and
Theorem 7.8.
We note that in the same articles, Ullmo and Yafaev formulate two
measure theoretic conjectures about π(X), in the algebraic and
o-minimal settings, and we do not touch on them here.
Finally, although the article is not formulated in that language,
our approach is influenced by van den Dries work on various
notions of limits of definable families and their connection to
model theory (see [lou-limit]).
2. Preliminaries
2.1. Model theoretic preliminaries
We first introduce the model theoretic settings in which we will be working.
We refer to [marker] for basics on model theory and to
[omin] and [CM] for basics on o-minimality.
We denote by La the “algebraic” language, i.e. the language of
rings La=⟨+,−,⋅,0,1⟩, and view the field
C as an La-structure.
Working with the field R and semialgebraic sets we use
the “semialgebraic” language Lsa=⟨+,−,⋅,<,0,1⟩.
For the algebraic case we also need a language for valued field.
We use the language Lval=⟨+,−,⋅,O,0,1⟩, where O
is a unary predicate with an intended use for the valuation
ring. Notice that La⊆Lval.
For the o-minimal case
we fix an o-minimal expansion Rom of
the field R and denote its language by Lom. Notice that La⊆Lsa⊆Lom.
We also work in expansions of R and Rom
by various additive subgroups Λ≤Rn. To avoid
different expansions it is
convenient to treat them all at once. Thus we consider the expansion of R
by predicates for all subsets of Rn, for all n. The language for this structure is
denoted by Lfull.
We let Rfull be the associated Lfull-structure on
R.
We choose a cardinal κ>2ω and fix a κ-saturated elementary
extension Rfull of Rfull. We denote by R the
underlying real closed field and by Rom the o-minimal reduct Rfull↾Lom. Notice that since both the real closed field R and the
o-minimal structure Rom are reducts of Rfull they are both
κ-saturated.
To distinguish between subsets of R and R we use the following
convention: we let roman lettes X,Y,Z etc. denote subsets of Rn and script
letters X,Y,Z etc. subsets of Rn.
Also if X⊆Rn, then we can view X as an Lfull-definable set
and denote by X♯ the set X(R) of realizations of X in
Rfull.
Our model theoretic terminology is standard.
By definable we mean definable with parameters.
We use “Lsa-definable” and “semialgebraic” interchangeably.
If L∙ is one of our languages and x a finite tuple of
variables then an L∙-type p(x) (over
a set A⊆R) is a collection of L∙-formulas (over A) with free variables
x. We identify an L∙-type p(x) with the collection of subsets of
R∣x∣ defined by formulas in p(x). We do not assume that a type is complete,
but always assume it is consistent. Thus an L∙-type p(x) over A
is a collection of subsets of R∣x∣ such that each subset is
L∙-definable over A and p(x) satisfies the finite intersection
property (namely the intersection of a every finite subcollection of p is nonempty).
Given a type p(x) we denote by p(R) the set ⋂X∈pX. Two
L∙-types p(x) and q(x) are called equivalent if for every finite
p0(x)⊆p(x) there is finite q0(x)⊆q(x) with q0(R)⊆p0(R), and vise versa. It follows that p(R)=q(R).
Definition 2.1**.**
A subset X⊆Rn is called pro-semialgebraic (over A⊆R)
if there is A0⊆R (A0⊆A) with ∣A0∣<κ and a
semialgebraic type p(x) over A0 such that X=p(R).
Notice that if X and p(x) are as in the above definition and X=q(R)
for another semialgebraic type q(x) over A0
then by κ-saturation of R the types p(x) and
q(x) are equivalent.
2.2. Basics on additive subgroups
Let W be a finite dimensional R-vector space and Λ be an
additive subgroup of
W whose R-span is the whole W.
We do not assume that Λ is a lattice or even finitely
generated.
We say that an R-subspace V⊆W is defined over Λ if it
has a basis consisting of elements of Λ.
It is not hard to see that the family of subspaces defined over Λ is closed
under arbitrary intersections and finite sums.
For a subspace H⊆W we denote by HΛ the smallest
R-subspace of W defined over Λ containing H.
We will need the following well-known fact.
Fact 2.2**.**
Let W be a finite dimensional R-vector space and Λ≤W an additive
subgroup whose R-span is the whole W. If H⊆W is an R-subspace
then HΛ+Λ⊆cl(H+Λ) (with equality when Λ
is a lattice in W).
Remark 2.3**.**
For a C-subspace H⊆Cn and an additive
subgroup Λ⊆Cn whose
R-span is the whole Cn, we still denote by HΛ the smallest R-subspace
of Cn containing H and having an R-basis in
Λ. Thus HΛ need not be a C-linear
subspace of Cn.
3. Valued field structures on R
We denote by OR the convex hull of R in R. It is a valuation ring of
R, and we let μR be its maximal ideal. The set μR is the
intersection of all open intervals (−1/n,1/n) for n∈N>0, hence it is
pro-semialgebraic over ∅.
As an additive group OR is the direct sum
OR=R⊕μR, hence for α∈OR there is
unique rα∈R with α∈rα+μR. This
rα is called the standard part of α and we
denote it by st(α). Thus we have the standard part mapst:OR→R. Slightly
abusing notations, we use st(x) also to denote the map from
ORn to Rn defined by st(x1,…,xn)=(st(x1),…,st(xn)), and
for a subset X⊆Rn we write st(X) for the set
st(X∩ORn).
3.1. Closure and the standard part map
We need the following claim that relates the topological closure and the standard
part map. It follows from the saturation assumption on Rfull. As usual for
X,Y⊆Rn we write X+Y for the set {x+y:x∈X,y∈Y}. Recall that for a subset X⊆Rn we denote
by X♯ the subset of Rn defined in the structure
Rfull by the predicate corresponding to X.
Claim 3.1**.**
(1)
For X⊆Rn
we have cl(X)=st(X♯). In particular, for X,Y⊆Rn we have
cl(X+Y)=st(X♯+Y♯).
2. (2)
Let Σ be a collection of subsets of Rn.
Then
[TABLE]
In particular the
set st(⋂X∈ΣX♯) is closed.
3.2. The algebraic closure C of R as an ACVF structure.
Let C=R+iR, where i=−1. It is an algebraically closed field
containing C. We identify the underlying set of C with R2 and
the underlying set of C with R2. We also view R and
R as
subfields of C and C, respectively, in an obvious way.
Let OC⊆C be the set OC=OR+iOR. It is a valuation ring of C with the
maximal ideal μC=μR+iμR. Again we have that
OC=C⊕μC, and we let
st:OC→C be the standard part map.
Remark 3.2**.**
We can also identify C with the residue
field k=OC/μC so that the residue map
res:OC→k is the same as the standard part map st:OC→C.
We denote by Cval the Lval-structure (C;+,−,⋅,OC,0,1).
Proposition 3.3**.**
If X⊆Cn is an Lval-definable set
then X∩Cn is La-definable in the field C, i.e. it is
a constructible subset of Cn.
If F is an Lval-definable family of subsets of Cn
then the family {F∩Cn:F∈F} is constructible.
Proof.
By Remark 3.2, the field C together with a predicate for C and
the map st(x) is an algebraically closed field with an embedded
residue field. By [HK, Lemma 6.3] the embedded residue field C is
stably embedded, i.e. for every
Lval-definable subset
X⊆Cn the set X∩Cn
is La-definable in the field of complex numbers.
The second part of the proposition is not stated in [HK, Lemma 6.3], but it
easily follows: By quantifier elimination from [HK, Lemma 6.3], the theory of
algebraically closed valued fields of characteristic zero with an embedded residue
field is complete, and we can use a standard compactness argument.
∎
Remark 3.4**.**
Notice that the structure Cval is not a reduct of
Rfull (e.g. OC is not definable in Rfull), so
Cval need not be κ-saturated, and in fact it is not.
For example the set
{x∈OC∧x∈/(c+μC):c∈C}
is an Lval-type over C but has no
realization in C.
However, as we will see below (see Corollary 3.6), Lval-types over C that are realized in
C can be viewed as pro-semialgebraic objects, and working with them we will
make use of the saturation of the field R.
Using the
identification of Cn with R2n, we say that a subset X⊆Cn is semialgebraic (over A⊆R) if it is semialgebraic (over A)
as a subset of R2n. Similarly we say that a set X⊆Cn is
pro-semialgebraic if it is pro-semialgebraic as a subset of R2n.
For example, every constructible subset of Cn is also
semialgebraic, and for every n∈N the set μCn is
pro-semialgebraic over ∅. However the set OC is not
pro-semialgebraic.
Given an element α∈Cn we will consider its Lval-type over C
and also its semialgebraic type over R.
To distinguish these types we denote by
tpval(α/C) the complete Lval-type of α over
C, i.e.
[TABLE]
and by tpsa(α/R) the semialgebraic type of α over R,
i.e.
[TABLE]
Notice that tpsa(α/R) can be also written as
[TABLE]
The following theorem plays an essential role in this paper.
Theorem 3.5**.**
Let α∈C and p(x)=tpval(α/C).
There is an Lval-type s(x) over C that is equivalent to p(x)
and such that every X∈s(x) is pro-semialgebraic over R.
Proof.
By Robinson’s quantifier elimination (see [rob]), if
X⊆Cn is Lval-definable over C then it is a finite Boolean combination
of sets of the form X♯ where X⊆Cn is a
constructible set, and sets of the form {z∈Cn:h(z)∈q(z)OC} where h,q∈C[x].
Since the complement of a constructible set is constructible, and, for
h,q∈C[x],
the complement of the set {z∈Cn:h(z)∈q(z)OC} is
{z∈Cn:h(z)=0,q(z)/h(z)∈μC},
everyLval-definable over C set X⊆Cn
is a finite positive Boolean combination of sets of
the following three kinds:
X♯, where X⊆Cn is a constructible
set.
2. 2.
{z∈Cn:h(z)=0,q(z)/h(z)∈μC}, where h,q∈C[x].
3. 3.
{z∈Cn:h(z)∈q(z)OC}, where h,q∈C[x].
Notice that sets of all three kinds are Lval-definable over C. Every set
of the first kind is also a semialgebraic set defined over R, and every set of
the second kind is pro-semialgebraic over R (since μC is
pro-semialgebraic).
Let X∈p(x) be of the third kind, i.e.
[TABLE]
Since α∈X, we have h(α)∈q(α)OC.
Then either q(α)=0 (and hence h(α)=0) or, for c=st(h(α)/q(α)), we have
h(α)/q(α)−c∈μC.
In either case we get a set Y of the first or second kind with
α∈Y and Y⊆X.
Thus if we take s(x) to be the set of all X∈p of first and
second kinds, then s(x) is equivalent to p(x) and consists of
sets that are pro-semialgebraic over R.
∎
Corollary 3.6**.**
Let α∈Cn and p(x)=Lval(α/C). There is an Lsa-type
rα(x) over R such that
(1)
rα(C)=p(C).
2. (2)
For every finite r′(x)⊆rα(x) there is X∈p(x) with X⊆r′(x).
Remark 3.7**.**
Notice that unless α∈Cn the semialgebraic
type rα(x) is different from the semialgebraic type
psa(x)=tpsa(α/R) and we only have strict inclusion psa(C)⊂rα(C)=p(C).
Using the κ-saturation of the field
R and Corollary 3.6 we obtain the following.
Corollary 3.8**.**
Let α∈Cn, p(x)=tpval(α/C) and
Z⊆Cn a pro-semialgebraic set.
If Z∩X=∅ for every
X∈p(x) then Z∩p(C)=∅.
Corollary 3.9**.**
Let h(x) be a polynomial over
C, α∈Cn, α1=h(α), p(x)=tpval(α/C) and
p1(x)=tpval(α1/C). Then h(x) maps p(C) onto
p1(C).
Proof.
Let s(x) be an Lval-type over C equivalent
to p(x) consisting of pro-semialgebraic sets, as in Theorem 3.5.
First notice that p1(x) is equivalent to the Lval type
[TABLE]
Let s1(x)={h(s′(C)):s′(x)⊆s(x) is finite}.
It is easy to see that s1(x) consists of pro-semialgebraic
sets and since s(x) and p(x)
are equivalent,
s1(x) and p1(x) are equivalent as well.
As h(x) is a polynomial over C it is also a semialgebraic map, and by the
κ-saturation of R we have h(s(C))=s1(C). Since s(C)=p(C)
and s1(C)=p1(C) the result follows.
∎
3.3. On μ-stabilizers of types
3.3.1. The o-minimal case
We review briefly μ-stabilizers of Lom-types
over R and refer to [mustab] for more details.
Since the structure Rom is κ-saturated the following
definition is equivalent to [mustab, Definition 2.10].
Definition 3.10**.**
For α∈Rn and p(x)=tpom(α/R) we define the
μ-stabilizer of p as
[TABLE]
and we also denote it by Stabomμ(α/R).
The fact below follows from the main results of [mustab] (see Proposition 2.17
and Theorem 2.10 there).
Fact 3.11**.**
Let α∈Rn.
(1)
Stabomμ(α/R)* is an Lom-definable subgroup of (Rn,+).*
2. (2)
If α is unbounded, i.e. α∈/ORn, then
Stabomμ(α/R) is infinite.
3.3.2. The algebraic case
Similarly to the o-minimal case we now define μ-stabilizers for
Lval-types over C realized in C.
Definition 3.12**.**
For α∈Cn and p(x)=tpval(α/C) we define the
μ-stabilizer of p as
[TABLE]
and we also denote it by Stabvalμ(α/C).
We denote by Pαμ the set
Pαμ=p(C)+μnC.
Thus Stabvalμ(α/C)={v∈Cn:v+Pαμ=Pαμ}.
Since the structure Cval is not κ-saturated
we need
some preliminaries before we can
prove an analogue of Fact 3.11.
Lemma 3.13**.**
Let α∈Cn. For v∈Cn
we have v+Pαμ=Pv+αμ.
Proof.
Let p(x)=tpval(α/C), β=v+α and
q(x)=tp(β/C).
It is easy to see that v+p(C)=q(C), hence
[TABLE]
∎
Proposition 3.14**.**
For α∈Cn we have
[TABLE]
Proof.
Let p(x)=tpval(α/C).
The inclusion ⊆ is easy. Indeed, let X⊆Cn be
Lval-definable over C with α∈X+μCn. Then
X+μCn is Lval-definable over C as well, hence
p(C)⊆X+μCn and
[TABLE]
For the inclusion ⊇, let
[TABLE]
We need to show β∈p(C)+μCn, or equivalently
(β+μCn)∩p(C)=∅.
Let X∈p(x). Then
(X+μnC)∈p(x) hence
β∈X+μCn and
(β+μCn)∩X=∅. Since the set
β+μCn is pro-semialgebraic, by
Corollary 3.8, we obtain (β+μCn)∩p(C)=∅.
∎
Corollary 3.15**.**
For α,β∈Cn the following conditions are equivalent.
(1)
Pαμ=Pβμ.
2. (2)
Pαμ∩Pβμ=∅.
3. (3)
α∈X+μnC⇔β∈X+μnC, for every X⊆Cn
that is Lval-definable over C.
Let v∈Cn. Applying Corollary 3.15 we obtain that
v∈Stabvalμ(α/C) if and only if α∈X+μnC⇔v+α∈X+μnC, for every X⊆Cn
that is Lval-definable over C.
If X⊆Cn
is Lval-definable over C and u∈Cn then
the set u+X is Lval-definable over C as well.
Thus for v∈Cn we have that v∈Stabvalμ(α/C)
if and only if for every Lval-definable over C set
X⊆Cn and every u∈Cn we have
α∈u+X+μnC⇔v+α∈u+X+μCn.
For a set X⊆Cn that is
Lval-definable over C let
[TABLE]
Let v∈Cn. It follows from the above discussion that
v∈Stabvalμ(α/C) if and only if −v+FX=FX,
equivalently XF=XF+v
for every
X⊆Cn that is
Lval-definable over C.
For a set X⊆Cn that is
Lval-definable over C let
[TABLE]
be the stabilizer of the set FX in (Cn,+).
Obviously each
GX is a subgroup of (Cn,+).
By Proposition 3.3 every FX is a constructible subset of Cn. Hence each
GX is an algebraic subgroup of (Cn,+).
As we observe above
[TABLE]
Thus
Stabvalμ(α/C) is an intersection of
algebraic subgroups of (Cn;+). Since the field C
satisfies the Decreasing Chan Condition on algebraic subgroups,
Stabvalμ(α/C) is an intersection of finitely many
GX, hence is algebraic.
(2). Assume α∈Cn is unbounded.
Let psa(x)=tpsa(α/R) be the
semialgebraic type of α over R.
Since by Fact 3.11(2) Stabsaμ(p) is infinite,
it is
sufficient to show that Stabsaμ(p)⊆Stabvalμ(α/C).
Let v∈Stabsaμ(p). We have v+α∈psa(C)+μCn. By
Theorem 3.5 (see also Remark 3.7), psa(C)⊆tpval(α/C). Thus v+α∈psa(C)+μR2n⊆Pαμ. By Corollary 3.15,
Pαμ=Pv+αμ, and, by Lemma 3.13,
v∈Stabvalμ(α/C).
∎
4. Affine asymptotes
Using an idea of Ullmo and Yafaev from [UY, Section 2] we introduce the notion
of affine asymptotes.
As usual if V is a vector space over C, then a translate of a C-linear
subspace of V is called an affine C-subspace of V or a C-flat
subset of V.
Definition 4.1**.**
Let α∈Cn. The smallest C-flat subset
A⊆Cn with α∈A♯+μCn is called
the asymptotic C-flat of α or just the C-flat of
α and is denoted by AαC.
To justify the above definition we need to show that such smallest
C-flat exists. It follows from the following proposition.
Proposition 4.2**.**
Let α∈Cn.
If A1,A2⊆Cn are C-flat subsets with α∈Ai♯+μCn, i=1,2, then α∈(A1∩A2)♯+μCn.
Proof.
By an elementary linear algebra, C-flat subsets of Cn are exactly solution
sets of the linear systems Mx=r, for an m×n-matrix M over C and
r∈Cm (m is arbitrary).
We need a claim.
Claim 4.3**.**
Let A be a C-flat subset of Cn
given as the solution set of Mx=r, where M is an m×n
matrix over C. Then α∈A♯+μCn if and only if
Mα∈r+μCm.
Proof of the claim..
If α∈A♯+μCn then α∈β+μCn for some
β∈A♯, and
Mα∈Mβ+MμCn⊆r+μCm.
For the right to left direction, assume Mα∈r+μCm.
Replacing Cm by the range of M if needed we will assume
that the range of M is the whole Cm.
Let V0⊆Cn be the kernel of M. We choose V1⊆Cn a
C-subspace complementary to V0, so Cn=V0⊕V1. We write α
as α=α0+α1 with α0∈V0♯, α1∈V1♯. Since the restriction of M to V1 is an invertible C-linear map
from V1 onto Cm and Mα1∈r+μCm, there is β1∈V1♯ with β1∈α1+μCn and Mβ1=r. Obviously
α0+β1∈A♯+μCn, hence α∈A♯+μCn.
This finishes the proof of the claim.
∎
We now proceed with the proof of the proposition.
Let A=A1∩A2. For i=1,2 we choose mi×n-matrices
Mi over C and ri∈Cmi,
such that Ai is the solution set of Mix=ri.
Then A is the solution set of Mx=r, where
M is the m×n matrix (M1M2) and
r=(r1r2).
Using Claim 4.3 for α and A1 and A2, we see that
Mα=r+ϵ for some ϵ∈μCm1+m2. Using
Claim 4.3
again we see that α∈A♯+μCn.
∎
Definition 4.4**.**
For a constructible set X⊆Cn we will denote by AC(X) the set of
all C-flats of elements of X♯, namely
[TABLE]
We say that a family F of subsets of Cn is *a
constructible family * if there is a constructible set T⊆Ck and a constructible set Y⊆Cn×T such that
F={Yt:t∈T}, where Yt is the fiber of Y above t.
The next theorem follows easily from Proposition 3.3.
Theorem 4.5**.**
If X⊆Cn is a constructible set then the family
AC(X) is also constructible.
Example 4.6**.**
(1). Consider the curve X⊆C2 given by xy=1.
Let α=(α1,α2)∈X♯. If α is bounded,
i.e. α∈OC2, then AαC is just the point
st(α).
Also notice that since X is closed we have st(α)∈X.
If α is unbounded then either α1∈/OC and
α2∈μC or α1∈μC and
α2∈/OC.
In the first case we get AαC=C×0, and in the
second AαC=0×C.
Thus AC(X) consists of all points in X together with two lines
C×0 and 0×C.
(2). Consider the curve X⊆C2 given by y=x2.
Let α∈X♯. Again if α is bounded
then AαC is
st(α).
If α is unbounded then α=(ξ,ξ2) with ξ∈/OC. It is
easy to see that ξ and ξ2 are C-independent modulo
OC, i.e. for
c1,c2∈C, if c1ξ+c2ξ2∈OC then c1=c2=0. It follows
then that AαC=C2.
Thus in this case AC(X) consists of all points in X together with the
plane C2.
(3). If we take X=C2 then AC(X) will be the set of all
C-flat subsets of C2.
Remark 4.7**.**
Since the theory of algebraically closed fields of characteristic zero with an
embedded residue field is complete we can define
AC(X) using the field of convergent Puiseux series instead of
C, and get an analytic interpretation of AC(X) as follows.
We denote by C({z}) the field of germs meromorphic functions at 0∈C.
For constructible set X⊆Cn we denote by
Xan the set of C({z})-points on X, in other words
[TABLE]
For f∈Xan let Af⊆Cn be
the smallest C-flat subset of Cn such that the distance from f(z) to
Az tends to [math] as z approaches [math]. Then AC(X)={Af:f∈Xan}.
We need some basic properties of AαC.
Lemma 4.8**.**
Let α∈Cn. Then α is bounded (i.e. α∈OCn) if
and only if dimC(AαC)=0. Also if dimC(AαC)=0 then
AαC=st(α).
Proof.
It follows from the definition of AαC that dimC(AαC)=0 if
and only if α∈c+μCn for some c∈Cn, i.e. α is bounded
and AαC=c.
∎
Lemma 4.9**.**
If α∈Cn then AαC is invariant under
translations by elements of Stabvalμ(α/C).
Proof.
Notice that if α and β realize the same Lval-type
then AαC=AβC. Moreover, the same is true if
Pαμ=Pβμ, where Pαμ as in
Definition 3.12
Now, if v∈Stabvalμ(α/C) then
Pαμ=v+Pαμ=Pv+αμ. By what we just noted,
[TABLE]
as claimed.
∎
The lemma below follows easily from Lemma 4.9 and we leave its
proof to the reader.
Lemma 4.10**.**
Let α∈Cn, Hα=Stabvalμ(α/C) and V1⊆Cn a subspace complementary to Hα. Let π:Cn→V1 be the
projection along Hα and α1=π(α). Then
AαC=Hα⊕Aα1C.
5. Describing cl(X+Λ) using asymptotic flats
The main goal of this section is to describe cl(X+Λ) as the
union:
[TABLE]
The next proposition is the key ingredient.
Proposition 5.1**.**
Let α∈Cn and let Λ≤Cn be an additive subgroup whose
R-span is Cn.
Let p(x)=tpval(α/C).
Then st(p(C)+Λ♯) is a closed subset of Cn and
[TABLE]
Proof.
Let rα be a semialgebraic type as in
Corollary 3.6, namely ρα(C)=p(C).
By
Claim 3.1, st(rα(C)+Λ♯) is
closed. Hence st(p(C)+Λ♯) is closed as well.
For the inclusion cl(AαC+Λ)⊇st(p(C)+Λ♯), let
β∈p(C). We need to show that
st(β+Λ♯)⊆cl(AαC+Λ).
Notice that since β and α have the same Lval-type
over C we have AβC=AαC.
By the definition of AβC, there is
γ∈(AβC)♯ with β∈γ+μCn. Hence we have
st(β+Λ♯)⊆st((AβC)♯+Λ♯),
and by Claim 3.1,
[TABLE]
We are left to show the inclusion
[TABLE]
Since the right side is invariant under translations by elements of Λ and is
closed it is sufficient to prove
[TABLE]
We proceed by induction on dimC(AαC), and
to simplify notation we denote Cn by V.
Base case: dimC(AαC)=0. Then, by
Lemma 4.8,
α is bounded with AαC=st(α),
and the proposition is
trivial in this case.
Inductive step. Assume dimC(AαC)>0, hence
α is unbounded.
Let Hα=Stabvalμ(α/C). By Theorem 3.16(2), dimC(Hα)>0.
Choose a C-subspace V1⊂V,
complementary to Hα, i.e
[TABLE]
and let π:V→V1 be the projection of V onto V1 along
Hα.
We can
write α as
[TABLE]
By Lemma 4.10 we have
AαC=Hα⊕Aα1C, so
dimC(Aα1C)<dimC(AαC).
To prove the proposition, it is sufficient to show that for any
a∈Aα1C we have
[TABLE]
We fix
a∈Aα1C.
We now apply the inductive hypothesis to Aα1C and
Λ1=Hα+Λ (which clearly still R-spans V). We obtain
[TABLE]
where p1=tpval(α1/C).
Thus we have
[TABLE]
By Corollary 3.8, π maps p(C) onto p1(C),
hence
there is β∈p(C) with
π(β)=β1. Thus β1=β+h′ for some
h′∈Hα♯ and
[TABLE]
Let H=HαΛ. Since H has an R-basis in Λ, there
is a compact subset F⊆H with H⊆F+Λ.
We now use the fact that Rfull is an elementary extension of Rfull.
Since h′′∈H♯, there is λ1∈Λ♯ with
λ1−h′′∈F♯. Because F is compact, there is h∗∈F♯⊆H♯ with h∗=st(λ1−h′′). Thus
[TABLE]
and
[TABLE]
By the definition of μ-stabilizers, β+Hα⊆p(C)+μCn, hence
[TABLE]
Since the right side is closed and
invariant under translations by elements of Λ, we conclude that
By Theorem 4.5, the family AC(X) is constructible.
∎
6. Completing the proof in the algebraic case
Our next goal is to show that in Theorem 5.2 one can replace
the union ⋃A∈AC(X)cl(A+Λ) by a finite union of sets of the
form Ci+ViΛ+Λ, where each Ci is constructible and each Vi
a C-linear subspace of Cn.
6.1. On families of affine subspaces
By Graffk(Cn) we denote the Grassmannian
variety of all affine k-dimensional C-subspaces of Cn.
Each Graffk(Cn) is a quasi-projective subvariety of some
Plk(C), and we often identify A∈Graffk(Cn) with the corresponding C-flat A⊆Cn.
The Euclidean topology on Graffk(Cn) induced by Plk(C) coincides with the topology induced by the distance function on the
set of all C-flats in Cn that is defined as follows: Let A1,A2⊆Cn be two C-flat subsets. Let ξ1∈A1 be the point of
A1 closest to the origin with respect to the Euclidean norm on Cn, and
similarly we choose ξ2∈A2. Let S1={v∈A1:∥v−ξ1∥=1}
and S2={v∈A2:∥v−ξ2∥=1}. The distance between A1 and
A2 is now defined to be the Hausdorff distance between S1 and S2.
For a C-flat A⊆Cn we denote by L(A) the
linear part of A, i.e. the linear subspace of Cn such that A
is a translate of L.
For a subset T⊆Graffk(Cn) we denote by CL(T) the C-linear span of
⋃A∈TL(A) in Cn. Slightly abusing notation, for a
C-subspace W⊆Cn of arbitrary dimension we let
[TABLE]
It is not hard to see that L−1[W] is a Zariski closed subset of
Graffk(Cn).
For a C-flat A⊆Cn and an additive subgroup Λ≤Cn
whose R-span is the whole Cn we denote by AΛ the C-flat
a+L(A)Λ, where a∈A. Obviously the definition of AΛ does not
depend on the choice of a. Notice that if Λ is
a lattice in Cn then a+L(A)Λ is the connected
component of cl(A+Λ) containing a.
Remark 6.1**.**
Let A⊆Cn be a C-flat and V⊆Cn a C-subspace with
L(A)⊆V. Then A+V is also a C-flat with L(A+V)=V. Also if
A=a+L(A) then A+V=a+V.
Recall that a constructible subset T⊆Graffk(Cn) is
called irreducible if its Zariski closure is an irreducible
subvariety of Graffk(Cn)
Proposition 6.2**.**
Let T⊆Graffk(Cn) be an irreducible constructible set and
V=CL(T).
Let Λ<Cn be a countable additive subgroup whose
R-span is the whole Cn.
(1)
The set
{A∈T:L(A)Λ=VΛ}
is topologically dense in T with respect to the Euclidean topology on Graffk(Cn).
2. (2)
The set
⋃A∈T(A+Λ) is topologically dense in ⋃A∈T(A+V+Λ) with respect to the Euclidean topology on
Cn.
Proof.
(1). Since Λ is countable, there are at most countably many
R-subspaces of Cn defined over Λ, hence by
the Baire category theorem
it is sufficient to show that for any proper R-subspace W⪇VΛ defined over Λ the set
TW={A∈T:L(A)≤W} is nowhere
dense in T.
Let W⪇VΛ be a proper R-subspace of VΛ
defined over Λ. Let W′=W∩iW be the largest
C-subspace Cn contained in W. For A∈T the space L(A) is a
C-subspace of Cn, hence L(A)≤W if and only if
L(A)≤W′. Thus TW=L−1[W′].
Since T is
irreducible and L−1[W′] is Zariski closed in Graffk(Cn),
the set TW is nowhere dense in T
if and only if T⊆L−1[W′]. Assume
T⊆L−1[W′]. Then V=CL(T)⊆W′⊆W, and since W is defined over Λ we would
have VΛ⊆W, contradicting the assumption on W.
(2). For A∈T, let ξA∈A be the point on A closest
to the origin with respect to the Euclidean metric on
Cn.
It is not hard to see that the map
A↦ξA, as a map from T to Cn,
is continuous with respect to Euclidean topologies.
By Fact 2.2, for any C-subspace W⊆Cn and ξ∈Cn
we have ξ+WΛ+Λ⊆cl(ξ+W+Λ). Therefore, writing each A∈T as
A=ξA+L(A), we have
[TABLE]
Thus it is sufficient to show that the set ⋃A∈T(ξA+L(A)Λ+Λ) is dense in ⋃A∈T(ξA+VΛ+Λ).
The latter follows from clause (1) and the continuity of the map
A↦ξA.
∎
6.2. Proof of the main theorem in the algebraic case
We can now prove our main result in the algebraic case.
For a C-subspace W⊆Cn, we denote by W⊥ its orthogonal
complement with respect to the standard inner product on Cn.
Theorem 6.3**.**
Let X⊆Cn be an algebraic subvariety.
There are C-subspaces V1,…,Vm⊆Cn of positive dimension and algebraic subvarieties
C1⊆V1⊥,…,Cm⊆Vm⊥
such that for any lattice
Λ<Cn we have
[TABLE]
In addition,
(i)
For each i=1,…,m, we have dimCi<dimX.
2. (ii)
For each Vi that
is maximal among V1,…,Vm, the set Ci⊆Rn is finite.
Proof.
Notice that it is sufficient to find Ci’s as above that are
constructible, and then
replace each Ci with its topological closure if needed.
and
we view AC(X) as a constructible subset of
Graff0(Cn)∪⋯∪Graffn(Cn).
Since X is a closed set, we have st(X♯)=X, and using Lemma 4.8
we identify AC(X)∩Graff0(Cn) with X.
Since every constructible subset of Graffk(Cn) is a finite union of
irreducible constructible sets, we can write AC(X) as
[TABLE]
where each Ti is an irreducible constructible subset of
some Graffki(Cn) with ki>0.
Thus we have
[TABLE]
For each i=1,…,m, let Vi=CL(Ti). Obviously each Vi
has positive dimension.
By Proposition 6.2(2),
every
closed set containing ⋃A∈Ti(A+Λ) must also
contain ⋃A∈Ti(A+Vi+Λ), hence
[TABLE]
Fix i={1,…,m}. Since L(A)⊆Vi for A∈Ti, we have that for
each A∈Ti the intersection (A+Vi)∩Vi⊥ is a singleton that we
denote by cA. Obiously A+Vi=cA+Vi. Let Ci={cA:A∈Ti}. It is not
hard to see that Ci is a constructible subset of Vi⊥.
We have
[TABLE]
This finishes the proof of the main part of Theorem 6.3.
Proof of Clause (i). Although, considering X as a semialgebraic
set, Clause (i) can be derived from the corresponding clause in the o-minimal case,
we also provide an algebraic argument.
Let V be one of Vi′s, i=1,…,m, and C⊆V⊥ the corresponding constructible subset. We need to show that
dimC(C)<dimC(X).
By our choice of V and C, for each c∈C there is α∈X♯∖OCn with
AαC⊆c+V, equivalently α∈c+V♯+μCn.
Changing coordinates, we may assume that V=Ck, V⊥=Cl
with k+l=n and we write Cn as Cl×Ck.
Let XZ be the Zariski closure of X in Cl×Pk(C)
under the embedding Cl×Ck↪Cl×Pk(C).
Since dimC(XZ∖X)<dimC(X), it is sufficient
to show that C is contained in the projection of XZ∖X into Cl.
Let cˉ=(c1,…,cl)∈C.
Choose αˉ∈X♯∖OCn with
αˉ∈cˉ+(Ck)♯+μCn.
We can write αˉ as
αˉ=(cˉ′,αˉ′), with
cˉ′=cˉ+μCl and
αˉ′∈Ck+μCk.
Notice that we must have αˉ′∈/OCk.
Choose ε∈C so that εαˉ′∈OCk∖μCk, (for example we can take
ε=αi′1 where αi′ is a component of
αˉ′ with smallest valuation).
Since αˉ′∈OCk we must have ε∈μC. Let aˉ=(a1,…,ak)=st(εαˉ′).
We use xˉ=(x1,…,xl) for coordinates in Cl and
[y0:y1:…:yk] for homogeneous coordinates in Pk(C),
hence Ck is identified with points represented by
homogeneous coordinates [1:y1:…:yk].
We claim that (c1,…,cl;0:a1:…:ak)∈XZ, and
since it is not in Cl×Ck we would be done.
To show that (c1,…,cl;0:a1:…:ak)∈XZ we need to check that
p(cˉ,0,aˉ)=0
for every polynomial p(x1,…,xl,y0,…,yk)∈C[xˉ,yˉ] that is homogeneous in yˉ and with
p(x1,…,xl,1,y1…,yk) vanishing on X.
Let p(x1,…,xl,y0,…,yk) be such polynomial.
Since αˉ∈X♯ we have p(cˉ′,1,αˉ′)=0. Since p
is homogeneous in yˉ, we have p(cˉ′,ε,εαˉ′)=εsp(cˉ′,1,αˉ′) for
some s∈N, hence p(cˉ′,ε,εαˉ′)=0.
Since p is a polynomial over C, cˉ=st(cˉ′), ε∈μC, and aˉ=st(εαˉ′), we have p(cˉ,0,aˉ)=0, i.e. what we need. That finishes the proof of clause (i).
∎
Proof of Clause (ii). Let T⊆Graffki(C) be one of
the Ti’s in (6.2), and let V and C be the corresponding Vi and
Ci. Thus T⊆AC(X) is an irreducible constructible set,
V=CL(T) and
[TABLE]
Assume C is
infinite. Since C is constructible it is unbounded with respect to the Euclidean
metric on Cn. We will show that there is α∗∈X♯ with
L(Aα∗C) properly containing V. This would imply that
Aα∗C∈Tj for some j=1,…,m, and L(Aα∗C)⊆Vj. Therefore such V can not be maximal among the Vi′s
In order to find such an α∗ we use the following observation which can be
deduced from the definition of asymptotic C-flats: for a C-subspace
W⊆Cn and α∈Cn we have
[TABLE]
Let Σ be the collection of all C-subspaces W⊆Cn with
V⊆W.
By the above observation, to prove the proposition, we need to show that there is
α∗∈X♯ with α∗∈(V♯+OCn) (hence
L(AαC)⊆V), and also α∗∈(W♯+OCn), for
any W∈Σ (hence V⊆L(AαC)).
Assume no such α∗ as above exists. Then the intersection
[TABLE]
would be empty.
Notice that every set in the above intersection is pro-semialgebraic over R.
By the saturation of R, it follows then that there are
W1,…,Wl∈Σ and R∈R such that
[TABLE]
where Bc(0,R) is a closed ball in Cn of radius R centered at the origin.
It follows then that for every A∈AC(X)
(1)
either A⊆V+Bc(0,R);
2. (2)
or A⊆Wi+Bc(0,R) for some
i=1,…,l.
Notice that in the second case we have L(A)⊆Wi.
For j=1,…,l, let Zj=T∩L−1[Wj]. Since CL(T)=V,
V⊆Wj, and T is irreducible we have dimCZj<dimCT.
The function h:T→C that assigns to each A the unique cA∈C with
A⊆cA+V is continuous with respect to the Euclidean topologies and
surjective. Since C is unbounded,
the set h−1(C∖Bc(0,R)) is
a non-empty open subset in the Euclidean topology of T. By (1) and
(2) it is covered by subsets Z1,…,Zl of smaller
dimension. A contradiction.
That finishes the proof of Clause
(ii) and with it the proof of the main theorem in the algebraic
case.
7. The o-minimal result
In this section we prove the Main Theorem in the o-minimal case.
The proof follows closely that of Theorem 6.3 so we shall be brief.
In this section “definable”
means Lom-definable in
structures Rom or Rom. We use dimR to
denote the o-minimal dimension of definable sets.
7.1. Asymptotic R-flats
Similarly to the algebraic case, for α∈Rn we let AαR be the
smallest affine R-subspace A⊆Rn such that α∈A+μRn.
The proof of its existence is identical to the proof in the complex case. We call
AαRthe asymptotic R-flat of α or just the
R-flat of α. For X⊆Rn definable in Rom, we
define
[TABLE]
We can now prove the analogue of Theorem 4.5, using the theory of tame
pairs.
Theorem 7.1**.**
Let X⊆Rn be a set definable in Rom. Then the family
of affine space AR(X) is also definable in Rom.
Proof.
We consider the structure obtained by expanding the
o-minimal structure Rom by a predicate symbol for the
real field and a function symbol st(x) for the standard part
map from OR into R. Thus we are working with a
pair of o-minimal structures (Rom,Rom,st) in
which the first structure is an elementary extension of the second
one and in addition the latter is Dedekind complete in the first.
Such an extension is called *tame *
and if we let
T be the theory of Rom then the theory of (Rom,Rom,st) is denoted Ttame. The model theory of tame extensions was studied by
van den Dries and others, e.g. see [lou-limit, Section 8]. The main result
we need states:
Fact 7.2** ([lou-limit, Proposition 8.1]).**
If X⊆Rn is definable in (Rom,Rom,st)
then X is definable in Rom. Moreover, if F is a family of subsets of
Rn that is definable in (Rom,Rom,st), then it is also
definable in Rom.
To be precise, it is only the first part of the above result which is proved in
[lou-limit], but the second part follows immediately by working in an arbitrary
model of Ttame.
To complete the proof of Theorem 7.1, we just need to observe that the
family AR(X) is definable in (Rom,Rom,st).∎
The
next step towards proving the Main Theorem is the following analogue of Proposition 5.1.
Proposition 7.3**.**
For α∈Rn and
an additive subgroup Λ≤Rn whose
R-span is Rn,
let p(x)=tpom(α/R).
Then st(p(R)+Λ♯) is a closed subset of Rn and
[TABLE]
Proof.
The inclusion ⊇ is similar to the argument in Proposition 5.1: We need to see that every element of the form
a=st(β+λ) for β∈p(R) and λ∈Λ♯
belongs to cl(AαR+Λ). It is easy to see that
AβR=AαR and hence there exists β′∈(AαR)♯ such that β−β′∈μRn. It follows
that
[TABLE]
We need to prove the inclusion cl(AαR+Λ)⊆st(p(R)+Λ♯). As in the algebraic case,
we use induction on
dimAαR
and assume that dimRAαR>0, so
α∈/ORn.
We denote by Rα the μ-stabilizer of the o-minimal type p, namely
Rα=Stabomμ(α/R), as introduced in Section 3.3.1.
By
Fact 3.11, dimRRα>0. The group
Rα is an Lom-definable subgroup of (Rn,+)
and hence it is an R-subspace. We write
Rn=Rα⊕V1 for some complementary R-space
V1 (with dimRV1<n) and let π:Rn→V1 be the
projection along Rα. We write accordingly
α=α0+α1.
We let p1=tpom(α1/R). Using the saturation of R we have
[TABLE]
(Note that the above equality is immediate, unlike the algebraic case
where we had to use Corollary 3.9.)
As in Lemma 4.9, we have Rα⊆L(AαR). It
follows, as in Lemma 4.10, that
AαR=Rα+Aα1R. Thus, it is enough to show that for
any a∈Aα1R, we have a+Rα⊆st(p(R)+Λ#).
The remaining argument is identical to the proof of Proposition 5.1 so
we omit it.
∎
We can now conclude the o-minimal analogue of Theorem 5.2.
We
denote by Graffk(Rn) the Grassmannian variety of all affine
k-dimensional R-subspaces of Rn. For an R-flat
A⊆Rn we
denote by L(A) the R-subspace of Rn whose translate is
A.
For a subset T⊆Graffk(Rn) we denote by RL(T) the
R-linear span of ⋃A∈TL(A) in Rn.
Given an R-flat A⊆Rn and an additive subgroup Λ≤Rn
whose R-span equals Rn, we denote by AΛ the R-flat
a+L(A)Λ, where a∈A.
Definition 7.5**.**
A definable T⊆Graffk(R)
is called neat if
(a)
T is a connected R-submanifold of Graffk(T).
2. (b)
For any
nonempty open subset U⊆T, we have RL(U)=RL(T).
The notion of neatness helps us replace the irreducibility assumption in Proposition 6.2. We have:
Proposition 7.6**.**
Let T⊆Graffk(Rn) be a definable neat family and V=RL(T).
Let Λ<Rn be a countable additive subgroup of Rn
whose R-span is the whole Rn. Then,
(1)
The set
{A∈T:L(A)Λ=VΛ}
is topologically dense in T.
2. (2)
The set ⋃A∈T(A+Λ) is topologically dense in
⋃A∈T(A+V+Λ) with respect to the Euclidean topology on
Rn.
Proof.
(1) Since Λ is countable there are countably many spaces
L(A)Λ as A varies in T. Using Baire Categoricity it is enough to prove
that for any proper subspace W⪇VΛ which is defined over Λ,
the set L−1[W]={A∈T:L(A)⊆W} is nowhere dense in T. Because this set
is definable we just need to prove that it does not contain an open set. But since
T is neat, for every open U⊆T we have RL(U)=V, and in particular, U is
not contained in L−1[W].
(2) The proof is identical to that of Proposition 6.2(2). ∎
The next result will replace the decomposition of an algebraic variety into its
irreducible components.
Theorem 7.7**.**
Let T⊆Graffk(Rn) be a definable family of R-flats in Rn. Then T
can be decomposed into a finite union of neat families.
Proof.
We use induction on dimR(T).
If dimR(T)=0 then T is finite and the theorem is trivial.
Assume dimR(T)>0.
For U1⊆U2⊆T, we have RL(U1)⊆RL(U2). Hence, for
A∈T there exists a neighborhood U⊆T of A and a subspace VA⊆Rn such that for every neighborhood U′⊆U of A we have RL(U′)=VA.
The map A↦VA is definable hence we may partition T into finitely many
connected submanifolds T1,…,Tr, such that on each Ti the
dimension of VA is constant. By induction, it is enough to prove that those Ti
of maximal dimension are neat. So we assume that dimTi=dimT and
Ti is an open subset of T.
We need to show that for each nonempty open W⊆Ti, we have
RL(W)=RL(Ti).
We first claim that for each A∈Ti, there is a neighborhood U of A
such that VA=VB for all B∈U. Indeed, pick U⊆Ti such that RL(U)=VA. By definition, for every B∈U we have VB⊆VA, but
because dimVB=dimVA we must have VA=VB for all B∈U.
Now, since Ti is connected, it easily follows that for all A,B∈Ti, we have
VA=VB.
To finish we just note that for every A∈Ti, we have L(A)⊆VA, so
RL(Ti)=VA=RL(W), for every nonempty open W⊆Ti.∎
7.3. Proof of the main theorem
We recall the Main Theorem in the o-minimal setting:
Theorem 7.8**.**
Let X⊆Rn be a
closed set definable in an o-minimal expansion Rom of the real field.
There are linear R-subspaces V1,…,Vm⊆Rn of positive dimension, and for each i=1,…,m a definable closed
Ci⊆Vi⊥, such that for any lattice
Λ<Rn we have
[TABLE]
In addition:
(i)
For each i=1,…,m we have dimCi<dimX
2. (ii)
For each Vi that is maximal among V1,…,Vm the set Ci⊆Rn
is bounded, and in particular Ci+ViΛ+Λ is a closed set.
Proof.
As in the algebraic case it is sufficient to find definable Ci’s as above that are
that are not necessarily closed, and then
replace each Ci with its topological closure if needed.
By Theorem 7.7, applied to each AR(X)∩Graffk(R)
for k>0, we
decompose AR(X)∖X into finitely many neat
sets
[TABLE]
We now finish the proof exactly as in Theorem 6.3, with
Proposition 7.6 replacing
Proposition 6.2, and conclude: There are linear subspaces V1,…,Vm⊆Rn of positive dimension and definable sets Ci⊆Vi⊥ such that for
any lattice Λ⊆Rn we have:
[TABLE]
This ends the proof of the main statement of
Theorem 7.8.
We are left to prove the remaining two clauses in the theorem.
7.3.1. Proof of Clause (i)
We need to prove that each Ci in the description of cl(X+Λ) has
dimension smaller than dimRX. For that we recall first that for each c∈Ci there exists α∈X♯∖ORn such that
AαR+Vi=c+Vi.
We let V=Vi and identify Rn with V⊥×V. The idea of the proof
is that C corresponds to the projection of the frontier of X in V⊥×V∗, where V∗ is the one-point compactification of V. By o-minimality, this
frontier will have dimension smaller than dimRX. We now describe the details.
Let
[TABLE]
Consider the projection (x1,x2,1/∣x2∣)↦(x1,1/∣x2∣) of X′ into V⊥×R, and the image of X′ under
this projection, call it Y′.
Claim. For every c∈C,
(c,0) is in the closure of Y′.
Proof.
Assume that c+V=AαR+V∈FV for α∈X♯∖ORn. Because L(AαR)⊆V it follows that
α∈c+V♯+μRn and hence α can be written as α1+α2
with
st(α1)=c and α2∈V♯ necessarily unbounded. We thus have and
st(1/∣α∣)=0 and therefore
(c,0) is in cl(Y′). This ends the proof of the claim. ∎
In order to finish we note that every element of the form
(c,0)∈V⊥×R is necessarily in
the frontier Fr(Y′)=cl(Y′)∖Y′, thus
[TABLE]
(the last equality follows from
o-minimality).
But dimRY′≤dimRX′≤dimRX, so dimRC<dimRX.
This ends the proof of Clause (i).
7.3.2. Proof of Clause (ii)
The proof below follows closely the proof of Clause (ii) in the
algebraic case.
We start with T=Ti as in (7.1), and V=Vi, C=Ci⊆Vi⊥
the corresponding linear space and definable set, respectively. Namely, T⊆Graffki(R) is neat, V=RL(T), and
[TABLE]
We assume that C is unbounded and we show that there exists α∗∈X♯
such that L(AαR) properly contains V. This implies that V cannot be
maximal among the Vj’s.
Let Σ be the collection of all proper R-subspaces of Rn which do not
contain V.
As in the algebraic case, if no such α∗ exists then the intersection
[TABLE]
would be empty, and we would conclude that there is a closed ball B⊆Rn and
W1,…,Wl∈Σ such that for every A∈AR(X),
(1)
either A⊆V+B;
2. (2)
or L(A)⊆Wi.
For every A∈T we have L(A)⊆V, hence L(A)⊆Wi implies that L(A)⊆Wi∩V. Because T is neat and each Wi∩V is a proper subspace of V the
dimension of the set T′=⋃i=1m{A∈T:L(A)⊆Wi} is smaller than
dimRT. So, for all A∈T outside a set T′ of smaller dimension, we
have A⊆V+B. Let us see that this is impossible.
For A∈T, we denote by c(A)∈V⊥ the unique c∈V⊥ so that
A⊆c+V. The map A↦c(A) is continuous and surjective so the pre-image
of C∖B is a non-empty, open subset of T. Since T is a connected
manifold the intersection of this pre-image with T∖T′ is non-empty, so
there exists A∈T∖T′ with A∈/V+B. Contradiction. This ends the
proof of Clause (ii) and with that we end the proof of
Theorem 7.8.∎
8. An example
In this section we provide a counter-example to conjectures
[UY, Conjecture 1.2] and [flow, Conjecture 1.6].
Let X
be the surface
[TABLE]
and Λ=Z3+iZ3.
For i=1,2,3 we denote by Πi the corresponding coordinate plane in C3,
namely Π1=0×C×C,
Π2=C×0×C and
Π3=C×C×0. Notice that all Πi are defined
over Λ, hence each Πi+Λ is closed.
Lemma 8.1**.**
[TABLE]
Proof.
We use the formula
[TABLE]
Inclusion ⊇.
We first show that cl(X+Λ) contains
every set in the union on the right side of (8.1).
Obviously cl(X+Λ) contains X+Λ.
For Π1+Λ, consider α=(1−δ31,δ,δ2),
with nonzero ε∈μC and δ=1/ε.
We show that Π1=AαC(X).
Clearly δ∈/OC and α∈X♯∖OC3. Since 1−δ31∈μC, we have
α∈Π1♯+μC3. Also, δ
and δ2 are C-linearly independent modulo OC (i.e. for c1,c2∈C, if c1δ+c2δ2∈OC then c1=c2=0),
hence α∈/L♯+OC3 for any proper C-subspace L⊊Π1. Thus
AαC=Π1 and, by Theorem 5.2,
[TABLE]
For Π2+Λ,
consider α=(δ2,ε−ε3,δ).
We have
that α∈X♯∖OC3 and as above it is easy to see that
AαC=Π2. Hence
[TABLE]
Similarly, for α=(δ2,δ,ε−ε3), we have
AαC=Π3, Hence
[TABLE]
For t∈C∗ and ϵ∈μC, let
αt=(εt,t−ε,t1). It is easy to see that
αt∈X♯∖OC3 and AαtC=(0,t,t1)+C×0×0.
Thus the right side of (8.1) is contained in cl(X+Λ).
Inclusion ⊆.
To show that cl(X+Λ) is contained in the right side of (8.1), it is
sufficient to show that for any α∈X♯∖OC3 the set
cl(AαC+Λ) is contained in the right side of (8.1).
Let α=(α1,α2,α3)∈X♯∖OC3.
Observe that if some αi∈μC
then α∈Πi♯+μC. In this case AαC⊆Πi
and cl(AαC+Λ)⊆Πi+Λ, hence it is contained in the
right side.
The only remaining case is when α∈X♯ is unbounded and
none of αi is in μC. It is easy to see that in this
case α1 must be unbounded, α2∈t+μC, and
α3∈t1+μC for some t∈C∗. Then
Aα=(0,t,t1)+C×0×0,
cl(Aα+Λ)=(0,t,t1)+C×0×0+Λ, and it is contained
in the right side of (8.1).
∎
Thus in the notations of the main theorem we can write cl(X+Λ) as
[TABLE]
where Vi=Πi for
i=1,…,3, C1=C2=C3=0×0×0, V4=C×0×0, and C4={(x,y,z)∈C3:x=0,yz=1}.
Consider the projection map π:C3→E3, where
E is the elliptic curve C/(Z+iZ). The set π(C4+V4) is just
π(C4)+E×0×0 and it is not hard to see that this
set is not contained in any proper real analytic subvariety of E3.
Thus cl(π(X)) cannot be written as the union of π(X)
with a real analytic subvariety of E3. Because X is semialgebraic, this
shows the failure of the Conjecture 1.6 from [flow].
For the same reason cl(π(X)) cannot
be written as the union of π(X) with finitely many real weakly special
subvarieties of E3. This shows also the failure of Conjecture 1.2
from [UY].