REVIEW 3 major objections 4 minor 25 references
Implicitization of tensor product surfaces via virtual projective resolutions
T0 review · 3 major / 4 minor · reviewed 2026-08-14 · deepseek-v4-flash
Pith's one-line read The paper proves that residual resultants over the biprojective plane—and with them the implicit equations of tensor product surfaces with base points—equal the gcd of maximal minors of an explicit matrix built from a virtual projective…
desk verdict Extends residual resultants to P1 x P1 via virtual resolutions, with a solid generic theorem but a real specialization gap in the implicitization algorithm. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The machinery is the Eagon-Northcott complex of the augmented syzygy matrix $\varphi\oplus\Psi$, where $\varphi$ presents the base point ideal $G$ and $\Psi$ records how the parametrizing polynomials are obtained from the generators of $G$. This complex is only a virtual resolution: its higher homology is B-torsion, meaning it is killed by a power of the irrelevant ideal $(s,t)\cap(u,v)$, rather than being zero as in an ordinary free resolution. Proposition 3.14 produces a regularity region for this complex depending only on the bidegrees involved; working inside that region ensures the degree-$\nu$ strand of the first differential is surjective exactly when the residual resultant does not vanish, which is what makes the gcd of maximal minors equal to the residual resultant.
What would settle it
Take a parametrization satisfying all the stated hypotheses and compute the residual resultant two independent ways: as the gcd of maximal minors of $\Theta_\nu$ and by a direct symbolic resultant; any disagreement would refute the main identity. Alternatively, exhibit a base-point scheme whose saturation is a height-two locally complete intersection but where the first homology of $\mathrm{EN}(\varphi\oplus\Psi)$ is not B-torsion and the gcd of maximal minors has the wrong degree in the coefficients of $F_0$.
Extended reading notes
Core claim
The central claim is Proposition 4.13: for a locally complete intersection base point ideal $G$ with Hilbert-Burch syzygy matrix $\varphi$, and polynomials $p_0,\dots,p_3$ written as $[p_0\ p_1\ p_2\ p_3] = [g_1\ \cdots\ g_n]h$, the residual resultant $\mathrm{Res}_{G,\{(a_i,b_i)\}}$ is the gcd of the maximal minors of the matrix $\Theta_\nu$ obtained by restricting the first differential of the Eagon-Northcott complex of $\varphi\oplus\Psi$ to a bidegree $\nu$ in an explicitly described regularity region. Combined with Proposition 5.2, this gives $\mathrm{Res}_{G,(a,b)}(p_0-Xp_3,\,p_1-Yp_3,\,p_2-Zp_3) = H(X,Y,Z,1)^{\deg(U/\beta(U))}$, so the same matrix computation produces the implicit equation of the tensor product surface. This is a new algorithmic route to implicitization with base points.
Load-bearing premise
The load-bearing premise is that the base point ideal can be replaced by a height-two locally complete intersection ideal with Hilbert-Burch syzygies whose saturation equals the saturation of the parametrization ideal, because only then is the Eagon-Northcott complex a virtual resolution and the regularity-region argument valid.
Editorial extensions
If this is right
- Residual resultants over the biprojective plane become a linear algebra computation: choose a bidegree in the regularity region, build $\Theta_\nu$, and take the gcd of maximal minors.
- The same computation dehomogenizes to the implicit equation $H(X,Y,Z,1)$ for tensor product surfaces with base points, with the degree factor accounted for by the birationality degree of the parametrization.
- The regularity region estimate depends only on the bidegrees of the generators, not on the specific polynomials, so the matrix shape can be precomputed from numerical data.
- Because the Eagon-Northcott complex is virtual rather than free, the resulting matrices are smaller than those coming from a minimal free resolution, offering an alternative to Gröbner bases in favorable cases.
Reading between the lines
- Example 6.4 suggests a broader algorithmic principle: when the saturation hypothesis fails, the implicit equation still appears as a divisor of submaximal minors of $\Theta_\nu$, so a Fitting-ideal version of the algorithm may apply to parametrizations with non-reduced base point schemes.
- The strategy of using a virtual resolution instead of a free resolution should transfer to other multigraded settings, such as products of more projective spaces, wherever a multigraded regularity region is known and a Hilbert-Burch-style virtual resolution exists.
- One could test the practical gain by benchmarking matrix sizes and running times against standard implicitization algorithms on families of tensor product surfaces; the paper does not include such benchmarks.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper develops a method for computing the implicit equation of a tensor product surface over P^1_k × P^1_k with base points, using residual resultants and virtual projective resolutions. Section 2 defines the residual resultant on the blow-up of P^1_k × P^1_k and computes its multidegrees (Proposition 2.7). Section 3 reviews virtual resolutions and multigraded regularity, and proves a regularity-region estimate for Eagon-Northcott complexes (Proposition 3.14). Section 4 constructs a matrix Θν from the Eagon-Northcott complex of ϕ⊕Ψ and proves, over the generic coefficient ring, that the gcd of the maximal minors of Θν is exactly the residual resultant (Propositions 4.11–4.13); this yields Algorithm 4.14. Section 5 specializes the method to implicitization: assuming the base-point ideal G has a Hilbert–Burch resolution and Psat = Gsat, Proposition 5.2 identifies a residual resultant with the implicit equation, and Algorithm 5.5 outputs a gcd of selected maximal minors. Section 6 contains worked examples, including a case where Psat ≠ Gsat and extraneous factors appear.
Significance. If the correctness of Algorithm 5.5 is fully established, the paper makes a valuable contribution: it extends the residual resultant formalism from projective space to the biprojective setting, gives explicit degree formulas via intersection theory on the blow-up, and shows that virtual resolutions can replace free resolutions in resultant computations. The main structural results—Proposition 2.7, Proposition 4.4, and the generic gcd theorem of Proposition 4.13—are largely self-contained, and the Macaulay2 examples provide useful evidence. However, the central algorithmic claim currently rests on an unproved specialization step: the gcd equality proved over a generic coefficient ring is applied after specializing the coefficients to X,Y,Z, and no lemma shows that this specialization preserves the gcd. This gap is load-bearing for the paper's main claim and needs to be repaired before the algorithm can be considered proven.
major comments (3)
- [§4.2, Prop. 4.13; §5, Algorithm 5.5] Proposition 4.13 proves equality between the gcd of the maximal minors of Θν and the residual resultant only over the generic coefficient ring C = k[C_{ij}^α]. Algorithm 5.5, however, forms Θν after the specialization (12)–(13) that sends the independent coefficient sets of F0, F1, F2 to the three variables X,Y,Z of S = k[X,Y,Z]. The proof of Proposition 4.13 controls multidegrees in those independent coefficient sets, so its degree argument does not survive the specialization, and gcds of generic polynomials do not in general descend under specialization. Proposition 5.2 identifies the specialized residual resultant with H(X,Y,Z,1)^{deg(U/β(U))}, but the manuscript never proves that the gcd of the specialized maximal minors equals this resultant. Example 6.4, where Psat ≠ Gsat, already exhibits an extraneous factor X in a specialized maximal minor, and nothing in the text rules out similar extraneous factors in the cases covered by Algorithm 5.5. Since the output of Algorithm 5.5 is exactly this specialized gcd, a specialization lemma or an alternative correctness argument is required.
- [§5, Algorithm 5.5, step (4)] The algorithm instructs the user to compute maximal minors δi of degree Ni in the coefficients of Fi for i = 0, 1, 2. Proposition 4.12 establishes existence of such minors for the generic matrix Θν over C, not for the specialized matrix over S. After specialization, the corresponding minors may vanish or acquire additional factors, and no proof is given that the specialized matrix still contains maximal minors of the separate degrees N0, N1, N2. The degree comparison in the proof of Proposition 4.13 therefore cannot be invoked to justify the output of Algorithm 5.5.
- [§5, Prop. 5.2] The equality ResG,(a,b)(p0−Xp3, p1−Yp3, p2−Zp3) = H(X,Y,Z,1)^{deg(U/β(U))} means that for non-birational parametrizations the residual resultant is a power of the defining equation of the image, not the reduced equation itself. The paper does not discuss how Algorithm 5.5 is expected to recover the reduced implicit equation rather than this power, nor whether the intended output is allowed to be a power. This needs clarification, since the implicitization claim is usually understood as producing the equation defining the image as a reduced surface.
minor comments (4)
- [§5, Eq. (13) and Algorithm 5.5] In the displayed formula for Ψ, the second column is written as 'hi0 − Yhi3'; it should be 'hi1 − Yhi3', since F1 = p1 − Yp3.
- [§6.1, Example 6.1] In the displayed formula for the residual resultant, the term 'c00a12c23' appears to be a typo for 'c00c12c23'.
- [§3.3] The text attributes the Eagon–Northcott complex to 'the original paper by Eagon and Northcott [Eag62]', but the cited reference is the single-author paper by Eagon; either the attribution or the reference should be corrected.
- [§2, Prop. 2.7 proof] The notation 'mini = ei' is ambiguous; the intended statement is presumably that the product of the two vanishing multiplicities equals the Hilbert–Samuel multiplicity ei, and the proof should say so explicitly.
Circularity Check
No significant circularity; derivation is independent, with only a minor non-load-bearing self-citation.
full rationale
The derivation chain is self-contained. The residual resultant is defined geometrically through blow-up incidence geometry (Proposition 2.4), its degrees are computed by intersection theory on the blow-up (Proposition 2.7), the gcd representation is proved over a generic coefficient ring by divisibility together with degree comparison (Propositions 4.11–4.13), and the link to the implicit equation is proved as Proposition 5.2 via the birational morphism induced by the parametrization. No fitted parameter is renamed as a prediction, and no quantity is defined in terms of the claimed output. The only author-overlapping citation is [CFG+16, Lemma 4.1] in Remark 2.5, used solely to note that ideals of reduced point sets are locally complete intersections; this is an independent algebraic fact and is not load-bearing for the main theorem. The reviewer's specialization concern—that the generic gcd result of Proposition 4.13 may not descend to the specialized gcd computed in Algorithm 5.5, with Example 6.4 showing extraneous factors in a related setting—is a genuine proof gap in the algorithmic claim, but it is not circularity: the fix would be an additional specialization lemma, not a change of inputs or a redefinition of the output.
Assumptions & free parameters
assumptions (5)
- standard math Hilbert-Burch theorem and virtual Hilbert-Burch resolutions for zero-dimensional subschemes of P1 x P1 (ZES17 Cor 5.2, Example 3.5).
- standard math Exactness and homology properties of the Eagon-Northcott complex (Lemma 3.11, Eag62).
- standard math Multigraded weak and strong regularity results of Maclagan-Smith and Hoffman-Wang (Proposition 3.9, MS04, HW04).
- standard math Intersection theory for blow-ups (Fulton), including c1 of twisted ideal sheaves and self-intersections of exceptional divisors.
- domain assumption The base point ideal G is a locally complete intersection of height two with a Hilbert-Burch syzygy matrix, and the parametrization ideal P satisfies Psat = Gsat.
Cite this review
Pith. "Pith review of Implicitization of tensor product surfaces via virtual projective resolutions." pith.science (2026). https://pith.science/paper/4M6CS4YO
@misc{pith2026190802086,
author = {Pith},
title = {Pith review of: Implicitization of tensor product surfaces via virtual projective resolutions},
year = {2026},
howpublished = {\url{https://pith.science/paper/4M6CS4YO}},
note = {Machine review of arXiv:1908.02086}
}
read the original abstract
We derive the implicit equations for certain parametric surfaces in three-dimensional projective space termed tensor product surfaces. Our method computes the implicit equation for such a surface based on the knowledge of the syzygies of the base point locus of the parametrization by means of constructing an explicit virtual projective resolution.
Reference graph
Works this paper leans on
-
[1]
Buchsbaum and David Eisenbud, What annihilates a module?, J
David A. Buchsbaum and David Eisenbud, What annihilates a module?, J. Algebra 47 (1977), no. 2, 231--243. 0476736
work page 1977
- [2]
-
[3]
Nicol \'a s Botbol, The implicit equation of a multigraded hypersurface, J. Algebra 348 (2011), 381--401. 2852248 (2012m:14094)
work page 2011
-
[4]
Laurent Bus\'e, Residual resultant over the projective plane and the implicitization problem, Proceedings of the 2001 I nternational S ymposium on S ymbolic and A lgebraic C omputation, ACM, New York, 2001, pp. 48--55. 2049730
work page 2001
-
[5]
Laurent Bus \'e , Implicit matrix representations of rational b \'e zier curves and surfaces , Computer-Aided Design 46 (2014), 14--24
work page 2014
-
[6]
David Cox, Alicia Dickenstein, and Hal Schenck, A case study in bigraded commutative algebra, Syzygies and H ilbert functions, Lect. Notes Pure Appl. Math., vol. 254, Chapman & Hall/CRC, Boca Raton, FL, 2007, pp. 67--111. 2309927
work page 2007
-
[7]
Susan Cooper, Giuliana Fatabbi, Elena Guardo, Anna Lorenzini, Juan Migliore, Uwe Nagel, Alexandra Seceleanu, Justyna Szpond, and Adam Van Tuyl, Symbolic powers of codimension two cohen-macaulay ideals, arXiv preprint arXiv:1606.00935 (2016)
work page Pith review arXiv 2016
-
[8]
David Cox, Ronald Goldman, and Ming Zhang, On the validity of implicitization by moving quadrics of rational surfaces with no base points, J. Symbolic Comput. 29 (2000), no. 3, 419--440. 1751389
work page 2000
Show all 25 references
-
[9]
Vis., Springer, Berlin, 2006, pp
Marc Chardin, Implicitization using approximation complexes, Algebraic geometry and geometric modeling, Math. Vis., Springer, Berlin, 2006, pp. 23--35. 2279841 (2007j:14097)
2006
-
[10]
Carlos D'Andrea, Macaulay style formulas for sparse resultants, Trans. Amer. Math. Soc. 354 (2002), no. 7, 2595--2629. 1895195
2002
-
[11]
John A Eagon, Ideals defined by matrices and a certain complex associated with them, Proc. R. Soc. Lond. A 269 (1962), no. 1337, 188--204
1962
-
[12]
150, Springer-Verlag, New York, 1995, With a view toward algebraic geometry
David Eisenbud, Commutative algebra, Graduate Texts in Mathematics, vol. 150, Springer-Verlag, New York, 1995, With a view toward algebraic geometry. 1322960 (97a:13001)
1995
-
[13]
2, Springer-Verlag, Berlin, 1984
William Fulton, Intersection theory, Ergebnisse der Mathematik und ihrer Grenzgebiete (3) [Results in Mathematics and Related Areas (3)], vol. 2, Springer-Verlag, Berlin, 1984. 732620
1984
-
[14]
Israel M Gelfand, Mikhail Kapranov, and Andrei Zelevinsky, Discriminants, resultants, and multidimensional determinants, Springer Science & Business Media, 2008
2008
-
[15]
Jitang Gao, Yutong Li, Michael Loper, and Amal Matoo, Virtual complete intersection in P ^1 P ^1 , arXiv preprint arXiv:1905.0999 (2019)
2019
-
[16]
Daniel R Grayson and Michael E Stillman, Macaulay2, a software system for research in algebraic geometry, 2002
2002
-
[17]
Robin Hartshorne, Algebraic geometry, Springer-Verlag, New York-Heidelberg, 1977, Graduate Texts in Mathematics, No. 52. 0463157 (57 \#3116)
1977
-
[18]
William Hoffman and Hao Hao Wang, Castelnuovo- M umford regularity in biprojective spaces , Adv
J. William Hoffman and Hao Hao Wang, Castelnuovo- M umford regularity in biprojective spaces , Adv. Geom. 4 (2004), no. 4, 513--536. 2096526
2004
-
[19]
Jouanolou, Le formalisme du r\' e sultant , Adv
J.-P. Jouanolou, Le formalisme du r\' e sultant , Adv. Math. 90 (1991), no. 2, 117--263. 1142904
1991
-
[20]
Jean-Pierre Jouanolou, Aspects invariants de l'\' e limination , Adv. Math. 114 (1995), no. 1, 1--174. 1344713
1995
-
[21]
M. M. Kapranov, B. Sturmfels, and A. V. Zelevinsky, Chow polytopes and general resultants, Duke Math. J. 67 (1992), no. 1, 189--218. 1174606
1992
-
[22]
Smith, Multigraded C astelnuovo- M umford regularity , J
Diane Maclagan and Gregory G. Smith, Multigraded C astelnuovo- M umford regularity , J. Reine Angew. Math. 571 (2004), 179--212. 2070149
2004
-
[23]
Algebraic Geom
, Uniform bounds on multigraded regularity, J. Algebraic Geom. 14 (2005), no. 1, 137--164. 2092129
2005
-
[24]
Sederberg and F
T. Sederberg and F. Chen, Residual resultant over the projective plane and the implicitization problem, SIGGRAPH 1995 Conference Proceedings, ACM, New York, 1995, pp. 301--308
1995
-
[25]
Christine Berkesch Zamaere, Daniel Erman, and Gregory G Smith, Virtual resolutions for a product of projective spaces, arXiv preprint arXiv:1703.07631 (2017)
2017 arXiv
Reviewed August 14, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.