06.01.2015 Views

The Real And Complex Number Systems

The Real And Complex Number Systems

The Real And Complex Number Systems

SHOW MORE
SHOW LESS

Create successful ePaper yourself

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

f x fx<br />

x<br />

So, let x y, wehave<br />

f x <br />

fx f0<br />

x 0<br />

f x f 0where 0, x. *<br />

gx gy g zx y, wherey z x<br />

f zz fz<br />

x y<br />

0by(*)<br />

which implies that g is an increasing function on 0, 1.<br />

5.18 Assume f has a finite derivative in a, b and is continuous on a, b with<br />

fa fb 0. Prove that for every real there is some c in a, b such that<br />

f c fc.<br />

Hint. Apply Rolle’s <strong>The</strong>orem to gxfx for a suitable g depending on .<br />

Proof: Consider gx fxe x , then by Rolle’s <strong>The</strong>orem,<br />

ga gb g ca b, wherec a, b<br />

0<br />

which implies that<br />

f c fc.<br />

z 2<br />

Remark: (1) <strong>The</strong> finding of an auxiliary function usually comes from the equation that<br />

we consider. We will give some questions around this to get more.<br />

(2)<strong>The</strong>re are some questions about finding auxiliary functions; we write it as follows.<br />

(i) Show that e e .<br />

Proof: (STUDY) Since log x is a strictly increasing on 0, , in order to show<br />

e e , it suffices to show that<br />

log e log e log e e log <br />

which implies that<br />

log e<br />

Consider fx logx<br />

x<br />

e<br />

: e, , wehave<br />

f x 1 log x<br />

x 2<br />

log <br />

.<br />

0wherex e, .<br />

So, we know that fx is strictly decreasing on e, . Hence,<br />

e e .<br />

(ii) Show that e x 1 x for all x R.<br />

loge<br />

e<br />

log<br />

<br />

.Thatis,<br />

Proof: By Taylor <strong>The</strong>orem with Remainder Term, we know that<br />

e x 1 x ec<br />

2 x2 ,forsomec.<br />

So, we finally have e x 1 x for all x R.<br />

Note: (a) <strong>The</strong> method in (ii) tells us one thing, we can give a theorem as follows. Let<br />

f C 2n1 a, b, andf 2n x exists and f 2n x 0ona, b. <strong>The</strong>n we have<br />

2n1<br />

fx f<br />

k<br />

a<br />

.<br />

k!<br />

k0

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

Saved successfully!

Ooh no, something went wrong!