MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $L_1,L_2$ be two irreducible component of two different Hilbert schemes parametrizing closed subscheme in $\mathbb{P}^n$ and $\mathbb{P}^{n-1}$, respectively. Denote by $\pi_1: \mathcal{X}_1 \to L_1,\pi_2: \mathcal{X}_2 \to L_2$ the corresponding universal families of closed subschemes. Assume that there exists a hyperplane in $\mathbb{P}^n$, say $H$ and an open set $U$ in $L_1$ such that for all $u \in U$, $\pi_1^{-1}(u)$ intersect $H$ transversally and the intersection $\pi_1^{-1}(u).H$ is a fiber of $\pi_2$. Hence gives a set theoretic map from $U$ to $L_2$. The question is whether this induces a morphism of schemes (from $U$ to $L_2$)? If not, is it known under what conditions this could hold true?

Note that the intersection $\pi_1^{-1}(u).H$ gives only a subscheme in $\mathbb{P}^n$ but there is a natural identification of this with a subscheme in $\mathbb{P}^{n-1}$ obtained by the fibered product $\mathbb{P}^{n-1} \times_{\mathbb{P}^n} \pi_1^{-1}(u)$, where the morphism from $\mathbb{P}^{n-1}$ to $\mathbb{P}^n$ is a closed immersion induced by the vanishing of $H$.

EDIT: Assume if necessary that $U, L_2$ are smooth.

share|cite|improve this question
Not the same question, but related:… – Allen Knutson Jan 22 '14 at 20:56

The Hilbert scheme is universal for flat families of closed subschemes of $\mathbb P^{n-1}$. So if $\mathcal X_1(U) \cap H$ is flat over $U$, then we obtain a map $U \to Hilb( \mathbb P^{n-1})$ by the universaL property. Since all the points land in the irreducible component $L_2$, the map factors through $L_2$.

A hypersurface in a flat family is flat as long as its equation is not a zero-divisor in any fiber. Because the intersection is transverse, this condition is satisfied.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.