Refinement of a partition

A partition Q that contains all points of a partition P (possibly with extra points).
Refinement of a partition

Let PP and QQ be partitions of [a,b][a,b]. The partition QQ is a refinement of PP if every point of PP is also a point of QQ, i.e.

{x0,,xn}{y0,,ym},\{x_0,\dots,x_n\}\subseteq \{y_0,\dots,y_m\},

where P:a=x0<<xn=bP:a=x_0<\cdots<x_n=b and Q:a=y0<<ym=bQ:a=y_0<\cdots<y_m=b.

Refinements correspond to subdividing intervals further. Upper sums decrease and lower sums increase under refinement, which is fundamental in proving integrability criteria.

Examples:

  • If P:0<1P:0<1 and Q:0<1/2<1Q:0<1/2<1, then QQ is a refinement of PP.
  • If P:0<1/3<2/3<1P:0<1/3<2/3<1 and Q:0<1/6<1/3<1/2<2/3<1Q:0<1/6<1/3<1/2<2/3<1, then QQ refines PP.
  • Any partition refines itself.