TheoremBase

The Increasing Listing of a Partition: Endpoints, Lengths, Covering, Unions, Inserting a Point, Concatenation and Uniform Partitions

A partition of [a,b] is listed by exactly one strictly increasing bijection x_1<...<x_{n+1} from [n+1], starting at a and ending at b; the gaps are positive and add up to b-a, the intervals [xix_i,xi+1x_{i+1}] cover [a,b], unions of partitions are common refinements, and inserting one point shifts the enumeration by one place.

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, and let partitions of [a,b][a,b] and their refinements be as in Partitions of a Closed Interval, the Set of Partitions, and Refinements. Let [m]={1,…,m}[m]=\{1,\dots,m\} for m∈N0m\in\mathbb{N}_{0} be as in Intervals of Natural Numbers (ii), and let #P\#P be the number of elements of a finite set PP. Let PP be a partition of [a,b][a,b].

There is exactly one n∈Nn\in\mathbb{N} for which some bijection x:[n+1]→Px:[n+1]\to P, i↦xii\mapsto x_{i}, satisfies xi<xjx_{i}<x_{j} for all i,j∈[n+1]i,j\in[n+1] with i<ji<j; for this nn there is exactly one such bijection xx; and #P=n+1\#P=n+1, x1=ax_{1}=a and xn+1=bx_{n+1}=b, so that a=x1<x2<⋯<xn+1=ba=x_{1}<x_{2}<\dots<x_{n+1}=b.

With nn and xx as in (i): for i∈[n]i\in[n], both ii and i+1i+1 lie in [n+1][n+1], by Intervals of Natural Numbers: Initial Segments, Adding One Element, Splitting and Shifting (i), Intervals of Natural Numbers: Initial Segments, Adding One Element, Splitting and Shifting (ii) and Arithmetic and Order of the Natural Numbers (ix), so xix_{i} and xi+1x_{i+1} are defined.

xi+1−xi>0x_{i+1}-x_{i}>0 for every i∈[n]i\in[n]; the map [n]→R[n]\to\mathbb{R}, i↦xi+1−xii\mapsto x_{i+1}-x_{i}, exists by The Map of Consecutive Differences of a Finite List of Reals Exists, and Its Sum Telescopes (i); and, for the finite sum of Iterated Operations: Finite Sums and Finite Products (iii), which is also the sum over the finite set [n][n] by Natural Numbers as Indices: ℕ ⊆ ℕ₀, 1 ∈ ℕ₀, and the Two Readings of an Operation from 1 to n (v),

∑i=1n(xi+1−xi)=b−a.\sum_{i=1}^{n}(x_{i+1}-x_{i})=b-a .

For every t∈[a,b]t\in[a,b] there is i∈[n]i\in[n] with xi≤t≤xi+1x_{i}\le t\le x_{i+1}.

If QQ is a partition of [a,b][a,b], then P∪QP\cup Q is a partition of [a,b][a,b] and a refinement of both PP and QQ.

Let y∈[a,b]y\in[a,b]. Then P∪{y}P\cup\{y\} is a partition of [a,b][a,b] and a refinement of PP. If y∉Py\notin P, then there is exactly one j∈[n]j\in[n] with xj<y<xj+1x_{j}<y<x_{j+1}; for P∪{y}P\cup\{y\} the nn of (i) is n+1n+1, and the bijection z:[(n+1)+1]→P∪{y}z:[(n+1)+1]\to P\cup\{y\} of (i) for P∪{y}P\cup\{y\} satisfies zk=xkz_{k}=x_{k} for every k∈[n+1]k\in[n+1] with k≤jk\le j, zj+1=yz_{j+1}=y, and zk+1=xkz_{k+1}=x_{k} for every k∈[n+1]k\in[n+1] with j<kj<k.

Let c∈Rc\in\mathbb{R} with a<c<ba<c<b, let P1P_{1} be a partition of [a,c][a,c] and P2P_{2} a partition of [c,b][c,b], and let p,q∈Np,q\in\mathbb{N} and y:[p+1]→P1y:[p+1]\to P_{1}, z:[q+1]→P2z:[q+1]\to P_{2} be the nn and the bijection of (i) for P1P_{1} and for P2P_{2}, respectively. Then P1∪P2P_{1}\cup P_{2} is a partition of [a,b][a,b]; for it the nn of (i) is p+qp+q, and its bijection x:[(p+q)+1]→P1∪P2x:[(p+q)+1]\to P_{1}\cup P_{2} of (i) satisfies xi=yix_{i}=y_{i} for every i∈[p+1]i\in[p+1] and xp+j=zjx_{p+j}=z_{j} for every j∈[q+1]j\in[q+1]; here [p+1]⊆[(p+q)+1][p+1]\subseteq[(p+q)+1] and p+j∈[(p+q)+1]p+j\in[(p+q)+1] by Splitting the Segment [m+n] into [m] and a Shifted Copy of [n] (i), Splitting the Segment [m+n] into [m] and a Shifted Copy of [n] (ii), Arithmetic and Order of the Natural Numbers (i) and Arithmetic and Order of the Natural Numbers (ii).

Let c∈Rc\in\mathbb{R} with a<c<ba<c<b. Then (P∪{c})∩[a,c](P\cup\{c\})\cap[a,c] is a partition of [a,c][a,c], (P∪{c})∩[c,b](P\cup\{c\})\cap[c,b] is a partition of [c,b][c,b], and their union is P∪{c}P\cup\{c\}.

Let N∈NN\in\mathbb{N}, the natural numbers being read in R\mathbb{R} as in The Real Line: Standing Notation and Background for Calculus on Intervals (vii), and let h=(b−a)/Nh=(b-a)/N, where 0<N0<N in R\mathbb{R} by Inequalities in an Ordered Field: Mixed Transitivity, Strict Sums, Signs, Products, Natural Numbers, Halving, Reciprocals, Absolute Values and Squares (vi). For k∈[N+1]k\in[N+1] let wk=a+(k−1)hw_{k}=a+(k-1)h, where 1≤k1\le k by Arithmetic and Order of the Natural Numbers (x) and k−1∈N0k-1\in\mathbb{N}_{0} is the difference of The Difference of Two Natural Numbers with Zero (i). Then {wk:k∈[N+1]}\{w_{k}:k\in[N+1]\} is a partition of [a,b][a,b]; for it the nn of (i) is NN and the bijection of (i) is k↦wkk\mapsto w_{k}; and wk+1−wk=hw_{k+1}-w_{k}=h for every k∈[N]k\in[N], where k,k+1∈[N+1]k,k+1\in[N+1] by (ii).

Proofs

Log in to submit a proof.

Loading...

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…