<< Chapter < Page Chapter >> Page >

Prove [link] . It is mostly the analog to [link] . To see the last part, let h i be the step function that is identically 1 on S i ; check that h i f I ( S i ) ; then examine i S f h i .

Of course, we could now extend the notion of integrability over a geometric set S to include complex-valued functions just as we did for integrability over an interval [ a , b ] . 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 S 1 , ... , S n be closed, nonoverlapping, geometric sets, all contained in a geometric set S . Then there exists a partition S ^ 1 , ... , S ^ M of S such that for 1 i n we have S i = S ^ i . In other words, the s i 's are the first n elements of a partition of S .

Suppose S is determined by the interval [ a , b ] and the two bounding functions u and l . We prove this theorem by induction on n .

If n = 1 , let S 1 be determined by the interval [ a 1 , b 1 ] and the two bounding functions u 1 and l 1 . Set S ^ 1 = S 1 , and define four more geometric sets S ^ 2 , ... , S ^ 5 as follows:

  1.   S ^ 2 is determined by the interval [ a , a 1 ] and the two bounding functions u and l restricted to that interval.
  2.   S 3 is determined by the interval [ a 1 , b 1 ] and the two bounding functions u and u 1 restricted to that interval.
  3.   S 4 is determined by the interval [ a 1 , b 1 ] and the two bounding functions l and l 1 restricted to that interval.
  4.   S ^ 5 is determined by the interval [ b 1 , b ] and the two bounding functions u and l restricted to that interval.

Observe that the five sets S ^ 1 , S ^ 2 , ... , S ^ 5 constitute a partition of the geometric set S , proving the theorem in the case n = 1 .

Suppose next that the theorem is true for any collection of n sets satisfying the hypotheses. Then, given S 1 , ... , S n + 1 as in the hypothesis of the theorem, apply the inductive hypothesis to the n sets S 1 , ... , S n to obtain a partition T 1 , ... , T m of S for which T i = S i for all 1 i n . For each n + 1 i m , consider the geometric set S i ' = S n + 1 T i of the geometric set T i . We may apply the case n = 1 of this theorem to this geometric set to conclude that S i ' is the first element S i , 1 ' of a partition { S i , 1 ' , S i , 2 ' , ... , S i , m i ' } of the geometric set T i .

Define a partition { S ^ k } of S as follows: For 1 k n , set S ^ k = T k . Set S ^ n + 1 = i = n + 1 m S i , 1 ' = S n + 1 . And define the rest of the partition { S ^ k } to be made up of the remaining sets S i , j ' for n + 1 i m and 2 j m i . It follows directly that this partition { S ^ k } satisfies the requirements of the theorem.

Let S 1 , ... , S n be as in the preceding theorem. Suppose S k is determined by the interval [ a k , b k ] and the two bounding functions u k and l k . We will say that S k is “below” S j , equivalently S j is “above” S k , if there exists a point x such that u k ( x ) < l j ( x ) . Note that this implies that x [ a k , b k ] [ a j , b j ] .

  1. Suppose S k is below S j , and suppose ( z , y k ) S k and ( z , y j ) S j . Show that y j > y k . That is, if S k is below S j , then no part of S k can be above S j .
  2. Suppose S 2 is below S 1 and S 3 is below S 2 . Show that no part of S 3 can be above S 1 . HINT: By way of contradiction, let x 1 [ a 1 , b 1 ] be such that u 2 ( x 1 ) < l 1 ( x 1 ) ; let x 2 [ a 2 , b 2 ] be such that u 3 ( x 2 ) < l 2 ( x 2 ) ; and suppose x 3 [ a 3 , b 3 ] is such that u 1 ( x 3 ) < l 3 ( x 3 ) . Derive contradictions for all possible arrangements of the three points x 1 , x 2 , and x 3 .
  3. Prove that there exists an index k 0 such that S k 0 is minimal in the sense that there is no other S j that is below S k 0 . HINT: Argue by induction on n . Thus, let { T l } be the collection of all S k 's that are below S 1 , and note that there are at most n - 1 elements of { T l } . By induction, there is one of the T l 's, i.e., an S k 0 that is minimal for that collection. Now, using part (b), show that this S k 0 must be minimal for the original collection.

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, Analysis of functions of a single variable. OpenStax CNX. Dec 11, 2010 Download for free at http://cnx.org/content/col11249/1.1
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Analysis of functions of a single variable' conversation and receive update notifications?

Ask