What we introduced last time:
Are actually known as the lower and upper integrals respectively. Both are simultaneously the integral provided that the function that they are built from satisfy the following condition, the definition of integrability (but not the integrability criterion).
A bounded function f on [a,b] is integrable if L(f)=U(f).
And that's all the integral really is!
Yet ANOTHER return of that summing exerciseEdit
This is just a quick little question, probably trivial. What does this mean for f(x)=x?
As previously defined we can prove the integrability of a function by noting that U(f)=L(f)
However, there is a much more useful way to prove that a function, or an entire class of functions, is integrable. This is the theorem called the Integrability Criterion:
A bounded function is integrable on [a,b] iff for all ε > 0 there exists a partition P of [a,b] such that U(P,f) - L(P,f) < ε
You'll notice that it has properties similar to the definition of the limit.
Since this is a proof of necessity assume that f is integrable on [a,b]. Let ε >0 be given and say . Also . Now by the approximation property there exists a partition Q such that U(Q,f) < I + ε/2 and a partition R such that L(R,f) > I - ε/2. If we take the refinement and apply the properties of refinement that we proved before:
U(P,f) < I + ε/2
L(P,f) > I - ε/2
We can manipulate this to:
U(P,f) - L(P,f) < ε
Now for the proof to finish up the biconditional.....
Integrability criterion proofEdit
You do it. If for all ε > 0 there exists a partition P of [a,b] such that U(P,f) - L(P,f) < ε then f is integrable on [a,b]. Some hints: show that it implies U(f) - L(f) < ε for all ε > 0 then show this is so only if U(f)=L(f).