Topological Study of Pairs of Algebraically Closed Fields
Ayhan G\"unayd{\i}n

TL;DR
This paper introduces a new topology on algebraically closed fields with a distinguished subfield, capturing definable sets as constructible sets and refining the Zariski topology.
Contribution
It constructs a topology on pairs of algebraically closed fields that precisely characterizes definable sets as constructible sets, enhancing the understanding of their geometric structure.
Findings
The topology is finer than the Zariski topology.
Definable sets correspond exactly to constructible sets in this topology.
Provides a new geometric perspective on pairs of algebraically closed fields.
Abstract
We construct a topology on a given algebraically closed field with a distinguished subfield which is also algebraically closed. This topology is finer than Zariski topology and it captures the sets definable in the pair of algebraically closed fields as above; in the sense that definable sets are exactly the constructible sets in this topology.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Rings, Modules, and Algebras · Mathematical and Theoretical Analysis
Topological study of pairs of algebraically closed fields
Ayhan Günaydın
Boğaziçi Üniversitesi, Istanbul, Turkey
Abstract.
We construct a topology on a given algebraically closed field with a distinguished subfield which is also algebraically closed. This topology is finer than Zariski topology and it captures the sets definable in the pair of algebraically closed fields as above; in the sense that definable sets are exactly the constructible sets in this topology.
This work was partially supported by TÜBİTAK Career Grant 113F119.
1. Introduction
The study of pairs of algebraically closed fields goes back to Keisler; he proves in [4] that the theory of proper pairs of algebraically closed fields of given characteristic is complete. One can extract a quantifier elimination result from his proof which we restate in Section 3.
We study pairs of algebraically closed fields in the language , where is a unary predicate, which is interpreted as the smaller field and we write them as .
It is worth mentioning that recently, Delon proved a quantifier elimination in a richer language; see [1].
In this paper, we suggest a topological study of these pairs in characteristic zero. Each such pair, has an elementary extension such that has a derivation on it, with which it becomes a differentially closed field and is the constant field for this derivation. For our purposes, we may work in , which we do and still call it . For each , we have the Kolchin topology on . However, there are Kolchin closed sets that are not definable in the pair. Therefore, we have to choose some of them to construe a useful topology. We could just declare that the closed sets are the Kolchin closed sets that are definable in the pair, but this would not be very useful in understanding the definable sets. We introduce a topology in Section 2 in detail. Here we just say that it is the coarsest topology in which the set of -tuples that are linearly dependent over is closed and the polynomial maps are continuous. We call this topology the pair topology and we prove the following.
Theorem 1.1**.**
Every set definable in the pair is a boolean combination of pair-closed sets.
In an attempt to prove that the pair-closed sets are exactly the Kolchin closed sets that are definable, we could not overcome the following version of Kolchin Irreducibility Theorem in our setting.
Question. Is it true that each pair-irreducible pair-closed set is also Kolchin-irreducible?
We prove the following in Section 3.
Proposition 1.2**.**
If the answer to the question above is affirmative, then each Kolchin-closed definable set is pair-closed.
The complete theory of proper pairs of algebraically closed fields of characteristic zero is -stable of Morley rank . We investigate the relation of Morley rank with pair topology and among others we prove the following.
Proposition 1.3**.**
Let be definable in . Then .
We also have another notion of dimension coming from a pregeometry called small closure. Small sets are the images of under multivalued functions that are definable in the field and small closure is the similar to the usual model theoretic algebraic closure: we replace finite by small. We explain this in detail in Section 4.
Small dimension refines Morley rank in some way. We prove the version of the proposition above for small dimension.
2. The topology
Let be an algebraically closed field of characteristic zero and let be a proper subfield which is also algebraically closed. We study the pair in the language extending the language of rings by a unary predicate . We set the word definable to mean definable in with parameters; otherwise we specify the language.
As mentioned in the introduction, we may assume that is equipped with a derivation with which it becomes a differentially closed field and is the constant field of that derivation. Then for each , has the Kolchin topology on it. Recall that these topologies are noetherian. As usual, most of the times we do not specify when talking about Kolchin topology and for the ease of nation, we call the Kolchin closed sets as K-closed sets.
Of course, not all K-closed sets are definable in . For instance, the graph of derivation is not definable and a non-definable K-closed subset of is given by
[TABLE]
(We explain why this is not definable in Section 4.) With this in mind, the first attempt to define a topology would be to define the closed sets to be K-closed sets that are definable in . This is a topology, however it is not easy to work with it unless we have more information on how the closed sets look like.
Before introducing the pair topology, we would like to mention the definable functions appearing in Delon’s quantifier elimination result in [1]. For and the function is defined as follows:
[TABLE]
Note that the functions are partial functions. We might send everything not in the domain to a fixed , however we do not elaborate on this detail here. For , each have the same domain and we denote it by .
Recall that for , the Wronskian is defined as the determinant
[TABLE]
This is a differential polynomial in indeterminates of degree and order . Hence its zero set is a K-closed subset of . Note also that its zero set is definable in the pair since
[TABLE]
So for our purposes this set should be closed. Let denote this set.
Other than this, we also want polynomial functions to be continuous. Therefore, we would like the sets , where is a polynomial function to be closed. The collection of such sets are not closed under intersection, so we define a basic closed set to be
[TABLE]
where is again a polynomial function.
These sets are K-closed. Since Kolchin topology is noetherian, finite union of such sets form the closed sets of a topology on . This topology is coarser than the Kolchin topology. In particular, it is noetherian, too. Noting that , we conclude also that it refines the Zariski topology. We call this topology the pair topology and we write closed, open, irreducible, etc. for topological concepts in pair topology.
Every polynomial map is continuous. In particular, the projection maps are continuous and as a result, the product of pair topologies on and is coarser than the pair topology on .
The domain of is constructible as it is \big{(}(\Omega^{n}\setminus Y_{n})\times\Omega\big{)}\cap Y_{n+1}.
We are aiming to prove that every set definable in the pair is constructible. We first prove that is closed.
Lemma 2.1**.**
For each , is closed.
Proof.
Let be defined as . Now it is easy to check that . Since the product of two closed sets is again closed, we get that is closed. ∎
Next lemma gives some more closed sets.
Lemma 2.2**.**
For every , the set is closed.
Proof.
Just note that if are linearly independent over , then
[TABLE]
for .
If are not linearly independent, then we may choose a maximal linearly independent set among them. Without loss of generality, let be such. Then is closed by the previous part and so is . ∎
Next we show that the graphs of the functions are constructible.
Lemma 2.3**.**
For every and , the graph of is constructible
Proof.
Without loss of generality we take and consider the graph of :
[TABLE]
Define by
[TABLE]
Now it is clear that
[TABLE]
It is now clear that the set on the right is constructible and hence the graph of is constructible. ∎
It is not clear from this proof whether is continuous. We show that later in Proposition 2.6. We first observe that closed subsets of are just Zariski closed subsets.
Proposition 2.4**.**
Let be closed. Then X is a Zariski closed subset of .
Proof.
It suffices to prove that a set of the form is Zariski closed where is a polynomial map, because Zariski closed sets are closed under finite unions and intersections.
Let . We need to show that the set
[TABLE]
is Zariski closed. Let be a -linearly independent set such that for each , the coefficients of are from .
After rearranging we have
[TABLE]
where are polynomials in whose degrees in the variable are at most for every .
Then
[TABLE]
So being in this set is equivalent to a certain system of linear equations over (depending on ) having a nonzero solution. This last condition is equivalent to certain polynomials over having a common zero at . Therefore is Zariski closed. ∎
Corollary 2.5**.**
Proper closed subsets of are finite sets.
Now we are ready to prove that the functions are continuous.
Proposition 2.6**.**
For and , the function, is continuous.
Proof.
We take . By the previous corollary, it suffices to prove that the preimages of singletons are closed in . So let and consider . This preimage is
[TABLE]
It now easy to see that this is nothing other than where
[TABLE]
So is closed. ∎
3. Definable Sets
Our aim in this section is to prove that sets definable in the pair are exactly the constructible sets.
We first make a reduction to parameter-free sets.
Lemma 3.1**.**
Suppose that for each , every subset of that is -definable is constructible. Then every definable set is constructible. Moreover, if is -definable, then is a boolean combination of closed sets definable over , provided that -definable sets are boolean combinations of -definable closed sets.
Proof.
Let be an arbitrary definable set and let be a parameter-free definable set and such that .
By assumption is constructible.
Consider the polynomial map from to defined by . It is clear that . So being the preimage of a constructible set under a continuous map, is constructible.
Note that closed and open sets appearing in the proof above are definable over the same parameters as . Therefore the last part of the proposition follows. ∎
Before going through some more reductions, we present a quantifier elimination for pairs of algebraically closed fields. This can be obtained from the proof of completeness in [4], but it also follows from Theorem 3.8 of [2].
Fact 1*.*
Every -definable subset of is a boolean combination of sets defined by formulas of the form
[TABLE]
where is an -tuple of variables and is a quantifier-free formula in the language of rings.
Quantifier-free formulas in the language of rings in variables are equivalent to formulas of the form
[TABLE]
where ’s and ’s are polynomials over . However, in the theory of (algebraically closed) fields, the last part is equivalent to
[TABLE]
Therefore, using Lemma 3.1 and Fact 1, in order to show that every -definable set is constructible, we need to show that sets defined by formulas of the form
[TABLE]
are constructible.
Finally, this last formula is equivalent to
[TABLE]
So we only consider sets defined by formulas
[TABLE]
where and are tuples of variable and is a polynomial over for each .
Now the following finishes the proof of Theorem 1.1 in a stronger way.
Theorem 3.2**.**
Let be defined by a formula of the form (3.1). Then is a boolean combination of -definable closed sets.
Proof.
Let be defined by
[TABLE]
For , write
[TABLE]
where is a finite set of multi-indices and for each .
Let for each and let . We define to be the set of such that for each the set is linearly independent over and is in the -linear space generated by for .
Note that
[TABLE]
where runs through the subsets of of the form Therefore it suffices to show that given such the set
[TABLE]
is constructible.
Let and , and enumerate as
[TABLE]
Let . Then for and write
[TABLE]
As a result, for we get that
[TABLE]
So elements of are exactly such that there is with the property that for every and
[TABLE]
and
[TABLE]
for some .
Now consider the definable set containing such that there is with the property that
[TABLE]
for some and
[TABLE]
for each and .
Being a definable subset of , is constructible by Proposition 2.4.
Now define as follows
[TABLE]
Now is continuous by Proposition 2.6. So is constructible as it is . ∎
Taking the parameters into consideration we have the following consequences.
Corollary 3.3**.**
Let be -saturated and let be of cardinality less than and . Then is determined by the closed sets in it.
Corollary 3.4**.**
Let be -definable. Then is also -definable.
Combining Theorem 3.2 and Proposition 2.4, we get the following stable embeddedness result which is folklore.
Corollary 3.5**.**
A subset of is definable in the pair if and only if it is definable in the field .
3.1. K-Closed versus Closed
The well-known Kolchin Irreducibility Theorem states that a Zariski closed set in a differentially closed field is Kolchin irreducible if it is Zariski irreducible. As we have mentioned in the introduction, we need the answer to the following version of this theorem to be affirmative for the next proposition.
Question. Is it correct that any irreducible closed set K-irreducible?
Following is Proposition 1.2 from the introduction.
Proposition 3.6**.**
Suppose that the answer to the question above is affirmative and let be definable in . Then is closed if and only if it is K-closed.
Proof.
It is clear that closed sets are K-closed, so we only need to prove the other implication. So let’s suppose that is K-closed and prove that it is closed.
By Theorem 3.2, we may write
[TABLE]
where the sets are closed and the sets are open. We may also assume that each is irreducible. Then they are indeed K-irreducible by the assumption. So
[TABLE]
Thus is closed.
∎
4. Ranks
It is well-known that the theory of pairs of algebraically closed fields is -stable with and . (Here and below, Morley ranks are with respect to the pair .)
We relate the Morley rank and the pair topology. We also relate them to another notion of dimension given by a certain pregeometry called small closure. The concept of smallness below is defined for any structure and for any subset of the underlying set, but here we always use it for subsets of an algebraically closed field and mostly with subsets definable in a pair of algebraically closed fields.
Definition 4.1**.**
Let be a first order structure in a language . We say that a subset of is large if there is a multi-valued function definable in such that . (A multi-valued function is a function such that has at most elements for each .)
If is not large, then we say it is small.
Some remarks are in order. The use of multi-valued functions in this definition is really crucial in the general setting, however it is proven in [2] that in the case of algebraically closed fields usual functions are enough. Note also that the notion of smallness is first order in the language extending by a (new) unary predicate which is interpreted as . For more facts on the notion, the reader could check [2].
If is a subfield of an algebraically closed field , then the only way it can be large is that either it is the whole or it is a real closed subfield such that the degree of over is 2. Hence a proper algebraically closed subfield is always small. As a result, the image of under a definable multi-valued function is also small. The converse is also correct: a small set is contained in the image of under a definable function. Using this, it is also easy to see that being small for a set definable in is the same as having finite Morley rank. So we freely use each one of these equivalent concepts.
We define small closure in a similar way to algebraic closure, replacing “finite” by “small”. More precisely: Let , then is in the small closure of , denoted by , if it is contained in a small set definable in over . In a saturated enough extension, this is the same as . Then this closure operator is a pregeometry and hence gives the notions of independence and dimension in the usual way.
Definition 4.2**.**
- (1)
Given and , we define the small rank, , of over to be the pregeometry dimension of over . 2. (2)
The small dimension, , of a definable set is defined to be the the maximum of the set
[TABLE]
The small dimension of a definable set is well-defined, because of the explanation on page 315 of [3].
For instance, the small dimension of a small set is [math] and . Note that for two definable sets , if , then . However, the converse is not correct:
[TABLE]
but if , then .
Consider the example from the introduction:
[TABLE]
This is a strongly minimal set in the differentially closed field and its geometry is trivial (see [5] for details). If it were definable in the pair, then it would still have Morley rank at most , hence it would be a small set. Then its small dimension would be [math]. However, this contradicts with the fact that its geometry is trivial. Therefore this is a subset of definable in the differential field, but not in the pair.
Lemma 4.3**.**
If is closed then .
Proof.
First let and let . Then –without loss of generality– we have that . So is at most . Therefore .
Now if is the pre-image of under a non-zero polynomial map, then we again get a similar dependence over .
It is clear that the small dimension of finite intersection is at most the least of small dimensions of sets we intersect. Similarly the small dimension of a finite union is the maximal of the small dimensions of the sets we put together. ∎
We collect some consequences of this lemma.
Corollary 4.4**.**
Proper closed subsets of are small.
Corollary 4.5**.**
The Morley rank of a proper closed subset of is less than .
Corollary 4.6**.**
The small dimension of a non-empty open subset of is and its Morley rank is .
Proof.
Let be an open subset of and let be its complement in . Then one of them has to have small dimension equal to . Since , we get that .
Similarly, one of or should have the same Morley rank as and the Morley rank of is strictly less than that. ∎
Next we prove a partial inverse of the last corollary.
Proposition 4.7**.**
Let be a definable set that has the same Morley rank as . Then has non-empty interior.
Proof.
First note that . Otherwise, by the corollary above, would have disjoint two subsets of maximal Morley rank.
Write
[TABLE]
where each is closed and each is open. Then
[TABLE]
Therefore one of the ’s must be and this means that the corresponding is contained in . ∎
The following has a similar proof.
Proposition 4.8**.**
Let be a definable set that has the same small dimension as . Then has non-empty interior.
Lemma 4.9**.**
Let . Suppose that there is a projection such that has non-empty interior. Then .
Proof.
Let be definable over . Without loss of generality is the projection onto the first coordinates. By the proposition above . Take a generic ; this is to say that are -independent over . Now take such that . It is clear that . Therefore . ∎
Proposition 4.10**.**
Let . Then is the maximal such that there is a projection in a way that has non-empty interior.
Proof.
Let be definable over and . Take such that ; say are -independent over . Then has small dimension , where is the projection onto the first coordinates. ∎
Lemma 4.11**.**
Let be definable sets where is an open set intersecting . Suppose also that is irreducible. Then .
Proof.
Let , where the sets are closed and irreducible and are open. Then
[TABLE]
So for some . Without loss of generality, .
Note that the only way the conclusion of the lemma does not hold is when . Suppose that . Then
[TABLE]
and
[TABLE]
Then either or . The former one is not possible, so we have . But then and , which contradicts the assumption that intersects . Thus we have
∎
Now we generalize Proposition 4.8
Proposition 4.12**.**
Let be definable in the pair. Then .
Proof.
First assume that . Since , either or has small dimension , but has empty interior. So .
Let and take such that has non-empty interior. Let . If , then . But . However , which is a contradiction. ∎
Using Lemma 4.11, we have the following.
Corollary 4.13**.**
Let be definable and suppose that is open with and that is irreducible. Then .
We are proceeding to prove the proposition above for Morley rank in the place of small dimension. We need the following fact from ???.
Fact 2*.*
Let and (of cardinality less than ). Then
[TABLE]
Proposition 4.14**.**
Let be definable. Then .
Proof.
Without loss of generality, we may assume that is of Morley degree . Let be definable over , then by Corollary 3.4, is also definable over . We proceed by induction on .
Take a -generic (over ). By Corollary 3.3, there is a closed defined over that contains and . Then we also have that . So indeed we have .
As we assume that is of Morley degree , we have . Hence by the induction hypothesis. Then
[TABLE]
and
[TABLE]
However, and , which proves the proposition.
∎
Once again, the following is a consequence of Lemma 4.11.
Corollary 4.15**.**
Let be a definable set such that is irreducible and let be an open set that intersects . Then .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] F. Delon. Elimination des quantificaeurs dans les paires de corps algebriquement clos. Confluentes Mathematici , 4(2), 2012.
- 2[2] Lou van den Dries and Ayhan Günaydın. The fields of real and complex numbers with a small multiplicative group. Proc. London Math. Soc. (3) , 93(1):43–81, 2006.
- 3[3] Jerry Gagelman. Stability in geometric theories. Ann. Pure Appl. Logic , 132(2-3):313–326, 2005.
- 4[4] H. Jerome Keisler. Complete theories of algebraically closed fields with distinguished subfields. Michigan Math. J. , 11:71–81, 1964.
- 5[5] David Marker. Model theory of differential fields. In Model theory, algebra, and geometry , volume 39 of Math. Sci. Res. Inst. Publ. , pages 53–63. Cambridge Univ. Press, Cambridge, 2000.
