In mathematics, and especially in algebraic geometry, the intersection number generalizes the intuitive notion of counting the number of times two curves intersect to higher dimensions, multiple (more than 2) curves, and accounting properly for tangency. One needs a definition of intersection number in order to state results like Bézout's theorem.
The intersection number is obvious in certain cases, such as the intersection of the x- and y-axes in a plane, which should be one. The complexity enters when calculating intersections at points of tangency, and intersections which are not just points, but have higher dimension. For example, if a plane is tangent to a surface along a line, the intersection number along the line should be at least two. These questions are discussed systematically in intersection theory.
Let X be a Riemann surface. Then the intersection number of two closed curves on X has a simple definition in terms of an integral. For every closed curve c on X (i.e., smooth function
c:S1\toX
ηc
\intc\alpha=-\iintX\alpha\wedgeηc=(\alpha,*ηc)
\alpha
where
\wedge
*
a ⋅ b:=\iintXηa\wedgeηb=(ηa,-*ηb)=-\intbηa
The
ηc
\Omega
\Omega\setminusc
\Omega+
\Omega-
\Omega0
- | |
\Omega | |
0 |
+ | |
\Omega | |
0 |
fc(x)=\begin{cases}1,&x\in
- | |
\Omega | |
0 |
\ 0,&x\inX\setminus\Omega-\ smoothinterpolation,&x\in\Omega-\setminus
- | |
\Omega | |
0 |
\end{cases}
The definition is then expanded to arbitrary closed curves. Every closed curve c on X is homologous to
N | |
\sum | |
i=1 |
kici
\intc\omega=
\int | |
\sumikici |
\omega=
N | |
\sum | |
i=1 |
ki
\int | |
ci |
\omega
\omega
Define the
ηc
ηc=
N | |
\sum | |
i=1 |
ki
η | |
ci |
The usual constructive definition in the case of algebraic varieties proceeds in steps. The definition given below is for the intersection number of divisors on a nonsingular variety X.
1. The only intersection number that can be calculated directly from the definition is the intersection of hypersurfaces (subvarieties of X of codimension one) that are in general position at x. Specifically, assume we have a nonsingular variety X, and n hypersurfaces Z1, ..., Zn which have local equations f1, ..., fn near x for polynomials fi(t1, ..., tn), such that the following hold:
n=\dimkX
fi(x)=0
\dimx
n | |
\cap | |
i=1 |
Zi=0
fi
Then the intersection number at the point x (called the intersection multiplicity at x) is
(Z1 … Zn)x:=\dimkl{O}X,/(f1,...,fn)
where
l{O}X,
k[U]ak{mx}
ak{m}x
2. The intersection number of hypersurfaces in general position is then defined as the sum of the intersection numbers at each point of intersection.
(Z1 … Zn)=
\sum | |
x\in\capiZi |
(Z1 … Zn)x
3. Extend the definition to effective divisors by linearity, i.e.,
(nZ1 … Zn)=n(Z1 … Zn)
((Y1+Z1)Z2 … Zn)=(Y1Z2 … Zn)+(Z1Z2 … Zn)
4. Extend the definition to arbitrary divisors in general position by noticing every divisor has a unique expression as D = P – N for some effective divisors P and N. So let Di = Pi – Ni, and use rules of the form
((P1-N1)P2 … Pn)=(P1P2 … Pn)-(N1P2 … Pn)
to transform the intersection.
5. The intersection number of arbitrary divisors is then defined using a "Chow's moving lemma" that guarantees we can find linearly equivalent divisors that are in general position, which we can then intersect.
Note that the definition of the intersection number does not depend on the order in which the divisors appear in the computation of this number.
Let V and W be two subvarieties of a nonsingular projective variety X such that dim(V) + dim(W) = dim(X). Then we expect the intersection V ∩ W to be a finite set of points. If we try to count them, two kinds of problems may arise. First, even if the expected dimension of V ∩ W is zero, the actual intersection may be of a large dimension: for example the self-intersection number of a projective line in a projective plane. The second potential problem is that even if the intersection is zero-dimensional, it may be non-transverse, for example, if V is a plane curve and W is one of its tangent lines.
The first problem requires the machinery of intersection theory, discussed above in detail, which replaces V and W by more convenient subvarieties using the moving lemma. On the other hand, the second problem can be solved directly, without moving V or W. In 1965 Jean-Pierre Serre described how to find the multiplicity of each intersection point by methods of commutative algebra and homological algebra.[1] This connection between a geometric notion of intersection and a homological notion of a derived tensor product has been influential and led in particular to several homological conjectures in commutative algebra.
l{O}X,
e(X;V,W;x)=
infty | |
\sum | |
i=0 |
(-1)ilengthA(\operatorname{Tor}
A(A/I, | |
i |
A/J))
If both V and W are locally cut out by regular sequences, for example if they are nonsingular, then in the formula above all higher Tor's vanish, hence the multiplicity is positive. The positivity in the arbitrary case is one of Serre's multiplicity conjectures.
The definition can be vastly generalized, for example to intersections along subvarieties instead of just at points, or to arbitrary complete varieties.
In algebraic topology, the intersection number appears as the Poincaré dual of the cup product. Specifically, if two manifolds, X and Y, intersect transversely in a manifold M, the homology class of the intersection is the Poincaré dual of the cup product
DMX\smileDMY
There is an approach to intersection number, introduced by Snapper in 1959-60 and developed later by Cartier and Kleiman, that defines an intersection number as an Euler characteristic.
Let X be a scheme over a scheme S, Pic(X) the Picard group of X and G the Grothendieck group of the category of coherent sheaves on X whose support is proper over an Artinian subscheme of S.
For each L in Pic(X), define the endomorphism c1(L) of G (called the first Chern class of L) by
c1(L)F=F-L-1 ⊗ F.
c1(L1)c1(L2)=c1(L1)+c1(L2)-c1(L1 ⊗ L2)
c1(L1)
c1(L2)
c1(L)c
-1 | |
1(L |
)=c1(L)+
-1 | |
c | |
1(L |
).
\dim\operatorname{supp}c1(L)F\le\dim\operatorname{supp}F-1
L1 ⋅ {...} ⋅ Lr
L1 ⋅ {...} ⋅ Lr ⋅ F=\chi(c1(L1) … c1(Lr)F)
L1 ⋅ {...} ⋅ Lr ⋅ F=
r | |
\sum | |
0 |
(-1)i\chi(\wedgei
r | |
( ⊕ | |
0 |
-1 | |
L | |
j |
) ⊗ F).
L1 ⋅ {...} ⋅ Lr ⋅ F
If Li = OX(Di) for some Cartier divisors Di's, then we will write
D1 ⋅ {...} ⋅ Dr
Let
f:X\toY
Li,1\lei\lem
m\ge\dim\operatorname{supp}F
*L | |
f | |
1 |
… f*Lm ⋅ F=L1 … Lm ⋅ f*F
There is a unique function assigning to each triplet
(P,Q,p)
P
Q
K[x,y]
p\inK2
Ip(P,Q)
P
Q
p
Ip(P,Q)=Ip(Q,P)
Ip(P,Q)=infty
P
Q
p
Ip(P,Q)=0
P(p)
Q(p)
p
Ip(x,y)=1
p=(0,0)
Ip(P,Q1Q2)=Ip(P,Q1)+Ip(P,Q2)
Ip(P+QR,Q)=Ip(P,Q)
R\inK[x,y]
Although these properties completely characterize intersection multiplicity, in practice it is realised in several different ways.
One realization of intersection multiplicity is through the dimension of a certain quotient space of the power series ring
K[[x,y]]
p=(0,0)
P(x,y)
Q(x,y)
z=1
I=(P,Q)
K[[x,y]]
P
Q
K[[x,y]]/I
K
Another realization of intersection multiplicity comes from the resultant of the two polynomials
P
Q
p=(0,0)
y=0
P
x
P
Ip(P,Q)
y
P
Q
P
Q
K[x]
Intersection multiplicity can also be realised as the number of distinct intersections that exist if the curves are perturbed slightly. More specifically, if
P
Q
U
(\epsilon,\delta)\inK2
P-\epsilon
Q-\delta
n
U
Ip(P,Q)=n
Consider the intersection of the x-axis with the parabola
y=x2
Writing
P=y,
Q=y-x2,
p=(0,0)
Ip(P,Q)=Ip(y,y-x2)=
2) | |
I | |
p(y,x |
=Ip(y,x)+Ip(y,x)=1+1=2.
Thus, the intersection multiplicity is two; it is an ordinary tangency. Similarly one can compute that the curves
y=xm
y=xn
m>n\geq0
n.
Some of the most interesting intersection numbers to compute are self-intersection numbers. This means that a divisor is moved to another equivalent divisor in general position with respect to the first, and the two are intersected. In this way, self-intersection numbers can become well-defined, and even negative.
The intersection number is partly motivated by the desire to define intersection to satisfy Bézout's theorem.
The intersection number arises in the study of fixed points, which can be cleverly defined as intersections of function graphs with a diagonals. Calculating the intersection numbers at the fixed points counts the fixed points with multiplicity, and leads to the Lefschetz fixed-point theorem in quantitative form.
. William Fulton . William Fulton (mathematician) . Algebraic Curves . Mathematics Lecture Note Series . W.A. Benjamin . 1974 . 0-8053-3082-8 . 74–83 .
. Robin Hartshorne . Robin Hartshorne . Algebraic Geometry . . 52 . 1977 . 0-387-90244-9 . Appendix A.
. William Fulton . William Fulton (mathematician) . Intersection Theory. Springer . 1998 . 2nd . 9780387985497 .