Sheaf Cohomolog and Free Resolutions over Exterior Algebras

Mathematics – Algebraic Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

29 pages

Scientific paper

In this paper we derive an explicit version of the Bernstein-Gel'fand-Gel'fand (BGG) correspondence between bounded complexes of coherent sheaves on projective space and minimal doubly infinite free resolutions over its ``Koszul dual'' exterior algebra. This leads to an efficient method for machine computation of the cohomology of sheaves. Among the facts about the BGG correspondence that we derive is that taking homology of a complex of sheaves corresponds to taking the ``linear part'' of a resolution over the exterior algebra. Using these results we give a constructive proof of the existence of a Beilinson monad for a sheaf on projective space. The explicitness of our version allows us to to prove two conjectures about the morphisms in the monad. Along the way we prove a number of results about minimal free resolutions over an exterior algebra. For example, we show that such resolutions are eventually dominated by their "linear parts" in the sense that erasing all terms of degree $>1$ in the complex yields a new complex which is eventually exact.

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

Sheaf Cohomolog and Free Resolutions over Exterior Algebras 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 Sheaf Cohomolog and Free Resolutions over Exterior Algebras, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sheaf Cohomolog and Free Resolutions over Exterior Algebras will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-441016

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