• Keine Ergebnisse gefunden

3. Locality and the formal δ -function 49

3.7. The decomposition theorem

The next fact is known as thedecomposition theorem:

Theorem 3.13. Let U be anF-module. Let a(z,w) ∈ U

z,z1,w,w1 be a local U-valued formal distribution. Then, a(z,w) uniquely decomposes as a

sum

jN

cj(w)(wj)δ(z−w)

with cj(w)jN being a family of formal distributions cj(w) ∈ U

w,w1 having the property that all but finitely many j ∈Nsatisfy cj(w) =0.

The formal distributions cj(w)in this decomposition are given by

cj(w) =Res(z−w)ja(z,w)dz for all j∈ N. (52) Before we prove this theorem, let us show a lemma:

Lemma 3.14. Let U be an F-module. Let b(z,w) ∈ U

z,z1,w,w1 . As-sume that

Res(z−w)nb(z,w)dz=0 for all n ∈N. (53) (a)Then,b(z,w) ∈ U

w,w1 [[z]].

(b)Assume thatb(z,w) is local. Then,b(z,w) =0.

Proof of Lemma 3.14. We haveb(z,w) ∈U

z,z1,w,w1

= U

w,w1 z,z1 . Hence, we can writeb(z,w) in the form b(z,w) =

jZzjbj(w) for somebj(w) ∈ U

w,w1

. Consider thesebj(w). Every n∈ Nsatisfies

Res zn

|{z}

=((zw)+w)n

=n

k=0

n k

(zw)kwn−k

b(z,w)dz =

n k=0

n k

Res(z−w)kb(z,w)dz

| {z }

=0

(by (53), applied tokinstead ofn)

wnk =0.

Compared with Reszn b(z,w)

| {z }

=

j∈Zzjbj(w)

dz=Reszn

jZ

zjbj(w)dz =Res

jZ

zn+jbj(w)dz=bn1(w),

this yields that bn1(w) = 0 for every n ∈ N. In other words, bj(w) = 0 for every negative j∈ Z. Hence,

b(z,w) =

jZ

zjbj(w) =

jN

zjbj(w) +

jZ;

jis negative

zjbj(w)

| {z }

=0

=

jN

zjbj(w)

Uhh

w,w1ii [[z]].

This proves Lemma 3.14(a).

(b)Lemma 3.14(a)yieldsb(z,w) ∈ U

w,w1

[[z]]. But U

w,w1 [[z]]

is an F[z,w]-module, and the element z−w of F[z,w] acts as a non-zero-divisor on this module (i.e., every element α ∈ U

w,w1

[[z]] satisfies (z−w)α = 0 must itself satisfy α = 0) 44. But b(z,w) is local. In other words, (z−w)Nb(z,w) = 0 for some N ∈ N. Consider this N. We can can-cel the (z−w)N from the equality (z−w)Nb(z,w) = 0 (since z−w acts as a non-zero-divisor on the module U

w,w1

[[z]], andb(z,w) belongs to said module). As a result, we obtainb(z,w) =0. This proves Lemma 3.14(b).

Proof of Theorem 3.13. Uniqueness: Let us first show the uniqueness of the fam-ily cj(w)jN satisfying a(z,w) =

jNcj(w)(wj)δ(z−w). For this, we let cj(w)jN be any family of formal distributions cj(w) ∈ U

w,w1 hav-ing the property that all but finitely manyj ∈Nsatisfycj(w) = 0. Assume that a(z,w) =

jNcj(w)(wj)δ(z−w). We need to prove that (52) holds.

For everyn∈ N, we have

j

N

cj(w)Res (z−w)n(wj)δ(z−w)

| {z }

=

(wjn)δ(z−w), if n≤ j;

0, ifn> j

(by Proposition 3.12(b), applied tonandj instead ofmandn)

dz

=

jN

cj(w)Res (

(wjn)δ(z−w), ifn≤ j;

0, ifn >j dz

=

jN;

jn

cj(w) Res(wjn)δ(z−w)dz

| {z }

=δj−n,0

(by Proposition 3.12(a), applied tojninstead ofn)

=

jN;

jn

cj(w)δjn,0 =cn(w). (54)

Hence, for every j∈ N, we have Res(z−w)n a(z,w)

| {z }

=

j∈Ncj(w)(j)wδ(zw)

dz=

jN

cj(w)Res(z−w)n(wj)δ(z−w)dz

=cn(w).

44Proof.Actually, U

w,w−1

[[z]]is not just anF[z,w]-module, but also an F

w,w−1 [[z]] -module (sinceU

w,w−1

is anF

w,w−1

-module). The elementzwof F

w,w−1 [[z]]

is invertible (since zw = w zw−11

), and thus acts as a non-zero-divisor on the F

w,w−1

[[z]]-module U

w,w−1

[[z]], qed.

Renaming n as j and interchanging the two sides of this equality, we obtain precisely (52). Thus, (52) holds, and so the uniqueness of the family cj(w)jN is proven.

Existence: Now, we shall show that the family cj(w)jN defined by (52) actually satisfies a(z,w) =

jNcj(w)(wj)δ(z−w) and has the property that all but finitely many j∈ Nsatisfycj(w) =0.

Indeed, the latter property obviously holds (since a(z,w) is local). So it re-mains to prove that the family cj(w)jN defined by (52) satisfies

a(z,w) =

jN

cj(w)(wj)δ(z−w). (55) Consider this family cj(w)jN. Since a(z,w) is local, we know that every sufficiently high j ∈Nsatisfies (z−w)ja(z,w) =0, and therefore

every sufficiently high j∈ Nsatisfiescj(w) =0. (56) Thus, the sum ∑

jNcj(w)(wj)δ(z−w) is well-defined. We set b(z,w) = a(z,w)−

jN

cj(w)(wj)δ(z−w).

Then, our goal is to showb(z,w) =0 (because this will immediately yield (55)).

We know that a(z,w) is local. Also, for every j ∈ N, the formal distribution

(wj)δ(z−w) is local (since Proposition 3.12 (b) yields(z−w)j+1(wj)δ(z−w) = 0), and therefore the formal distributioncj(w)(wj)δ(z−w)is local as well. Hence, the sum ∑

jNcj(w)(wj)δ(z−w) is local as well (since it has only finitely many nonzero addends – due to (56) – and these addends are local). Thus, b(z,w) is local (since we have defined b(z,w) as a difference between the local formal distributionsa(z,w) and ∑

jNcj(w)(wj)δ(z−w)).

For everyn∈ N, we have

Res(z−w)n b(z,w)

| {z }

=a(z,w)−

j∈Ncj(w)(j)wδ(zw)

dz

=Res(z−w)na(z,w)dz

| {z }

=cn(w) (by (52), applied toj=n)

jN

cj(w)Res(z−w)n(wj)δ(z−w)dz

| {z }

=cn(w) (by (54))

=cn(w)−cn(w) =0.

Hence, Lemma 3.14(b)yieldsb(z,w) = 0 (sinceb(z,w)is local). This completes the proof of (55). Thus, the existence part of Theorem 3.13 is proven. The proof of Theorem 3.13 is thus complete.

For the next corollary, we shall use the notations of Section 2.7.

Corollary 3.15. Let U be an F-module. To every a = a(z,w) ∈ U

z,z1,w,w1

, let us associate theF-linear operator Da :Fh

w,w1i

→Uhh

w,w1ii , ϕ(w) 7→Resϕ(z)a(z,w)dz.

(a)For everyc(w) ∈Uw,w1 and jN, we have

Dc(w)(j)wδ(zw) =c(w)(wj) (57) as maps F

w,w1

→ U

w,w1

. (Here, c(w)(wj) means the operator

(wj), followed by multiplication with c(w).) In particular, if U = F, then Dδ(zw) =1 (the identity map, or, rather, the canonical inclusionF

w,w1

F

w,w1 ).

(b) Let a = a(z,w) ∈ U

z,z1,w,w1

. Prove that a(z,w) is local if and only if Da is a differential operator of finite order. (See Definition 2.22 for the definition of a differential operator of finite order.)

(c) Let a = a(z,w) ∈ U

z,z1,w,w1

be local. Then, show that a(w,z) is local and satisfies

Da(w,z) =Da(z,w)

. (58)

(See Definition 2.27 for the meaning of

Da(z,w)

.) (d)Let a =a(z,w) ∈U

z,z1,w,w1

. Show that

Dψ(w)a(z,w) =ψ(w)◦Da(z,w) for all ψ(w) ∈Fhw,w1i

; (59) Dwa(z,w) =w◦Da(z,w); (60) Dψ(z)a(z,w) = Da(z,w)ψ(w) for all ψ(z) ∈Fhz,z1i

; (61)

Dza(z,w) =−Da(z,w)w. (62) Proof of Corollary 3.15. (a) Let c(w) ∈ Uw,w1 and jN. Let ϕ(w) ∈ F

w,w1

. We write ϕ(w) in the form ϕ(w) =

mZϕmwm, where all ϕm be-long to F and all but finitely many of these ϕm are zero. Then, (wj)ϕ(w) =

mZ

m j

ϕmwmj (by the definition of (wj)).

Now,

Dc(w)(j)wδ(zw)(ϕ(w)) =Resϕ(z)c(w)(wj)δ(z−w)dz

by the definition of Dc

(w)(j)wδ(zw)

Before we start proving Proposition 3.15(b), let us show two auxiliary results:

• Everya =a(z,w) ∈ U

z,z1,w,w1

satisfies

D(zw)a(z,w) = [Da,w]. (63) Here,wdenotes the continuousF-linear map

U

z,z1,w,w1

→U

z,z1,w,w1

which sends every

b ∈ U

z,z1,w,w1

to w·b. (In analogy to Proposition 2.3, we should have called it Lw instead ofw, but the notationw is shorter.)]

Proof of (63): Let a = a(z,w) ∈ U

z,z1,w,w1

. Then, every ϕ(w) ∈ F

w,w1

satisfies D(zw)a(z,w)(ϕ(w))

=Resϕ(z) (z−w)a(z,w)dz

by the definition of D(zw)a(z,w)

=Resϕ(z)za(z,w)dz−wResϕ(z)a(z,w)dz

=Reszϕ(z)a(z,w)dz−wResϕ(z)a(z,w)dz. (64) Hence, every ϕ(w)∈ Fw,w1 satisfies

[Da,w]

| {z }

=DawwDa

(ϕ(w))

= (Da◦w−w◦Da) (ϕ(w)) = Da(wϕ(w))

| {z }

=Res(z)a(z,w)dz (by the definition ofDa)

−w Da(ϕ(w))

| {z }

=Resϕ(z)a(z,w)dz (by the definition ofDa)

=Reszϕ(z)a(z,w)dz−wResϕ(z)a(z,w)dz

=D(zw)a(z,w)(ϕ(w)) (by (64)).

In other words,[Da,w] = D(zw)a(z,w). This proves (63).

• If ana∈ U

z,z1,w,w1

satisfies Da =0, then

a =0. (65)

Proof of (65): Leta ∈U

z,z1,w,w1

be such thatDa =0. Writeain the forma =

(n,m)∈Z2an,mznwm with an,m ∈ U. Then, everyi∈ Zsatisfies Da

wi

=Reszi a(z,w)

| {z }

=a=

(n,m)∈Z2

an,mznwm

dz (by the definition of Da)

=Reszi

(n,m)∈Z2

an,mznwmdz =

mZ

ai1,mwm.

Hence, every i ∈ Z satisfies ∑

mZai1,mwm = Da

|{z}

=0

wi

= 0. Comparing coefficients in this equality, we conclude that everyi∈ Zandm∈ Zsatisfy ai1,m = 0. In other words, every (n,m) ∈ Z2 satisfy an,m = 0. Hence, a=0. This completes our proof of (65).

(b) =⇒: Assume that a(z,w) is local. Theorem 3.13 thus yields that a(z,w) can be written in the form

j

N

cj(w)(wj)δ(z−w)

with cj(w)jN being a family of formal distributions cj(w) ∈ U

w,w1 having the property that all but finitely many j∈ Nsatisfy cj(w) =0. Consider this cj(w)jN. Sincea(z,w) =

jNcj(w)(wj)δ(z−w), we have Da =

jN

Dcj(w)(j)wδ(zw)

| {z }

=cj(w)(j)w

(by (57), applied toc(w)=cj(w))

(since Da dependsF-linearly ona)

=

jN

cj(w)(wj). (66)

Thus, Da is a differential operator of finite order (since all but finitely many j ∈ Nsatisfy cj(w) =0). This proves the =⇒ direction of Proposition 3.15(b).

⇐=: Assume that Da is a differential operator of finite order. In other words, Da =

jNcj(w)(wj)for a family cj(w)jNof formal distributions inU

w,w1 with the property that all but finitely many j ∈ N satisfy cj(w) = 0. Consider this family cj(w)jN.

Let us define theF-linear map w : U

z,z1,w,w1

→ U

z,z1,w,w1 as in (63). We have

h w,(wn)

i

=−(wn1) for everyn∈ N. (67)

45

All but finitely manyj ∈ Nsatisfy cj(w) =0. Thus, there exists a J ∈ Nsuch that every j∈ Nsatisfying j ≥ J satisfies cj(w) =0. Consider this J. Then,

Da =

jN

cj(w)(wj) =

J1 j

=0

cj(w)(wj) (68)

45Indeed, this is similar to Proposition 2.3; there are only two differences:

We now have two variables z and w instead of a single variable z. But this does not change much because only the variable w is “active”. (If we identify U

z,z−1,w,w−1

with U

z,z−1 w,w−1

, then we are back in the single-variable case.)

We are now denoting bywthe map that would be denoted by Lwin the terminology of Proposition 2.3.

These two differences are insubstantial, and the proof of Proposition 2.3 can be easily adapted to prove (67).

(by the definition of J). We are going to prove that(z−w)Ja(z,w) = 0.

Indeed, let us show that D(zw)ka(z,w) =

J1 j

=k

cj(w)(wjk) for everyk ∈ N (69) (where any sum whose lower limit is larger than its upper limit is understood to be empty).

Proof of (69): We shall prove (69) by induction overk.

Induction base: For k = 0, the equality (69) follows immediately from (68).

Thus, the induction base is complete.

Induction step: Let K∈ N. Assume that (69) holds fork =K. We need to show

In other words, (69) holds for k = K+1. This completes the induction step.

Thus, (69) is proven.

Thus, (65) (applied to(z−w)Ja(z,w)instead ofa) yields that(z−w)J a(z,w) = 0. Hence,a(z,w)is local. This proves the ⇐=direction of Proposition 3.15(b).

(c)Clearly, a(w,z) is local.46 It remains to prove that Da(w,z) =Da(z,w)

. In other words, it remains to prove that Da(w,z) = (Da) (sincea(z,w) = a).

Theorem 3.13 yields thata(z,w)can be written in the form

j

N

cj(w)(wj)δ(z−w)

with cj(w)jN being a family of formal distributions cj(w) ∈ U

w,w1 having the property that all but finitely many j∈ Nsatisfy cj(w) =0. Consider this cj(w)jN. Theorem 3.13 furthermore shows that thesecj(w)are given by (52).

We havea(z,w) =

jNcj(w)(wj)δ(z−w). Renaming the indeterminateszand wasw andz in this equality, we obtain

a(w,z) =

jN

cj(z)(zj) δ(w−z)

| {z }

=δ(zw) (by Proposition 3.12(c))

=

jN

cj(z) (zj)δ(z−w)

| {z }

=(−1)j(j)w δ(zw) (by Proposition 3.12(e))

=

jN

cj(z) (−1)j(wj)δ(z−w) =

jN

(−1)j cj(z)(wj)

| {z }

=(j)w cj(z)

(sincecj(z)is a polynomial inz and thus commutes with(j)w)

δ(z−w)

=

jN

(−1)j(wj)

cj(z)δ(z−w).

From (66), we have Da =

jN

cj(w)(wj), so that (Da) =

jN

(−1)j(wj)cj(w).

46Proof.We know thata(z,w)is local. Thus, there exists anNNsuch that(zw)Na(z,w) = 0. Consider thisN. Switching the indeterminateszandwin(zw)Na(z,w) =0, we obtain (wz)Na(w,z) = 0. Hence, (zw)N

| {z }

=(−1)N(w−z)N

a(w,z) = (−1)N(wz)Na(w,z)

| {z }

=0

= 0. Thus, a(w,z)is local, qed.

Now, for every ϕ(w) ∈Fw,w1

, we have Da(w,z)(ϕ(w))

=Resϕ(z) a(w,z)

| {z }

=

j∈N(−1)j(j)w(cj(z)δ(zw))

dz

by the definition of Da(w,z)

=Resϕ(z)

jN

(−1)j(wj)

cj(z)δ(z−w)

! dz

=

jN

(−1)jResϕ(z)(wj)

cj(z)δ(z−w)dz

| {z }

=(j)w Resϕ(z)cj(z)δ(zw)dz (since both multiplication withϕ(z)and

the mapq7→Resqdzcommute with(j)w)

=

jN

(−1)j(wj)Resϕ(z)cj(z)δ(z−w)dz

| {z }

=Resδ(zw)ϕ(z)cj(z)dz

=ϕ(w)cj(w)

(by Proposition 3.6(c), applied toϕ(z)cj(z)instead ofa(z))

=

jN

(−1)j(wj)

ϕ(w)cj(w)=

jN

(−1)j(wj)cj(w)

!

| {z }

=(Da)

(ϕ(w)) = (Da)(ϕ(w)).

Hence,Da(w,z) = (Da). This completes the proof of Proposition 3.15(c).

(d) Proof of (59): For every ψ(w) ∈ Fw,w1

and ϕ(w) ∈ Fw,w1 , we have

Dψ(w)a(z,w)(ϕ(w)) =Resϕ(z)ψ(w)a(z,w)dz

by the definition of Dψ(w)a(z,w)

=ψ(w) Resϕ(z)a(z,w)dz

| {z }

=Da(z,w)(ϕ(w)) (by the definition ofDa(z,w))

=ψ(w)Da(z,w)(ϕ(w))

=ψ(w)◦Da(z,w)

(ϕ(w)). This yields (59).

Proof of (60): For every ϕ(w) ∈Fw,w1

, we have Dwa(z,w)(ϕ(w)) =Resϕ(z)wa(z,w)dz

by the definition of Dwa(z,w)

=w Resϕ(z)a(z,w)dz

| {z }

=Da(z,w)(ϕ(w)) (by the definition ofDa(z,w))

(since the mapq 7→Resqdzcommutes with w)

=wDa(z,w)(ϕ(w)) =w◦Da(z,w)

(ϕ(w)). This yields (60).

Proof of (61): For every ϕ(w) ∈Fw,w1

, we have Dψ(z)a(z,w)(ϕ(w)) = Resϕ(z)ψ(z)a(z,w)dz

by the definition ofDψ(w)a(z,w)

=Da(z,w)(ϕ(w)ψ(w)) by the definition of Da(z,w)

=Da(z,w)(ψ(w)ϕ(w)) = Da(z,w)ψ(w)(ϕ(w)). This yields (61).

Proof of (62): For every ϕ(w) ∈Fw,w1

, we have Dza(z,w)(ϕ(w)) =Resϕ(z)za(z,w)dz

by the definition of Dza(z,w)

=−Resz(ϕ(z))a(z,w)dz

| {z }

=Da(z,w)(w(ϕ(w))) (by the definition ofDa(z,w))

by (28), applied toU

w,w1

, ϕ(z) and a(z,w) instead ofU, g and f

=−Da(z,w)(w(ϕ(w))) =−Da(z,w)w

(ϕ(w)). This yields (62).