Loading [MathJax]/jax/output/HTML-CSS/jax.js
Skip to main content
Library homepage
 

Text Color

Text Size

 

Margin Size

 

Font Type

Enable Dyslexic Font
Mathematics LibreTexts

7.5: Nonnegative Set Functions. Premeasures. Outer Measures

( \newcommand{\kernel}{\mathrm{null}\,}\)

We now concentrate on nonnegative set functions

m:M[0,]

(we mostly denote them by m or μ). Such functions have the advantage that

n=1mXn

exists and is permutable (Theorem 2 in §2) for any sets XnM, since mXn 0. Several important notions apply to such functions (only). They "mimic" §§1 and 2.

Definition 1

A set function

m:M[0,]

is said to be

(i) monotone (on M) iff

mXmY

whenever

XY and X,YM;

(ii) (finitely) subadditive (on M) iff for any finite union

nk=1Yk,

we have

mXmk=1mYk

whenever X,YkM and

Xnk=1Yk (disjoint or not);

(iii) σ-subadditive (on M) iff (1) holds for countable unions, too.

Recall that {Yk} is called a covering of X iff

XkYk.

We call it an M-covering of X if all Yk are M-sets. We now obtain the following corollary.

Corollary 7.5.1

Subadditivity implies monotonicity.

Take n=1 in formula (1).

Corollary 7.5.2

If m:C[0,] is additive (σ-additive) on C, a semiring, then m is also subadditive (σ-subadditive, respectively), hence monotone, on C.

Proof

The proof is a mere repetition of the argument used in Lemma 1 in §1.

Taking n=1 in formula (ii) there, we obtain finite subadditivity.

For σ-subadditivity, one only has to use countable unions instead of finite ones.

Note 1. The converse fails: subadditivity does not imply additivity.

Note 2. Of course, Corollary 2 applies to rings, too (see Corollary 1 in §3).

Definition 2

A premeasures is a set function

μ:C[0,]

such that

C and μ=0.

(C may, but need not, be a semiring.)

A premeasure space is a triple

(S,C,μ),

where C is a family of subsets of S (briefly, C2S) and

μ:C[0,]

is a premeasure. In this case, C-sets are also called basic sets.

If

AnBn,

with BnC, the sequence {Bn} is called a basic covering of A, and

nμBn

is a basic covering value of A;{Bn} may be finite or infinite.

Examples

(a) The volume function v on C (= intervals in En) is a premeasure, as v0 and v=0. (En,C,v) is the Lebesgue premeasure space.

(b) The LS set function sα is a premeasure if α (see Problem 7 in §4). We call it the α-induced Lebesgue-Stieltjes (LS) premeasure in E1.

We now develop a method for constructing σ-subadditive premeasures. (This is a first step toward achieving σ-additivity; see §4.)

Definition 3

For any premeasure space (S,C,μ), we define the μ-induced outer measure m on 2S (= all subsets of S) by setting, for each AS,

mA=inf{nμBn|AnBn,BnC},

i.e., mA (called the outer measure of A) is the glb of all basic covering values of A.

If μ=v,m is called the Lebesgue outer measure in En.

Note 3. If A has no basic coverings, we set mA=. More generally, we make the convention that inf =+.

Note 4. By the properties of the glb, we have

(AS)0mA.

If AC, then {A} is a basic covering; so

mAμA.

In particular, m=μ=0.

Theorem 7.5.1

The set function m so defined is σ-subadditive on 2S.

Proof

Given

AnAnS,

we must show that

mAnmAn.

This is trivial if mAn= for some n. Thus assume

(n)mAn<

and fix ε>0.

By Note 3, each An has a basic covering

{Bnk},k=1,2,

(otherwise, mAn=.) By properties of the glb, we can choose the Bnk so that

(n)kμBnk<mAn+ε2n.

(Explain from (2)). The sets Bnk (for all n and all k) form a countable basic covering of all An, hence of A. Thus by Definition 3,

mAn(kμBnk)n(mAn+ε2n)nmAn+ε.

As ε is arbitrary, we can let ε0 to obtain the desired result.

Note 5. In view of Theorem 1, we now generalize the notion of an outer measure in S to mean any σ-subadditive premeasure defined on all of 2S.

By Note 4, mμ on C, not m=μ in general. However, we obtain the following result.

Theorem 7.5.2

With m as in Definition 3, we have m=μ on C iff μ is σ-subadditive on C. Hence, in this case, m is an extension of μ.

Proof

Suppose μ is σ-subadditive and fix any AC. By Note 4,

mAμA.

We shall show that

μAmA,

too, and hence μA=mA.

Now, as AC,A surely has basic coverings, e.g., {A}. Take any basic covering:

AnBn,BnC.

As μ is σ-subadditive,

μAnμBn.

Thus μA does not exceed any basic covering values of A; so it cannot exceed their glb, mA. Hence μ=m, indeed.

Conversely, if μ=m on C, then the σ-subadditivity of m (Theorem 1) implies that of μ (on C). Thus all is proved.

Note 6. If, in (2), we allow only finite basic coverings, then the μ-induced set function is called the μ-induced outer content, c. It is only finitely subadditive, in general.

In particular, if μ=v (Lebesgue premeasure), we speak of the Jordan outer content in En. (It is superseded by Lebesgue theory but still occurs in courses on Riemann integration.)

We add two more definitions related to the notion of coverings.

Definition 4

A set function s:ME(M2S) is called σ-finite iff every XM can be covered by a sequence of M-sets Xn, with

|sXn|<(n).

Any set AS which can be so covered is said to be σ-finite with respect to s (briefly, (s) σ-finite).

If the whole space S can be so covered, we say that s is totally σ-finite.

For example, the Lebesgue premeasure v on En is totally σ-finite.

Definition 5

A set function s:ME is said to be regular with respect to a set family A (briefly, A-regular) iff for each AM,

sA=inf{sX|AX,XA};

that is, sA is the glb of all sX, with AX and XA.

These notions are important for our later work. At present, we prove only one theorem involving Definitions 3 and 5.

Theorem 7.5.3

For any premeasure space (S,C,μ), the μ-induced outer measure m is A-regular whenever

CσA2S.

Thus in this case,

(AS)mA=inf{mX|AX,XA}.

Proof

As m is monotone, mA is surely a lower bound of

{mX|AX,XA}.

We must show that there is no greater lower bound.

This is trivial if mA=.

Thus let mA<; so A has basic coverings (Note 3). Now fix any ε>0.

By formula (2), there is a basic covering {Bn}C such that

AnBn

and

mA+ε>nμBnnmBnmnBn.

(m is σ-subadditive!)

Let

X=nBn.

Then X is in Cσ, hence in A, and AX. Also,

mA+ε>mX.

Thus mA+ε is not a lower bound of

{mX|AX,XA}.

This proves (4).


This page titled 7.5: Nonnegative Set Functions. Premeasures. Outer Measures is shared under a CC BY 3.0 license and was authored, remixed, and/or curated by Elias Zakon (The Trilla Group (support by Saylor Foundation)) via source content that was edited to the style and standards of the LibreTexts platform.

Support Center

How can we help?