06.04.2013 Views

Spectral Theory in Hilbert Space

Spectral Theory in Hilbert Space

Spectral Theory in Hilbert Space

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.

B. STIELTJES INTEGRALS 123<br />

Note that Theorem B.3 is a statement about the Riemann-Stieltjes<br />

<strong>in</strong>tegral; for more general (Lebesgue-Stieltjes) <strong>in</strong>tegrals it is not true<br />

without further assumptions about f and g. The reason is that the<br />

Riemann-Stieltjes <strong>in</strong>tegrals can not exist if f and g have discont<strong>in</strong>uities<br />

<strong>in</strong> common (Exercise B.4), whereas the Lebesgue-Stieltjes <strong>in</strong>tegrals exist<br />

as soon as f and g are, for example, both monotone. In such a case<br />

the <strong>in</strong>tegration by parts formula only holds under additional assumptions,<br />

for example if f is cont<strong>in</strong>uous to the right and g to the left <strong>in</strong> any<br />

common po<strong>in</strong>t of discont<strong>in</strong>uity, or if both f and g are normal, i.e., their<br />

values at po<strong>in</strong>ts of discont<strong>in</strong>uity are the averages of the correspond<strong>in</strong>g<br />

left and right hand limits.<br />

So far we don’t know that any function is <strong>in</strong>tegrable with respect<br />

to any other (except for g(x) = x which is the case of the Riemann<br />

<strong>in</strong>tegral).<br />

Theorem B.4. If g is non-decreas<strong>in</strong>g on [a, b], then every cont<strong>in</strong>uous<br />

function f is <strong>in</strong>tegrable with respect to g and we have<br />

b<br />

<br />

f dg ≤ max|f|(g(b)<br />

− g(a)).<br />

[a,b]<br />

a<br />

Proof. Let ∆ ′ and ∆ ′′ be partitions a = x ′ 0 < x ′ 1 < · · · < x ′ m = b<br />

and a = x ′′<br />

0 < x ′′<br />

1 < · · · < x ′′ n = b of [a, b] and consider the correspond<strong>in</strong>g<br />

Riemann-Stieltjes sums s ′ = m<br />

k=1 f(ξ′ k )(g(x′ k ) − g(x′ k−1 )) and s′′ =<br />

n<br />

k=1 f(ξ′′<br />

k )(g(x′′<br />

k )−g(x′′<br />

k−1 )). If we <strong>in</strong>troduce the partition ∆ = ∆′ ∪∆ ′′ ,<br />

suppos<strong>in</strong>g it to be a = x0 < x1 < · · · < xp = b, we can write<br />

s ′ − s ′′ p<br />

= (f(ξ ′ kj ) − f(ξ′′ qj ))(g(xj) − g(xj−1))<br />

j=1<br />

where kj = k for all j for which [xj−1, xj] ⊂ [x ′ k−1 , x′ k ] and qj = k for<br />

all j for which [xj−1, xj] ⊂ [x ′′<br />

k−1 , x′′ k ] (check this carefully!). Thus, for<br />

all j, ξ ′ kj and xj are <strong>in</strong> the same sub<strong>in</strong>terval of the partition ∆ ′ , and<br />

ξ ′′<br />

qj and xj <strong>in</strong> the same sub<strong>in</strong>terval of the partition ∆ ′′ . It follows that<br />

|ξ ′ − ξ′′ kj qj | ≤ |ξ′ kj − xj| + |ξ ′′<br />

qj − xj| ≤ |∆ ′ | + |∆ ′′ | for all j. S<strong>in</strong>ce f<br />

is uniformly cont<strong>in</strong>uous on [a, b], this means that given ε > 0, then<br />

|f(ξ ′ ) − f(ξ′′<br />

kj qj )| ≤ ε if |∆′ | and |∆ ′′ | are both small enough. It follows<br />

that |s ′ −s ′′ | ≤ ε p j=1 |g(xj)−g(xj−1| = ε(g(b)−g(a)) for small enough<br />

|∆ ′ | and |∆ ′′ |. Thus f is <strong>in</strong>tegrable with respect to g accord<strong>in</strong>g to<br />

Proposition B.1. We also have |s ′ | ≤ n k=1 |f(ξ′ k )||g(x′ k ) − g(x′ k−1 )| ≤<br />

max|f|(g(b) − g(a)) so the proof is complete. <br />

As a generalization of Theorem B.4 we may of course take g to be<br />

any function which is the difference of two non-decreas<strong>in</strong>g functions.<br />

Such a function is called a function of bounded variation. We shall<br />

briefly discuss such functions; the ma<strong>in</strong> po<strong>in</strong>t is that they are characterized<br />

by hav<strong>in</strong>g f<strong>in</strong>ite total variation.

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

Saved successfully!

Ooh no, something went wrong!