Professional Documents
Culture Documents
Fulltext01 PDF
Fulltext01 PDF
Fulltext01 PDF
Martin Lind
Mathematics
C-level thesis
Date: 2006-01-30
Supervisor: Viktor Kolyada
Examiner: Thomas Martinsson
1
Contents
Introduction 1
1 Monotone functions 3
3 Jump functions 29
2
1 Monotone functions
The properties of monotone functions will be useful to us because later we
shall see that some of them can be extended directly to the functions of
bounded variation. First a definition:
If the interval [a, b] can be divided into a finite number of intervals such that
f is monotone on each of them then f is said to be piecewise monotone on
[a, b]. The following theorem is given in [2], we refer to it for a proof.
Definition 1.0.3 Let f : [a, b] → R be monotone on [a, b] and let c ∈ [a, b].
σc+ = f (c + 0) − f (c)
σc− = f (c) − f (c − 0)
1
We denote the right-hand and left-hand limits
lim f (c + h) = f (c + 0) lim f (c − h) = f (c − 0)
h→0 h→0
3
(iii) If c ∈ [a, b] we define the jump of f at c to be
+
σc + σc− if c ∈ (a, b)
σc = σ+ if c = a
c−
σc if c = b
Theorem 1.0.4 [2, p. 96]. Let f : [a, b] → R be monotone on [a, b] and let
D be the set of all points of discontinuity of f . Then D is at most countable.
D = {x ∈ [a, b] : σx > 0}
For any given n ∈ N take points x1 , x2 , ..., xn satisfying a ≤ x1 < x2 < ... <
xn ≤ b. For 0 ≤ j ≤ n take points tj such that
So if Dk = {x : σx ≥ (f (b)
S∞− f (a))/k} then Dk can have at most k ele-
ments. Furthermore, D = k=1 Dk and since every Dk is finite D is at most
countable.
4
2 Functions of bounded variation
2.1 General properties
Let f : [a, b] → R beP
a function and Π = {x0 , x1 , ..., xn } a partition of [a, b].
We denote VΠ (f ) = n−1
k=0 |f (xk+1 ) − f (xk )| and set
Vab (f ) = sup VΠ (f )
Π
where the supremum is taken over all partitions of [a, b]. We clearly have
0 ≤ Vab (f ) ≤ ∞. The quantity Vab (f ) is called the total variation of f over
[a, b].
Definition 2.1.1 A function f : [a, b] → R is said to be of bounded vari-
ation on [a, b] if Vab (f ) is finite. If f is of bounded variation on [a, b] we
write f ∈ V [a, b].
Occasionally we shall say that a function is of bounded variation, leaving out
the specification of interval, when the interval in question is clear.
We shall state and prove some important properties of functions of bounded
variation and their total variation but first we need a theorem concerning
refinements of partitions.
Theorem 2.1.2 Let f : [a, b] → R be a function and Π any partition of
[a, b]. If Π0 is any refinement of Π then VΠ (f ) ≤ VΠ0 (f ).
Proof: Since any refinement of Π can be obtained by adding points to Π
one at a time it’s enough to prove the theorem in the case when we add just
one point. Take Π = {x0 , x1 , ..., xn } and add the point c to Π and denote
the result Π0 . Assume that xj < c < xj+1 for some 0 ≤ j ≤ n − 1, then the
triangle inequality gives that
|f (xj+1 ) − f (xj )| = |f (xj+1 ) − f (c) + f (c) − f (xj )|
≤ |f (xj+1 ) − f (c)| + |f (c) − f (xj )|
and hence
n−1
X
VΠ (f ) = |f (xk+1 ) − f (xk )|
k=0
n−1
X
= |f (xj+1 ) − f (xj )| + |f (xk+1 ) − f (xk )|
k=0,k6=j
n−1
X
≤ |f (xj+1 ) − f (c)| + |f (c) − f (xj )| + |f (xk+1 ) − f (xk )|
k=0,k6=j
= VΠ0 (f )
5
The theorem above assures us that adding points to a partition Π will only
make the sum VΠ (f ) larger or perhaps leave it unchanged, a useful fact that
we shall use in the proof of the following theorem, given in [1].
Proof: Assume that f ∈ V [a, b]. We will show that f ∈ V [a, c], the proof
is similar to prove that f ∈ V [c, b]. Take an arbitrary partition Π of [a, c]
and add the point b to Π and denote the result Π0 , which is a partition of
[a, b]. We then have
Since Vab (f ) is finite, the sums VΠ (f ) are bounded above and thus supΠ VΠ (f )
is finite, that is f ∈ V [a, c].
Now assume that f ∈ V [a, c] and f ∈ V [c, b]. Let Π be any partition of [a, b].
Add the point c to Π and denote the result Π1 . Then Π1 = Π0 ∪ Π00 where
Π0 is a partition of [a, c] and Π00 is a partition of [c, b]. Then we have
and since both Vac (f ) and Vcb (f ) are finite the sums VΠ (f ) are bounded above
and thus f ∈ V [a, b] and Vab (f ) ≤ Vac (f ) + Vcb (f ).
Now we take any two partitions Π0 and Π00 of [a, c] and [c, b] respectively and
let Π be the union of Π0 and Π00 , then Π is a partition of [a, b]. We have
and thus VΠ0 (f ) ≤ Vab (f ) − VΠ00 (f ). For any fixed partition Π00 of [c, b] the
number Vab (f ) − VΠ00 (f ) is an upper bound for the sums VΠ0 (f ) and therefore
Vac (f ) ≤ Vab (f ) − VΠ00 (f ). This is equivalent to VΠ00 (f ) ≤ Vab (f ) − Vac (f ) and
thus Vab (f ) − Vac (f ) is an upper bound for the sums VΠ00 (f ) and therefore
Vcb (f ) ≤ Vab (f ) − Vac (f ) whence Vac (f ) + Vcb (f ) ≤ Vab (f ). But then we must
have Vab (f ) = Vac (f ) + Vcb (f ).
6
The following two theorems are given in [1] and are straightforward to prove
and therefore their proofs are omitted.
Theorem 2.1.4 [1, p. 120]. Let f, g : [a, b] → R be of bounded variation on
[a, b]. Then (f + g) ∈ V [a, b] and Vab (f + g) ≤ Vab (f ) + Vab (g).
Proof: We will give the proof in the case when f is increasing, it is similar
when f is decreasing. Let f be increasing on [a, b], then |f (b) − f (a)| =
f (b) − f (a). Take an arbitrary partition Π = {x0 , x1 , ..., xn } of [a, b]. Since
f is increasing we have |f (xk+1 ) − f (xk )| = f (xk+1 ) − f (xk ) and hence
n−1
X n−1
X
VΠ (f ) = |f (xk+1 ) − f (xk )| = (f (xk+1 ) − f (xk )) = f (b) − f (a)
k=0 k=0
Combining the theorem above with theorem 2.1.3 we see that any piecewise
monotone function defined on a compact interval is of bounded variation.
However, the converse is certainly not true. Indeed, there exists functions of
bounded variation that aren’t monotone on any subinterval.
Even so, functions of bounded variation can be characterized in terms of
monotone functions, as the following theorem due to Jordan shows.
Theorem 2.1.7 (Jordan’s theorem) [1, p. 121]. Let f : [a, b] → R, f
is of bounded variation if and only if f is the difference of two increasing
functions.
Proof: Assume that f ∈ V [a, b] and let v(x) = Vax (f ), x ∈ (a, b] and
v(a) = 0. Then clearly f (x) = v(x) − [v(x) − f (x)]. We will show v(x) and
v(x) − f (x) are increasing. For any x1 < x2 we have
v(x2 ) − v(x1 ) = Vxx12 (f ) ≥ 0 ⇔ v(x2 ) ≥ v(x1 )
so v(x) is increasing. Furthermore,
7
f (x2 ) − f (x1 ) ≤ |f (x2 ) − f (x1 )| ≤ Vxx12 (f ) = v(x2 ) − v(x1 )
⇔ v(x1 ) − f (x1 ) ≤ v(x2 ) − f (x2 )
and thus v(x) − f (x) is increasing.
Conversely, suppose that f (x) = g(x) − h(x) with g and h increasing. Since
h is increasing −h is decreasing and thus f (x) = g(x) + (−h(x)) is the sum of
two monotone functions so theorem 2.1.6 together with theorem 2.1.4 gives
that f ∈ V [a, b]
Since any function of bounded variation can be written as the sum of two
monotone functions many of the properties of monotone functions are inher-
ited by functions of bounded variation. If f ∈ V [a, b], then
• The limits f (c + 0) and f (c − 0) exists for any c ∈ (a, b).
• The set of points where f is discontinuous is at most countable.
We shall return to these facts later on.
The following two problems demonstrate how one can use the theorems given
above in computations.
Solution: The proof of Jordans theorem shows that the functions v(x) −
f (x) and v(x) will do, so the problem is to determine v(x). Divide [0, 2π]
into four subintervals I1 = [0, π2 ], I2 = [ π2 , π], I3 = [π, 3π
2
] and I4 = [ 3π
2
, 2π].
The function f (x) decreases from 0 to 1 on I1 and I3 and increases from 0
to 1 on I2 and I4 , so the total variation of f over any of these subintervals is
1. To determine V0x (f ) we need to study separate cases depending on which
interval x lies in. To demonstrate the principle, assume that x ∈ I3 , then
π
V0x (f ) = V02 (f ) + V ππ (f ) + |f (x) − f (π)|
2
= 1 + 1 + | cos2 x − 1| = 3 − cos2 x
8
V0x (f ) = | − x2 − 0| = x2
To determine V01 (f ), let Π = {x0 , ..., xn } be any partition of [0, 1] and consider
VΠ (f ). We have
n−1
X
VΠ (f ) = |f (xk+1 ) − f (xk )|
k=0
n−2
X
= |f (xk+1 ) − f (xk )| + |f (1) − f (xn−1 )|
k=0
n−2
X
= (x2k+1 − x2k ) + x2n−1 = 2x2n−1
k=0
n−1
X
VΠ (f ) = |f (xk+1 ) − f (xk )|
k=0
n−1
X
= |f (x1 ) − f (x0 )| + |f (xk+1 ) − f (xk )|
k=1
= |1 − 0| = 1
9
Clearly VΠ (f ) is independent of the partition Π, so V1x (f ) = 1 and thus
V0x (f ) = 3 , x ∈ (1, 2]. Hence
2
x 0≤x<1
V0x (f ) = 2 x=1
3 1<x≤2
10
2.2 Positive and negative variation
For any a ∈ R set
a+ + a− = |a| (1)
a+ − a− = a (2)
(α + β)+ ≤ α+ + β + (3)
Let f : [a, b] → R and Π = {x0 , x1 , ..., xn } any partition of [a, b]. Denote
n−1
X n−1
X
PΠ (f ) = +
[f (xk+1 ) − f (xk )] and QΠ (f ) = [f (xk+1 ) − f (xk )]−
k=0 k=0
and set
Pab (f ) = sup PΠ (f ) and Qba (f ) = sup QΠ (f )
Π Π
Problem 2.2.1 If one of the magnitudes Pab (f ), Qba (f ) and Vab (f ) is finite
then so are the two others.
11
Hence Pab (f ) is finite if and only if Qba (f ) is finite.
Suppose that Vab (f ) is finite. For any partition Π of [a, b] we have
PΠ (f ) + QΠ (f ) = VΠ (f ) ≤ Vab (f ) and since PΠ (f ) ≥ 0 and QΠ (f ) ≥ 0 we
also have PΠ (f ) ≤ Vab (f ) and QΠ (f ) ≤ Vab (f ) whence it follows that Pab (f )
and Qba (f ) is finite.
Suppose now that one of Pab (f ), Qba (f ) is finite, then the other one is finite
as well. Then, for any partition Π
VΠ (f ) = PΠ (f ) + QΠ (f ) ≤ Pab (f ) + Qba (f )
and thus
n−1
X
PΠ (f ) = [f (xk+1 ) − f (xk )]+
k=0
n−1
X
= [f (xj+1 ) − f (xj )]+ + [f (xk+1 ) − f (xk )]+
k=0,k6=j
n−1
X
+ +
≤ [f (xj+1 ) − f (c)] + [f (c) − f (xj )] + [f (xk+1 ) − f (xk )]+
k=0,k6=j
= PΠ0 (f )
12
With the useful additivity property established we consider the following
problem.
Thus
x 4x3 − 3x4 + 80 x ∈ [−2, 1]
V−2 (f ) =
82 − 4x3 + 3x4 x ∈ (1, 2]
13
We shall finish this section with another characterization of functions of
bounded variation.
Problem 2.2.4 Let f be defined on [a, b]. Then f ∈ V [a, b] if and only if
there exists an increasing function ϕ on [a, b] such that
Proof: Suppose that f ∈ V [a, b]. We take ϕ(x) = Vax (f ), this function is
increasing and for any a ≤ x0 < x00 ≤ b we have
00
ϕ(x00 ) − ϕ(x0 ) = Vxx0 (f ) ≥ |f (x00 ) − f (x0 )| ≥ f (x00 ) − f (x0 )
14
2.3 Conditions for bounded variation
We know that piecewise monotone functions and any function that can be
expressed as the difference of two increasing functions are of bounded vari-
ation. In this section we shall give some additional conditions which will
guarantee that a function is of bounded variation.
Definition 2.3.1 Let f : [a, b] → R, f is said to satisfy a Lipschitz con-
dition if there exists a constant M > 0 such that for every x, y ∈ [a, b] we
have
|f (x) − f (y)| ≤ M |x − y|
Proof: Suppose that |f (x) − f (y)| ≤ K|x − y| for every x, y ∈ [a, b]. Take
an arbitrary partition Π = {x0 , x1 , ..., xn } of [a, b]. Then
n−1
X n−1
X
VΠ (f ) = |f (xk+1 ) − f (xk )| ≤ K|xk+1 − xk | = K(b − a)
k=0 k=0
Since Π was arbitrary the inequality above is valid for any partition, which
means that the sums VΠ (f ) are bounded above by K(b − a) whence it follows
that f ∈ V [a, b] and Vab (f ) ≤ K(b − a).
Proof: For any x, y ∈ [a, b] we have f (x) − f (y) = f 0 (c)(x − y) for some c
between x and y according to the Mean value theorem. Hence
|f (x) − f (y)| = |f 0 (c)||x − y| ≤ M |x − y|
for any x, y ∈ [a, b], that is f satisfies a Lipschitz condition on [a, b] with
constant M and thus Theorem 2.3.2 gives the result.
15
Solution: For any x ∈ (0, 1] the function f (x) has the derivative
3 √ π √
f 0 (x) = x1/2 cos(π/ x) + sin(π/ x)
2 2
and in the point 0 the derivative
f (x) − f (0) √
f 0 (0) = lim = lim x1/2 cos(π/ x) = 0
x→0 x−0 x→0
So let Π be a partition of [a, b] with d(Π) < δ. According to the Mean Value
theorem |f (xk+1 )−f (xk )| = |f 0 (tk )|(xk+1 −xk ) for some tk ∈ (xk , xk+1 ) Hence
n−1
X n−1
X
VΠ (f ) = |f (xk+1 ) − f (xk )| = |f 0 (tk )|(xk+1 − xk )
k=0 k=0
16
The right hand side is a Riemann sum S(|f 0 |, Π) and since d(Π) < δ we have
I − < VΠ (f ) < I + ⇒ I − < Vab (f ) whence I ≤ Vab (f ) since is
arbitrary. Further, for any partition Π = {x0 , x1 , ..., xn } we have
n−1
X n−1 Z xk+1
X
VΠ (f ) = |f (xk+1 ) − f (xk )| = | f 0 (x)dx|
k=0 k=0 xk
n−1
X Z xk+1 Z b
≤ |f 0 (x)|dx = |f 0 (x)|dx
k=0 xk a
17
Solution: For any x ∈ (0, 1] the function f (x) has the derivative
3√ π
f 0 (x) = x cos(π/x) + √ sin(π/x)
2 x
For any 0 < a < 1 the function |f 0 (x)| is continuous on [a, 1] and thus
f ∈ V [a, 1] and the total variation of f over [a, 1] is given by
Z 1
1
Va (f ) = |f 0 (x)|dx
a
Furthermore
3√ π 3√ π
|f 0 (x)| = | x cos(π/x) + √ sin(π/x)| ≤ x+ √
2 x 2 x
so it follows that
1 1
3√
Z Z
0 π
Va1 (f ) = |f (x)|dx ≤ ( x + √ )dx < 1 + 2π
a a 2 x
18
2.4 The function v(x)
In the proof of Jordans theorem we introduced the function of total variation,
v(x) = Vax (f ). In this section we shall study some properties of this function,
more specifically continuity and differentiability.
The following theorem is given in [1]:
Theorem 2.4.1 [1, p. 125]. Let f ∈ V [a, b], then v(x) is continuous at a
point c if and only if f (x) is continuous at c.
Instead of proving 2.4.1 we shall give a result that is a bit stronger:
Problem 2.4.2 Let f ∈ V [a, b], then for any x ∈ (a, b) we have
Proof: We shall prove the first equality, the proof of the second one is
similar.
Take a fixed but arbitrary x0 ∈ (a, b) and set L = |f (x0 + 0) − f (x0 )|
Given > 0, there exists a δ > 0 such that x0 < x < x0 + δ ⇒
L− < |f (x) − f (x0 )| < L +
2 2
Let Π = {x0 , x1 , ..., xn } be a partition of [x0 , b] such that
The point x1 can be treated as an arbitrary point satisfying x0 < x1 < x0 +δ.
Now set Π0 = Π \ {x0 }, clearly Π0 is a partition of [x1 , b] and we have
Furthermore,
VΠ (f ) − VΠ0 (f ) ≥ (Vxb0 (f ) − 2 ) − VΠ0 (f )
≥ Vxb0 (f ) − Vxb1 (f ) − 2
= Vxx01 (f ) − 2
= Vax1 (f ) − Vax0 (f ) − 2
= v(x1 ) − v(x0 ) − 2
19
But we also have that |f (x1 ) − f (x0 )| ≤ Vxx01 (f ) = v(x1 ) − v(x0 )
⇒ L − 2 < v(x1 ) − v(x0 ) ⇒ L − < v(x1 ) − v(x0 )
Since we regard the point x1 as an arbitrary point satisfying x0 < x1 < x0 + δ
we have
x0 < x < x0 + δ ⇒ L − < v(x) − v(x0 ) < L +
and hence v(x0 + 0) − v(x0 ) = L
We shall proceed to study how the differentiability of the function v(x) is
related to that of f (x).
Problem 2.4.3 If f has a continuous derivative on [a, b], then the function
v(x) is differentiable and has a continuous derivative on [a, b].
ϕ(x) 2
lim =
x→∞ x π
Proof: For any n ∈ N
Z nπ n−1 Z
X (k+1)π
ϕ(nπ) = | sin t|dt = | sin t|dt
0 k=0 kπ
R (k+1)π
To evaluate kπ | sin t|dt for a given k, we make the change of variable
t = kπ + u, then 0 ≤ u ≤ π and since the function | sin | is periodic with a
period π then
Z (k+1)π Z π
| sin t|dt = sin udu = 2
kπ 0
20
and thus ϕ(nπ) = 2n.
Assume that nπ ≤ x < (n + 1)π for some n ∈ N, then
2n 2n ϕ(nπ) ϕ(x)
< = ≤
(n + 1)π x x x
Problem 2.4.5 Let f (x) = x2 cos(|x|−3/2 ) for 0 < |x| ≤ 1 and f (0) =
0. Then f ∈ V [−1, 1] and f (x) is differentiable on [−1, 1] but v(x) is not
differentiable at the point x = 0.
21
Make the change of variable u = t−3/2 , then t = u−2/3 and dt = − 23 u−5/3 du,
the integral above becomes
1 ∞ 2
Z
| sin u|u−4/3 du
x x−3/2 3
According to problem 2.4.3, if f 0 is continuous on [a, b] then v is differen-
tiable on [a, b]. The above problem demonstrates that only the existence of a
derivative f 0 at a point is not sufficient to guarantee that v is differentiable.
We shall show that if f 0 is continuous at a point, then v will be differentiable
at the point. We cannot use the same approach as in problem 2.4.3 since we
only assume that f 0 is continuous at one point. Indeed, f 0 might not even be
Riemann-integrable.
22
Proof: Continuity of f 0 in x0 implies that |f 0 | is continuous in x0 .
Let > 0 be given, there exists δ1 > 0 such that if |x − x0 | < δ1 then
Take δ = δ21 , for any x ∈ [x0 − δ, x0 + δ] we have |f 0 (x)| < |f 0 (x0 )| + and
since f has a bounded derivative on [x0 − δ, x0 + δ] then f satisfies a Lipschitz
condition on [x0 − δ, x0 + δ] with constant |f 0 (x0 )| + .
If x0 < x < x0 + δ then v(x) − v(x0 ) = Vxx0 (f ) ≤ (|f 0 (x0 )| + )(x − x0 )
whence
v(x) − v(x0 )
< |f 0 (x0 )| + (4)
x − x0
In the same way one shows that the inequality above also holds for x such
that x0 − δ < x < x0 . On the other hand, if x > x0 we have
v(x) − v(x0 ) |f (x) − f (x0 )|
≥ = |f 0 (x1 )|
x − x0 |x − x0 |
for some x1 between x and x0 according to the Mean value theorem. Since
|x1 − x0 | < δ we have |f 0 (x1 )| > |f 0 (x0 )| − and therefore
v(x) − v(x0 )
|f 0 (x0 )| − < (5)
x − x0
A similar inequality holds for x < x0 . Combining inequality 4 with inequal-
ity 5 the following implication follows:
v(x)−v(x0 ) 0
0 < |x − x0 | < δ ⇒ x−x0 − |f (x0 )| <
Problem 2.4.7 Let f (x) = x2 cos(1/x) for 0 < |x| ≤ 1 and f (0) = 0. Then
f (x) and v(x) are differentiable everywhere on [−1, 1] but both f 0 and v 0 are
discontinuous at the point x = 0.
23
not continuous at the point x = 0. It follows from problem 2.4.6 that v is
differentiable and has the derivative v 0 (x) = |f 0 (x)| for every x ∈ [−1, 1] \ {0}
since f 0 (x) is continuous there.
Now we shall show that limx→0 (v(x)R − v(0))/x exists. Let x > 0, as in
x
problem 2.4.5 we have v(x) − v(0) = 0 |f 0 (t)|dt and therefore the derivative
in x = 0 is given by
1 x
Z
1 1
lim |2t cos + sin |dt
x→+0 x 0 t t
Further, Z x Z x
1 1 1
|2t cos + sin |dt = | sin |dt + O(x2 )
0 t t 0 t
Rx
so it’ll be sufficient to show the existence of limx→+0 x1 0 | sin 1t |dt.
Make the change of variable u = 1t , then dt = − u12 du and we get
1 ∞
Z
1
lim | sin u| 2 du
x→+0 x 1/x u
Set y = x1 , then y → +∞ as x → +0 which yields
Z ∞
1
lim y | sin u| 2 du
y→∞ y u
Let ϕ(u) be as in problem 2.4.5 and use integration by parts:
Z ∞ Z ∞
−2 −2 ∞
| sin u|u du = ϕ(u)u |y + 2 ϕ(u)u−3 du
y y
Z ∞
= 2 ϕ(u)u−3 du − ϕ(y)y −2
y
R∞ R∞
and thus y y | sin u|u du = 2y y ϕ(u)u−3 du − ϕ(y)y −1
−2
R∞ R∞
Write y y ϕ(u)u−3 du = y ϕ(u)u−3 du/y −1 and apply L’Hospital’s rule:
R∞
( y ϕ(u)u−3 du)0 −ϕ(y)y −3 ϕ(y) 2
lim −1 0
= lim −2
= lim =
y→∞ (y ) y→∞ −y y→∞ y π
R∞
by lemma 2.4.4 and therefore limy→∞ y y ϕ(u)u−3 du = π2 according to
L’Hospital’s rule. Thus
Z ∞ Z ∞
−2 ϕ(y)
lim y | sin u|u du = lim (2y ϕ(u)u−3 du − )
y→∞ y y→∞ y y
4 2 2
= − =
π π π
0 2
Therefore v (0) = π .
24
2.5 Two limits
In this section we shall consider continuous functions of bounded variation.
If f is continuous then the total variation is given as a limit of the sums
VΠ (f ). We shall introduce some notations:
Let Π = {x0 , x1 , ..., xn } be any partition of [a, b]. Then we set
25
|f (yj ) − f (xk )| + |f (xk+1 ) − f (yj )| − |f (xk+1 ) − f (xk )|
and therefore
0 ≤ |f (yj ) − f (xk )| + |f (xk+1 ) − f (yj )| − |f (xk+1 ) − f (xk )|
≤ |f (yj ) − f (xk )| + |f (xk+1 ) − f (yj )|
< /4m + /4m = /2m
where the last inequality is true because |xk+1 − yj |, |yj − xk | < δ1 .
Therefore
VΠ0 (f ) − VΠ (f ) < m · /2m = /2
and thus
Vab (f ) − /2 < VΠ0 (f ) < VΠ (f ) + /2 ⇔ Vab (f ) − < VΠ (f )
We conclude that VΠ (f ) → Vab (f ) when d(Π) → 0
For the second part of the problem, let > 0 be given, there exists a δ > 0
such that d(Π) < δ ⇒ Vab (f ) − < VΠ (f ) . Take any partition Π with
d(Π) < δ. We notice that for any partition we have VΠ (f ) ≤ ΩΠ (f ) and thus
d(Π) < δ ⇒ Vab (f ) − < ΩΠ (f )
On the other hand, for any partition Π = {x0 , x1 , ..., xn } let tk , sk be points
in which f attains it’s maximum respectively minimum on [xk , xk+1 ], that is
Mk = f (tk ) and mk = f (sk ). Now add tk and sk , 0 ≤ k ≤ n − 1, to the
partition Π and denote the resulting partition Π0 . The sum VΠ0 (f ) will then
contain terms |f (tk ) − f (sk )| = Mk − mk so we have
n−1
X
Vab (f ) ≥ VΠ0 (f ) = (Mk − mk ) + additional positive terms
k=0
Problem 2.5.2 Let f ∈ V [a, b] and let f be continuous on [a, b]. Then
1 b−h
Z
b
Va (f ) = lim |f (x) − f (x + h)|dx
h→+0 h a
26
Proof: Since |f (x) − f (x + h)| ≤ v(x + h) − v(x) it follows that
1 b−h 1 b−h
Z Z
|f (x) − f (x + h)|dx ≤ [v(x + h) − v(x)]dx
h a h a
1 b−h 1 b−h
Z Z
= v(x + h)dx − v(x)dx
h a h a
1 b 1 b−h
Z Z
= v(x)dx − v(x)dx
h a+h h a
1 b 1 a+h
Z Z
= v(x)dx − v(x)dx
h b−h h a
≤ v(b) = Vab (f )
The inequality above is valid for every h and thus
1 b−h
Z
lim sup |f (x) − f (x + h)|dx ≤ Vab (f )
h→+0 h a
27
for any partition Π. It follows that
1 b−h
Z
lim inf |f (x) − f (x + h)|dx ≥ Vab (f )
h→+0 h a
1 b−h
Z
b
Va (f ) ≤ lim inf |f (x) − f (x + h)|dx
h→+0 h a
1 b−h
Z
≤ lim sup |f (x) − f (x + h)|dx
h→+0 h a
≤ Vab (f )
and therefore
Z b−h
1
lim |f (x) − f (x + h)|dx = Vab (f )
h→+0 h a
28
3 Jump functions
In this section we shall introduce the so called jump function of a function of
bounded variation. Before we give a definition we shall establish some facts.
One of the consequences of Jordan’s theorem is that if f is of bounded varia-
tion, then the set of points at which f is discontinuous is at most countable.
Let {dn }n≥1 be the sequence of points of discontinuity of f and let σn+ be the
right-hand jump of f at dn and σn− the left-hand jump of f at dn , that is
σn+ = f (dn + 0) − f (dn ), and σn− = f (dn ) − f (dn − 0)
Proof: Set n
X
Sn = (|σk+ | + |σk− |)
k=1
It is sufficient to show that the sequence {Sn }n∈N is bounded above by Vab (f ),
that is Sn ≤ Vab (f ) for every n.
Let {dk }k∈N be the sequence of all points of discontinuity of f in [a, b]. For
the sake of simplicity assume that neither a nor b is a point of discontinuity.
The problem that arises when a or b is a point of discontinuity is purely
notational, the reasoning is the same.
Let > 0 be given and take n ∈ N. Consider the points dk , 1 ≤ k ≤ n, we
may reorder these points so that d1 < d2 < ... < dn . For 1 ≤ k ≤ n let rk , lk
be points such that
(i) rk−1 < lk < dk < rk < lk+1 , 2 ≤ k ≤ n − 1
(ii) |f (dk ) − f (lk )| > |σk− | − 2n
Now let Π be the partition of [a, b] consisting of a,b and the points lk , dk , rk
for 1 ≤ k ≤ n. Then we have
Xn
b
Va (f ) ≥ VΠ (f ) ≥ (|f (dk ) − f (lk )| + |f (rk ) − f (dk )|)
k=1
n
X
> (|σk− | − + |σk+ | − ) = Sn −
k=1
2n 2n
29
30
For the second part, take a fixed point of discontinuity dj . We shall show
that limx→+dj s(x) − s(dj ) = σj+ , one shows that limx→−dj s(dj ) − s(x) = σj−
in the same way.
For x > dj we set ω 0 (x) = dj ≤dk <x σk+ and ω 00 (x) = dj <dk ≤x σk− . Then
P P
and X X X
|ω 00 (x)| = | σk− | ≤ |σk− | ≤ |σk− | <
dj <dk ≤x dj <dk ≤x k≥N
= t(xk+1 ) − t(xk )
31
and therefore
n−1
X n−1
X
VΠ (s) = |s(xk+1 ) − s(xk )| ≤ (t(xk+1 ) − t(xk )) = t(x)
k=0 k=0
(4) Let x, y ∈ [a, b] and y < x. In the proof of (1) above we showed that
We can give an alternative definition of the jump function that will be useful:
32
If dn = a for some n set
σn+ a < x ≤ b
σn (x) =
0 x=a
Then ∞
X
s(x) = σn (x)
n=1
P∞
Proof: Set s1 (x) = n=1 σn (x) , we shall prove that s1 = s. Since
σn (a) = 0 for every n clearly s1 (a) = s(a). Take x ∈ (a, b] fixed but arbitrary,
for those n ∈ N such that a < dn < x we have σn (x) = σn+ + σn− and for those
n ∈ N such that x < dn we have σn (x) = 0. We get different cases depending
on wether or not the points x and a are points of discontinuity.
We’ll do the case when a is a point of discontinuity, that is a = di for some
i, and x isn’t a point of discontinuity:
X X X
s1 (x) = σi (x) + σn (x) = σn+ + σn− = s(x)
a<dn <x a≤dn <x a<dn <x
We shall conclude this section with two problems on how the total variation
of the function f − s relates to the total variation of f .
Problem 3.0.7 Let f ∈ V [a, b] and let s be the jump function of f . Then
∞
X
Vab (f ) = Vab (f − s) + (|σn+ | + |σn− |)
n=1
Proof: We have
∞
X
Vab (f ) = Vab (f − s + s) ≤ Vab (f − s) + Vab (s) = Vab (f − s) + (|σk+ | + |σk− |)
k=1
33
where σk (x) is as defined in problem 3.0.6. For notational simplicity we
assume that a and b are not points of discontinuity of f . We shall show that
(i) Vab (f − sn ) = Vab (f ) − nk=1 (|σk+ | + |σk− |)
P
In order to show (i), first consider the case when n = 1. We shall show that
Vab (f − s1 ) = Vab (f ) − (|σ1+ | + |σ1− |).
Let h be an arbitrary number satisfying 0 < h < min{c − a, b − c}.
The function s1 is constant on [a, c − h] and [c + h, b] and thus Vac−h (f − s1 ) =
b
Vac−h (f ) and Vc+h b
(f − s1 ) = Vc+h (f ) and the following equality follows:
c+h c+h
Vab (f ) − Vab (f − s1 ) = Vc−h (f ) − Vc−h (f − s1 )
Let h → +0, with v(x) = Vax (f ) problem 2.4.2 gives that v(c + 0) − v(c) =
|σ + | and v(c)−v(c−0) = |σ − | so therefore v(c+0)−v(c−0) = |σ + |+|σ − | .
c+h
Further, since f − s1 is continuous in the point c then Vc−h (f − s1 ) → 0
and thus we obtain Vab (f ) − Vab (f − s1 ) = |σ1+ | + |σ1− |.
For the general case of (i), order the points of discontinuity d1 , .., dn such
that d1 < d2 < ... < dn and divide [a, b] into n compact, non-overlapping
subintervals I1 , ..., In such that dk lies in the interior of Ik = [xk−1 , xk ] for
1 ≤ k ≤ n. Then applying the case n = 1 to each interval [xk−1 , xk ] yields
Vxxk−1
k
(f − sn ) = Vxxk−1
k
(f ) − (|σk+ | + |σk− |) for 1 ≤ k ≤ n
Summing these equalities gives (i).
Since the function s has the same points of discontinuity as f and the same
left-hand and right-hand jumps at these points (ii) follows directly by apply-
ing (i) to the function s.
Now, we have
Vab (f − s) = Vab (f − sn + sn − s)
≤ Vab (f − sn ) + Vab (s − sn )
n
X n
X
= Vab (f ) − (|σk+ | + |σk− |) + Vab (s) − (|σk+ | + |σk− |)
k=1 k=1
n
X ∞
X
= Vab (f ) − (|σk+ | + |σk− |) + (|σk+ | + |σk− |)
k=1 k=n+1
34
and if n ≥ N2 then
n ∞
X X
(|σk+ | + |σk− |) ≥ (|σk+ | + |σk− |) −
k=1 k=1
2
then ϕ − s = constant
0 = (f − ϕ)(dk + 0) − (f − ϕ)(dk )
= f (dk + 0) − f (dk ) − [ϕ(dk + 0) − ϕ(dk )]
= σk+ − [ϕ(dk + 0) − ϕ(dk )]
35
That is, the function ϕ has the same right-hand jump as f at dk . In the
same way we can show that ϕ also has the same left-hand jump as f at dk .
Then problem 3.0.7 gives that
∞
X
Vab (ϕ) = Vab (ϕ − sϕ ) + (|σk+ | + |σk− |)
k=1
where sϕ is the jump function of ϕ. However, f and ϕ have the same points
of discontinuity and the same right-hand and left-hand jumps at these points
so then sf = sϕ . Thus
∞
X
Vab (ϕ) = Vab (ϕ − sf ) + (|σk+ | + |σk− |)
k=1
P∞
Finally we’re given that Vab (ϕ) = +
k=1 (|σk | + |σk− |) and it follows that
Vab (ϕ − sf ) = 0 ⇔ ϕ − sf = constant
36
References
[1] R. Kannan and C.K. Kreuger, Advanced analysis on the real line,
Springer-Verlag, 1996
37