TheoremBase

A Closed Interval Covered by Open Intervals Is No Longer than Their Total Length

If a closed interval [p,q] is covered by finitely many, or by a sequence of, open intervals (ama_m,bm)b_m), then q-p is at most the sum of the lengths bm−amb_m-a_m, the sum formed in [0,∞].

Statement

In the setting of Routine Facts Used Without Citation: Arithmetic, Maps, Predicativity and Indices, let R\mathbb{R}, its order and its arithmetic be as in The Real Numbers, with the Natural Numbers, Integers and Rationals Identified with Subsets of the Reals, and Completeness (ii), the intervals [p,q][p,q] and (a,b)(a,b) as in Intervals of the Real Line (ii), [0,∞][0,\infty] and its order ≤\le as in The Extended Real Line, Its Order, and [0,∞] (ii) and The Extended Real Line, Its Order, and [0,∞] (iii), and its sum ++ as in Addition and Multiplication on [0,∞] (i). Sums over finite sets of maps into [0,∞][0,\infty] are as in Sums and Products over a Finite Set and over an Interval (i), Sums and Products over a Finite Set and over an Interval (ii), Sums and Products over a Finite Set and over an Interval (iii) and Sums and Products over a Finite Set and over an Interval (v), for ++, which is associative and commutative with neutral element 00 by Arithmetic in [0,∞]: Monoid Laws, Distributivity, Monotonicity and Cancellation (i), and sums of sequences in [0,∞][0,\infty] are as in Sum of a Sequence in [0,∞] (ii). Let (am)(a_{m}) and (bm)(b_{m}) be sequences in R\mathbb{R} with am≤bma_{m}\le b_{m} for every m∈Nm\in\mathbb{N}, so that bm−am∈[0,∞]b_{m}-a_{m}\in[0,\infty], and let p,q∈Rp,q\in\mathbb{R} with p≤qp\le q.

Let FF be a finite subset of N\mathbb{N} such that every x∈[p,q]x\in[p,q] lies in (am,bm)(a_{m},b_{m}) for some m∈Fm\in F. Then

q−p≤∑m∈F(bm−am).q-p\le\sum_{m\in F}(b_{m}-a_{m}).

If every x∈[p,q]x\in[p,q] lies in (am,bm)(a_{m},b_{m}) for some m∈Nm\in\mathbb{N}, then

q−p≤∑m∈N(bm−am).q-p\le\sum_{m\in\mathbb{N}}(b_{m}-a_{m}).

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…