Papers
Topics
Authors
Recent
Search
2000 character limit reached

Linear syzygies and linear subspaces whose lines are multisecant

Published 8 Oct 2026 in math.AG | (2610.12078v1)

Abstract: The locus Sd(X)S_d(X) of dd-secant lines to a projective variety XX plays an important role in the study of projective varieties via projections (Lazarsfeld 1987, Kwak 1998, Beheshti-Eisenbud 2010). For a projective scheme X⊆P<sup>rX\subseteq\mathbb{P}<sup>r satisfying N<em>d,2\textbf{N}<em>{d,2}, we show that Sd(X)∪XS_d(X)\cup X is cut out set-theoretically by the rr-minors of a matrix MM constructed from dd-forms scheme-theoretically defining XX and their linear syzygies. In particular, Sd(X)=P<sup>rS_d(X)=\mathbb{P}<sup>r if and only if every rr-minor of MM vanishes. Using this, we find a singular threefold X⊆P<sup>5X\subseteq\mathbb{P}<sup>5 with S4(X)≠P<sup>5S_4(X)\ne \mathbb{P}<sup>5 and (IX)3=0(I_X)_3=0, and a normal fourfold X⊆P<sup>7X\subseteq\mathbb{P}<sup>7 with S3(X)≠P<sup>7S_3(X)\ne \mathbb{P}<sup>7 and (IX)2=0(I_X)_2=0. The nonexistence of such varieties in the smooth case is an open question raised by the second author and by Gruson-Peskine. Next, we consider the locus S</em>k,d(X)S</em>{k,d}(X) of kk-planes LL such that L∩XL\cap X contains a hypersurface of degree ≥d\ge d in LL so that S1,d(X)=Sd(X)S_{1,d}(X)=S_d(X). The locus Sk,d(X)∪XS_{k,d}(X)\cup X is set-theoretically defined by the (r+1−k)(r+1-k)-minors of MM. As a result, we obtain determinantal equations vanishing on the (q+1)(q+1)-secant variety σ<em>q+1Xσ<em>{q+1}X from the equations of σqXσ_qX and their linear syzygies when σqXσ_qX satisfies N</em>q+1,2\textbf{N}</em>{q+1,2}. Finally, we extend the dd-secant lemma for lines to the locus Sk,d(X)S_{k,d}(X) of kk-planes. This yields a lower bound on the number of linear syzygies.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.