Partition of an interval

A finite increasing list a=x0<⋯<xn=b subdividing [a,b] into subintervals.
Partition of an interval

A partition of a closed [a,b]R[a,b]\subseteq\mathbb{R} is a finite set of points written in increasing order

P: a=x0<x1<<xn=b.P:\ a=x_0<x_1<\cdots<x_n=b.

The associated subintervals are [xi1,xi][x_{i-1},x_i] for i=1,,ni=1,\dots,n, and their lengths are Δxi:=xixi1\Delta x_i:=x_i-x_{i-1}.

Partitions are the indexing objects for , / , and the definition of the . See also and .

Examples:

  • P: 0<12<1P:\ 0<\tfrac12<1 is a partition of [0,1][0,1] with two subintervals.
  • The uniform partition of [0,1][0,1] into nn pieces is xi=i/nx_i=i/n.
  • The trivial partition is a=x0<x1=ba=x_0<x_1=b (one subinterval).