Exercise 7.5.9

Given a function f on [ a , b ] , define the total variation of f to be

V f = sup { k = 1 n | f ( x k ) f ( x k 1 ) | } ,

where the supremum is taken over all partitions P of [ a , b ] .

(a)
If f is continuously differentiable ( f exists as a continuous function), use the Fundamental Theorem of Calculus to show V f a b | f | .
(b)
Use the Mean Value Theorem to establish the reverse inequality and conclude that V f = a b | f | .

Answers

(a)
For any subinterval [ c , d ] [ a , b ] ,
c d | f ( x ) | | c d f ( x ) | = | f ( d ) f ( c ) |

Applying this to each subinterval of any partition P leaves us with

k = 1 n | f ( x k ) f ( x k 1 ) | a b | f |

and hence V f a b | f | .

(b)
Let 𝜖 > 0 . Since | f | is uniformly continuous over the closed interval [ a , b ] , we can create a partition P with n elements so that each subinterval has length less than δ , where | x y | < δ | | f ( x ) | | f ( y ) | | < 𝜖 b a .

Within a representative subinterval [ x k 1 , x k ] of P , by the Mean Value Theorem x ^ k [ x k 1 , x k ] satisfying

f ( x ^ k ) = f ( x k ) f ( x k 1 ) x k x k 1

Letting M k be the supremum of | f | over [ x k 1 , x k ] , note that

U ( | f | , P ) k = 1 n | f ( x k ) f ( x k 1 ) | = k = 1 n ( M k | f ( x k ) f ( x k 1 ) x k x k 1 | ) ( x k x k 1 ) = k = 1 n ( M k | f ( x ^ k ) | ) ( x k x k 1 ) 𝜖 b a k 1 n x k x k 1 = 𝜖

Since U ( | f | , P ) a b | f | , we have V f a b | f | 𝜖 , or simply V f a b | f | .

It’s worth noting that we can’t use argument with L ( | f | , P ) for the inequality because of the sup in V f .

User profile picture
2022-01-27 00:00
Comments