Muddiest Point 11/16/17

Upper and Lower Sums

We illustrated lower sums in class to show that, given a function f that is bounded on [a,b], L(f,[a,b],Q)\geq L(f,[a,b],P) where Q is a refinement of a given partition P of [a,b]. This post shows the analogous graph for upper sums that we did not draw in class.

These are our observations about the areas in the upper sum and lower sum:

  1. L(f,[a,b],Q)\geq L(f,[a,b],P)
  2. U(f,[a,b],Q)\leq U(f,[a,b],P)
  3. L(f[a,b],P)\leq U(f,[a,b],P)

One Response

  1. Jeremy LeCrone says:

    Thank you for the post, though I will admit I am a little confused about what feature you are identifying as the “muddiest point”…

Leave a Reply