TheoremBase

Partitions of a Closed Interval, the Set of Partitions, and Refinements

A partition of [a,b] (a<b) is a finite subset of [a,b] containing a and b; the partitions of [a,b] form a set, and Q refines P when P is contained in Q.

Statement

In the setting of The Real Line: Standing Notation and Background for Calculus on Intervals, let a,b∈Ra,b\in\mathbb{R} with a<ba<b, let [a,b][a,b] be the closed interval, and let finite sets be as in Finite Sets (i).

A partition of [a,b][a,b] is a finite set PP with P⊆[a,b]P\subseteq[a,b], a∈Pa\in P and b∈Pb\in P.

The set of partitions of [a,b][a,b] is

Πa,b={P∈P([a,b]):P is finite, a∈P and b∈P},\Pi_{a,b}=\{P\in\mathcal{P}([a,b]):P\text{ is finite},\ a\in P\text{ and }b\in P\},

the subset of the power set P([a,b])\mathcal{P}([a,b]) given by a predicative condition (Induction over Finite Sets, and Predicative Formulas for the Segments [n] and for Finiteness (ii)), a set by Sets and Maps: Ordinary Notation (iii). As the elements of P([a,b])\mathcal{P}([a,b]) are the subsets of [a,b][a,b], for every set PP: P∈Πa,bP\in\Pi_{a,b} if and only if PP is a partition of [a,b][a,b].

For partitions PP and QQ of [a,b][a,b], QQ is a refinement of PP, or QQ refines PP, if P⊆QP\subseteq Q.

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…