TheoremBase

Lebesgue Outer Measure: Bounds from Covers by Open Intervals

The Lebesgue outer measure of a subset of the real line lies in [0,∞], is at most the total length of each of its covers by open intervals, is at least every common lower bound of these total lengths, and is approximated from above by them.

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), ∞\infty, [−∞,∞][-\infty,\infty], [0,∞][0,\infty] and the order ≤\le of [−∞,∞][-\infty,\infty] as in The Extended Real Line, Its Order, and [0,∞] (i), The Extended Real Line, Its Order, and [0,∞] (ii) and The Extended Real Line, Its Order, and [0,∞] (iii), sums of sequences in [0,∞][0,\infty] as in Sum of a Sequence in [0,∞] (ii), let P(R)\mathcal{P}(\mathbb{R}) be the power set of R\mathbb{R} and λ∗:P(R)→[0,∞]\lambda^{*}:\mathcal{P}(\mathbb{R})\to[0,\infty] the Lebesgue outer measure on R\mathbb{R}, and let covers (a,b)(a,b) by open intervals of subsets of R\mathbb{R}, pairs of sequences (am)(a_{m}) and (bm)(b_{m}) in R\mathbb{R} with am≤bma_{m}\le b_{m} for every m∈Nm\in\mathbb{N}, and their total lengths ∑m∈N(bm−am)\sum_{m\in\mathbb{N}}(b_{m}-a_{m}) in [0,∞][0,\infty] be as in Lebesgue Outer Measure on the Real Line (i). Let A⊆RA\subseteq\mathbb{R}.

λ∗(A)∈[0,∞]\lambda^{*}(A)\in[0,\infty].

For every cover (a,b)(a,b) of AA and every s∈[−∞,∞]s\in[-\infty,\infty] with s=∑m∈N(bm−am)s=\sum_{m\in\mathbb{N}}(b_{m}-a_{m}), that is, every total length ss of it, λ∗(A)≤s\lambda^{*}(A)\le s.

If t∈[−∞,∞]t\in[-\infty,\infty] and t≤st\le s for every cover (a,b)(a,b) of AA and every s∈[−∞,∞]s\in[-\infty,\infty] with s=∑m∈N(bm−am)s=\sum_{m\in\mathbb{N}}(b_{m}-a_{m}), then t≤λ∗(A)t\le\lambda^{*}(A).

If t∈[−∞,∞]t\in[-\infty,\infty] and λ∗(A)<t\lambda^{*}(A)<t, then there are a cover (a,b)(a,b) of AA and s∈[−∞,∞]s\in[-\infty,\infty] with s=∑m∈N(bm−am)s=\sum_{m\in\mathbb{N}}(b_{m}-a_{m}) and s<ts<t.

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…