<< Chapter < Page Chapter >> Page >
  1. Using the notation of the preceding paragraphs, show that each rectangle R i is a subset of the set S and that R i R j = if i j . It may help to draw a picture of the set S and the rectangles { R i } . Can you draw one so that d i < c i ?
  2. Suppose S 1 is a geometric set and that S 2 is another geometric set that is contained in S 1 . Prove that A ( S 2 ) A ( S 1 ) . HINT: For each partition P , compare the two A P 's.

Let T be the triangle in the plane with vertices at the three points ( 0 , 0 ) , ( 0 , H ) , and ( B , 0 ) . Show that the area A ( T ) , as defined above, agrees with the formula A = ( 1 / 2 ) B H , where B is the base and H is the height.

The next theorem gives the connection between area (geometry) and integration (analysis).In fact, this theorem is what most calculus students think integration is all about.

Let S be a geometric set, i.e., a subset of R 2 that is determined in the above manner by a closed bounded interval [ a , b ] and two bounding functions l and u . Then

A ( S ) = a b ( u ( x ) - l ( x ) ) d x .

Let P = { x 0 < x 1 < ... < x n } be a partition of [ a , b ] , and let c i and d i be defined as above. Let h be a step function that equals d i on the open interval ( x i - 1 , x i ) , and let k be a step function that equals c i on the open interval ( x i - 1 , x i ) . Then on each open interval ( x i - 1 , x i ) we have h ( x ) u ( x ) and k ( x ) l ( x ) . Complete the definitions of h and k by defining them at the partition points so that h ( x i ) = k ( x i ) for all i . Then we have that h ( x ) - k ( x ) u ( x ) - l ( x ) for all x [ a , b ] . Hence,

A P = i = 1 n ( x i - x i - 1 ) ( d i - c i ) = a b ( h - k ) a b ( u - l ) .

Since this is true for every partition P of [ a , b ] , it follows by taking the supremum over all partitions P that

A ( S ) = sup P A P a b ( u ( x ) - l ( x ) ) d x ,

which proves half of the theorem; i.e., that A ( S ) a b u - l .

To see the other inequality, let h be any step function on [ a , b ] for which h ( x ) u ( x ) for all x , and let k be any step function for which k ( x ) l ( x ) for all x . Let P = { x 0 < x 1 < ... < x n } be a partition of [ a , b ] for which both h and k are constant on the open subintervals ( x i - 1 , x i ) of P . Let a 1 , a 2 , ... , a n and b 1 , b 2 , ... , b n be the numbers such that h ( x ) = a i on ( x i - 1 , x i ) and k ( x ) = b i on ( x i - 1 , x i ) . It follows, since h ( x ) u ( x ) for all x , that a i d i . Also, it follows that b i c i . Therefore,

a b ( h - k ) = i = 1 n ( a i - b i ) ( x i - x i - 1 ) i = 1 n ( x i - x i - 1 ) ( d i - c i ) = A P A ( S ) .

Finally, let { h m } be a nondecreasing sequence of step functions that converges uniformly to u , and let { k m } be a nonincreasing sequence of step functions that converges uniformly to l . See part (d) of [link] . Then

a b ( u - l ) = lim m a b ( h m - k m ) A ( S ) ,

which proves the other half of the theorem.

OK! Trumpet fanfares, please!

( A = π r 2 . ) If S is a circle in the plane having radius r , then the area A ( S ) of S is π r 2 .

Suppose the center of the circle S is the point ( h , k ) . This circle is a geometric set. In fact, we may describe the circle with center ( h , k ) and radius r as the subset S of R 2 determined by the closed bounded interval [ h - r , h + r ] and the functions

u ( x ) = k + r 2 - ( x - h ) 2

and

l ( x ) = k - r 2 - ( x - h ) 2 .

By the preceding theorem, we then have that

A ( S ) = h - r h + r 2 r 2 - ( x - h ) 2 d x = π r 2 .

We leave the verification of the last equality to the following exercise.

Evaluate the integral in the above proof:

h - r h + r 2 r 2 - ( x - h ) 2 d x .

Be careful to explain each step by referring to theorems and exercises in this book.It may seem like an elementary calculus exercise, but we are justifying each step here.

REMARK There is another formula for the area of a geometric set that is sometimes very useful. This formula gives the area in terms of a “double integral.”There is really nothing new to this formula; it simply makes use of the fact that the number (length) u ( x ) - l ( x ) can be represented as the integral from l ( x ) to u ( x ) of the constant 1. Here's the formula:

A ( S ) = a b ( l ( x ) u ( x ) 1 d y ) d x .

The next theorem is a result that justifies our definition of area by verifying that the whole is equal to the sum of its parts, something that any good definition of area should satisfy.

Let S be a closed geometric set, and suppose S = i = 1 n S i , where the sets { S i } are closed geometric sets for which S i 0 S j 0 = if i j . Then

A ( S ) = i = 1 n A ( S i ) .

Suppose S is determined by the interval [ a , b ] and the two bounding functions l and u , and suppose S i is determined by the interval [ a i , b i ] and the two bounding functions l i and u i . Because S i S , it must be that the interval [ a i , b i ] is contained in the interval [ a , b ] . Initially, the bounding functions l i and u i are defined and continuous on [ a i , b i ] , and we extend their domain to all of [ a , b ] by defining l i ( x ) = u i ( x ) = 0 for all x [ a , b ] that are not in [ a i , b i ] . The extended functions l i and u i may not be continuous on all of [ a , b ] , but they are still integrable on [ a , b ] . (Why?) Notice that we now have the formula

A ( S i ) = a i b i ( u i ( x ) - l i ( x ) ) d x = a b ( u i ( x ) - l i ( x ) ) d x .

Next, fix an x in the open interval ( a , b ) . We must have that the vertical intervals ( l i ( x ) , u i ( x ) ) and ( l j ( x ) , u j ( x ) ) are disjoint if i j . Otherwise, there would exist a point y in both intervals, and this would mean that the point ( x , y ) would belong to both S i 0 and S j 0 , which is impossible by hypothesis. Therefore, for each x ( a , b ) , the intervals { ( l i ( ) x ) , u i ( x ) ) } are pairwise disjoint open intervals, and they are all contained in the interval ( l ( x ) , u ( x ) ) , because the S i 's are subsets of S . Hence, the sum of the lengths of the open intervals { ( l i ( x ) , u i ( x ) ) } is less than or equal to the length of ( l ( x ) , u ( x ) ) . Also, for any point y in the closed interval [ l ( x ) , u ( x ) ] , the point ( x , y ) must belong to one of the S i 's, implying that y is in the closed interval [ l i ( x ) , u i ( x ) ] for some i . But this means that the sum of the lengths of the closed intervals [ l i ( x ) , u i ( x ) ] is greater than or equal to the length of the interval [ l ( x ) , u ( x ) ] . Since open intervals and closed intervals have the same length, we then see that ( u ( x ) - l ( x ) = i = 1 n ( u i ( x ) - l i ( x ) ) .

We now have the following calculation:

i = 1 n A ( S i ) = i = 1 n a i b i ( u i ( x ) - l i ( x ) ) d x = i = 1 n a b ( u i ( x ) - l i ( x ) ) d x = a b i = 1 n ( u i ( x ) - l i ( x ) ) d x = a b ( u ( x ) - l ( x ) ) d x = A ( S ) ,

which completes the proof.

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