Connectivity of joins, cohomological quantifier elimination, and an algebraic Toda's theorem
Saugata Basu, Deepam Patel

TL;DR
This paper establishes cohomological properties of iterated joins of algebraic varieties, leading to applications in quantifier elimination, complexity theory, and bounds on Betti numbers over algebraically closed fields.
Contribution
It proves isomorphism and injectivity of cohomology restriction maps for iterated joins, extending classical results to a broader algebraic and cohomological context.
Findings
Cohomology restriction maps are isomorphisms for degrees less than p
Injectivity of cohomology maps at degree p for iterated joins
Derived applications in quantifier elimination and complexity bounds
Abstract
Let be a non-empty closed subscheme over an algebraically closed field , and denote the -fold iterated join of with itself. In this article, we prove that the restriction homomorphism on cohomology , with , is an isomorphism for , and injective for , for any good cohomology theory. We also prove this result in the more general setting of relative joins for over a base scheme , where is of finite type over . We give several applications of these results including a cohomological version of classical quantifier elimination in the first order theory of algebraically closed fields of arbitrary characteristic, as well as an algebraic version of…
| - | - | - | ||
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.
Connectivity of joins, cohomological quantifier elimination, and an algebraic Toda’s theorem
Saugata Basu
Department of Mathematics, Purdue University, 150 N. University Street, West Lafayette, IN 47907, U.S.A.
and
Deepam Patel
Department of Mathematics, Purdue University, 150 N. University Street, West Lafayette, IN 47907, U.S.A.
Abstract.
In this article, we use cohomological techniques to obtain an algebraic version of Toda’s theorem in complexity theory valid over algebraically closed fields of arbitrary characteristic. This result follows from a general ‘connectivity’ result in cohomology. More precisely, given a closed subvariety over an algebraically closed field , and denoting by the -fold iterated join of with itself, we prove that the restriction homomorphism on (singular or -adic etale) cohomology , with , is an isomorphism for , and injective for . We also prove this result in the more general setting of relative joins for over a base scheme , where is of finite type over . We give several other applications of this connectivity result including a cohomological version of classical quantifier elimination in the first order theory of algebraically closed fields of arbitrary characteristic, and to obtain effective bounds on the Betti numbers of images of projective varieties under projection maps.
S.B. would like to acknowledge support from the National Science Foundation award CCF-1618981, DMS-1620271, and CCF-1910441. D.P. would like to acknowledge support from the National Science Foundation award DMS-1502296.
Contents
-
2.3.2 A generalization of the cohomological connectivity result
-
2.4 Cohomological connectivity over non-algebraically closed fields
-
3.2 Proof of the cohomological quantifier elimination theorem
-
4 An algebraic version of Toda’s theorem over algebraically closed fields
-
5.1 Classical results on bounds for sums of Betti numbers of algebraic sets
-
5.2 Bounds on the Betti numbers of images via relative joins
-
6.1 Exponentially large error for the hypercovering inequality
1. Introduction
The main goal of this article is to obtain a geometric proof of an algebraic version of Toda’s theorem in complexity theory valid over algebraically closed fields of arbitrary characteristic. We obtain this result as an application of some cohomological properties of (ruled) joins of projective schemes. These cohomological results are also applied to obtain a cohomological version of quantifier elimination as well as give bounds for the Betti numbers of projective varieties under projection maps. We describe our main results, the motivation behind these results, and their connections with prior work in the following paragraphs.
1.1. Cohomological connectivity of joins
Let and denote two non-empty closed sub-schemes over an algebraically closed field .111Here is the usual -dimensional projective space over . Sometimes we denote this by in order to make the base field explicit. Then the (ruled) join is a closed subscheme of . Moreover, one can show that is connected. One can interpret the latter topological connectivity result as the following cohomological connectivity result:
The restriction map induces an isomorphism
Our first main theorem generalizes this cohomological connectivity result to iterated joins. Given (, let denote the iterated (ruled) join. Here
Theorem** (cf. Theorem 2.17).**
Let for , be non-empty closed subschemes. Then the inclusion (with ) induces an isomorphism
[TABLE]
for all , and an injective homomorphism for .
The cohomology groups appearing in the Theorem may be taken to be -adic etale cohomology with a fixed prime not equal to the characteristic of the base field. We also prove a similar result under assumptions of ‘higher’ cohomological connectivity of the given schemes. More precisely, we prove the following result:
Theorem** (cf. Theorem 2.27).**
Let for , be non-empty closed subschemes, and , such that the restriction homomorphisms are isomorphisms for for , and injective for . Then the restriction homomorphism
[TABLE]
is an isomorphism for , and injective for , where .
Note that topological connectivity properties (in the Zariski topology) of joins of projective varieties have been considered by various authors (see for example the book [FOV99]). The main emphasis in these previous works was on studying Grothendieck’s notion of ‘-connectedness’. A projective variety is -connected if and is connected for all closed subvarieties of dimension . It is a classical result [FOV99, §3.2.4], that if is -connected and is -connected then is -connected. One can easily generalize this to the setting of multi-joins. While this result is philosophically similar to the aforementioned cohomological connectivity of the join, one cannot infer Theorem 2.9 from this result. In particular, it is easy to come up with examples of projective varieties , such that is -connected, but the restriction homomorphism is not an isomorphism for some .
The notion of cohomological connectivity considered in this paper is distinguished from Grothendieck connectivity in another significant way. We prove relative versions (see Theorems 2.19 and 2.22) of our connectedness theorems where the join is replaced by the relative join. This relative version (namely, Theorem 2.19) is in fact the key to the main applications of our connectivity theorem. It allows us to relate the Poincaré polynomial of the image of a closed projective scheme with that of the iterated relative join (relative to the projection morphism). 222 Note that we define (2.31).
More precisely, we obtain:
Theorem** (cf. Theorem 2.32).**
Let , , and the projection morphism. Then,
[TABLE]
(Here, denote the -fold iterated relative join over , and the Poincaré polynomial.)
The cohomological connectivity property of the iterated relative join of a complex algebraic set relative to the proper morphism (the restriction of the projection to ) was first investigated in [Bas12]. A complex version of Theorem 2.32 valid for singular cohomology was obtained there (though not stated in the language of cohomological connectivity). The motivation in loc. cit. was to prove an analog of a certain result from the theory of computational complexity (Toda’s theorem [Tod91]) in the complex algebraic setting. The relation between Poincaré polynomials in the above theorem was the key input in the proof of the complex analog of Toda’s theorem. However, the argument in loc. cit. was topological, and heavily used the analytic topology of complex varieties. Our result extends the topological result in loc. cit. to the setting of etale cohomology of projective schemes of finite type over a base field of arbitrary characteristic. This significantly widens the applicability of our main results. For example, using our more general result we are now able to extend Toda’s theorem to algebraically closed fields of arbitrary characteristic.
We also give several other applications of our results. These applications are mostly quantitative in nature and impinges on model theory as well as on the theory of computational complexity. We discuss these applications in the next paragraphs.
1.2. Cohomological quantifier elimination
Our first application is related to the topic of ‘quantifier elimination’ in the first order theory of algebraically closed fields. It is a well known fact in model theory that the first order theory of algebraically closed fields (for any fixed characteristic) admits quantifier elimination. This is also known as Chevalley’s theorem. More precisely, for an algebraically closed field and with tuples of variables , a quantifier-free first order formula in the language of the field is a Boolean formula with atoms of the form . A first order formula in the language of the field is of the form
[TABLE]
where is a quantifier-free first order formula and each is a quantifier belonging to . 333We refer the reader who is unfamiliar with model theory terminology to the book [Poi00] for all the necessary background that will be required in this article.
Any first order formula in the language of an algebraically closed field defines (in an obvious way) a subset of , where is the length of the tuple .444Here, denotes the usual -dimensional affine space over . If the (i.e. the set of free variables is empty), then the formula is called a sentence, and there are only two possibilities for . Either , in which case we say that is True (or equivalently belongs to the first order theory of ), or , in which case we say that is False (or belongs to the first order theory of ). The quantifier elimination property of the theory of algebraically closed fields can now be stated as:
Theorem A** (Quantifier-elimination in the theory of algebraic closed fields).**
Let be an algebraically closed field. Then, every first order formula
[TABLE]
in the language of the field , there exists a quantifier-free formula such that
[TABLE]
At the cost of being redundant (for reasons that will become apparent in the following paragraphs) we state the following corollary of Theorem A in the case is empty. With the same hypothesis as in Theorem A:
Corollary A**.**
[TABLE]
We introduce in this paper a cohomological variant of quantifier elimination. We restrict our attention to what we call proper formulas (cf. Definition 3.2). Just like a first order formula defines a constructible subset of , a proper formula defines an algebraic subset of some products of ’s. Given a (possibly quantified) proper formula over an algebraically closed field (of arbitrary characteristic), we produce a quantifier-free formula
[TABLE]
(also proper) from . (The notation and its connection to the join will be clear from its definition given in Notation 3.8 in Section 3.) While not being equivalent to in the strict sense of model theory, is related to via a cohomological invariant (closely related to the Poincaré polynomial which we call the ‘pseudo-Poincaré polynomial’).
This invariant of can be recovered from that of the quantifier-free formula using only arithmetic over . More precisely, we prove that there exists an operator (whose definition we omit right now but can be found in (3.11)) which depends only on the sequence, , of quantifiers and the block sizes in the proper quantified formula , such that the following equality holds:
Theorem B** (cf. Theorem 3.12).**
[TABLE]
Here, denotes the pseudo-Poincaré polynomial (see (3.5) for definition of ) of the algebraic set defined by for any proper formula .
The above theorem deserves the moniker ‘quantifier elimination’ once we substitute the realization map , which takes formulas to constructible sets in Theorem A, by the map which takes formulas to . While we have an absolute equality in Theorem A, in Theorem B, the polynomials and are related via the map . In the case of sentences (i.e. when the set of free variables is empty) we have the (perhaps even more suggestive) corollary (compare with Corollary A):
Corollary B**.**
[TABLE]
The main advantage of the cohomological variant over usual quantifier elimination becomes apparent when viewed through the lens of ‘complexity’. In the traditional quantifier elimination (Theorem A above) the quantifier-free formula can be potentially much more complicated than – for instance, the degrees of the polynomials appearing in the atoms of could be much bigger than those of the polynomials appearing in the atoms of (see for example [Hei83]) – and there is no direct way of producing from without using algebraic constructions such as taking resultants of polynomials appearing in etc. (see Example 1.4 below).
Bounding the ‘complexity’ of the quantifier-free in terms of that of is an extremely well-studied question (see for example [Hei83] for the state-of-the-art) with many ramifications. Indeed, the well known P vs NP question in computational complexity – say in the Blum-Shub-Smale (henceforth, B-S-S) model of computation [BCSS98] – is fundamentally about comparing the complexities of sequences of varieties which belong to an ‘easy’ class (i.e. the B-S-S complexity class ), with the complexities of sequences obtained by taking images under certain projections of sequences belonging to the ‘easy’ class (by taking the images under projections of sequences in the class one obtains the B-S-S complexity class ). A formal definition of in the B-S-S sense can be found in [Bas12] and will not be repeated here.
The notion of ‘complexity’ of a formula that we use is made precise later (cf. Definition 4.2). However any reasonable notion of ‘complexity’ (for example, taking it to be the maximum of the degrees of polynomials that appear in it) suffices for the following discussion. The best known upper bound on the ‘complexity’ of is exponential in that of [Hei83], even when the number of blocks of quantifiers is fixed and it is considered highly unlikely that this could be improved (see Example 1.4 below). The crucial advantage of ‘cohomological quantifier elimination’ over ordinary quantifier elimination (i.e. Theorem B over Theorem A) is that the quantifier-free formula has ‘complexity’ which is bounded polynomially in that of (when the length of is fixed). This fact follows from the fact that can be expressed in terms of in a uniform way – without having to do any algebraic operations. Thus, while the relation between the quantifier-free formula and is weaker than in the case of quantifier elimination in the usual sense, it is obtained much more easily from without paying the heavy price inherent in the quantifier elimination process.
Example 1.4**.**
A classical example of the blow-up in complexity on passing from to is illustrated in the following well-studied example.
Let be an algebraically closed field, , and . Let be the proper formula
[TABLE]
(identifying elements of with the vectors of coefficients of forms of degree ). Let be the subvariety of defined by
[TABLE]
and
[TABLE]
the projection morphism. Then the image, , is a subvariety (hypersurface) of defined by a polynomial (the resultant of the forms ) of degree (see for example [GKZ08, Chapter 13, Prop. 1.1]). Notice that , and in this case a quantifier-free formula equivalent to is given by . If one measures the complexity of a formula by the maximum degree of the polynomials appearing in it, we see that in this case the complexity of is bounded by , while that of is which is exponentially large. In contrast, in this case it follows from the definition of (Notation 3.8 in Section 3) that the complexity of the quantifier-free formula (cf. (1.3)) is bounded by . Moreover, the operator appearing in Theorem B in this simple example reduces to multiplication by the polynomial followed by truncation of the resulting polynomial to degree . This illustrates the advantage of Theorem B over Theorem A from the point of view of complexity. This last feature of Theorem B is the key to our second application of Theorem 2.32 that we discuss below – namely, an algebraic analog of Toda’s theorem.
We note that a version of Theorem B in a less precise form over the field of complex numbers and using singular cohomology appears in [Bas12]. The results of this section hold over algebraically closed fields of arbitrary characteristic, and etale cohomology and so is much more general than the result in loc. cit. Also, while the techniques used in the proof of Theorem B are somewhat similar to those used in loc. cit., the proof differs in several key points – so we prefer to give a self-contained proof of Theorem B at the cost of some repetition.
1.3. Algebraic Toda’s theorem
The ‘cohomological quantifier elimination’ theorem discussed above has applications in the theory of computational complexity. In the classical theory of computational complexity, there is a clear analog of Kleene’s arithmetical hierarchy in logic – namely, the polynomial hierarchy (consisting of the problems of deciding sentences with a fixed number of quantifier alternations). This connection, and especially the relation to quantifiers is made precise in Section 4 below. Another important topic studied in the theory of computational complexity is the complexity of counting functions. A particularly important class of counting functions is the class (introduced by Valiant [Val84]) associated with the decision problems in : it can be defined as the set of functions which, for any input , return the number of accepting paths for the input in some non-deterministic Turing machine. A theorem due to Toda relates these two different complexity classes by an inclusion (which expresses the fact that ability to ‘count’ is a powerful ‘computational resource’). The precise result is:
Theorem 1.7** (Toda [Tod91]).**
.
Thus, Toda’s theorem asserts that any language in the polynomial hierarchy can be decided by a Turing machine in polynomial time, given access to an oracle with the power to compute a function in . (Only one call to the oracle is required in the proof.) We refer the reader to [Pap94] for precise definitions of these classes in terms of Turing machines, and also that of oracle computations, but these definitions will not be needed for the results proved in the current paper.
As mentioned previously, an important feature of Theorem 3.12 is that the quantifier-free formula obtained from the quantified formula has an easy description in terms of (in contrast to what happens in classical quantifier elimination). Making this statement quantitative leads to a result which is formally analogous to Theorem 1.7, and which we discuss below.
As stated above Toda’s theorem deals with complexity classes in a discrete setting. Blum, Shub and Smale [BCSS98], and independently Poizat [Poi95], proposed a more general notion of complexity theory valid over arbitrary rings. The classical discrete complexity theory reduces to the case when this ring is a finite field. The complexity classes (corresponding to the discrete complexity classes such as etc.) consists of sequences of constructible sets.
Example 1.8**.**
For example, over any field , and for any fixed , the sequence of algebraic sets , where is defined as in (1.5) will belong to the complexity class . This is because it is possible to check membership in the sets (by a Blum-Shub-Smale machine [BCSS98]) with number of steps bounded by a polynomial in (for fixed ). On the other hand, the sequence (cf. (1.6)) belongs to the class , since its elements are obtained as images of projections of the sets belonging to the class . We refer the reader to Section 4.1 for the precise definitions of complexity classes that we will use in this paper, but the two examples given above can be considered to be the prototypical examples of members of the classes and respectively (also of the classes and where the superscript indicates that the elements of the sequence are compact in the case ). (Also note that in Section 4.1, the class above is denoted by in order to place it in its right position in the polynomial hierarchy, but in this introductory section we will continue to use the more commonly used nomenclature .)
An interesting question that arises in this context is whether an analog of Toda’s result hold for complexity classes defined over rings other than finite fields. While the polynomial hierarchy has an obvious meaning in the more general B-S-S setting, the meaning of the counting class is less clear – boiling down to the question what does it mean to ‘count’ a semi-algebraic set (for B-S-S theory over ) or a constructible set (for B-S-S theory over ). An equivalent definition of the classical (discrete) complexity class (which is more amenable to amenable to generalizations to an algebraic setting) is that a sequence of functions belong to the class if the functions count the cardinalities of the fibers of the projections maps restricted to a sequence of sets in . Making the reasonable choice that ‘counting’ over or should mean computing the Poincaré polynomial, and defining the class appropriately, real and complex versions of Toda’s theorem were proved in [BZ10] and [Bas12], respectively.
The proofs of the results in [BZ10, Bas12] were topological and used the euclidean topology of real and complex varieties. Since the approach in the current paper is purely algebraic, we are now able obtain a similar result in all characteristics. The algebraic approach is also different in certain important technical details. Additionally, in order to make our result independent of the technical details which are inherent in any description of a computing machine (such as B-S-S or Turing machines) we state and prove our result in the non-uniform setting of circuits – and reformulate Toda’s theorem as a containment of two non-uniform complexity classes of constructible functions instead. This does not affect the main mathematical content of the theorem, viz. a polynomially bounded reduction of the quantifier elimination problem in the theory of algebraically closed fields to the problem of computing the Poincaré polynomial of certain algebraic set built in terms of the given formula. As an added advantage, this lessens the burden on the reader unfamiliar with B-S-S machines. We prove the following inclusion, where the precise definitions of the complexity classes on both sides can be found in Section 4.1 and should be thought of as the non-uniform, constructible function analogs of the classes appearing in Toda’s original theorem.
Theorem** (cf. Theorem 4.11).**
[TABLE]
The precise definitions are given in Section 4.1 below. The left hand side of the inclusion is the class of sequences of characteristic functions of the algebraic analog of languages in the polynomial hierarchy, and the right hand side is the algebraic analog of the class as in Toda’s theorem.
Example 1.9**.**
We will define counting complexity classes of sequences of functions over arbitrary algebraically closed fields later in Section 4.1. But the following example of a sequence in over an algebraically closed field is instructive. We use the same notation as in Examples 1.4 and 1.8.
The following sequence of functions is an example of a sequence in :
[TABLE]
where
[TABLE]
denotes the Poincaré polynomial, and is the algebraic set defined by . Notice that the value of the function at a point in is the Poincaré polynomial of the fiber above the point of the map , and the sequence belongs to the . In this sense the functions are ‘counting’ the fibers of projection maps restricted to a a sequence in , analogous to the discrete case.
On the other hand the sequence in Example 1.8 belongs to the class , and hence also belongs to the class . So as an application of Theorem 4.11 we obtain that the sequence of characteristic functions
[TABLE]
belongs to the class .
If Toda’s original theorem expresses the ‘power of counting’, one could say similarly, that Theorem 4.11 is about the ‘expressive power of cohomology’.
1.4. Uniform bounds on Betti numbers of varieties
As a final application of our results on the connectivity of joins, we consider the well studied problem of proving effective upper bounds on the Betti numbers of algebraic sets in terms of the parameters defining them. This problem has many applications, and has attracted a lot of attention in different settings. For example, in the context of real algebraic and semi-algebraic sets, such bounds were first proved by Oleĭnik and Petrovskiĭ [PO49], Thom [Tho65] and Milnor [Mil64], who used Morse theory and the method of counting critical points of a Morse function to obtain a singly exponential upper bound on the Betti numbers (dimensions of the singular cohomology groups) of real varieties. Over arbitrary fields, Katz [Kat01], proved similar results for the -adic Betti numbers of both affine and projective varieties, using prior results of Bombieri [Bom78a] and Adolphson-Sperber [AS88a] on exponential sums. Theorem 2.32 proved in this paper relates the Betti numbers of the image , of a projective subscheme , with those of itself. Thus, it is natural to ask if this allows one to extend the results of Katz, to the images of projective subschemes of under projection map. One obvious way to prove upper bounds on is to first describe in terms of polynomials using effective quantifier elimination (see for example [Hei83]), and then applying Katz’s bound to the resulting description. However, the inordinately large complexity of quantifier elimination implies that such an upper bound would be very pessimistic.
We utilize Theorem 2.32 to prove uniform bounds on the Betti numbers of the image of an algebraic set in terms of the number of equations defining and their degrees. We are thus able to extend prior results of Katz ([Kat01]) on bounding Betti numbers of projective algebraic sets in terms of the number of equations defining them and their degrees, to bounding those of the image in terms of the same parameters. Our main result in this direction is the following theorem.
Theorem** (cf. Theorem 5.2).**
Let be an algebraic set defined by bi-homogeneous polynomials of bi-degree , and the projection morphism. Then, for all ,
[TABLE]
Here, is a certain function defined precisely in Section 5.1, coming from the works of Bombieri [Bom78a], Adolphson-Sperber [AS88a], and Katz [Kat01], giving an upper bound on the -adic Betti numbers (with compact support) of an algebraic subset , defined by polynomial equations of degrees bounded by .
An alternative method for bounding the Betti numbers of the image , in terms of the defining parameters of , is by bounding the -terms of the spectral sequence associated to the hypercovering of given by the iterated products of fibered over . We show in some situations (Section 6.1), the hypercovering inequality can be loose by an exponentially large factor. In such situations it might be better to first express the sum of the Betti numbers of in terms of certain Betti numbers of the join (cf. Eqns. (6.3) and (6.4)) and then use the bounds due to Katz (thus the only source of looseness of the obtained bound is that coming from Katz’s inequality).
We also give an example of a situation where the join inequality can give the exact Betti numbers (up to some dimensions) of the image . As an application of Theorem 2.32 combined with a weak Lefschetz type argument, we prove the following theorem.
Theorem** (cf. Theorem 6.5).**
Let be a subvariety defined by bi-homogeneous forms. Let be the projection morphism. Then, for all ,
[TABLE]
Remark 1.10*.*
Theorem 6.5 can be useful in determining the Betti numbers in small dimensions of varieties described as the image, , where is a subvariety and . In many situations, while may be cut out by a small number of equations, the image, , might need many more equations to define (this number is determined by the arithmetic rank of the elimination ideal). In particular, a repeated application of classical Artin vanishing directly to (cf. Lemma 6.6) might not give any useful information. However, the interval of dimensions for which Theorem 6.5 gives us information does not depend on the arithmetic rank of the elimination ideal but just on the number of equations needed to cut out the variety . In particular the result here is purely topological, and this could be useful in situations where we do not have good knowledge of the arithmetic rank of the elimination ideal.
An instructive example is the following. Let , and let denote the vector space of matrices, and . Let be the subvariety defined by
[TABLE]
and let
[TABLE]
be the projection morphism. Then is the projectivization of the subvariety of matrices of rank at most . Notice that the number of equations needed to define is clearly , while the number of equations needed to define could be much larger. In this particular situation, the arithmetic rank of the ideal defining is well studied, and it is known that it is bounded from above by [BV88, Corollary 5.21] (which could be much larger than ). In this particular example, the information about the Betti numbers obtained by using Theorem 6.5 can be recovered using Lemma 6.6 directly in conjunction with the upper bound on the arithmetic rank mentioned above. However, in more general situations knowledge of a good upper bound on the arithmetic rank of the elimination ideal could be missing, and in such situations Theorem 6.5, whose proof is purely topological, can still give useful information. Finally, note that it is not possible to derive Theorem 6.5 from the upper bound obtained from the hypercover inequality.
The rest of the paper is organized as follows. In Section, 2, we state and prove our main theorems on joins and relative joins. We state and prove a key inequality (Theorem 2.32) in Section 2.5. In Section 3, we state and prove our theorem on ‘cohomological quantifier elimination’, and in Section 4, we give the promised application of cohomological quantifier elimination to prove a version of Toda’s theorem valid over all algebraically closed fields. In Section 5, we discuss bounds on Betti numbers and in Section 6 we compare the efficacies of using the hypercovering vs the join inequalities.
2. Cohomological connectivity properties of the join
In this section, we prove our main result on the cohomological connectivity of the join. In the following, we shall fix an algebraically closed base field (except in subsection 2.4). All our schemes will be of finite type over the base field .
2.1. Joins of schemes
We recall some basic properties of the join construction for the convenience of the reader. We refer the reader to [AK75] for the details. Let be a scheme of finite type over . Let denote the category of positively graded quasi-coherent -algebras such that is generated in degree , each component is a coherent -module, and the degree zero component is . We let denote the corresponding projection. Given , let and denote the corresponding projective schemes. The relative join of and over , denoted , is by definition . Here are some basic properties of this construction:
The relative join construction can be viewed as a bi-functor as follows. Any surjection of graded -algebras induces a linear embedding
[TABLE]
Since the tenor product is right exact, the join can be viewed as a bi-functor with morphisms in given by surjective morphisms of -algebras. Here denotes the category of -schemes. 2. 2.
Applying this construction to the the morphism , where is the identity, gives a natural embedding of schemes over . Similarly, one has a natural embedding . 3. 3.
Given a morphism and an object , let denote the corresponding pull back. Since the construction is compatible with base change, the relative join is also compatible with base change. In particular, one has a cartesian diagram:
[TABLE]
We can iterate the join construction and consider the -fold join . More precisely, let , and set . This construction is the same as . Note that a surjection induces an imbedding for all .
More generally, given , we can consider the multi-join:
[TABLE]
As before, one has closed embeddings .
Suppose is a vector bundle on and is a closed sub-scheme of . Recall, is of the symmetric algebra , where is the dual bundle. In this case, is given by applying the construction to an object in . More precisely, is a quotient of . In particular, we have a natural embedding . We note that the construction of depends on and, in particular, on the embedding of in .
We can generalize the previous paragraph to the setting of multi-joins. Suppose () are vector bundles on , and are closed subschemes. Then each , and we can define the multi-join as before. Note that the previous constructions give a natural embedding
[TABLE]
Given as above, we shall denote the multiple join by .
Let as above, denote the structure map, and denote the corresponding scheme theoretic image. Note that, since is proper, the underlying set of is the set theoretic image. Let , and let denote the union of the subschemes . Consider the base change diagram:
[TABLE]
Lemma 2.1**.**
With notation as above, the structure map factors through .
Proof.
One can proceed by induction on . Suppose . Then by ([AK75], B.3), there is a natural retraction (i.e. a section of the natural embedding ). It follows that the image of in is contained in and similarly for . This proves the result in the case that . The general case follows by induction. ∎
As a consequence of the previous lemma, and the universal property of fiber products, one has a commutative diagram:
[TABLE]
In the case of and , we get a commutative diagram:
[TABLE]
Remark 2.2*.*
Note that is canonically isomorphic to where is the restricted bundle.
Remark 2.3*.*
If is the trivial bundle of rank , then we may identify with .
2.2. Joins and cones
Suppose now that . In the following, we shall drop the subscript from our notation in the setting of (unless we need to specify the field). Let and denote two fixed projective subschemes. If (resp. ) is the homogeneous coordinate ring of (resp. ), then we defined join of and as the projective scheme . Note that this is naturally a closed subscheme of .
The cone of , denoted by , is by definition the affine scheme . We shall denote by the cone point. In the following, we shall sometimes drop the subscript and simply denote by the cone point. One has a canonical isomorphism:
[TABLE]
2.3. Proofs of cohomological connectivity of joins
In the following, we shall prove connectivity (i.e. cohomology vanishing) results for iterated relative joins. By cohomology, we shall mean etale cohomology theory on the category of schemes over . Moreover precisely, given a prime not equal to the characteristic of the field , we shall consider the etale cohomology groups , or . We shall usually drop the coefficients (and subscript) and denote these simply by .
Remark 2.5*.*
We remind the reader that by definition
[TABLE]
and . In the following, we will prove statements at the level of torsion coefficients, and then pass to inverse limits to obtain statements at the level of -coefficients (and, after tensoring with , for -coefficients).
Remark 2.6*.*
If is a fixed embedding, the we may also consider the singular cohomology . The results of this section also hold in this setting.
2.3.1. Connectivity over a point
In this subsection, we shall work with schemes of finite type over a separably closed field , and will denote the etale cohomology groups as in the previous paragraph. Let be a closed subscheme and consider
Definition 2.7**.**
Let be a closed subscheme and an integer such that . Then is cohomologically -connected if the restriction homomorphism
[TABLE]
is an isomorphism for all , and an injection for .
Remark 2.8*.*
We note that, if , standard results show that this notion will be independent of the prime . In characteristic , this would follow from Deligne’s proof of the Weil conjectures if is also smooth. In general, it would follow from certain standard conjectures in algebraic geometry. For our purposes, we have simply fixed a prime not equal to the characteristic of .
We begin by proving the following connectivity property of the join. The analogous statement in the setting of singular cohomology was proven by the first author in ([Bas12]). Our goal here is to give a ‘motivic proof’ of this statement which is applicable to any Weil cohomology theory.
Theorem 2.9**.**
Let be a closed subscheme. Then is cohomologically -connected. In particular, the restriction homomorphism
[TABLE]
is an isomorphism for , and an injection for .
We begin with some preliminary remarks. In the following, for any closed subscheme we set . Note that one has a natural cartesian diagram:
[TABLE]
In particular, the natural projection is a -bundle.
The following lemma is well-known. Over the complex numbers, it follows directly from the contractibility of the cone. We provide a proof here applicable to any ‘good cohomology theory’ due to a lack of reference.
Lemma 2.11**.**
The natural inclusion induced an isomorphism on cohomology:
[TABLE]
Proof.
Let denote the blow-up of at . Then it is a standard fact that there is a natural map which realizes as a line bundle over . Moreover, the exceptional fiber of the blow-up is canonically identified with the zero section of . In particular, and . On the other hand, one has the usual long exact sequence for the cohomology of the blow-up ([Sta20, Tag 0EW5]) :
[TABLE]
where the arrows are induced by the natural pull-back maps on cohomology. Since the restriction homomorphism is an isomorphism (by the remarks above), the natural restriction homomorphisms must be isomorphisms. ∎
Lemma 2.12**.**
With notation as above, one has
[TABLE]
and
[TABLE]
Before proving the lemma, we give two proofs of Theorem 2.9. The first uses a spectral sequence argument, while the second proof uses the following standard Gysin long exact sequence.
Lemma 2.13**.**
[SGA77*, Corollaire 1.5, Exposé VII]**
Let be a scheme, and be a rank vector bundle. Let denote the complement of the zero section. Then there is a long exact sequence in cohomology:*
[TABLE]
We are now in a position to prove Theorem 2.9.
Proof of Theorem 2.9.
The conclusion follows by an application of Lemma 2.12 to the Leray spectral sequences for the bundle . More precisely, the cartesian diagram 2.10 of -bundles gives rise to a commutative diagram of spectral sequences:
[TABLE]
Here, by abuse of notation, we use the same notation to denote the natural maps and . Since is a -bundle, is a local system with stalk at given by , and similarly for . Moreover, in the case of it is the trivial local system. Since on is the restriction of the corresponding local system on (due to the fact that the base change map is an isomorphism for zariski or etale local -torsors as a consequence of the Kunneth formula, and the fact that 2.10 is cartesian), it is also a trivial local system. In particular, the cohomology groups are zero for , and otherwise one has and , and similarly for . Note that one can identify .
It follows that both spectral sequences are concentrated in two columns and degenerate at . In particular, they give rise to a commutative diagram of long exact sequences:
[TABLE]
where . The result is now an easy consequence of Lemma 2.12, and an application of the five lemma to the commutative diagram of long exact sequences above. ∎
Alternate proof of Theorem 2.9 using the Gysin.
Let and be the line bundle in the proof of Lemma 2.11. Similarly, let and the corresponding line bundle. Note that, in the case of , this is simply the tautological line bundle (i.e. the bundle given by the locally free sheaf on ). Since is simply the restriction of to , it follows that is the line bundle associated to the locally free sheaf . We can now apply Lemma 2.13 to both and to get a commutative diagram of long exact sequences:
[TABLE]
Here we have identified with (since this is a line bundle over ), and similarly for and . This diagram is the same as diagram 2.14, and one can proceed now as in the previous lemma. ∎
In the following, we shall make repeated use of the Künneth formula for cohomology with coefficients in a principal ideal domain. We recall it here for the convenience of the reader. In particular, given schemes and over (separably closed) one has the following Künneth short exact sequence for etale cohomology with -coefficients ([Sta20, Tag 0F1P]): 555Note that in loc. cit. it is shown that . This gives rise to the standard spectral sequence. If , then all ’s vanish for , and the spectral sequence gives the Kunneth short exact sequence.
[TABLE]
If , then the term vanishes and one has the following simplified formula (see for example [Mil80, page 267]):
[TABLE]
Proof of Lemma 2.12.
We shall prove this by induction on . In the following, we denote by the cone point.
- Step 1.
Suppose . In this case, we are reduced to showing that is connected. This is follows from Grothendieck’s proof of Zariski’s main theorem (or by hand). In fact, this is true more generally for . 2. Step 2.
Suppose . In this case, we are reduced to showing that . Let and . Then is an open cover of and the intersection The Mayer-Vietoris sequence (and Step 1) gives an exact sequence:
[TABLE]
Note that the left most arrow is an injection, since the previous arrow in the Mayer-Vietoris sequence must be a surjection by Step 1. By 2.15 and 2.11, . Note that the cohomology of the point is zero except in degree [math], where it is simply the coefficient ring ; in particular, the -terms in the Künneth exact sequence vanish. Similarly, . Another application of the Künneth exact sequence shows that the third arrow in the above sequence is an injection. It follows that . 3. Step 3.
Suppose the Proposition is known for all . We need show that for all . Let and . Note that is an open cover of and . By an application of the Künneth exact sequence:
- (a)
for all , 2. (b)
for all , 3. (c)
for all .
Therefore, an application of Mayer-Vietoris shows that for all . Moreover, in degree one has an exact sequence:
[TABLE]
An argument via Künneth, as in Step 2, shows that the third arrow is injective and the result follows.
∎
Remark 2.16*.*
The result only uses formal properties of a cohomology theory (Künneth, Mayer-Vietoris, Leray/Gysin) and contractibility of the cone.
Note that the proof of Theorem 2.9 holds verbatim in the multi-join setting of the following theorem.
Theorem 2.17**.**
Let for , be closed subschemes. Then (with ) is cohomologically -connected.
We shall now extend the connectivity result above to the relative setting. Suppose now that is a scheme of finite type over a field and is a vector bundle on . Let be a closed subscheme of . Then, as before, we have a natural embedding . Recall, we have a commutative diagram
[TABLE]
where is canonically isomorphic to with .
We have the following relative version of Theorem 2.9. We state the proposition for etale cohomology with (or or ) coefficients with not equal to the characteristic of . However, as will be clear from the proof, the same result holds in any good cohomology theory. The proof only uses the proper base change theorem and existence of a Leray spectral sequence.
Theorem 2.19**.**
With notation as above, the natural map
[TABLE]
is an isomorphism for , and an injection for .
Proof.
The commutative diagram (2.18) gives rise to a morphism of sheaves
[TABLE]
Note that this map is an isomorphism on stalks for all . To see this, we use the proper base change theorem to compute the stalks. In that case, one has isomorphisms:
[TABLE]
The first is a consequence of proper base change, and the second follows from the base change property for joins. Similarly, we have isomorphisms:
[TABLE]
where is the rank of . An application of Theorem 2.9 now shows that the above higher direct images are isomorphisms for . A Leray spectral sequence argument now gives the desired result. ∎
Example 2.20**.**
Suppose and consider the trivial bundle of rank over . Then . In that case, for , the above result gives an isomorphism
[TABLE]
Here .
We conclude this section by noting that the proof of Theorem 2.19 also works in the relative multi-join setting. Let () be vector bundles of rank on . For each , let be a closed subscheme of . Then, as before, we have a natural embedding (recall that we denote by the multiple join ) and a commutative diagram
[TABLE]
where is canonically isomorphic to with .
Theorem 2.22**.**
With notation as above, the natural map
[TABLE]
is an isomorphism for , and an injection for .
Proof.
We can argue as in the proof of the previous result, given Theorem 2.17.
∎
2.3.2. A generalization of the cohomological connectivity result
In this section, we prove analogs of the results of the previous setting where a ‘higher’ cohomological connectivity of the is assumed. We fix a separably closed base field as before. Moreover, we only consider etale cohomology with -coefficients.
In this setting, we have the following analog of the Theorem 2.9.
Theorem 2.23**.**
Let be a cohomologically -connected closed subscheme. Then is cohomologically -connected. In particular, the restriction homomorphism
[TABLE]
is an isomorphism for , and an injection for .
Proof.
One can use the Gysin sequence, as in the second proof of Theorem 2.9, given Lemma 2.25 below.
∎
Remark 2.24*.*
- (1)
The weak Lefschetz theorem states that any smooth complete intersection in is cohomologically -connected. 2. (2)
The Barth-Larsen theorem [BL72] (and its generalization due to Ogus [Ogu75], Hartshorne-Speiser [HS77]) states that any local complete intersection projective variety of dimension is -cohomologically connected. 3. (3)
We note that, even if is smooth, the iterated join will generally be not smooth. In particular, neither the weak Lefschetz nor the Barth-Larsen theorem apply in order to obtain cohomological connectivity results for the join. 4. (4)
On the other hand, we obtain many examples of satisfying the hypothesis of Theorem 2.23 by applying the previous remark in either the weak Lefschetz or Barth-Larsen settings.
Lemma 2.25**.**
Let be a cohomologically -connected closed subscheme. Then one has the following vanishing for the punctured cone:
[TABLE]
If , then .
Proof.
For simplicity, we drop the coefficients from the notation. One can argue as in the proof of Lemma 2.12. We will show the main case of , which follows from Lemma 2.26 below. The rest of the proof then proceeds exactly in the proof of Lemma 2.12. So we suppose that .
As before, we are interested in . Let and . Note that , and . By the Künneth exact sequence, and for all . In particular, both groups vanish for , and are given by the coefficients in degree [math]. The Künneth formula applied to gives and isomorphism:
[TABLE]
If , then by the previous remarks, the left term is equal to . In particular, an application of Mayer-Vietoris proves the desired result for . In degree , one obtains a short exact sequence:
[TABLE]
The right arrow is injective by the previous remarks. This completes the proof in the case .
We briefly discuss the case of .
Suppose the result is known for all . We need show that for all . Let and . Note that is an open cover of and . By an application of the Künneth formula:
- (a)
for all , 2. (b)
for all , 3. (c)
for all .
Moreover, by Lemma 2.26, for all . As before, using these facts and Mayer-Vietoris gives the desired vanishing. ∎
Lemma 2.26**.**
Let be a cohomologically -connected closed subscheme. Then one has the following vanishing for the punctured cone:
[TABLE]
In degree [math], (where is the ring of coefficients).
Proof.
Let be the line bundle as in the proof of Lemma 2.11. We can now apply Lemma 2.13, and argue as in the ‘alternate’ proof to Theorem 2.9 to get a commutative diagram of long exact sequences:
[TABLE]
The result now follows by induction and the five lemma. ∎
We note that the previous result can also be adapted to the setting of multi-joins and also the relative setting. Here we only state the result in the multi-join setting, and leave the proof to the reader.
Theorem 2.27**.**
Let for , be closed cohomologically -connected subschemes. Then is cohomologically -connected, where and .
2.4. Cohomological connectivity over non-algebraically closed fields
We discuss the case where is possibly a non-algebraically closed field. Let denote a fixed separable closure of , and denote the corresponding Galois group. For , we denote by its base change to . We fix a prime , and let denote the etale cohomology with -coefficients. Note that there is a natural continuous action of on .
The results of the previous sections give the following natural connectivity of the join with Galois action.
Corollary 2.28**.**
Let () be closed cohomologically -connected subschemes. Then is cohomologically -connected, where and . In particular,
[TABLE]
is an isomorphism of Galois modules for , and injective for .
Proof.
This is a direct consequence of the functoriality of the restriction map, and the fact that the join construction is compatible with base extension. More precisely, . ∎
In this setting, one has the usual Hochschild-Serre spectral sequence:
[TABLE]
where is the Galois cohomology of with coefficients in the Galois module .
Corollary 2.30**.**
With notation and assumptions as in the previous corollary, the subscheme is cohomologically -connected.
Proof.
One has a commutative diagram of spectral sequences:
[TABLE]
By the previous corollary, the -terms are isomorphic for , and therefore also on the corresponding terms. ∎
2.5. Cohomological connectivity and Poincaré polynomials
We now prove a key inequality relating the Poincaré polynomial of a closed subscheme , with that of where is the projection morphism.
Definition 2.31** (Poincaré Polynomial).**
For any scheme of finite type over a field , we will denote
[TABLE]
where , and is a prime not equal to the characteristic of the field .
We have the following direct consequence of Theorem 2.19.
Theorem 2.32**.**
With notation as in Theorem 2.19, let , , and the projection morphism. Then,
[TABLE]
Proof.
Direct consequence of Theorem 2.19. ∎
3. Quantifier elimination, cohomology and joins
In this section, we state and prove our result on cohomological quantifier elimination. Let be a fixed algebraically closed field. We consider etale cohomology with coefficients in with .
Notation 3.1**.**
For any finite tuple , we denote:
- (1)
; 2. (2)
.
In the following we will denote by bold letters tuples of variables and we will denote by the lengths of the corresponding tuples.
Definition 3.2** (Proper formulas).**
Let (with each denoting a tuple of variables ) be a quantifier-free first order formula in the language of fields with parameters in . We say that is a quantifier-free proper formula (with homogeneous blocks) if its atoms are of the form , where is a multi-homogeneous polynomial, and does not contain any negations.
We say that a first order formula in the language of fields with parameters in (possibly with quantifiers)
[TABLE]
is a proper formula (with homogeneous blocks), if is a quantifier-free proper formula.
A proper formula
[TABLE]
defines an algebraic subset of , where whose -points are described by
[TABLE]
We denote this algebraic set by (the realization of ).
Notation 3.3**.**
Given , we write
[TABLE]
where
[TABLE]
and
[TABLE]
Following [Bas12], we introduce for any subscheme , a polynomial, , which we call the pseudo-Poincaré polynomial of defined as follows.
[TABLE]
In other words,
[TABLE]
For any proper formula , we will denote:
[TABLE]
Note that for each ,
[TABLE]
We introduce below notation for several operators on polynomials that we will use later.
Notation 3.7** (Operators on polynomials).**
- (1)
For any finite tuple of natural numbers, we denote by , the map defined by
[TABLE] 2. (2)
For , we denote by and , we denote the map defined by: for ,
[TABLE]
Now let be a quantifier-free proper formula with homogeneous blocks. For , let , and , let , and define by the formulas:
[TABLE]
and for ,
[TABLE]
Notation 3.8**.**
We will denote by the quantifier-free proper formula (with homogeneous blocks) defined by
[TABLE]
where for each tuple , , and the tuples represent homogeneous coordinates in . If , then we will denote by .
Remark 3.10*.*
Notice that the realization, , is an algebraic subset of
[TABLE]
Also notice that for each , and we will index the factors of the product by tuples .
For each , let
[TABLE]
For , we denote
[TABLE]
and for ,
[TABLE]
We denote:
[TABLE]
With the above notation we have the following theorem which relates the pseudo-Poincaré polynomial of a quantified proper formula, , with that of the quantifier-free proper formula .
Theorem 3.12**.**
For each ,
[TABLE]
(Notice that in the statement of Theorem 3.12 the quantifier-free formula does not depend on the sequence of quantifiers , and only the operator depends on .)
The following special case of Theorem 3.12 will be important in the application of Theorem 3.12 in the proof of an algebraic version of Toda’s theorem. With the same notation as in Theorem 3.12, suppose additionally that . In this case, the formula has no free variables and is a sentence, and we have:
Corollary 3.13**.**
[TABLE]
Proof.
Follows immediately from Theorem 3.12. ∎
3.1. An example
Before we prove Theorem 3.12 it is instructive to consider an example.
Example 3.14**.**
Let , , and consider the quantifier-free proper formula:
[TABLE]
The values of the various are displayed in the following table.
It is easy to check that is an algebraic subset of , and
[TABLE]
Let be defined by
[TABLE]
It is easy to check that
[TABLE]
Moreover, using Eqn. (3.11) we have that:
[TABLE]
A calculation using the package Maple now yields:
[TABLE]
3.2. Proof of
the cohomological quantifier elimination theorem
Before we prove Theorem 3.12 we need a few preliminary facts.
Theorem 3.16** (Alexander duality).**
Let be a closed subscheme. Then for each odd , :
[TABLE]
Proof.
Let and . Then, there is a long exact sequence
[TABLE]
and Alexander duality gives,
[TABLE]
Eqn. (3.17) now follows f that for all odd . ∎
Corollary 3.18**.**
Let be a closed subscheme.
Then,
[TABLE]
Theorem 3.19**.**
Let , a closed subscheme. Let . For each , and , we have that
[TABLE]
and 2. 2.
[TABLE]
are isomorphisms.
Proof.
The proof of Part (1) follows from the argument in Example 2.20 with replaced by , and omitted. We now prove Part (2). Let and let
[TABLE]
There is a long exact sequence
[TABLE]
Using Alexander duality one has
[TABLE]
Moreover,
[TABLE]
which implies that
[TABLE]
whenever
[TABLE]
and in this case
[TABLE]
as well. ∎
With the same notation as in Theorem 3.19:
Corollary 3.20**.**
Let with . Then
[TABLE]
We will also need the following lemma.
Lemma 3.23**.**
Let , and for each , let be a closed subscheme, and . For , let denote the canonical surjection to the -th factor.
Suppose that the restriction homomorphism is an isomorphism for . Then, the restriction homomorphism
[TABLE]
is an isomorphism for . 2. 2.
Suppose that the restriction homomorphism is an isomorphism for . Then, the restriction homomorphism
[TABLE]
is an isomorphism for .
Proof.
Easy. ∎
Proof of Theorem 3.12.
For , let denote the formula
[TABLE]
and let denote the formula
[TABLE]
Notice that
[TABLE]
We prove by induction on that
[TABLE]
Notice that (3.26) is true for using (3.24), and implies the theorem in the case using (3.25).
Now assume that (3.26) holds for and we prove it for , thus completing the inductive step.
There are two cases to consider.
- Case 1.
. For each (where , , and for , ), and each tuple , let denote the algebraic set
[TABLE]
Notice that, for , the restriction homomorphism
[TABLE]
is an isomorphism using Part (1) of Theorem 3.19.
Also, observe that denoting by
[TABLE]
the projection on the -th factor,
[TABLE]
Now using Part (1) of Lemma 3.23 we get that for each point , and for the restriction homomorphisms
[TABLE]
are isomorphisms.
Finally using proper base change, and the fact that if and only if , we get that the restriction homomorphisms
[TABLE]
are isomorphisms for , from which it follows using (3.21) that
[TABLE]
which completes the inductive step in this case. 2. Case 2.
. For each (where , , and for , ), and each tuple , let .
Notice that, for , the restriction homomorphism
[TABLE]
is an isomorphism using Part (2) of Theorem 3.19.
Also, observe that denoting by
[TABLE]
the projection on the -th factor,
[TABLE]
Now using Part (2) of Lemma 3.23 we get that for each point , and for the restriction homomorphisms
[TABLE]
are isomorphisms.
Finally using proper base change, and the fact that
[TABLE]
if and only if , we get that the restriction homomorphisms
[TABLE]
are isomorphisms for . From this it follows using Theorem 3.16 twice, and (3.22), that
[TABLE]
which completes the inductive step in this case.
∎
4. An algebraic version of Toda’s theorem over algebraically closed fields
As mentioned previously, an important feature of Theorem 3.12 (and Corollary 3.13) is that the quantifier-free formula obtained from the quantified formula has an easy description in terms of (in contrast to what happens in classical quantifier elimination). Making this statement quantitative leads to a result which is formally analogous to a classical result in discrete complexity theory – namely, Toda’s theorem.
4.1. The classes , ,
We fix an algebraically closed field for the rest of this section. In order to prove our algebraic analog of Toda’s theorem we first need algebraic analogs of the complexity classes appearing in Toda’s theorem. In order to motivate the definition of the polynomial hierarchy it is instructive to first consider the following set-theoretic definitions.
Recall that any map between sets and induces three functors
[TABLE]
in the poset categories of their respective power sets . The functors are defined as follows. For all and ,
[TABLE]
Now, suppose that , and . Let be an algebraic subset of . Then, are both algebraic subsets of .
However, as is well known from computational algebraic geometry, elimination is a costly procedure, and as a result the ‘complexity’ of and could increase dramatically compared to that of . Here, by complexity one can take for instance the number and degrees of the polynomials appearing in the descriptions of these sets. A more precise definition of complexity and formalization in terms of sequences of algebraic sets rather than just one, leads to variants of the famous vs (respectively, vs co-) question albeit over the field [BCSS98]. Alternating the functors a fixed number of times leads to the so called polynomial hierarchy of complexity classes whose lowest level consists of the class of sequences of objects with polynomially bounded growth in complexity. We now make more precise the notion of ‘complexity’ that we are going to use. We begin with some notation.
Notation 4.1**.**
For any finite tuple , we denote:
- (1)
for (we will denote for convenience); 2. (2)
, the projection map.
Definition 4.2** (Complexity of algebraic sets and polynomial maps).**
Following [UI18], we define the complexity, , of an algebraic subset , to be the size of the smallest arithmetic circuit [B0̈0] computing a tuple of multi-homogeneous polynomials such that . The complexity of a polynomial map is the size of the smallest arithmetic circuit computing .
Remark 4.3*.*
We will often identify for convenience with the -module, , of polynomials of degree at most .
Notation 4.4** (Characteristic function).**
Let be a tuple indexed by , where each is an algebraic subset of .
We will denote by the tuple of constructible functions
[TABLE]
where denotes the characteristic function of .
Definition 4.5** (The class and ).**
Following [UI18], we will say that
[TABLE]
if are polynomially bounded functions of . Similarly, we will say that a sequence if are all polynomially bounded functions of .
Example 4.6**.**
For each fixed , consider the sequence
[TABLE]
where
[TABLE]
and
[TABLE]
where we identify with the projectivization of the space of non-zero homogeneous polynomials of degree in variables. It is an easy exercise to check that for each .
We now define the algebraic analog of the discrete complexity class . Note that in the classical theory the class consists of ‘counting functions’ counting the number of solutions of the ‘fibers’ of some Boolean satisfiability problem belonging to . As remarked before, a natural analog of counting in the algebraic context is computing the Poincaré polynomial of algebraic sets (or some easily computable polynomial function of the Poincaré polynomial). Thus, it is natural to define the algebraic analog of as sequences of constructible functions whose values are the Poincaré polynomials (with respect to etale cohomology) of the fibers of sequences of proper morphisms. The sequence of codomains of the morphisms defining an element of the class should itself belong to .
More formally, we define:
Definition 4.7** (The class ).**
A sequence , where each is a constructible function, is in the class , if and only if there exists
[TABLE]
[TABLE]
and
[TABLE]
such that for all ,
[TABLE]
Notation 4.8** ( and ).**
For a tuple of algebraic subsets of , we denote by
[TABLE]
and
[TABLE]
Definition 4.9** (Polynomial hierarchy).**
For , we define as follows.
- (1)
; 2. (2)
For , we define as the smallest class of sequences satisfying:
- (a)
, and 2. (b)
. 3. (3)
Similarly, we define as the smallest class of sequences satisfying:
- (a)
, and 2. (b)
. 4. (4)
Finally, we define
[TABLE]
and
[TABLE]
Remark 4.10*.*
Notice that it follows from Definition 4.9 that if and only if there exists , , and , such that
[TABLE]
With the algebraic analogs of the classes , and in place (cf. Definitions 4.7 and 4.9 respectively), we are now in a position to state an algebraic analog of Toda’s theorem.
Theorem 4.11** (Algebraic analog of Toda’s theorem).**
[TABLE]
4.2. Proof of
algebraic version of Toda’s theorem
Lemma 4.12**.**
Let , with . Then,
[TABLE]
Proof.
First observe that it follows from Definitions 4.5 and 4.2 that for each there exists a tuple of multi-homogeneous polynomials such that there exists an arithmetic circuit computing of size which is polynomially bounded in , and such that is defined by the proper quantifier-free formula
[TABLE]
It now follows from Notation 3.8 that
- (1)
where 2. (2)
, and are defined as in Notation 3.8; 3. (3)
for each , the sequence is polynomially bounded in ; 4. (4)
for each , for some multi-homogeneous polynomials , and 5. (5)
there exists an arithmetic circuit of size computing the tuple
[TABLE]
and for each , the sequence is polynomially bounded in .
This shows that
[TABLE]
and hence the sequence is polynomially bounded in , since is a constant, and the sequences and are bounded polynomially in , as observed previously. This proves the lemma. ∎
Lemma 4.13**.**
The following sequences belong to .
- (1)
, for any sequence such that the sequence is polynomially bounded. 2. (2)
, for any pair of polynomially bounded sequences ; 3. (3)
, where are two polynomially bounded sequences, for , ; 4. (4)
, for any polynomially bounded sequence , where maps a polynomial to .
Proof.
Obvious. ∎
Proof of Theorem 4.11.
Suppose that . It follows from Remark 4.10 that there exists , with for some fixed , and , such that
[TABLE]
This implies that for each , , where , is defined by . Lemma 4.12 now implies that .
Let (respectively, ) denote the restriction of the projection morphism to (respectively, ).
Let (respectively, ) denote the pull-back of (respectively, ) under the inclusion .
Observe that,
[TABLE]
Theorem 3.12 now implies that
[TABLE]
where is the operator appearing in Theorem 3.12.
It follows also from the definition of the operator (as in Theorem 3.12) and Lemma 4.13, that the two sequences of operators , are in , and so is the sequence of their compositions. It now follows from Definition 4.7 that the sequence . ∎
5. Bounds on Betti numbers
As before, we work over an algebraically closed field . We fix a prime number , and work with etale cohomology with -coefficients. Let be an algebraic subset. In this section, we will apply the results of the previous section to obtain bounds on sums of the Betti numbers of the image under the projection to in terms of those of the relative join. Finally, we compare this bound with those achieved through an application of classical elimination theory.
5.1. Classical results on bounds for sums of Betti numbers of algebraic sets
In this subsection, we recall some classical results on bounds of (sums of) Betti numbers for algebraic subsets of and . The results here are due to Oleĭnik and Petrovskiĭ, Thom, Milnor, Bombieri, Adolphson-Sperber, and Katz. We follow closely the paper of Katz ([Kat01]).
Given an algebraic set , let
[TABLE]
(resp. )). Let and . Finally, we denote by and the Euler characteristic (resp. compactly supported Euler characteristic) of . With this notation, one has the following classical bounds on sums of Betti numbers and Euler characteristics.
- (1)
Suppose . If () defined by equations with , then Oleĭnik and Petrovskiĭ [PO49], Thom [Tho65] and Milnor [Mil64] showed that
[TABLE]
While the result in loc. cit. is stated for singular cohomology with coefficients in , standard arguments give the same result for -adic cohomology over any algebraically closed field of characteristic zero. Standard arguments ([Kat01]) now show that
[TABLE] 2. (2)
In general, Bombieri [Bom78b] gave the explicit upper bound
[TABLE] 3. (3)
Bombieri’s bounds were improved upon by Adolphson and Sperber ([AS88b]). They considered the homogeneous polynomial
[TABLE]
and showed that
[TABLE] 4. (4)
In [Kat01], Katz derived bounds on sums of Betti numbers given any universal bound
[TABLE]
More precisely, let
[TABLE]
and
[TABLE]
Then for as before, Katz showed [Kat01, Theorem 1] that
[TABLE] 5. (5)
Suppose now that is defined by the vanishing of homogeneous polynomials of degree at most . Then [Kat01, Theorem 3] gives:
[TABLE]
Here are some explicit versions of this bound.
- (1)
Bombieri’s bound, gives
[TABLE] 2. (2)
The Adolphson-Sperber bound gives
[TABLE]
In particular, one has the following bounds due to Katz:
- (1)
For defined by polynomials of degree , the Adolphson-Sperber bound gives:
[TABLE] 2. (2)
For defined by homogeneous polynomials of degree , the Adolphson-Sperber bound gives:
[TABLE]
We can apply these results to obtain bounds on sums of the Betti numbers for defined by a bi-homogeneous system with bi-homogeneous degree bounded by . The above bounds then give the following:
Proposition 5.1**.**
Let be an algebraic set defined by bi-homogeneous polynomials of bi-degree . Then one has:
[TABLE]
Here, for , we set .
Proof.
We may decompose . This gives a decomposition . One now argues recursively. ∎
5.2. Bounds on the Betti numbers of images via relative joins
As a direct consequence of Proposition 5.1 and Theorem 2.32 we obtain:
Theorem 5.2**.**
Let be an algebraic subset defined by bi-homogeneous polynomials of bi-degree , and the projection morphism. Then, for all ,
[TABLE]
Proof.
The first inequality follows from Theorem 2.32, and the second from Proposition 5.1. ∎
6. Relative joins versus products
In Section 5, upper bounds on the Betti numbers of , where is an algebraic subset and were derived in terms of the join . There is another more direct way to obtain an upper bound on : namely from the spectral sequence associated to the hypercover
[TABLE]
one obtains the inequality for each
[TABLE]
In this section we compare the upper bounds on Betti numbers coming from considering the relative join with that coming from inequality (6.1).
6.1. Exponentially large error for the hypercovering inequality
Let and the projection. Then, for each , it follows from Theorem 2.32 that
[TABLE]
from which it follows that
[TABLE]
Telescoping Eqn. (6.2) we obtain for all odd ,
[TABLE]
Inequalities (6.3) and (6.4) sometime give more information on the Betti numbers of than what can be inferred from inequality (6.1).
For instance, consider the projection map , and . Applying inequality (6.1) one gets
[TABLE]
This example shows that the difference between the two sides of the inequality (6.1) can be exponentially large in .
On other hand, it follows from the fact that , and Eqn. (6.3), that with
[TABLE]
6.2. Joins and defects
We discuss another way in which the relative join gives better information on the Betti numbers of the image under projection of an algebraic set than what can be gleaned from inequality (6.1). We prove the following theorem.
Theorem 6.5**.**
Let be a subvariety defined by bi-homogeneous forms. Let be the projection morphism. Then, for all ,
[TABLE]
We first need a preliminary result.
Lemma 6.6**.**
Let and be a closed subvariety defined by -bi-homogeneous forms. Then the natural restriction restriction map on cohomology
[TABLE]
is an isomorphism for all .
Proof.
Suppose . Then, since the complement of the zeros of a bi-homogeneous form in is an affine variety, the result follows from usual Artin vanishing for affine schemes. In general, the complement of is covered by a union of affine open sets. One can now argue as in ([GL09, 3.2]). ∎
Proof of Theorem 6.5.
For any , is an algebraic subset of . Thus the ambient dimension, , of equals . Since is defined by equations, it follows that the number of equations needed to define is .
Using Lemma 6.6, we deduce that for
[TABLE]
we have
[TABLE]
On other hand
[TABLE]
for . It follows that for ,
[TABLE]
The integral value of that maximizes the function equals from which we deduce that for ,
[TABLE]
The theorem follows from (6.7). ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[AK 75] Allen B. Altman and Steven L. Kleiman, Joins of schemes, linear projections , Compositio Math. 31 (1975), no. 3, 309–343. MR 0396560
- 2[AS 88a] Alan Adolphson and Steven Sperber, On the degree of the L 𝐿 L -function associated with an exponential sum , Compositio Math. 68 (1988), no. 2, 125–159. MR 966577 (90b:11134)
- 3[AS 88b] by same author, On the degree of the L 𝐿 L -function associated with an exponential sum , Compositio Math. 68 (1988), no. 2, 125–159. MR 966577
- 4[B 0̈0] Peter Bürgisser, Completeness and reduction in algebraic complexity theory , Algorithms and Computation in Mathematics, vol. 7, Springer-Verlag, Berlin, 2000. MR 1771845
- 5[Bas 12] Saugata Basu, A complex analogue of Toda’s theorem , Found. Comput. Math. 12 (2012), no. 3, 327–362. MR 2915565
- 6[BCSS 98] L. Blum, F. Cucker, M. Shub, and S. Smale, Complexity and real computation , Springer-Verlag, New York, 1998, With a foreword by Richard M. Karp. MR 1479636 (99a:68070)
- 7[BL 72] W. Barth and M. E. Larsen, On the homotopy groups of complex projective algebraic manifolds , Math. Scand. 30 (1972), 88–94. MR 0340643
- 8[Bom 78a] E. Bombieri, On exponential sums in finite fields. II , Invent. Math. 47 (1978), no. 1, 29–39. MR 0506272 (58 #22072)
