Connected Components in the Hilbert Scheme of hypersurfaces in Grassmannians

See-Hak Seong

arxiv: 1907.06569 · v2 · pith:Y27ZJJ7Fnew · submitted 2019-07-15 · 🧮 math.AG

Connected Components in the Hilbert Scheme of hypersurfaces in Grassmannians

See-Hak Seong This is my paper

Pith reviewed 2026-05-24 21:21 UTC · model grok-4.3

classification 🧮 math.AG

keywords Hilbert schemeGrassmannianconnected componentshypersurfacescohomologymoduli space

0 comments

The pith

The Hilbert scheme Hilb_{dT+1-binom(d-1,2)}(G(k,n)) has two connected components for d ≥ 3, even when both components share the same cohomology class.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper proves that for d at least 3 the Hilbert scheme of subschemes with a particular Hilbert polynomial in a Grassmannian breaks into two connected components. The elements of these components cannot be distinguished using their cohomology classes since those classes coincide. The work also shows that for the Hilbert polynomial of degree d hypersurfaces the corresponding Hilbert scheme has at most two connected components. A reader would care because it reveals that Hilbert schemes can be disconnected even when standard invariants fail to separate the pieces.

Core claim

We show that when d ≥ 3, the Hilbert scheme Hilb_{dT+1−binom(d-1,2)}(G(k,n)) has 2 components, even though elements in both components have the same cohomology class. Moreover, we show that the Hilbert scheme associated to the Hilbert polynomial binom(T+n}{n}−binom(T+n-d}{n} in Grassmannian has at most 2 connected components.

What carries the argument

The Hilbert scheme Hilb_P(G(k,n)) classifying flat families of subschemes with a fixed Hilbert polynomial P inside the Grassmannian.

Load-bearing premise

The Hilbert polynomial equals exactly dT + 1 − binom(d−1,2) and the ambient variety is the Grassmannian G(k,n) with its standard embedding.

What would settle it

Finding a connected flat family over a curve that joins subschemes from both components would disprove the existence of two separate components.

read the original abstract

We show that when $d \geq 3$, the Hilbert scheme $Hilb_{dT+1-\binom{d-1}{2}}(G(k,n))$ has 2 components, even though elements in both components have the same cohomology class. Moreover, we show that the Hilbert scheme associated to the Hilbert polynomial $\binom{T+n}{n}-\binom{T+n-d}{n}$ in Grassmannian has at most 2 connected components.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

Paper gives concrete component counts for these Hilbert schemes but the statements lack conditions on k and n.

read the letter

The main takeaway is that this paper finds exactly two connected components in the Hilbert scheme Hilb with polynomial dT +1 - binom(d-1,2) inside G(k,n) when d is at least 3, and that the two components have the same cohomology class. It also finds at most two components for the Hilbert scheme with the binomial polynomial binom(T+n,n) - binom(T+n-d,n). What is new is the explicit count of two components in the first case despite the cohomology classes matching. The abstract suggests this is not just a restatement of earlier results. The paper does a reasonable job stating these specific results for hypersurfaces in Grassmannians. The soft spots are around the generality. The statements give no conditions on k and n. The stress-test concern holds up because the first polynomial is linear, pointing to curve-like objects, and the second has degree n, so the Grassmannian dimension must exceed those to make sense. Without specifying the range for k and n, the claims as written may not apply universally. The abstract also gives no proof steps or verification, so the soundness is hard to judge without the full arguments. This work is for specialists in algebraic geometry who study moduli spaces and Hilbert schemes of subschemes in homogeneous varieties. Someone already looking at connected components in these settings might get something from the concrete numbers. It deserves a serious referee because the claims are precise enough to be checked, even if the scope is limited. Recommendation: Send it for peer review, but flag the need to add conditions on the parameters k and n.

Referee Report

1 major / 1 minor

Summary. The manuscript claims that when d ≥ 3, the Hilbert scheme Hilb_{dT+1−binom(d−1,2)}(G(k,n)) has 2 components, even though elements in both components have the same cohomology class. Moreover, it claims that the Hilbert scheme associated to the Hilbert polynomial binom(T+n,n)−binom(T+n-d,n) in a Grassmannian has at most 2 connected components.

Significance. If the results hold, they would demonstrate that Hilbert schemes of subschemes in Grassmannians can have multiple connected components even when the cohomology class is fixed, which is a non-generic phenomenon. The upper bound of two components for the second family of Hilbert polynomials would also be a useful structural result for hypersurface-like subschemes in homogeneous spaces.

major comments (1)

[Abstract] Abstract (and main theorem statement): the claim that Hilb_{dT+1−binom(d−1,2)}(G(k,n)) has exactly two components for d≥3 is stated with no restrictions on k or n. The first polynomial has degree 1 and the second has degree n, so both assertions require dim G(k,n) to be large enough relative to these degrees for the relevant families to exist in the Plücker embedding. This omission is load-bearing for the central count of components, as the number may change for small k or n.

minor comments (1)

[Abstract] The second Hilbert polynomial is written as binom(T+n,n)−binom(T+n-d,n) without an explicit variable of integration, though context makes the meaning clear.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for identifying an important omission in the statement of the main results. We address the major comment below.

read point-by-point responses

Referee: [Abstract] Abstract (and main theorem statement): the claim that Hilb_{dT+1−binom(d−1,2)}(G(k,n)) has exactly two components for d≥3 is stated with no restrictions on k or n. The first polynomial has degree 1 and the second has degree n, so both assertions require dim G(k,n) to be large enough relative to these degrees for the relevant families to exist in the Plücker embedding. This omission is load-bearing for the central count of components, as the number may change for small k or n.

Authors: We agree that the claims require explicit restrictions on k and n to guarantee that the relevant subschemes exist inside the Plücker embedding of G(k,n). In the revised version we will add the necessary hypotheses (that dim G(k,n) strictly exceeds the degree of each Hilbert polynomial) to both the abstract and the main theorem statements, thereby making the component counts precise. revision: yes

Circularity Check

0 steps flagged

No circularity in derivation chain

full rationale

The paper's central claim is a theorem asserting that certain Hilbert schemes have exactly two connected components (for d ≥ 3) despite sharing cohomology classes, and that a related Hilbert scheme has at most two components. This is presented as a result to be shown via algebraic geometry arguments on the Hilbert scheme Hilb_P(G(k,n)). No self-definitional loops, fitted parameters renamed as predictions, load-bearing self-citations, or ansatzes smuggled via prior work appear in the abstract or the described claim. The derivation is self-contained against external benchmarks in algebraic geometry and does not reduce to its inputs by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Only the abstract is available; no free parameters, invented entities, or non-standard axioms are visible.

axioms (1)

standard math Standard axioms and definitions of algebraic geometry, schemes, and Hilbert polynomials.
The result is stated inside the framework of scheme theory over an algebraically closed field.

pith-pipeline@v0.9.0 · 5588 in / 1167 out tokens · 29912 ms · 2026-05-24T21:21:03.759469+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/RealityFromDistinction.lean reality_from_one_distinction unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Theorem 1.1. For d ≥ 3 and 1 < k < n − 1, Hilb dT +1− (d− 1 2 )(G(k, n)) has 2 connected components.

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.