Exercise 6.3

Exercise 3: Define three functions β 1 , β 2 , β 3 as follows: β j ( x ) = 0 if x < 0 , β j ( x ) = 1 if x > 0 for j = 1 , 2 , 3 , and β 1 ( 0 ) = 0 , β 2 ( 0 ) = 1 , β 3 ( 0 ) = 1 2 . Let f be a bounded function on [ 1 , 1 ] .

  • Prove that f R ( β 1 ) if and only if f ( 0 + ) = f ( 0 ) and that then f d β 1 = f ( 0 ) .
  • State and prove a similar result for β 2 .
  • Prove that f R ( β 3 ) if and only if f is continuous at 0.
  • If f is continuous at 0 prove that f d β 1 = f d β 2 = f d β 3 = f ( 0 ) .

Answers

(Matt “Frito” Lundy)
(a) First suppose that f ( 0 + ) = f ( 0 ) and let 𝜀 > 0 be given. Then there exists a δ > 0 such that 0 < x < δ implies | f ( x ) f ( 0 ) | < 𝜖 . Let δ = min { 1 , δ 2 } and form a partition P = { 1 , 0 , δ , 1 } . Then we have

U ( P , f , β 1 ) L ( P , f , β 1 ) = f ( s ) f ( t )

for some s , t [ 0 , δ ] . But

f ( s ) f ( t ) | f ( s ) f ( 0 ) | + | f ( 0 ) f ( t ) |

so we have

U ( P , f , β 1 ) L ( P , f , β 1 ) | f ( s ) f ( 0 ) | + | f ( 0 ) f ( t ) | < 2 𝜀 ,

which shows that f R ( β 1 ) .

Now suppose that f R ( β 1 ) and let 𝜀 > 0 be given. Then there exists a partition P for which

U ( P , f , β 1 ) L ( P , f , β 1 ) < 𝜀 .

Let P be a refinement of P that includes 0 . Then we have:

U ( P , f , β 1 ) L ( P , f , β 1 ) < 𝜀 .

But if [ 0 , δ ] is the subinterval of P that contains 0 , then:

U ( P , f , β 1 ) L ( P , f , β 1 ) = f ( s ) f ( t )

for some s , t [ 0 , δ ] where f ( s ) f ( t ) | f ( x 1 ) f ( x 2 ) | for any x 1 , x 2 [ 0 , δ ] . So we have for any 0 < x < δ

| f ( 0 ) f ( x ) | f ( s ) f ( t ) < 𝜀 ,

which means that f ( 0 + ) = f ( 0 ) .

As above, for any partition P that contains 0 we have:

U ( P , f , β 1 ) = M l L ( P , f , β 1 ) = m l

in the interval [ 0 , x l ] of P . Because f is right-continuous at 0 , both M l and m l converge to f ( 0 ) as x l 0 , so

f d β 1 = f ( 0 ) .

(b) The statement is: f R ( β 2 ) if and only if f ( 0 ) = f ( 0 ) and then

f d β 2 = f ( 0 ) .

The proof is similar to part (a).

(c) Suppose that f is continuous at 0 and let 𝜀 be given. Then there exists a δ > 0 such that | x | < 0 implies | f ( x ) f ( 0 ) | < 𝜀 . Let δ = min { 1 , δ 2 } , and P = { 1 , δ , δ , 1 } . Then

U ( P , f , β 3 ) L ( P , f , β 3 ) = f ( s ) f ( t )

where s , t [ δ , δ ] . But

f ( s ) f ( t ) | f ( s ) f ( 0 ) | + | f ( 0 ) f ( t ) |

so

U ( P , f , β 3 ) L ( P , f , β 3 ) < 2 𝜀

and f R ( β 3 ) .

Now suppose that f R ( β 3 ) and let 𝜀 > 0 be given. There exists a partition P such that

U ( P , f , β 3 ) L ( P , f , β 3 ) < 𝜀 .

Let P be a refinement of P that contains 0 so that the partitions around 0 are [ x l 1 , 0 ] and [ 0 , x l ] , let δ = min { | x l | , | x l 1 | } and let P # be a refinement of P that contains ± δ . Then

U ( P # , f , β 3 ) L ( P # , f , β 3 ) = 1 2 [ f ( s ) f ( t ) + f ( q ) f ( r ) ]

where s , t [ 0 , δ ] , q , r [ δ , 0 ]

f ( s ) f ( t ) | f ( 0 ) f ( x ) | for any x [ 0 , δ ]

f ( q ) f ( q ) | f ( 0 ) f ( x ) | for any x [ δ , 0 ] .

So for any x [ δ , δ ] we have

| f ( 0 ) f ( x ) | < 𝜖

which shows that f is continuous at 0 .

(d) The result follows from parts (a) - (c) and the fact that if f is continuous at 0 , then f ( 0 ) = f ( 0 ) = f ( 0 + ) .

User profile picture
2023-08-07 00:00
Comments

Proof of ( a ) . Let our partition P include the point x j 1 = 0 and put δ = x j x j 1 . By Definition 6.1,

U ( P , f , β 1 ) = sup x [ 0 , δ ] f ( x ) L ( P , f , β 1 ) = inf x [ 0 , δ ] f ( x )

since Δ β 1 = 1 on the interval [ 0 , δ ] , and 0 otherwise.

If we assume f ( β 1 ) , then given 𝜖 > 0 , we can find a refinement P with a value of x j = δ such that

sup x [ 0 , δ ] f ( x ) inf x [ 0 , δ ] f ( x ) < 𝜖 ,

by Theorem 6.6. Since | f ( 0 ) f ( δ ) | sup f ( x ) inf f ( x ) over this interval,

| f ( 0 ) f ( δ ) | < 𝜖 ,

and so f ( 0 + ) = f ( 0 ) since 𝜖 is arbitrary.

If we assume f ( 0 + ) = f ( 0 ) , then given 𝜖 > 0 , we can find a δ > 0 such that

| f ( x ) f ( 0 ) | < 𝜖 ,

for 0 < x < δ , so f is continuous at x = 0 , and therefore 0 δ fd β 1 exists. Since fd β 1 = 0 for any other subinterval of , f ( β 1 ) .

Now evaluate fd β 1 . Since f ( β 1 ) ,

fd β 1 = sup x [ 0 , δ ] f ( x ) = inf x [ 0 , δ ] f ( x ) ,

and since f ( 0 + ) = f ( 0 ) ,

fd β 1 = f ( 0 ) .

[ b ] f ( β 2 ) if and only if f ( 0 ) = f ( 0 ) and

fd β 2 = f ( 0 ) .

Proof of ( b ) . Let our partition P include the point x j + 1 = 0 and put δ = x j x j + 1 . By Definition 6.1,

U ( P , f , β 2 ) = sup x [ δ , 0 ] f ( x ) L ( P , f , β 2 ) = inf x [ δ , 0 ] f ( x )

since Δ β 2 = 1 on the interval [ δ , 0 ] , and 0 otherwise.

If we assume f ( β 2 ) , then given 𝜖 > 0 , we can find a refinement P with a value of x j = δ such that

sup x [ δ , 0 ] f ( x ) inf x [ δ , 0 ] f ( x ) < 𝜖 ,

by Theorem 6.6. Since | f ( 0 ) f ( δ ) | sup f ( x ) inf f ( x ) over this interval,

| f ( 0 ) f ( δ ) | < 𝜖 ,

and so f ( 0 ) = f ( 0 ) since 𝜖 is arbitrary.

If we assume f ( 0 ) = f ( 0 ) , then given 𝜖 > 0 , we can find a δ < 0 such that

| f ( δ ) f ( 0 ) | < 𝜖 ,

so f is continuous at x = 0 , and therefore δ 0 fd β 2 exists. Since fd β 2 = 0 for any other subinterval of , f ( β 2 ) .

Now evaluate fd β 2 . Since f ( β 2 ) ,

fd β 1 = sup x [ δ , 0 ] f ( x ) = inf x [ δ , 0 ] f ( x ) ,

and since f ( 0 ) = f ( 0 ) ,

fd β 1 = f ( 0 ) .
User profile picture
2023-09-01 19:37
Comments