Measure extension by local approximation
Iosif Pinelis

TL;DR
This paper introduces a measure extension theorem based on local approximation of sets by algebra elements, establishing a connection with Carathéodory-measurability.
Contribution
It provides a new measure extension theorem using local approximation and characterizes Carathéodory-measurable sets through local approximability.
Findings
Proves a measure extension theorem via local approximation.
Shows equivalence between local approximability and Carathéodory-measurability.
Establishes a new criterion for measurability based on local approximation.
Abstract
Measurable sets are defined as those locally approximable, in a certain sense, by sets in the given algebra (or ring). A corresponding measure extension theorem is proved. It is also shown that a set is locally approximable in the mentioned sense if and only if it is Carath\'eodory-measurable.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Functional Equations Stability Results
Measure extension by local approximation
Iosif Pinelis
Department of Mathematical Sciences
Michigan Technological University
Houghton, Michigan 49931, USA
E-mail: [email protected]
Abstract.
Measurable sets are defined as those locally approximable, in a certain sense, by sets in the given algebra (or ring). A corresponding measure extension theorem is proved. It is also shown that a set is locally approximable in the mentioned sense if and only if it is Carathéodory-measurable.
Key words and phrases:
Measures, measure extension, rings of sets, algebras of sets, -algebras of sets
2010 Mathematics Subject Classification:
Primary 28A12; secondary 60A10
Contents
1. Introduction,
summary, and discussion
Let be a measure – that is, a nonnegative -additive function defined on an algebra over a set such that .
The measure extension problem is to extend the measure to a measure on a -algebra containing . This problem was solved by Carathéodory; see e.g. [3]. The key in his solution was to consider the set
[TABLE]
of all Carathéodory-measurable subsets of , where, as usual, denotes the outer measure corresponding to , and c denotes the complement (to ). It is then shown that is a -algebra containing , and the restriction of to is a measure extending .
When the measure is finite, one can also introduce the inner measure by the formula for all , and then the key condition in (1.1) can be rewritten in the case as . This equality of the outer and inner measures on all Carathéodory-measurable subsets of may explain the intuition behind the definition (1.1).
Moreover, one can show – see e.g. Theorem 1.4 at the end of this section – that the condition in (1.1) can be equivalently replaced by , where
[TABLE]
That is,
[TABLE]
where
[TABLE]
is the restriction of the measure to the algebra over the set , and and are the outer and inner measures corresponding to . This “localized” restatement of the definition of brings it closer to the mentioned intuition of the desired equality of the outer and inner measures of measurable sets.
Another approach to the measure extension problem is based on an approximation idea, which may be more immediately intuitive. For any subsets and of , define the “distance” between them by the formula
[TABLE]
where denotes the symmetric difference between and . The idea is then to define the set of all measurable subsets of as the closure of the algebra with respect to the pseudometric . This idea was carried out in [2, Appendix 1] in the case when is a probability measure. Of course, one can quite similarly do for any finite measure ; cf. e.g. [1, Theorem 1.5.6].
However, without modifications, this approach will not work in general even when the measure is -finite. For instance, suppose that , is the smallest algebra containing all left-open intervals in , and is the Lebesgue measure on , so that is -finite. Let now , so that is in the -algebra generated by . Then it is easy to see that for any . Moreover, [5, Example 4.19] shows that there exist a set , an algebra over , a -finite measure on , and a set such that but for all .
The approximation idea can be saved, though, by combining it with appropriate localization. That is, a measurable set may be only “locally” approximable by sets in the algebra . Specifically, for any consider the following “localized” version of the definition (1.4):
[TABLE]
for any subsets and of . Thus, for the “distance” defined by (1.4), we have .
Now recall (1.2) and let denote the set of all subsets of such that for each and each real there is some such that :
[TABLE]
Note that here we use the “-finite” subset of the algebra (rather than itself); this localization idea is similar to the one that led us to (1.3).
Theorem 1.1**.**
* is a -algebra over , and .*
The necessary proofs are given in Section 2.
Theorem 1.2**.**
*The outer measure is -additive on the -algebra . *
So, in view of (2.2), the restriction
[TABLE]
of to is a measure that extends from the algebra to the -algebra .
Theorem 1.3**.**
If the measure on is -finite, then the -additive extension of to is unique.
Of course, the -finiteness condition in Theorem 1.3 is essential; for instance, see [5, Example 4.20].
Let us also compare the set , defined by (1.5), of all sets locally approximable by sets in algebra with the set , defined by (1.1), of all sets measurable in the Carathéodory sense, as well as with the completion
[TABLE]
of the -algebra generated by algebra . Let us also consider the following “” counterparts of the Carathéodory set and the set :
[TABLE]
Theorem 1.4**.**
. If the measure on is -finite, then .
In [4, Theorem 2.3], it was shown that the restriction of to is -additive. The -finiteness condition in the second sentence of Theorem 1.4 is essential; cf. e.g. [5, Example 4.28].
Remark 1.5**.**
The condition will never be used in the proofs of Theorems 1.1–1.4 (to be given in Section 2). So, these theorems will hold even if is only assumed to be a ring (but not necessarily an algebra) of subsets of .
2. Proofs
First here, let us recall the definition and basic properties of the outer measure corresponding to the given measure on the algebra .
Take any set . Let denote the set of all sequences in such that . Let also denote the set of all disjoint sequences , so that whenever and . Consider the outer measure
[TABLE]
of the set corresponding to the measure on the algebra . The following properties of the outer measure are well known and easy to check: for any subsets of , one has
**positivity: **
;
**monotonicity: **
if then ;
**subadditivity: **
m^{*}\big{(}\bigcup_{n}E_{n}\big{)}\leqslant\sum_{n}m^{*}(E_{n});
**“disjoint” version: **
in the definition (2.1) of the outer measure, one may replace by .
The latter property follows immediately by simple and well-known
Remark 2.1**.**
For any sequence in and the sequence defined by the condition , one has the following: is a disjoint sequence in , for all , and
Another useful property of the outer measure is just a bit more involved:
Proposition 2.2**.**
Take any disjoint sequence in . Then
[TABLE]
Proof.
Let . Then trivially , so that, by (2.1), .
To prove the reverse inequality, take any and any natural . Let , so that . Then, by the -additivity of on ,
[TABLE]
Taking now the infimum over all and recalling the “disjoint” version of the definition of the outer measure, we see that . Finally, letting , we confirm the reverse inequality, , which completes the proof of Proposition 2.2. ∎
An immediate and important consequence of Proposition 2.2 is that
[TABLE]
that is, is an extension of from to the set of all subsets of .
Note the following properties of the functions : for any and any subsets of ,
- (I)
is a pseudometric; 2. (II)
; 3. (III)
d_{A}\Big{(}\bigcup\limits_{n}E_{n},\bigcup\limits_{n}B_{n}\Big{)}\leqslant\sum\limits_{n}d_{A}(E_{n},B_{n}) and
d_{A}\Big{(}\bigcap\limits_{n}E_{n},\bigcap\limits_{n}B_{n}\Big{)}\leqslant\sum\limits_{n}d_{A}(E_{n},B_{n}); 4. (IV)
.
Property (I) follows because the outer measure is nonnegative, monotone, and subadditive, whereas and . Concerning Property (II), it is enough to note that . To check Property (III), note that and , and then use again the monotonicity and subadditivity of . Finally, Property (IV) as well follows by the monotonicity and subadditivity of , since A\cap E\subseteq(A\cap B)\cup\big{(}A\cap(E+B)\big{)}.
Now we are ready to present
Proof of Theorem 1.1.
Take any and any real .
Note first that , since .
Moreover, if , then for ; so, .
That is closed with respect to the complement easily follows from Property (II) of , which yields if .
Also, Property (III) of shows that is closed with respect to the finite unions. So, is an algebra.
To complete the proof of Theorem 1.1, it remains to show that is closed with respect to the countable unions.
First here, take any disjoint sequence in . Then for any natural
[TABLE]
by Proposition 2.2. On the other hand, for any natural ,
[TABLE]
since . Hence, , which implies that as . So, by (2.3), – for any disjoint sequence in .
Moreover, since is an algebra, in view of Remark 2.1 it now follows that for any, not necessarily disjoint, sequence in .
Finally, take any in . Then for each there is some such that . By the last paragraph, , and so, d_{A}\big{(}\bigcup_{n}B_{n},B)<\varepsilon for some . By Properties (I) and (III) of ,
[TABLE]
This completes the proof of Theorem 1.1. ∎
Proof of Theorem 1.2.
In view of the subadditivity property of , it is enough to show that is finitely superadditive; that is, for any disjoint and in , one has
[TABLE]
Take indeed any such and . Take also any real . If , then inequality (2.4) is trivial. So, without loss of generality . Hence, in view of the “disjoint” version of the definition of the outer measure, for some sequence we have
[TABLE]
and so, for any natural and ,
[TABLE]
Further, since and are in , one can find and in such that
[TABLE]
here and in what follows, is or . By Property IV of the pseudometrics ,
[TABLE]
On the other hand, using first the monotonicity of and the condition , and then Proposition 2.2 and (2.5), we have
[TABLE]
if is large enough – which latter will be assumed in the sequel. It follows from the subadditivity of , (2.8), (2.9), and (2.2) that
[TABLE]
Therefore,
[TABLE]
the penultimate inequality here holds by Property (III) of the pseudometrics , taking also into account that and , whereas the last inequality in (2.10) follows immediately from (2.7). Comparing the multi-line display (2.10) with (2.6), we see that , which concludes the proof of (2.4) and thus the proof of Theorem 1.2. ∎
Proof of Theorem 1.3.
Recall that the -finiteness of the measure on means that there is a disjoint sequence in such that . In the rest of this proof, let be such a sequence.
In addition to the restriction of to , let be another measure that extends from the algebra to the -algebra . Take any .
By the “disjoint” version of the definition of the outer measure, for each real there is a sequence such that . So, {\tilde{m}}(E)\leqslant{\tilde{m}}\big{(}\bigcup_{n}A_{n}\big{)}=\sum_{n}{\tilde{m}}(A_{n})=\sum_{n}m(A_{n})<r, for any real . Thus, .
So, for each one has and . Adding now inequalities and , we get unless . But contradicts the condition that both and are extensions of the measure on .
Thus, for all , whence , for all . ∎
The following characterization of the outer measure will be useful in the proof of Theorem 1.4, and it may also be of independent interest.
Proposition 2.3**.**
Take any . Then
[TABLE]
Morever, the second of the two infima is attained, and hence the first one is attained.
Proof.
That follows because . That follows because for any such that one has . So, .
Thus, to complete the proof of Proposition 2.3, it is enough to construct some such that and . Such a construction is easy. Indeed, for each natural there is a sequence \big{(}A_{n}^{(k)}\big{)}_{n=1}^{\infty}\in c_{\mathrm{d}}(E) such that and . Let now . Then indeed , , and . ∎
Proof of Theorem 1.4.
The first sentence of Theorem 1.4 will be verified in the following six steps.
Step 1: verification of . This follows immediately, because for any subsets and of .
Step 2: verification of . Take any . Take next any real and any . Then for some . Take any such . Then, by Theorem 1.1, and therefore for some , whence, by the triangle inequality, . So, . Step 2 is complete.
Step 3: verification of . Take any . Take next any real and any . Then for each natural there is some set such that . Let , where . Note that and for any natural , since for all . So, by Property III of , we have for all , whence , for any natural . Thus, , which means that . Step 3 is complete.
Step 4: verification of . Take any and then any . By Proposition 2.3, for some one has and . Then , , , and , whence
[TABLE]
so that . The reverse inequality follows by the subadditivity of . Thus, , for any . Step 4 is complete.
Step 5: verification of . This is trivial.
Step 6: verification of . Take any and then any and any real . We want to show here that for some . The conditions and yield
[TABLE]
Next, for some sequences and we have
[TABLE]
Moreover, without loss of generality ; otherwise, replace and by and , respectively. Since and , it follows that
[TABLE]
By the first inequality in (2.12), , because . So, for some natural we have . Let now Then and
[TABLE]
Since and , we have . Therefore and in view of (2.12), (2.13), and (2.11),
[TABLE]
This and (2.14) yield the desired result:
[TABLE]
This completes Step 6 and thus the entire proof of the first sentence of Theorem 1.4.
It remains to verify its second sentence. To do this, assume that is -finite, so that there is a disjoint sequence in such that . Take now any . Since , for each natural there is some set such that . Here one can replace by , so that without loss of generality . Let then , so that and for each . Since is -additive on and , it follows that . So, , for any – if is -finite.
Theorem 1.4 is now completely proved. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] V. I. Bogachev. Measure theory. Vol. I, II . Springer-Verlag, Berlin, 2007.
- 2[2] A. A. Borovkov. Probability theory . Gordon and Breach Science Publishers, Amsterdam, 1998. Translated from the 1986 Russian original by O. Borovkova and revised by the author.
- 3[3] P. R. Halmos. Measure Theory . D. Van Nostrand Company, Inc., New York, N. Y., 1950.
- 4[4] H. von Weizsäcker. Basic Measure Theory . Lecture Notes. Technische Universität Kaiserslautern, 2008. Revised Translation, http://bit.ly/2j S 1a Pf .
- 5[5] G. L. Wise and E. B. Hall. Counterexamples in probability and real analysis . The Clarendon Press, Oxford University Press, New York, 1993.
