14.08.2013 Views

View PDF - Project Euclid

View PDF - Project Euclid

View PDF - Project Euclid

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

484 PHILLIP A. GRIFFITHS<br />

we use here that o/x, o mod toy). It follows that<br />

(4.26) q Ct%b{/ P,_ (f) modo<br />

where Pn- k(l)) is homogeneous of degree n k and invariant under<br />

Appealing again to the theory of unitary invariants (cf. footnote (5)) we deduce<br />

that P,_ () is a polynomial in c(2), ., c,_ (f).<br />

To determine which polynomial we may argue as follows: In G(n, N) x<br />

G(n k, N k, N) we consider that part I0 of the incidence correspondence<br />

lying over z 0. Denoting by the pullback to G(n k, N k, N) of the<br />

fundamental class of G(n- k, N) and by Cn-k(U) the Chern class of<br />

U---> G(n k,N- k,N),<br />

Cn- k(O) / H 2(n k + k(N- k))(/0)"<br />

Under the projection Io--- G(n, N), the Gysin image<br />

r.(Cn-(U) / ) H 2‘n- k)(G(n, N))<br />

is expressible as a polynomial in c(E), ., cn-(E), and this polynomial is<br />

just Pn- whose determination is consequently a topological question. Since<br />

our argument that Pn- CCn- (E) is messy and we have no need for the<br />

explicit form of the result the argument will be omitted.<br />

We<br />

.<br />

observe that since any polynomial in the quantities (4.25) gives an invariant<br />

differential form on G(n, N), an invariant-theoretic proof of (4.2 l) will<br />

require use of the additional property dO 0. For example, let us examine the<br />

terms 4) / 4- which might appear in Since by the structure equations<br />

(3.2)<br />

we deduce that<br />

(4.27)<br />

dba + -&b,<br />

d(ch//k h- l) (’0 "-[- ) / (11 --1 / (2--1--1) (1(2 (k- 1)(1)<br />

d(Q(12,t)) 0<br />

Writing<br />

q=( t=0<br />

c61/ b2- t/ Q(llz))+ (other terms)<br />

it follows recursively from (4.27) and dq 0 that

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!