Contents
1. Theorem
2. Proof
3. Consequences of the theorem.
Theorem
Let and
be any two partitions of an interval
, and let
be bounded on
. Then, we have that
Ie, the lower sum is always less than or equal to the upper sum.
Proof
Recall from this theorem that, for two partitions and
of
, where
is a refinement of
, we have,
If we define , then
is a refinement of both
and
, and so with
, we can re-write
as two different sets of inequalities,
Hence, we have three cases. Firstly, if , then
, so obviously
.
Secondly, if , then it is obvious that
(this just follows from
).
Finally, if , or
, then we have three inequalities
.
Adding the first two inequalities together gives,
. Secondly, re-writing the third inequality gives
Now, adding these two inequalities together, we obtain,
.
But, as we know that , we have
, which of course gives
Consequences of the theorem
As a consequence of this theorem, let us assume that for a function bounded on
, that the upper integral of
,
, is lower than the lower integral,
. Ie,
But then, this would imply that there exist partitions and
such that
.
However, we have just proven the negation of , and so it follows that no such partitions exist.