32 Theories of Integration
as possible the collection of sets that are allowable as inputs. For the
Riemann integral,
a natural collection of sets is the collection of finite unions
of subintervals of [a, b]. As we will see below, if f is Riemann integrable on
[a, b], then f is Riemann integrable on every subinterval of [a, b].
Proposition 2.28
c E (a, b). Then, f is Riemann integrable on [a, c] and [c, b], and
Suppose that
f : [a, b] -+ R is Riemann integrable and
Proof. We first claim that f is Riemann integrable on [a, c] and [c, b].
Given E > 0, it is enough to show that there is a partition P[,,.] of [a,
such that
and
a similar result for [c,b]. By Theorem 2.20, there is a 6 > 0 so that if
P is a partition of [a, b] with p (P) < 6, then U (f, P) - L (f, P) < E. Let
PI,,.] be any partition of [a, c] with p (PI,,.]) < 6, let P[c,,~ be any partition
of
[c, b] with p (P[,,bl) < 6, and set P = P[u,c~ u P[c,b~. Then, p (P) < 6 and
Since for any bounded function
g and partition P, L (9, P) 5 U (9, P), it
follows that
and
so that f is Riemann integrable on [a, c] and [c, 61.
To see that 1,' f + JCb f = s," f, we fix e > 0 and choose partitions PfU,.]
E E
and P[c,b] such that u (f, P[u,c]) - 1," f < 5 and u (f, P[c,b]) - s," f < 5-