IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4612-1700-8_10.html

Excess and Residual Intersections

In: Intersection Theory

Author

Listed:
  • William Fulton

    (University of Michigan, Department of Mathematics)

Abstract

If X Y is a regular imbedding, V⊂Y a subvariety, we have constructed (§ 6.1) an intersection product X·V in A m (X∩V), where m = dim V - codim (X, Y). If a closed subscheme Z of X∩V is given, the basic problem of residual intersections is to write X·Vas the sum of a class on Z and a class on a “residual set” R. There is a canonical choice for the class on Z, namely $$ {\left\{ {c\left( N \right) \cap s\left( {Z,V} \right)} \right\}_m} $$ where N is the restriction to Z of N X Y, and s(Z,V) is the Segre class. Our problem is therefore to compute this class on Z, and to construct and compute a residual intersection class $$ \mathbb{R} $$ in A m (R), for an appropriate closed set R such that Z∪R= X∩V, with $$ X \cdot V = {\left\{ {c\left( N \right) \cap s\left( {Z,V} \right)} \right\}_m} + \mathbb{R} $$ If m = 0, and R is a finite set, knowing X·V and $$ {\left\{ {c\left( N \right) \cap s\left( {Z,V} \right)} \right\}_0} $$ gives a formula for the weighted number of points of R. This is the basis for applications of the excess intersection formula to enumerative geometry. In case Z is a (scheme-theoretic) connected component of X∩V, R is the union of the other connected components; since $$ {A_ * }\left( {X \cap V} \right) = {A_ * }\left( Z \right) \oplus {A_ * }\left( R \right) $$ the above decomposition is part of the construction of Chap. 6. Computations, applications, and a few of the many classical examples are considered in § 9.1. The general case is considered in § 9.2. In the main theorem Z is assumed to be a Cartier divisor on V; in this case there is a natural scheme structure on the residual set, which can be used to construct $$ \mathbb{R} $$ If Z is arbitrary, one blows up V along Z to reduce to the divisor case. An important and typical application of the residual intersection theorem is to the formula for the double point cycle class of a morphism, which is given in § 9.3.

Suggested Citation

  • William Fulton, 1998. "Excess and Residual Intersections," Springer Books, in: Intersection Theory, edition 0, chapter 0, pages 153-174, Springer.
  • Handle: RePEc:spr:sprchp:978-1-4612-1700-8_10
    DOI: 10.1007/978-1-4612-1700-8_10
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-1-4612-1700-8_10. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.