Prove
[link] .
It is mostly the analog to
[link] .
To see the last part, let
be the step function that is
identically 1 on
check that
then examine
Of course, we could now extend the notion of integrability over
a geometric set
to include complex-valued functions just as we did for
integrability over an interval
However, real-valued functions on geometric sets will suffice for the purposes of this book.
We include here, to be used later in
[link] , a somewhat technical theorem about constructing partitions of a geometric set.
Let
be closed, nonoverlapping, geometric sets, all contained
in a geometric set
Then there exists a partition
of
such that
for
we have
In other words, the
's are
the first
elements of a partition of
Suppose
is determined by the interval
and the two bounding functions
and
We prove this theorem by induction on
If
let
be determined by the interval
and the two bounding functions
and
Set
and
define four more geometric sets
as follows:
-
is determined by the interval
and the two bounding functions
and
restricted to that interval.
-
is determined by the interval
and the two bounding functions
and
restricted to that interval.
-
is determined by the interval
and the two bounding functions
and
restricted to that interval.
-
is determined by the interval
and the two bounding
functions
and
restricted to that interval.
Observe that the five sets
constitute a partition of the geometric set
proving the theorem in the case
Suppose next that the theorem is true for
any collection of
sets satisfying the hypotheses.
Then, given
as in the hypothesis of the theorem,
apply the inductive hypothesis to the
sets
to obtain
a partition
of
for which
for all
For each
consider the geometric set
of the geometric set
We may apply the case
of this theorem to this geometric set
to conclude that
is the first element
of a partition
of the geometric set
Define a partition
of
as follows:
For
set
Set
And define the rest of the partition
to be made up of the remaining sets
for
and
It follows directly that this partition
satisfies the requirements of the theorem.
Let
be as in the preceding theorem.
Suppose
is determined by the interval
and the two bounding functions
and
We will say that
is “below”
equivalently
is “above”
if there exists a point
such that
Note that this implies that
- Suppose
is below
and suppose
and
Show that
That is, if
is below
then no part of
can be above
- Suppose
is below
and
is below
Show that no part of
can be above
HINT: By way of contradiction, let
be such that
let
be such that
and suppose
is such that
Derive contradictions for all possible arrangements of the three points
and
- Prove that there exists an index
such that
is minimal in the sense that
there is no other
that is below
HINT: Argue by induction on
Thus, let
be the collection of all
's that are below
and note that there are at most
elements of
By induction, there is one of the
's, i.e., an
that is minimal for that collection.
Now, using part (b), show that this
must be minimal for the original collection.