Prove that every upper sum has a greatest lower bound.

Primary tabs

Lesson Parent: 
The Logical Framework For Definite Integrals
Problem: 

Assume that $f(x)$ is a bounded function on the closed interval $[a,b]$. Prove that every upper sum has a greatest lower bound.

Answer: 

It is true that every upper sum has a greatest lower bound. We denote it by $\Phi$.

SAMPLE SOLUTION

All of our problems have fully worked out, logical solutions. We connect every solution to its underlying lesson so you can understand the concepts needed to solve any problem and reinforce your learning by practicing with similar problems. All of the formulas are available to our subscribers, but here is a sample of the problem solution you will see when you log in:



Solution: 

In this problem we showed that for any two arbitrary partitions $P$ and $Q$ that <Sign in to see all the formulas>. This means that every lower sum is a lower bound on every upper sum. By the Axiom of Completeness we know that the set of all upper sums has a greatest lower bound. The proof is now complete.

On this site we call that greatest lower bound $\Phi$. So for a bounded function and any arbitrary partition $P$, we know that <Sign in to see all the formulas>.