1. Since all of the inside approximations are smaller than the outside approximations for the same partitions, and since the inside approximations get bigger with finer partitions and the outside approximations get smaller, all of the inside approximations will be bounded above by any outside approximation. The inside approximations will then form a nonempty set of positive numbers which is bounded above and it will thus have a least upper bound. So the are length is well defined.

Return to text