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.

124 B. STIELTJES INTEGRALS<br />

Def<strong>in</strong>ition B.5. Let f be a real-valued function def<strong>in</strong>ed on [a, b].<br />

Then the total variation of f over [a, b] is<br />

(B.1) V (f) = sup<br />

∆<br />

n<br />

|f(xk) − f(xk−1)|,<br />

k=1<br />

the supremum taken over all partitions ∆ = {x0, x1, . . . , xn} of [a, b].<br />

We have 0 ≤ V (f) ≤ +∞, and if V (f) is f<strong>in</strong>ite, we say that f has<br />

bounded variation on [a, b].<br />

When the <strong>in</strong>terval considered is not obvious from the context, one<br />

may write the total variation of f over [a, b] as V b<br />

a (f); another common<br />

notation is b<br />

|df|. As we mentioned above, a function of bounded<br />

a<br />

variation can also be characterized as a function which is the difference<br />

of two non-decreas<strong>in</strong>g functions.<br />

Theorem B.6.<br />

(1) The total variation V b<br />

a (f) is an <strong>in</strong>terval additive function, i.e.,<br />

if a < x < b we have V x<br />

a (f) + V b<br />

x (f) = V b<br />

a (f).<br />

(2) A function of bounded variation on an <strong>in</strong>terval [a, b] may be<br />

written as the difference of two non-decreas<strong>in</strong>g functions. Conversely,<br />

any such difference is of bounded variation.<br />

(3) If f is of bounded variation on [a, b], then there are nondecreas<strong>in</strong>g<br />

functions P and N, such that f(x) = f(a)+P (x)−<br />

N(x), called the positive and negative variation functions of f<br />

on [a, b], with the follow<strong>in</strong>g property: For any pair of nondecreas<strong>in</strong>g<br />

functions u, v for which f = u − v holds u(x) ≥<br />

u(a) + P (x) and v(x) ≥ v(a) + N(x) for a ≤ x ≤ b.<br />

Proof. It is clear that if a < x < b and ∆, ∆ ′ are partitions of<br />

[a, x] respectively [x, b], then ∆ ∪ ∆ ′ is a partition of [a, b]; the cor-<br />

respond<strong>in</strong>g sum is therefore ≤ V b<br />

a (f). Tak<strong>in</strong>g supremum over ∆ and<br />

then ∆ ′ it follows that V x<br />

a (f) + V b<br />

x (f) ≤ V b<br />

a (f). On the other hand,<br />

<strong>in</strong> calculat<strong>in</strong>g V b<br />

a (f), we may restrict ourselves to partitions ∆ con-<br />

ta<strong>in</strong><strong>in</strong>g x, s<strong>in</strong>ce add<strong>in</strong>g new po<strong>in</strong>ts can only <strong>in</strong>crease the sum (B.1). If<br />

∆ = {x0, . . . , xn} and x = xp we have p<br />

k=1 |f(xk) − f(xk−1)| ≤ V x<br />

a (f)<br />

respectively m<br />

k=p+1 |f(xk) − f(xk−1)| ≤ V b<br />

x (f). Tak<strong>in</strong>g supremum over<br />

all ∆ we obta<strong>in</strong> V b<br />

a (f) ≤ V x<br />

a (f) + V b<br />

x (f). The <strong>in</strong>terval additivity of the<br />

total variation follows.<br />

Sett<strong>in</strong>g T (x) = V x<br />

a (f) the function T is f<strong>in</strong>ite <strong>in</strong> [a, b]; it is called<br />

the total variation function of f over [a, b]. S<strong>in</strong>ce by <strong>in</strong>terval additivity<br />

T (y)−T (x) = V y<br />

x (f) ≥ |f(y)−f(x)| ≥ ±(f(y)−f(x)) if a ≤ x ≤ y ≤ b<br />

it also follows that T is non-decreas<strong>in</strong>g, as are P = 1(T<br />

+ f − f(a))<br />

2<br />

and N = 1(T<br />

− f + f(a)). But then f = (f(a) + P ) − N is a splitt<strong>in</strong>g<br />

2<br />

of f <strong>in</strong>to a difference of non-decreas<strong>in</strong>g functions. Note also that T =<br />

P + N. Conversely, if u and v are non-decreas<strong>in</strong>g functions on [a, b]

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

Saved successfully!

Ooh no, something went wrong!