\(\DeclarePairedDelimiterX{\Set}[2]{\{}{\}}{#1 \nonscript\;\delimsize\vert\nonscript\; #2}\) \( \DeclarePairedDelimiter{\set}{\{}{\}}\) \( \DeclarePairedDelimiter{\parens}{\left(}{\right)}\) \(\DeclarePairedDelimiterX{\innerproduct}[1]{\langle}{\rangle}{#1}\) \(\newcommand{\ip}[1]{\innerproduct{#1}}\) \(\newcommand{\bmat}[1]{\left[\hspace{2.0pt}\begin{matrix}#1\end{matrix}\hspace{2.0pt}\right]}\) \(\newcommand{\barray}[1]{\left[\hspace{2.0pt}\begin{matrix}#1\end{matrix}\hspace{2.0pt}\right]}\) \(\newcommand{\mat}[1]{\begin{matrix}#1\end{matrix}}\) \(\newcommand{\pmat}[1]{\begin{pmatrix}#1\end{pmatrix}}\) \(\newcommand{\mathword}[1]{\mathop{\textup{#1}}}\)
Needs:
Intervals
Needed by:
None.
Links:
Sheet PDF
Graph PDF

Interval Partitions

Why

We partition a real interval into interval pieces.

Definition

An interval partition is a finite partition of a closed real interval.

An interval partition is regular if all pieces except the largest are closed on the left and open on the right and the largest is closed.

Any regular interval partition with $n-1$ elements can be represented by $n+1$ real numbers: the endpoints of each interval. We call these the cut points of the interval partition.

Notation

Let $[a, b]$ a closed interval in $\R $ with endpoints $a, b \in \R $.

Consider a regular partition of $[a,b]$ with $n-1$ pieces. We can identify its cut points:

\[ a = a_1 < a_2 < \dots a_{n-1} < a_n = b. \]

The pieces of the partition are:

\[ [a_1, a_2), [a_2, a_3), \dots , [a_{n-2}, a_{n-1}), [a_{n-1}, a_n]. \]

Copyright © 2023 The Bourbaki Authors — All rights reserved — Version 13a6779cc About Show the old page view