Partitions of an interval A
partition of an interval is a finite sequence of numbers of the form a = x_0 Each is called a
sub-interval of the partition. The
mesh or
norm of a partition is defined to be the length of the longest sub-interval, that is, \max \left(x_{i+1}-x_i\right), \quad i \in [0,n-1]. A
tagged partition of an interval is a partition together with a choice of a sample point within each sub-interval: that is, numbers with for each . The mesh of a tagged partition is the same as that of an ordinary partition. Suppose that two partitions and are both partitions of the interval . We say that is a
refinement of if for each integer , with , there exists an integer such that and such that for some with . That is, a tagged partition breaks up some of the sub-intervals and adds sample points where necessary, "refining" the accuracy of the partition. We can turn the set of all tagged partitions into a
directed set by saying that one tagged partition is greater than or equal to another if the former is a refinement of the latter.
Riemann sum Let be a real-valued function defined on the interval . The
Riemann sum of with respect to a tagged partition of is \sum_{i=0}^{n-1} f(t_i) \left(x_{i+1}-x_i\right). Each term in the sum is the product of the value of the function at a given point and the length of an interval. Consequently, each term represents the (signed) area of a rectangle with height and width . The Riemann sum is the (signed) area of all the rectangles. Closely related concepts are the
lower and upper Darboux sums. These are similar to Riemann sums, but the tags are replaced by the
infimum and supremum (respectively) of on each sub-interval: \begin{align} L(f, P) &= \sum_{i=0}^{n-1} \inf_{t \in [x_i, x_{i+1}]} f(t)(x_{i+1} - x_i), \\ U(f, P) &= \sum_{i=0}^{n-1} \sup_{t \in [x_i, x_{i+1}]} f(t)(x_{i+1} - x_i). \end{align} If is continuous, then the lower and upper Darboux sums for an untagged partition are equal to the Riemann sum for that partition, where the tags are chosen to be the minimum or maximum (respectively) of on each subinterval. (When is discontinuous on a subinterval, there may not be a tag that achieves the infimum or supremum on that subinterval.) The
Darboux integral, which is similar to the Riemann integral but based on Darboux sums, is equivalent to the Riemann integral.
Riemann integral Loosely speaking, the Riemann integral is the limit of the
Riemann sums of a function as the partitions get finer. If the limit exists then the function is said to be
integrable (or more specifically
Riemann-integrable). The Riemann sum can be made as close as desired to the Riemann integral by making the partition fine enough. One important requirement is that the mesh of the partitions must become smaller and smaller, so that it has the limit zero. If this were not so, then we would not be getting a good approximation to the function on certain subintervals. In fact, this is enough to define an integral. To be specific, we say that the Riemann integral of exists and equals if the following condition holds: For all , there exists such that for any
tagged partition and whose mesh is less than , we have \left| \left( \sum_{i=0}^{n-1} f(t_i) (x_{i+1}-x_i) \right) - s\right| Unfortunately, this definition is very difficult to use. It would help to develop an equivalent definition of the Riemann integral which is easier to work with. We develop this definition now, with a proof of equivalence following. Our new definition says that the Riemann integral of exists and equals if the following condition holds: For all , there exists a tagged partition and such that for any tagged partition and which is a refinement of and , we have \left| \left( \sum_{i=0}^{n-1} f(t_i) (x_{i+1}-x_i) \right) - s\right| Both of these mean that eventually, the Riemann sum of with respect to any partition gets trapped close to . Since this is true no matter how close we demand the sums be trapped, we say that the Riemann sums converge to . These definitions are actually a special case of a more general concept, a
net. As we stated earlier, these two definitions are equivalent. In other words, works in the first definition if and only if works in the second definition. To show that the first definition implies the second, start with an , and choose a that satisfies the condition. Choose any tagged partition whose mesh is less than . Its Riemann sum is within of , and any refinement of this partition will also have mesh less than , so the Riemann sum of the refinement will also be within of . To show that the second definition implies the first, it is easiest to use the
Darboux integral. First, one shows that the second definition is equivalent to the definition of the Darboux integral; for this see the
Darboux integral article. Now we will show that a Darboux integrable function satisfies the first definition. Fix , and choose a partition such that the lower and upper Darboux sums with respect to this partition are within of the value of the Darboux integral. Let r = 2\sup_{x \in [a, b]} |f(x)|. If , then is the zero function, which is clearly both Darboux and Riemann integrable with integral zero. Therefore, we will assume that . If , then we choose such that \delta If , then we choose to be less than one. Choose a tagged partition and with mesh smaller than . We must show that the Riemann sum is within of . To see this, choose an interval . If this interval is contained within some , then m_j \leq f(t_i) \leq M_j where and are respectively, the infimum and the supremum of
f on . If all intervals had this property, then this would conclude the proof, because each term in the Riemann sum would be bounded by a corresponding term in the Darboux sums, and we chose the Darboux sums to be near . This is the case when , so the proof is finished in that case. Therefore, we may assume that . In this case, it is possible that one of the is not contained in any . Instead, it may stretch across two of the intervals determined by . (It cannot meet three intervals because is assumed to be smaller than the length of any one interval.) In symbols, it may happen that y_j (We may assume that all the inequalities are strict because otherwise we are in the previous case by our assumption on the length of .) This can happen at most times. To handle this case, we will estimate the difference between the Riemann sum and the Darboux sum by subdividing the partition at . The term in the Riemann sum splits into two terms: f\left(t_i\right)\left(x_{i+1}-x_i\right) = f\left(t_i\right)\left(x_{i+1}-y_{j+1}\right)+f\left(t_i\right)\left(y_{j+1}-x_i\right). Suppose,
without loss of generality, that . Then m_j \leq f(t_i) \leq M_j, so this term is bounded by the corresponding term in the Darboux sum for . To bound the other term, notice that x_{i+1}-y_{j+1} It follows that, for some (indeed any) , \left|f\left(t_i\right)-f\left(t_i^*\right)\right|\left(x_{i+1}-y_{j+1}\right) Since this happens at most times, the distance between the Riemann sum and a Darboux sum is at most . Therefore, the distance between the Riemann sum and is at most . == Examples ==