17.01.2013 Views

PDF (1016 kB)

PDF (1016 kB)

PDF (1016 kB)

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

5.23. Theorem. Assume that graphCΦ − (1) ∩ N ∗ W0 = (0) and graphCΦ + (1) ∩ N ∗ Wk = (0).<br />

Then for every p ∈]1, +∞[ theÊ-linear operator<br />

is bounded and Fredholm of index<br />

∂A : X 1,p<br />

S ,W (Σ,�n ) → X p<br />

S (Σ,�n ), u ↦→ ∂u + Au,<br />

ind∂A = µ(N ∗ W0, graphCΦ − ) − µ(N ∗ Wk, graphCΦ + )<br />

− 1<br />

k�<br />

(dimWj−1 + dimWj − 2 dimWj−1 ∩ Wj).<br />

2<br />

j=1<br />

Proof. Given u : Σ →�n define ũ : Σ →�2n by<br />

ũ(z) := (u(z/2), u(z/2 + i)).<br />

The map u ↦→ ũ determines a linear isomorphism<br />

F : X 1,p<br />

S ,W (Σ,�n ) ∼ =<br />

−→ X 1,p<br />

S ′ ,W ,W ′(Σ,�2n ),<br />

where S ′ = {2s1, . . . , 2sk, 2s1 + i, . . .,2sk + i}, W ′ is the (k + 1)-uple (∆Ên, . . . , ∆Ên), and we<br />

have used the identity<br />

The map v ↦→ ˜v/2 determines an isomorphism<br />

The composition G ◦ ∂A ◦ F −1 is the operator<br />

where<br />

Since<br />

∂ Ã<br />

we easily see that the solutions ˜ Φ ± of<br />

are given by<br />

The above formula implies<br />

For t = 1 we get<br />

N ∗ ∆Ên = graphC = {(w, w) | w ∈�n }.<br />

G : X p<br />

S (Σ,�n ) ∼ =<br />

−→ X p<br />

S ′(Σ,�2n ).<br />

: X1,p<br />

S ′ ,W ,W ′(Σ,�2n ) −→ X p<br />

S ′(Σ,�2n ), u ↦→ ∂u + Ãu,<br />

Ã(z) := 1<br />

(A(z/2) ⊕ CA(z/2 + i)C).<br />

2<br />

Ã(±∞, t) = 1<br />

(A(±∞, t/2) ⊕ CA(±∞, 1 − t/2)C),<br />

2<br />

d<br />

dt ˜ Φ ± (t) = i Ã(±∞, t)˜ Φ ± (t), ˜ Φ ± (0) = I,<br />

˜Φ ± (t) = Φ ± (t/2) ⊕ CΦ ± (1 − t/2)Φ(1) −1 C.<br />

˜Φ ± (t) −1 N ∗ ∆Ên = graphCΦ ± (1)Φ ± (1 − t/2) −1 Φ ± (t/2). (122)<br />

˜Φ − (1)N ∗ W0 ∩ N ∗ ∆Ên = ˜ Φ − (1)[N ∗ W0 ∩ graphCΦ − (1)] = (0),<br />

˜Φ + (1)N ∗ Wk ∩ N ∗ ∆Ên = ˜ Φ + (1)[N ∗ Wk ∩ graphCΦ + (1)] = (0),<br />

73

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

Saved successfully!

Ooh no, something went wrong!