Finite rank vector bundles on inductive limits of grassmannians

Mathematics – Algebraic Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

AMS Latex, 14 pages. To the memory of Andrey Tyurin

Scientific paper

If $\P^\infty$ is the projective ind-space, i.e. $\P^\infty$ is the inductive limit of linear embeddings of complex projective spaces, the Barth-Van de Ven-Tyurin (BVT) Theorem claims that every finite rank vector bundle on $\P^\infty$ is isomorphic to a direct sum of line bundles. We extend this theorem to general sequences of morphisms between projective spaces by proving that, if there are infinitely many morphisms of degree higher than one, every vector bundle of finite rank on the inductive limit is trivial. We then establish a relative version of these results, and apply it to the study of vector bundles on inductive limits of grassmannians. In particular we show that the BVT Theorem extends to the ind-grassmannian of subspaces commensurable with a fixed infinite dimensional and infinite codimensional subspace in $\C^\infty$. We also show that for a class of twisted ind-grassmannians, every finite rank vector bundle is trivial.

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

Finite rank vector bundles on inductive limits of grassmannians 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 Finite rank vector bundles on inductive limits of grassmannians, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite rank vector bundles on inductive limits of grassmannians will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-172867

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