Submodules of the deficiency modules and an extension of Dubreil's Theorem

Mathematics – Algebraic Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

18 pages, LaTeX, version 2.09

Scientific paper

In its most basic form, Dubreil's Theorem states that for an ideal $I$ defining a codimension $2$, arithmetically Cohen--Macaulay subscheme of projective $n$-space, the number of generators of $I$ is bounded above by the minimal degree of a minimal generator plus $1$. By introducing a new ideal $J$ which is the complete intersection of $n-1$ general linear forms, we are able to extend Dubreil's Theorem to an ideal $I$ defining a locally Cohen--Macaulay subscheme $V$ of any codimension. Our new bound involves the lengths of the Koszul homologies of the cohomology modules of $V$, with respect to the ideal $J$, and depends on a careful identification of the module $(I \cap J)/IJ$ in terms of the maps in the free resolution of $J$. As a corollary to this identification, we also give a new proof of a theorem of Serre which gives a necessary and sufficient condition to have the equality $I \cap J = IJ$ in the case where $I$ and $J$ define disjoint schemes in projective space.

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

Submodules of the deficiency modules and an extension of Dubreil's Theorem 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 Submodules of the deficiency modules and an extension of Dubreil's Theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Submodules of the deficiency modules and an extension of Dubreil's Theorem will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-314494

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