27.08.2014 Views

Real and Complex Analysis (Rudin)

Real and Complex Analysis (Rudin)

Real and Complex Analysis (Rudin)

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.

326 REAL AND COMPLEX ANALYSIS<br />

Suppose u satisfies these conditions. Then (2) shows that 'If covers Yu' <strong>and</strong><br />

therefore Theorem 16.11 shows that both g, <strong>and</strong> gu are obtained by continuation<br />

of (f, D) along this same chain 'If. Hence g, = gu.<br />

Thus each tel is covered by a segment J, such that gu = g, for all u E<br />

I ('\ J,. Since I is compact, I is covered by finitely many J,; <strong>and</strong> since I is<br />

connected, we see in a finite number of steps that g1 = go.<br />

IIII<br />

Our next item is an intuitively obvious topological fact.<br />

16.14 Theorem Suppose r 0 <strong>and</strong> r 1 are curves in a topological space X, with<br />

common initial point IX <strong>and</strong> common end point fJ. If X is simply connected, then<br />

there exists a one-parameter family {y,} (O::s;; t ::s;; 1) of curves from IX to fJ in X,<br />

such that Yo = ro <strong>and</strong> Y1 = r 1•<br />

PROOF Let [0, n] be the parameter interval of r 0 <strong>and</strong> r l' Then<br />

(0 ::s;; s ::S;; n)<br />

(n ::S;; s ::S;; 2n)<br />

(1)<br />

defines a closed curve in X. Since X is simply connected, r is null-homotopic<br />

in X. Hence there is a continuous H: [0, 2n] x [0, 1] -+ X such that<br />

H(s, 0) = r(s), H(s, 1) = c E X, H(O, t) = H(2n, t).<br />

(2)<br />

If : 0 -+ X is defined by<br />

(rei~ = H(fJ, 1 - r)<br />

(0 ::S;; r ::S;; 1, 0 ::S;; fJ ::S;; 2n),<br />

(2) implies that is continuous. Put<br />

y,(fJ) = [(1 - t)e i9 + te- i '] (0 ::S;; fJ ::S;; n, 0 ::S;; t ::S;; 1).<br />

Since (ei~ = H(fJ, 0) = r(fJ), it follows that<br />

y,(O) = (1) = r(0) = IX (0 ::S;; t ::S;; 1),<br />

YAn) = ( -1) = r(n) = fJ (0 ::S;; t ::S;; 1),<br />

(0 ::S;; fJ ::S;; n)<br />

<strong>and</strong><br />

Y1(fJ) = (e-i~ = (ei (21t-9)) = r(2n - fJ) = r 1 (fJ)<br />

This completes the proof.<br />

(0 ::S;; fJ ::S;; n).<br />

IIII<br />

The Monodromy Theorem<br />

The preceding considerations have essentially proved the following important<br />

theorem.

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

Saved successfully!

Ooh no, something went wrong!