7.5: Nonnegative Set Functions. Premeasures. Outer Measures
( \newcommand{\kernel}{\mathrm{null}\,}\)
We now concentrate on nonnegative set functions
(we mostly denote them by
exists and is permutable (Theorem 2 in §2) for any sets
A set function
is said to be
(i) monotone (on
whenever
(ii) (finitely) subadditive (on
we have
whenever
(iii)
Recall that
We call it an
Subadditivity implies monotonicity.
Take
If
- Proof
-
The proof is a mere repetition of the argument used in Lemma 1 in §1.
Taking
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).
A premeasures is a set function
such that
(
A premeasure space is a triple
where
is a premeasure. In this case,
If
with
is a basic covering value of
(a) The volume function
(b) The LS set function
We now develop a method for constructing
For any premeasure space
i.e.,
If
Note 3. If
Note 4. By the properties of the glb, we have
If
In particular,
The set function
- Proof
-
Given
we must show that
This is trivial if
for some Thus assumeand fix
.By Note 3, each
has a basic covering(otherwise,
) By properties of the glb, we can choose the so that(Explain from (2)). The sets
(for all and all form a countable basic covering of all hence of Thus by Definition 3,As
is arbitrary, we can let to obtain the desired result.
Note 5. In view of Theorem 1, we now generalize the notion of an outer measure in
By Note 4,
With
- Proof
-
Suppose
is -subadditive and fix any By Note 4,We shall show that
too, and hence
.Now, as
surely has basic coverings, e.g., Take any basic covering:As
is -subadditive,Thus
does not exceed any basic covering values of so it cannot exceed their glb, Hence indeed.Conversely, if
on then the -subadditivity of (Theorem 1) implies that of (on ). Thus all is proved.
Note 6. If, in (2), we allow only finite basic coverings, then the
In particular, if
We add two more definitions related to the notion of coverings.
A set function
Any set
If the whole space
For example, the Lebesgue premeasure
A set function
that is,
These notions are important for our later work. At present, we prove only one theorem involving Definitions 3 and 5.
For any premeasure space
Thus in this case,
- Proof
-
As
is monotone, is surely a lower bound ofWe must show that there is no greater lower bound.
This is trivial if
.Thus let
so has basic coverings (Note 3). Now fix any .By formula (2), there is a basic covering
such thatand
(
is -subadditive!)Let
Then
is in hence in and Also,Thus
is not a lower bound ofThis proves (4).


