<< Chapter < Page Chapter >> Page >

If S is a closed geometric set, we will indicate the corresponding open geometric set by the symbol S 0 .

The symbol S 0 we have introduced for the open geometric set corresponding to a closed one is the same symbol that we have used previously for the interior of a set.Study the exercise that follows to see that the two uses of this notation agree.

  1. Show that rectangles, triangles, and circles are geometric sets. What in fact is the definition of a circle?
  2. Find some examples of sets that are not geometric sets. Think about a horseshoe on its side, or a heart on its side.
  3. Let f be a continuous, nonnegative function on [ a , b ] . Show that the “region” under the graph of f is a geometric set.
  4. Show that the intersection of two geometric sets is a geometric set. Describe the left, right, upper, and lower boundaries of the intersection.Prove that the interior ( S 1 S 2 ) 0 of the intersection of two geometric sets S 1 and S 2 coincides with the intersection S 1 0 S 2 0 of their two interiors.
  5. Give an example to show that the union of two geometric sets need not be a geometric set.
  6. Show that every closed geometric set is compact.
  7. Let S be a closed geometric set. Show that the corresponding open geometric set S 0 coincides with the interior of S , i.e., the set of all points in the interior of S . HINT: Suppose a < x < b and l ( x ) < y < u ( x ) . Begin by showing that, because both l and u are continuous, there must exist an ϵ > 0 and a δ > 0 such that a < x - δ < x + δ < b and l ( x ) < y - ϵ < y + ϵ < u ( x ) .

Now, given a geometric set S (either open or closed), that is determined by an interval [ a , b ] and two bounding functions u and l , let P = { x 0 < x 1 < ... < x n } be a partition of [ a , b ] . For each 1 i n , define numbers c i and d i as follows:

c i = sup x i - 1 < x < x i l ( x ) , and d i = inf x i - 1 < x < x i u ( x ) .

Because the functions l and u are continuous, they are necessarily bounded, so that the supremum and infimum above are real numbers.For each 1 i n define R i to be the open rectangle ( x i - 1 , x i ) × ( c i , d i ) . Of course, d i may be < c i , in which case the rectangle R i is the empty set. In any event, we see that the partition P determines a finite set of (possibly empty) rectangles { R i } , and we denote the union of these rectangles by the symbol C P . = i = 1 n ( x i - 1 , x i ) × ( c i , d i ) .

The area of the rectangle R i is ( x i - x i - 1 ) ( d i - c i ) if c i < d i and 0 otherwise. We may write in general that A ( R i ) = ( x i - x i - 1 ) max ( ( d i - c i ) , 0 ) . Define the number A P by

A P = i = 1 n ( x i - x i - 1 ) ( d i - c i ) .

Note that A P is not exactly the sum of the areas of the rectangles determined by P because it may happen that d i < c i for some i 's, so that those terms in the sum would be negative. In any case, it is clear that A P is less than or equal to the sum of the areas of the rectangles, and this notation simplifies matters later.

For any partition P , we have S C P , so that, if A ( S ) is to denote the area of S , we want to have

A ( S ) i = 1 n A ( R i ) = i = 1 n ( x i - x i - 1 ) max ( ( d i - c i ) , 0 ) i = 1 n ( x i - x i - 1 ) ( d i - c i ) = A P .

Let S be a geometric set (either open or closed), bounded on the left by x = a , on the right by x = b , below by the graph of l , and above by the graph of u . Define the area A ( S ) of S by

A ( S ) = sup P A P = sup P = { x 0 < x 1 < ... < x n } i = 1 n ( x i - x i - 1 ) ( d i - c i ) ,

where the supremum is taken over all partitions P of [ a , b ] , and where the numbers c i and d i are as defined above.

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