1 Introduction
In [
27], Macaulay introduced the notion of homogeneous resultant, extending the Sylvester resultant to systems of homogeneous polynomials in several variables with given degrees. In the same paper, he also presented an intriguing family of formulae, each of them allowing to compute it as the quotient of the determinant of a Sylvester-type square matrix by one of its principal minors.
The sparse resultant is a generalization of the homogeneous resultant to systems of multivariate Laurent polynomials with prefixed monomials. It is a basic tool of elimination theory and polynomial equation solving, and it is also connected to combinatorics, toric geometry, and hypergeometric functions, see for instance [
8,
16,
18,
33]. As a consequence, there has been a lot of interest in efficient methods for computing it, see also [
5‐
7,
10,
13,
22] and the references therein.
In [
4,
5], Canny and Emiris introduced a family of Sylvester-type square matrices whose determinants are nonzero multiples of the sparse resultant, and showed that the sparse resultant can be expressed as the gcd of several of these determinants. Besides, for each of these matrices they identified a certain principal submatrix and, following Macaulay, conjectured that the quotient of their determinants coincides with the sparse resultant, at least in some cases. Their construction relies heavily on the combinatorics of the polytopes defined as the convex hull of the exponents of the given monomials, and of a chosen family of affine functions on them. Shortly afterward, Sturmfels extended the method by allowing the use of convex piecewise affine functions on these polytopes [
33].
Using this circle of ideas, the first author found a recursive procedure to build Sylvester-type square matrices with a distinguished principal submatrix, and obtained another family of formulae for the sparse resultant extending those of Macaulay for the homogeneous resultant [
7]. Some connections between the D’Andrea construction and that of Canny and Emiris were explored by Emiris and Konaxis for families of monomials whose associated polytopes are scaled copies of a fixed one [
11]. There are also some determinantal formulae for sparse resultants, but their applicability is limited to a short list of special cases [
1,
3,
9,
12,
19,
25,
26,
34,
35].
The main result of this paper is a proof of a generalized version of the Canny–Emiris conjecture, with precise conditions for its validity. Our approach is based on a systematic study of the Canny–Emiris matrices and their interplay with mixed subdivisions of polytopes. In particular, we compute the orders and initial parts of its principal minors and establish the compatibility of this construction with the restriction of the defining data. We also prove a product formula for the initial parts of the sparse resultant, generalizing a previous one by Sturmfels [
33].
Classically, sparse resultants and Canny–Emiris matrices were studied in the situation where the family of exponents of the given monomials is essential in the sense of Sturmfels, that is, when the sparse resultant does depend on all the sets of variables and, in addition, the affine span of these exponents coincides with the ambient lattice, see [
33, §1] or Remark
3.5 for details. Whereas this is, without any doubt, the main case of interest, a crucial part of our analysis consists in extending and studying these notions in full generality. Having constructions and properties that behave uniformly allows us to descend to the simple cases where the result can be proved directly.
We also show that the Macaulay formula for the homogeneous resultant corresponding to the critical degree appears as a particular case of our result, thus obtaining an independent proof for it.
We next explain these results with more detail. Let
\(M\simeq {\mathbb {Z}}^{n}\) be a lattice of rank
n. Set
\({\mathbb {T}}_{M}= {\text {Hom}}(M,{\mathbb {C}}^{\times }) \simeq ({\mathbb {C}}^{\times })^{n} \) for the associated torus and, for
\(a\in M\), denote by
\( \chi ^{a} :{\mathbb {T}}_{M}\rightarrow {\mathbb {C}}^{\times }\) the corresponding character. For
\(i=0,\dots , n\) let
\({{\mathcal {A}}}_{i} \subset M\) be a nonempty finite subset,
\({\varvec{u}}_{i}=\{u_{i,a}\}_{a\in {{\mathcal {A}}}_{i}}\) a set of
\(\#{{\mathcal {A}}}_{i}\) variables and
$$\begin{aligned} F_{i}=\sum _{a\in {{\mathcal {A}}}_{i}}u_{i,a} \, \chi ^{a}\in {\mathbb {Z}}[{\varvec{u}}_{i}][M] \end{aligned}$$
the general Laurent polynomial with support equal to the subset
\(\mathcal {A}_i\), where
\({\mathbb {Z}}[{\varvec{u}}_{i}][M] \simeq {\mathbb {Z}}[{\varvec{u}}_{i}][x_1^{{\pm } 1},\dots , x_n^{{\pm } 1}]\) denotes the group
\({\mathbb {Z}}[{\varvec{u}}_{i}]\)-algebra of
M.
Let
\({\text {Res}}_{{\varvec{{{\mathcal {A}}}}}}, {\text {Elim}}_{{\varvec{{{\mathcal {A}}}}}} \in {\mathbb {Z}}[{\varvec{u}}] = {\mathbb {Z}}[{\varvec{u}}_{0},\dots , {\varvec{u}}_{n}] \) be the sparse resultant and the sparse eliminant associated with the family of supports
\({\varvec{{{\mathcal {A}}}}}=({{\mathcal {A}}}_{0},\dots , {{\mathcal {A}}}_{n})\) in the sense of [
8,
16]. The sparse resultant is the resultant of the multiprojective toric variety with torus
\({\mathbb {T}}_{M}\) associated with
\({\varvec{{{\mathcal {A}}}}}\) in the sense of Rémond’s multiprojective elimination theory, whereas the sparse eliminant corresponds to what is classically referred to as the sparse resultant, as is done in [
6,
18,
33] for instance. Both are well defined up to the sign, the sparse resultant is a power of the sparse eliminant, and they coincide when the family of supports
\({\varvec{{{\mathcal {A}}}}}\) is essential and its affine span coincides with
M, see [
8] or Sect.
3 for precisions.
For each
i denote by
\(\Delta _{i} \) the convex hull of
\({{\mathcal {A}}}_{i}\) in the vector space
\(M_{{\mathbb {R}}}=M\otimes {\mathbb {R}}\) and set
\(\Delta =\sum _{i=0}^{n}\Delta _{i}\) for the Minkowski sum of these lattice polytopes. For a vector
\({\varvec{\omega }}=({\varvec{\omega }}_{0},\dots , {\varvec{\omega }}_{n})\in {\mathbb {R}}^{{\varvec{{{\mathcal {A}}}}}} =\prod _{i=0}^{n}{\mathbb {R}}^{{{\mathcal {A}}}_{i}}\) set
$$\begin{aligned} \vartheta _{{\varvec{\omega }}_{i}}:\Delta _{i}\longrightarrow {\mathbb {R}}, \ i=0,\dots , n, \quad \mathrm{and}\quad \Theta _{{\varvec{\omega }}} :\Delta \longrightarrow {\mathbb {R}}\end{aligned}$$
(1.1)
for the convex piecewise affine functions parametrizing the lower envelope of the convex hull of the lifted supports
\( {\widehat{{{\mathcal {A}}}}}_{i}=\{(a,\omega _{i,a})\}_{a\in {{\mathcal {A}}}_{i}} \subset M \times {\mathbb {R}}\),
\(i=0,\dots , n\), and of their sum
\(\sum _{i=0}^{n}{\widehat{{{\mathcal {A}}}}}_{i} \subset M \times {\mathbb {R}}\), respectively. These functions define a mixed subdivision
\(S(\Theta _{{\varvec{\omega }}})\) of
\(\Delta \), and for each
n-cell
D of
\(S(\Theta _{{\varvec{\omega }}})\) they also determine a decomposition
$$\begin{aligned} D=\sum _{i=0}^{n} D_{i} \end{aligned}$$
where each
\(D_{i}\) is a cell of the subdivision
\(S(\vartheta _{{\varvec{\omega }}_{i}})\) of
\(\Delta _{i}\), called the
i-th component of
D. We can then consider the restriction
$$\begin{aligned} {\varvec{{{\mathcal {A}}}}}_{D}=( {{\mathcal {A}}}_{0}\cap D_{0},\dots , {{\mathcal {A}}}_{n}\cap D_{n}) \end{aligned}$$
of the given family of supports to these components.
Our first main result, contained in Theorem
3.12, is the following factorization for the initial part of the sparse resultant with respect to
\({\varvec{\omega }}\), defined as the sum of the monomial terms whose exponents have minimal weight with respect to this vector. It generalizes a previous one by Sturmfels for the case when
\({\varvec{{{\mathcal {A}}}}}\) is essential [
33, Theorem 4.1].
A result by Philippon and the third author for the Chow weights of a multiprojective toric variety [
31, Proposition 4.6] implies that the order of the sparse resultant with respect to
\({\varvec{\omega }}\) can be expressed as the mixed integral of the
\(\vartheta _{{\varvec{\omega }}_{i}}\)’s (Theorem
3.12). Applying this together with Theorem
1.1, we derive product formulae for the evaluation of
\({\text {Res}}_{{\varvec{{{\mathcal {A}}}}}}\) by setting some of the coefficients of the input Laurent polynomials to zero (Theorem
3.19 and Proposition
3.22), correcting and generalizing a previous one by Minimair [
29], see Remark
3.23. These factorizations might be interesting from the computational point of view, since they allow to extract the sparse resultant associated with a family of supports contained in those of
\({\varvec{{{\mathcal {A}}}}}\) as a factor of such an evaluation (Remark
3.21).
Apart from being homogeneous with respect to the sets of variables
\({\varvec{u}}_{i}\), the sparse resultant is also homogeneous with respect to a weighted grading on
\({\mathbb {C}}[{\varvec{u}}]\) associated with the action of
\({\mathbb {T}}_{M}\) by pullbacks on the system of Laurent polynomials
\({\varvec{F}}=(F_{0},\dots , F_{n})\). As another application of the Philippon–Sombra formula, we compute its degree with respect to this grading, extending a result by Gelfand, Kapranov, and Zelevinsky [
18, Chapter 9, Proposition 1.3] and by Sturmfels [
33, §6] (Theorem
3.16).
To state our second main result, let
$$\begin{aligned} \rho _{i}:\Delta _{i}\longrightarrow {\mathbb {R}}, \ i=0,\dots , n, \quad \mathrm{and}\quad \rho :\Delta \longrightarrow {\mathbb {R}}\end{aligned}$$
(1.2)
be the family of convex piecewise affine functions and its inf-convolution defined by a vector of
\({\mathbb {R}}^{{\varvec{{{\mathcal {A}}}}}}\) as in (
1.1). Set
\({\varvec{\rho }}=(\rho _{0},\dots ,\rho _{n})\) and suppose that the mixed subdivision
\(S(\rho )\) is tight (Definition
2.3).
Following Canny and Emiris [
4,
5] and Sturmfels [
33], this data together with a generic translation vector
\(\delta \in M_{{\mathbb {R}}}\) determines linear subspaces of
\( {\mathbb {C}}({\varvec{u}})[M]^{n+1}\) and of
\( {\mathbb {C}}({\varvec{u}})[M] \), both of them generated by monomials indexed by the lattice points in the translated polytope
\(\Delta +\delta \), and such that the expression
$$\begin{aligned} (G_{0},\dots , G_{n}) \longmapsto \sum _{i=0}^{n}G_{i}\, F_{i} \end{aligned}$$
defines a linear map between them, see Sect.
4.1 for details. The matrix of this linear map is denoted by
\({{\mathcal {H}}}_{{\varvec{{{\mathcal {A}}}}},{\varvec{\rho }}}\), and we denote by
\({{\mathcal {E}}}_{{\varvec{{{\mathcal {A}}}}},{\varvec{\rho }}}\) the principal submatrix corresponding to the lattice points in
\(\Delta +\delta \) contained in the translated nonmixed
n-cells of
\(S(\rho )\) (Definition
4.5).
There is a nice interplay between these square matrices and the mixed subdivisions of
\(\Delta \) that are coarser than
\(S(\rho )\). Let
$$\begin{aligned} \phi _{i} :\Delta _{i}\longrightarrow {\mathbb {R}}, \ i =0, \dots , n, \quad \mathrm{and}\quad \phi :\Delta \longrightarrow {\mathbb {R}}\end{aligned}$$
be another family of convex piecewise affine functions and its respective inf-convolution, and suppose that
\(S(\phi )\) is coarser than
\( S( \rho )\), a condition that is denoted by
\(S(\phi ) \preceq S( \rho )\). For an
n-cell
D of
\(S(\phi )\) denote by
\({\varvec{\rho }}_{D}=(\rho _{0}|_{D_{0}}, \dots , \rho _{n}|_{D_{n}})\) the restriction to its components of this family of functions.
More generally, a similar factorization holds for all the principal minors of the Canny–Emiris matrix and in particular, for the determinant of
\({{\mathcal {E}}}_{{\varvec{{{\mathcal {A}}}}},{\varvec{\rho }}}\) (Theorem
4.10). Hence, for the vector defined by the
\(\phi _{i}\)’s, the initial part of each of these minors factorizes in the same way as the corresponding initial part of the sparse resultant. In contrast with the situation for the sparse resultant, we do not know if this factorization holds for every
\({\varvec{\omega }}\in {\mathbb {R}}^{{\varvec{{{\mathcal {A}}}}}}\) and as a matter of fact, it would be most interesting to extend it to a larger class of vectors.
Another important property is that the Canny–Emiris matrices associated with the restricted data
\({\varvec{{{\mathcal {A}}}}}_{D}\) and
\({\varvec{\rho }}_{D}\) can be retrieved as the evaluation of a principal submatrix of
\({{\mathcal {H}}}_{{\varvec{{{\mathcal {A}}}}}, {\varvec{\rho }}}\) by setting some of its coefficients to zero, and that this construction is compatible with refinements of mixed subdivisions (Propositions
4.8 and
4.9). We also determine the homogeneities and degrees of
\(\det ({{\mathcal {H}}}_{{\varvec{{{\mathcal {A}}}}},{\varvec{\rho }}})\) (Proposition
4.6) and show that, under a mild hypothesis, this determinant is a nonzero multiple of the sparse resultant (Proposition
4.16). As a side question, such a hypothesis does not seem necessary, and it would be interesting to get rid of it (Remark
4.20).
The Canny–Emiris conjecture [
5, Conjecture 13.1] states that, if the family of supports
\({\varvec{{{\mathcal {A}}}}}\) is essential and its affine span coincides with
M, then there is a family
\({\varvec{\rho }}\) of affine functions on the
\(\Delta _{i}\)’s and a translation vector
\(\delta \in M_{{\mathbb {R}}}\) such that
$$\begin{aligned} {\text {Elim}}_{{\varvec{{{\mathcal {A}}}}}} ={\pm } \frac{\det ({{\mathcal {H}}}_{{\varvec{{{\mathcal {A}}}}},{\varvec{\rho }}})}{\det ({{\mathcal {E}}}_{{\varvec{{{\mathcal {A}}}}},{\varvec{\rho }}})}. \end{aligned}$$
(1.3)
As noted in [
5, §13], this identity does not hold unconditionally since there are examples of families of convex piecewise affine functions whose associated Canny–Emiris matrix and distinguished principal submatrix do not verify it (Example
5.16).
In [
7], the first author presented a recursive procedure, using several mixed subdivisions on polytopes of every possible dimension up to
n, for constructing a square matrix with a distinguished principal submatrix such that the quotient of the determinants of these matrices coincides with
\({\text {Elim}}_{{\varvec{{{\mathcal {A}}}}}}\). In [
11], Emiris and Konaxis showed that in the generalized unmixed case, the D’Andrea formula can be produced by a single mixed subdivision of
\(\Delta \), at the price of adding many more points to the supports.
Our third main result gives a positive answer to a generalized version of the Canny–Emiris conjecture. To bypass the recursive steps of the previous approaches, we consider chains of mixed subdivisions of
\(\Delta \)$$\begin{aligned} S(\theta _{0})\preceq \dots \preceq S(\theta _{n}) \end{aligned}$$
with
\(S(\theta _{n})\preceq S(\rho )\). The tight mixed subdivision
\(S(\rho )\) is said to be admissible if there is such a chain which is incremental in the sense of Definition
2.4 and satisfies the conditions in Definition
4.22.
Not every tight mixed subdivision of
\(\Delta \) is admissible (Example
5.16). However, for the family of supports
\({\varvec{{{\mathcal {A}}}}}\) one can always find convex piecewise affine functions
\({\varvec{\rho }}=(\rho _{0},\dots ,\rho _{n})\) whose associated mixed subdivision
\(S(\rho )\) is admissible. For instance, this can be realized by considering convex piecewise affine functions as in (
1.1) associated with a generic vector
\({\varvec{\nu }}=({\varvec{\nu }}_{0}, \dots , {\varvec{\nu }}_{n})\in {\mathbb {R}}^{{\varvec{{{\mathcal {A}}}}}}\) such that
\( {\varvec{\nu }}_{0}\gg \dots \gg {\varvec{\nu }}_{n} ={\varvec{0}}\). Moreover, this vector can be chosen so that the
\(\rho _{i}\)’s are affine (Example
2.12 and Corollary
4.25).
In the setting of the Canny–Emiris conjecture (
1.3), the sparse eliminant coincides with the sparse resultant. Hence, this statement follows from Theorem
1.3 taking a family of affine functions whose associated mixed subdivision is admissible.
The statement of Theorem
1.3 is contained in Theorem
4.27 and its proof uses a descent argument similar to that of Macaulay in [
27] and the first author in [
7], but its implementation is different. In contrast to these references, our approach works directly with the Canny–Emiris matrices associated with restrictions of the given data, without any need of extending the Canny–Emiris construction to a larger one. On the other hand, it is interesting to note that such an enlargement is possible, in analogy with the situation in [
7,
27]: the Canny–Emiris construction can be enlarged by replacing the translation vector
\(\delta \) by a convex piecewise affine function on a polytope, and Theorem
1.3 extends to this more general situation (Remark
4.28).
This result calls in for several research questions. To begin with, it would be interesting to extend the class of mixed subdivisions to which the quotient formula for the sparse resultant holds. Indeed, such an extension might be possible by enlarging the range of validity of Theorem
1.2. In the mean time, for computational purposes it would be interesting to have a fast way of checking if a given tight mixed subdivision of
\(\Delta \) is admissible. In the same line, it would be interesting to determine the probability that a given tight mixed subdivision is admissible, with respect to a suitable probability distribution.
As an application, we show that the Macaulay formula for the homogeneous resultant corresponding to the critical degree is a particular case of Theorem
1.3, thus providing an independent proof for it (Corollary
5.13). This is done by considering a specific admissible mixed subdivision of scalar multiples of the standard simplex such that its Canny–Emiris matrix and distinguished principal submatrix coincide with those in that formula (Proposition
5.9).
The paper is organized as follows. In Sect.
2 we explain the necessary notions and results from polyhedral geometry, including convex piecewise affine functions on polyhedra and their associated mixed subdivisions, and mixed volumes and integrals. In Sect.
3, we recall the basic definitions and properties of sparse resultants and study some further aspects, including their orders and initial parts, their homogeneities and corresponding degrees, and their behavior under the evaluation at systems of Laurent polynomials with smaller supports. In Sect.
4, we study Canny–Emiris matrices: their behavior under restriction of the data, the orders, initial parts, homogeneities and degrees of their principal minors, some divisibility properties of their determinants, and we give the proof of the Canny–Emiris conjecture. In Sect.
5, we study the Macaulay formula for the homogeneous resultant in the framework of the Canny–Emiris construction, and give some additional examples and observations.