Refinement lemma for upper and lower sums

Refining a partition increases lower sums and decreases upper sums
Refinement lemma for upper and lower sums

Refinement lemma: Let f:[a,b]Rf:[a,b]\to\mathbb{R} be . If PP and QQ are of [a,b][a,b] and QQ is a of PP (i.e., every partition point of PP is also a partition point of QQ), then L(f,P)L(f,Q)U(f,Q)U(f,P), L(f,P)\le L(f,Q)\le U(f,Q)\le U(f,P), where L(f,P)L(f,P) and U(f,P)U(f,P) are the and Riemann sums of ff with respect to PP.

An analogous statement holds for Riemann–Stieltjes upper/lower sums when the integrator α\alpha is .

This lemma formalizes the idea that making the partition finer can only improve the approximation: lower sums go up and upper sums go down.

Proof sketch: It suffices to check the effect of inserting a single new point tt into one subinterval [xi1,xi][x_{i-1},x_i] of PP. On the refined partition, the over [xi1,xi][x_{i-1},x_i] is \le the infimum over each smaller subinterval, so the weighted sum of infima cannot decrease; similarly the over the large interval is \ge each smaller-interval supremum, so the weighted sum of suprema cannot increase. Iterate over all inserted points.