Papers
Topics
Authors
Recent
Search
2000 character limit reached

Classifying Smooth Quot Schemes

Published 14 Aug 2026 in math.AG and math.AC | (2608.14424v1)

Abstract: The Quot scheme Quot<sup>q(OP<sup>n<sup>r)\operatorname{Quot}<sup>{q}(\mathcal{O}_{\mathbb{P}<sup>n}<sup>{r}) parametrizes the quotients of the trivial vector bundle of rank rr on nn-dimensional projective space that have Hilbert polynomial qq and are flat over a base scheme. We identify numerical conditions on the polynomial qq that completely determine when this Quot scheme is smooth and irreducible. Our approach also uncovers further geometric features of the projective scheme Quot<sup>q</sup>(OP<sup>n<sup>r)\operatorname{Quot}<sup>{q}</sup> (\mathcal{O}_{\mathbb{P}<sup>n}<sup>{r}) including the smoothness of the lexicographic point.

Summary

  • The paper gives a complete classification: smoothness and irreducibility occur precisely for Hilbert polynomials q(t)=s·C(t+n,n)+pλ(t) satisfying explicit rank and partition conditions.
  • The authors prove every nonempty Quot scheme has a smooth lexicographic point and use Borel-fixed-point combinatorics, tangent-space dimensions, and path-connectedness to establish irreducibility or detect singularities.
  • The results identify Grassmannians, projective spaces, and products with Hilbert schemes as important smooth families, while exceptional partitions such as (2,1) and (2,2,1) produce sporadic singular Quot schemes.

Overview and main result

The paper by Skjelnes, Smith, and Stillman (2608.14424) gives a complete classification of the smooth, irreducible Quot schemes $\Quot^{q}(\mathcal{O}_{\mathbb{P}^n}^{\,r})$ parametrizing flat quotients of the trivial rank-rr bundle on nn-dimensional projective space with Hilbert polynomial qq. The classification is expressed through a family of univariate polynomials attached to integer partitions: for a partition λ=(λ1,,λe)\lambda = (\lambda_1,\dots,\lambda_e), the associated polynomial is

pλ(t)=i=1e(t+λiiλi1).p_\lambda(t) = \sum_{i=1}^{e} \binom{t+\lambda_i-i}{\lambda_i-1}.

The main theorem asserts that $\Quot^{q}(\mathcal{O}_{\mathbb{P}^n}^{\,r})$ is smooth and irreducible exactly when q(t)=s(t+nn)+pλ(t)q(t) = s\binom{t+n}{n} + p_\lambda(t) with rsr \geqslant s, nλ1n \geqslant \lambda_1, and one of three rank-dependent cases holds:

Case Condition for smoothness
rr0 rr1; or rr2 with rr3, rr4; or rr5 with rr6, rr7; or rr8 or rr9
nn0 nn1 is smooth (combinatorially enumerated via the earlier classification of smooth Hilbert schemes)
nn2 nn3

The nn4 case is degenerate: the Quot scheme is a single point corresponding to the ambient bundle itself. The nn5 case reduces to Hilbert-scheme smoothness, since the Quot scheme is locally a product of a projective space and nn6. The genuinely new content is the nn7 case, which the authors emphasize is, somewhat surprisingly, less complicated than the nn8 case: four conditions on the partition suffice, in contrast to the seven conditions required for Hilbert schemes. The classification is uniform over nn9 because only standard Borel-fixed submodules are needed.

Nonemptiness and the pair qq0

The analysis rests on a numerical criterion, extending Macaulay's theorem to free modules: qq1 is nonempty if and only if qq2 for some qq3 and partition qq4 with qq5 and qq6. Here qq7 is the rank of the quotient sheaf, and the lexicographic submodule qq8 realizes the polynomial. A greedy algorithm decides nonemptiness for any given qq9; for instance, λ=(λ1,,λe)\lambda = (\lambda_1,\dots,\lambda_e)0 (with λ=(λ1,,λe)\lambda = (\lambda_1,\dots,\lambda_e)1, λ=(λ1,,λe)\lambda = (\lambda_1,\dots,\lambda_e)2, or λ=(λ1,,λe)\lambda = (\lambda_1,\dots,\lambda_e)3, λ=(λ1,,λe)\lambda = (\lambda_1,\dots,\lambda_e)4) and λ=(λ1,,λe)\lambda = (\lambda_1,\dots,\lambda_e)5 yield empty Quot schemes.

A key combinatorial lemma characterizes when λ=(λ1,,λe)\lambda = (\lambda_1,\dots,\lambda_e)6 admits a nontrivial decomposition λ=(λ1,,λe)\lambda = (\lambda_1,\dots,\lambda_e)7: such a decomposition exists if and only if λ=(λ1,,λe)\lambda = (\lambda_1,\dots,\lambda_e)8 has a part of size λ=(λ1,,λe)\lambda = (\lambda_1,\dots,\lambda_e)9, with exactly two possibilities when the part pλ(t)=i=1e(t+λiiλi1).p_\lambda(t) = \sum_{i=1}^{e} \binom{t+\lambda_i-i}{\lambda_i-1}.0 is unique. This lemma, proved via a recursive "parallel sum identity" algorithm on matrices (interpretable as a game on nonnegative matrices, or via residual flags), controls the number of Borel-fixed points. As a consequence, when pλ(t)=i=1e(t+λiiλi1).p_\lambda(t) = \sum_{i=1}^{e} \binom{t+\lambda_i-i}{\lambda_i-1}.1, pλ(t)=i=1e(t+λiiλi1).p_\lambda(t) = \sum_{i=1}^{e} \binom{t+\lambda_i-i}{\lambda_i-1}.2, or pλ(t)=i=1e(t+λiiλi1).p_\lambda(t) = \sum_{i=1}^{e} \binom{t+\lambda_i-i}{\lambda_i-1}.3, the Quot scheme has a unique saturated Borel-fixed point — a condition that is much easier to verify than the analogous Hilbert-scheme statement.

Smoothness of the lexicographic point

The technical core is the proof that the lexicographic point of every nonempty pλ(t)=i=1e(t+λiiλi1).p_\lambda(t) = \sum_{i=1}^{e} \binom{t+\lambda_i-i}{\lambda_i-1}.4 is smooth, generalizing the Reeves–Stillman theorem for Hilbert schemes. The proof computes the tangent-space dimension at the lexicographic point via two formulas: pλ(t)=i=1e(t+λiiλi1).p_\lambda(t) = \sum_{i=1}^{e} \binom{t+\lambda_i-i}{\lambda_i-1}.5 equals pλ(t)=i=1e(t+λiiλi1).p_\lambda(t) = \sum_{i=1}^{e} \binom{t+\lambda_i-i}{\lambda_i-1}.6 or pλ(t)=i=1e(t+λiiλi1).p_\lambda(t) = \sum_{i=1}^{e} \binom{t+\lambda_i-i}{\lambda_i-1}.7 depending on whether all parts of pλ(t)=i=1e(t+λiiλi1).p_\lambda(t) = \sum_{i=1}^{e} \binom{t+\lambda_i-i}{\lambda_i-1}.8 equal pλ(t)=i=1e(t+λiiλi1).p_\lambda(t) = \sum_{i=1}^{e} \binom{t+\lambda_i-i}{\lambda_i-1}.9, while $\Quot^{q}(\mathcal{O}_{\mathbb{P}^n}^{\,r})$0, where $\Quot^{q}(\mathcal{O}_{\mathbb{P}^n}^{\,r})$1 is the multiplicity of the part $\Quot^{q}(\mathcal{O}_{\mathbb{P}^n}^{\,r})$2. The authors then construct a full-dimensional family through the lexicographic point without exhibiting an explicit presentation of the corresponding module — a notable departure from the Hilbert-scheme proof, which relied on explicit generators. For $\Quot^{q}(\mathcal{O}_{\mathbb{P}^n}^{\,r})$3 the family is built from matrices of homogeneous forms of degree $\Quot^{q}(\mathcal{O}_{\mathbb{P}^n}^{\,r})$4; for larger $\Quot^{q}(\mathcal{O}_{\mathbb{P}^n}^{\,r})$5, a copairing argument with global sections of $\Quot^{q}(\mathcal{O}_{\mathbb{P}^n}^{\,r})$6 extends smoothness from rank $\Quot^{q}(\mathcal{O}_{\mathbb{P}^n}^{\,r})$7 to rank $\Quot^{q}(\mathcal{O}_{\mathbb{P}^n}^{\,r})$8.

Combining the unique-Borel-fixed-point criterion with smoothness of the lexicographic point and the path-connectedness of Quot schemes yields smoothness and irreducibility whenever $\Quot^{q}(\mathcal{O}_{\mathbb{P}^n}^{\,r})$9, q(t)=s(t+nn)+pλ(t)q(t) = s\binom{t+n}{n} + p_\lambda(t)0, or q(t)=s(t+nn)+pλ(t)q(t) = s\binom{t+n}{n} + p_\lambda(t)1. An explicit Gröbner-basis computation for q(t)=s(t+nn)+pλ(t)q(t) = s\binom{t+n}{n} + p_\lambda(t)2 with q(t)=s(t+nn)+pλ(t)q(t) = s\binom{t+n}{n} + p_\lambda(t)3 identifies q(t)=s(t+nn)+pλ(t)q(t) = s\binom{t+n}{n} + p_\lambda(t)4 with an open dense subset of the lexicographic component, illustrating why avoiding explicit presentations simplifies matters.

Recognizable smooth Quot schemes

Three countable families of smooth Quot schemes are identified with classical parameter spaces:

Polynomial data Quot scheme
q(t)=s(t+nn)+pλ(t)q(t) = s\binom{t+n}{n} + p_\lambda(t)5 q(t)=s(t+nn)+pλ(t)q(t) = s\binom{t+n}{n} + p_\lambda(t)6
q(t)=s(t+nn)+pλ(t)q(t) = s\binom{t+n}{n} + p_\lambda(t)7, q(t)=s(t+nn)+pλ(t)q(t) = s\binom{t+n}{n} + p_\lambda(t)8 q(t)=s(t+nn)+pλ(t)q(t) = s\binom{t+n}{n} + p_\lambda(t)9
rsr \geqslant s0, rsr \geqslant s1 rsr \geqslant s2

The first isomorphism follows from the projection formula and relative Serre vanishing. The second uses a closed immersion rsr \geqslant s3, shown to be an isomorphism when rsr \geqslant s4 has no part equal to rsr \geqslant s5 by dimension comparison. A concrete consequence: the Quot scheme containing the twisted tangent bundle rsr \geqslant s6 is rsr \geqslant s7, recovering the rigidity of the tangent bundle under flat deformations, consistent with Siu's global nondeformability result.

Singular Quot schemes

The converse direction exploits the two Borel-fixed points that exist when rsr \geqslant s8 and rsr \geqslant s9: the lexicographic point nλ1n \geqslant \lambda_10 and the point nλ1n \geqslant \lambda_11. Comparing tangent-space dimensions via the identity nλ1n \geqslant \lambda_12 for the Hilbert-scheme lexicographic components, the paper proves that nλ1n \geqslant \lambda_13 is singular whenever nλ1n \geqslant \lambda_14, nλ1n \geqslant \lambda_15, and nλ1n \geqslant \lambda_16 has a part equal to nλ1n \geqslant \lambda_17 but nλ1n \geqslant \lambda_18. The exceptional partition nλ1n \geqslant \lambda_19 is then handled separately: smoothness holds exactly when rr00 and rr01, with the rr02 case requiring an explicit computation of rr03. For rr04, a parallel argument shows that the Quot scheme is singular if and only if the Hilbert scheme is.

A striking application concerns cotangent bundles: for rr05, rr06, rr07, rr08, the Quot scheme containing rr09 is singular, and Macaulay2 computations suggest the multiplicity rr10 grows exponentially for rr11, with rr12 for rr13 — indicating singularity for all rr14, though this remains a conjectural extrapolation from limited data.

Two sporadic singular examples

The partitions rr15 and rr16 with rr17, rr18 yield singular Quot schemes rr19 and rr20 that superficially resemble the Hilbert schemes of two skew lines and twisted cubics: each has two smooth rational irreducible components of unequal dimensions (6 and 5, respectively 9 and 8) meeting in a smooth divisor. The components are exhibited explicitly via parametrized families of presentation matrices whose columns, together with relations, form Gröbner bases, with the lexicographic point obtained as a flat limit. The comparison with Hilbert schemes is instructive and non-obvious: rr21 is singular while rr22 is smooth for all rr23; rr24 behaves like rr25 for rr26 rather than the smooth rr27; and rr28 is smooth, behaving like rr29. The authors attribute these discrepancies to whether the underlying curve configuration can be distributed across the summands of the ambient bundle.

Scope and limitations

The results depend essentially on the ambient bundle being trivial, which forces quotients to be generated in a single degree. The authors state that the methods should extend to rr30, but the characterization of Borel-fixed points becomes substantially more complicated there. For an arbitrary vector bundle rr31, or for a base other than projective space (even a Grassmannian or smooth toric variety), the authors state that essentially nothing is known about the geometry of the associated Quot schemes; the present techniques, which rely on Borel-fixed points and lexicographic ideals, do not apply. The exponential-growth claim for the cotangent-bundle partitions is explicitly computational and conjectural. The precise conjectural formula for rr32 is supported by Macaulay2 evidence but is not proved.

Conclusion

The paper settles the smoothness and irreducibility of rr33 in full generality via purely combinatorial conditions on the pair rr34, proves smoothness of the lexicographic point for all nonempty Quot schemes of this type, and identifies the first systematic collections of smooth Quot schemes beyond Hilbert schemes. The classification reveals that Quot schemes and Hilbert schemes diverge in both directions — some Quot schemes are singular where the analogous Hilbert scheme is smooth, and vice versa — and the two sporadic singular examples delineate where the analogy breaks down. The natural boundary of the method, namely the triviality of the ambient bundle and the base being projective space, marks the precise extent of what is currently understood.

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.

Tweets

Sign up for free to view the 1 tweet with 2 likes about this paper.