Théorèmes De Connexité Pour Les Produits D'Espaces Projectifs et Les Grassmanniennes

Mathematics – Algebraic Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

In French, 24 pages. The file originally submitted was corrupted. This one should work fine. PlainTeX v 1.2 with amssym.def an

Scientific paper

Let $G$ be the Grassmannian $G(d,n)$, let $X$ and $Y$ be complete irreducible varieties, and let $X\rightarrow G$ and $Y\rightarrow G$ be morphisms. Hansen proved that $X \times_G Y$ is connected when $codim f(X) + codim g(Y) < n$. We show that the conclusion holds under the often weaker hypothesis $f(X).g(Y).T\ne 0$, where $T$ is the class of $G(d,n-1)$ in $G$. We prove similar results when $G$ is a product of projective spaces. In particular, if $D$ is an irreducible subvariety of $P^n\times P^n$ of dimension $n$ which dominates both factors, and if $X$ is complete irreducible, with a morphism $f: X \rightarrow P^n\times P^n$ such that $dim f(X) >n$, $f^{-1}(D)$ is connected. This extends the classical Fulton-Hansen connectedness theorem. These results illustrate Fulton and Lazarsfeld's idea that connectedness should be a numerical property.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Théorèmes De Connexité Pour Les Produits D'Espaces Projectifs et Les Grassmanniennes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Théorèmes De Connexité Pour Les Produits D'Espaces Projectifs et Les Grassmanniennes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Théorèmes De Connexité Pour Les Produits D'Espaces Projectifs et Les Grassmanniennes will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-143991

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.