Q. 50

Question

Use Definition 4.7 to prove that for any function f and interval [a, b], the upper sum with n rectangles is greater than or equal to the lower sum with n rectangles.

Step-by-Step Solution

Verified
Answer

It is proved that upper sum withn rectangles is greater than or equal to the lower sum with n rectangles.

1Step 1. Given Information

Upper and Lower Sums

Suppose f is a function that is continuous on the interval [a, b]. Given a positive integer n,

let x=b-anand xk=a+kx.Then

(a) The n-rectangle upper sum for fon a,b is where eachMk is chosen so that is the maximum value of  fon xk-1,xk.

(b) The n-rectangle lower sum for on  is where each mkis chosen so that  is the minimum value of fon xk-1,xk

2Step 2. Proof of the Statement

Note that given any interval a,band number n of rectangles, we can write x and xk

in terms of a, b, and n. In practice, we will always need to use the explicit expressionsx=b-an and xk=a+kx (as well as using the definition of the function f ) when

evaluating a Riemann sum. For example, the right sum expressed earlier is equal to

fa+kb-anb-ank=1n

 The upper sum is always greater than or equal to the actual signed area.