Unformatted text preview: 2.5. INTEGRATION ALONG CURVES 197 polygons give a lower bound follows from the much simpler assumption, which we take as selfevident, that the shortest curve between two points is a straight line segment. Suppose that C is an arc parametrized by −→ p : R → R 3 and let P = { a = t < t 1 < ··· < t n = b } be a partition of the domain of −→ p . The sum ℓ ( P , −→ p ) = n summationdisplay j =1 bardbl −→ p ( t j ) − −→ p ( t j − 1 ) bardbl is the sum of the straightline distances between successive points along C . It is clear that any reasonable notion of the “length” of C at least equals ℓ ( P , −→ p ). We would also think intuitively that a partition with small mesh size should give a good approximation to the “true” length of C . We therefore say C is rectifiable if the values of ℓ ( P , −→ p ) among all partitions are bounded, and then we define the arclength of C to be s ( C ) = sup P ℓ ( P , −→ p ) ....
View
Full
Document
This note was uploaded on 10/20/2011 for the course MAC 2311 taught by Professor All during the Fall '08 term at University of Florida.
 Fall '08
 ALL
 Calculus, Polygons

Click to edit the document details