Upper sum

A Riemann upper sum built from suprema on each subinterval.
Upper sum

An upper sum of a bounded function f:[a,b]Rf:[a,b]\to\mathbb R with respect to a P={x0,,xn}P=\{x_0,\dots,x_n\} is the number

U(f,P)=i=1nMi(xixi1), U(f,P)=\sum_{i=1}^n M_i\,(x_i-x_{i-1}),

where Mi=sup{f(x):x[xi1,xi]}M_i=\sup\{f(x):x\in[x_{i-1},x_i]\} is the of ff on the iith subinterval.

Upper sums, together with , give the standard criterion for a : upper and lower sums can be made arbitrarily close by choosing a suitable partition.

Examples:

  • For f(x)=xf(x)=x on [0,1][0,1] and P={0,12,1}P=\{0,\tfrac12,1\}, one gets U(f,P)=1212+112=34U(f,P)=\tfrac12\cdot\tfrac12+1\cdot\tfrac12=\tfrac34.
  • If f(x)=cf(x)=c is constant on [a,b][a,b], then U(f,P)=c(ba)U(f,P)=c(b-a) for every partition PP.