<< Chapter < Page Chapter >> Page >
This module contains an axiom of choice and also includes various theorems and exercises related to the usage of integrals in finding the area of regions in the plane.

It would be desirable to be able to assign to each subset S of the Cartesian plane R 2 a nonnegative real number A ( S ) called its area. We would insist based on our intuition that (i) if S is a rectangle with sides of length L and W then the number A ( S ) should be L W , so that this abstract notion of area would generalize our intuitively fundamental one. We would also insist that (ii) if S were the union of two disjoint parts, S = S 1 S 2 , then A ( S ) should be A ( S 1 ) + A ( S 2 ) . (We were taught in high school plane geometry that the whole is the sum of its parts.) In fact, even if S were the union of an infinite number of disjoint parts, S = n = 1 S n with S i S j = if i j , we would insist that (iii) A ( S ) = n = 1 A ( S n ) .

The search for such a definition of area for every subset of R 2 motivated much of modern mathematics. Whether or not such an assignment exists is intimately related to subtle questions in basic set theory,e.g., the Axiom of Choice and the Continuum Hypothesis . Most mathematical analysts assume that the Axiom of Choice holds, and as a result of that assumption,it has been shown that there can be no assignment S A ( S ) satisfying the above three requirements. Conversely, if one does not assume that the Axiom of Choiceholds, then it has also been shown that it is perfectly consistent to assume as a basic axiom that such an assignment S A ( S ) does exist. We will not pursue these subtle points here, leaving them to a course in Set Theory or Measure Theory.However, Here's a statement of the Axiom of Choice, and we invite the reader to think about how reasonable it seems.

AXIOM OF CHOICE Let S be a collection of sets. Then there exists a set A that contains exactly one element out of each of the sets S in S .

The difficulty mathematicians encountered in trying to define area turned out to be involved withdefining A ( S ) for every subset S R 2 . To avoid this difficulty, we will restrict our attention here to certain “ reasonable” subsets S . Of course, we certainly want these sets to include the rectangles and all other common geometric sets.

By a (open) rectangle we will mean a set R = ( a , b ) × ( c , d ) in R 2 . That is, R = { ( x , y ) : a < x < b and c < y < d } . The analogous definition of a closed rectangle [ a , b ] × [ c , d ] should be clear: [ a , b ] × [ c , d ] = { ( x , y ) : a x b , c y d } .

By the area of a (open or closed) rectangle R = ( a , b ) × ( c , d ) or [ a , b ] × [ c , d ] we mean the number A ( R ) = ( b - a ) ( d - c ) . .

The fundamental notion behind our definition of the area of a set S is this. If an open rectangle R = ( a , b ) × ( c , d ) is a subset of S , then the area A ( S ) surely should be greater than or equal to A ( R ) = ( b - a ) ( d - c ) . And, if S contains the disjoint union of several open rectangles, then the area of S should be greater than or equal to the sum of their areas.

We now specify precisely for which sets we will define the area. Let [ a , b ] be a fixed closed bounded interval in R and let l and u be two continuous real-valued functions on [ a , b ] for which l ( x ) < u ( x ) for all x ( a , b ) .

Given [ a , b ] , l , and u as in the above, let S be the set of all pairs ( x , y ) R 2 , for which a < x < b and l ( x ) < y < u ( x ) . Then S is called an open geometric set. If we replace the < signs with signs, i.e., if S is the set of all ( x , y ) such that a x b , and l ( x ) y u ( x ) , then S is called a closed geometric set. In either case, we say that S is bounded on the left and right by the vertical line segments { ( a , y ) : l ( a ) y u ( a ) } and { ( b , y ) : l ( b ) y u ( b ) } , and it is bounded below by the graph of the function l and bounded above by the graph of the function u . We call the union of these four bounding curves the boundary of S , and denote it by C S .

If the bounding functions u and l of a geometric set S are smooth or piecewise smooth functions, we will call S a smooth or piecewise smooth geometric set.

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