Serlo: EN: Existence of a measure continuation
{{#invoke:Mathe für Nicht-Freaks/Seite|oben
|info=Mathe für Nicht-Freaks: Vorlage:Banner/Maßtheorie Autorenwerbung
}} In this chapter we deal with the question when a continuation of a function on sets to a measure (which is a special function on sets) exists and consider how such a continuation can be constructed. We learn about -subadditivity and exterior measures. We will derive the theorem of Carathéodory and the measure continuation theorem.
First thoughts
Under what conditions can a set function defined on any set system be continued to a measure on the generated -algebra ? We will find the answer to this question step by step in this chapter.
A simple example will soon show that the whole thing is a bit more complicated as it first seems. Shouldn't it be intuitively sufficient that a function defined on a set system has some nice measure properties to (somehow) continue it to a measure? (Meaning, a measure on the generated -algebra ?) The set function has the measure properties if and -additivity hold. In other words, if is a pre-measure on . That this condition is necessary is clear: if is not a pre-measure on the set system , then in particular no continuation of can be a pre-measure and hence also not a measure.
So must be a pre-measure on . But this is unfortunately not sufficient: may have properties that preclude making it a volume or a measure, for instance because monotonicity is violated. We saw an example of this at the very beginning in the article volumes on rings. However, the property of -additivity can be trivially satisfied simply because there are no disjoint sets in .
Mathe für Nicht-Freaks: Vorlage:Beispiel
Therefore, let's first go back a few steps and recall our very first considerations about measurement functions.
Sub-additive function on sets
In the article volumes on rings, we introduced volume-measuring functions as extensive quantities. So doubling the size of the underlying system doubles the quantity (as for volume, mass, energy, etc.). As a central common feature of all extensive volume-measuring functions we have observed the monotonicity, i.e. the property that an increase of the size of a set / an object / a quantity also leads to an increase of the measurement result. We have generalized the monotonicity to the subadditivity, from which one can infer the monotonicity. The subadditivity says that a superset of some within a set system has more volume than the set itself. This makes sense for extensive quantities. We recall the definition:
Mathe für Nicht-Freaks: Vorlage:Definition
Only later we supplemented this extensive property by the "exact" property of additivity and in this context described the set ring as a possible domain of definition of volume-measuring functions. On set rings it was sufficient to require only the additivity to infer also subadditivity and monotonicity. But in general these two properties of a function on sets do not follow from additivity if the domain of definition has no further structure, as the example above has shown. Therefore, our first goal will be to construct a subadditive continuation of defined on a set system, which is as large as possible.
Construction of an outer volume
A subadditive set function can be interpreted as an outer approximation: If a set of sets is covered, then its volume is less than or equal to the volume of the covering sets. It does not matter whether the sets are disjoint with respect to the set or whether they cover only "roughly":
-
A set is split into sets .
-
The sets cover , but are not disjoint.
In some cases, the sum of the volumes of a disjoint aprtition might be larger than the union. This is indeed allowed for an outer approximation. We admit "upward deviations" for the the volume. This makes subadditivity easier to control under continuations, compared to additivity, and it is even possible to have a subadditive continuation on all of . On the other hand, an additive (instead of just subadditive) set function cannot generally be defined on the entire power set , as we saw in the Example of Banach-Tarski. This means that not every subset of the basic set is "exactly" measurable. However, every arbitrary set can be outer-approximated.
So let us use this connection between subadditivity and the approximation of sets by covers in the construction of a subadditive continuation. Let be a subadditive function defined on the set system . Of course, must also hold. Therefore, we can assume without restriction by defining (even if should hold). Using approximating covers, we now construct a subadditive continuation defined on the power set: for a set covered by sets (i.e., ), we define
Problem: The value of depends on the selected cover!
Mathe für Nicht-Freaks: Vorlage:Beispiel
So for to be well-defined, we must choose among all possible supersets from . We choose for every set the value for that belongs to that superset (=covering) of , which approximates the best. Because we approximate from above (outer approximation), this is just the covering that gives the smallest value for . There may be infinitely many possible coverings, so a minimum might not exist and we generalize to taking the infimum:
Mathe für Nicht-Freaks: Vorlage:Hinweis
Following the construction with the infimum we have for every and every arbitrary covering with sets that:
In the estimate above, we used that the are contained in the set of covers of which is used to for the infimum.
This inequality is already very similar to our goal: we want to obtain subadditivity for the outer approximations. However,we still have an on the left-hand side and a uon the right-hand side. It remains to establish a similar inequality with on both sides, which will be out subadditivity for .
Mathe für Nicht-Freaks: Vorlage:Satz
Mathe für Nicht-Freaks: Vorlage:Hinweis
We now have a subadditive function defined on all of , namely with . Following the considerations on outer approximation, we call a set function defined on the power set with these properties an outer volume.
Mathe für Nicht-Freaks: Vorlage:Definition
Mathe für Nicht-Freaks: Vorlage:Warnung
There still remains the question whether is continued by , i.e. whether for all . So far, we know , because one of many coverings of . But we don't know yet if there is no "lower" approximation and that the infimum over all possible covers does not yield a smaller value. Intuitively, this should be true, but we have to prove it. So what we want is: for all . This is the case if for all finite coverings of with sets we have that . In other words, we additionally need the subadditivity of on .
Mathe für Nicht-Freaks: Vorlage:Satz
To make clear that the outer volume defined as above is a continuation of , we write for it. In summary, we have proved:
Mathe für Nicht-Freaks: Vorlage:Satz
Mathe für Nicht-Freaks: Vorlage:Warnung
Finally, let us consider a short example. The outer Jordan volume is defined starting from the geometric volume in :
Mathe für Nicht-Freaks: Vorlage:Beispiel
From outer volumes to volumes
We have identified subadditivity as an essential property in the previous section and put it in the focus of the construction of a continuation. But do our considerations about subadditivity (constructing outer volumes) lead us to the final goal (constructing volumes) and if so, how can we reach it? We are still interested in an "exact" (additive) or additionally continuous (-additive) extension of the measure - on a domain which shall be as large as possible. A subadditive continuation to the whole power set (what we have) is of course fine, but we are interested an additive or -additive continuation, which might only be possible on a smaller set system than .
Let's go step by step and take care of the additivity first. If we can find out the sets on which a subadditive set function behaves additively, we have already taken a good step: By simply restricting the domain of definition to those sets, we already get a volume. And from that point, it is not far to a measure (hopefully only taking a limit , but let's see).
So the goal now is to restrict the domain of definition and thus make additive on it - so it is a volume. Now, how do we find out on which sets, is additive?
Carathéodory measurability condition
We are looking for those where the is "exact", i.e.:
These are two unknown variables ( and ) in one expression, so ti is difficult to handle. We keep only as the unknown quantity and consider (and thus also ) as arbitrarily given and known. We cannot simplify anything on the left side of the equation. So let's try to express on the right side all expressions with by and :
Since we know nothing about , we must allow for all sets with . Thus, for the sets on which is additive, we would like:
Let's recall the considerations about the approximation with coverings and the additivity as a property to have an "exact" statement of the volume. Then intuitively the sets for which the condition is fulfilled can be approximated. Approximability of a set can be interpreted as the property that approximation of outside and of inside coincide, just as for integrable functions the values for upper and lower approximation should converge to the same limit. If we understand the inner approximation of a set as an outer approximation of the complement (see picture), it follows from this consideration that if a set is measurable, then also its complement should be measurable.
-
Inner approximation of the set by .
-
Outer approximation of the set by .
This equivalence is already expressed in the above formula, because due to it is symmetric in and :
But now we have required that the equation be satisfied only for those with . If a set is measurable, then because of we cannot yet infer the measurability of the complement . To establish the desired symmetry between the approximability of a set and its complement , the defining equation of measurability must be satisfied for any . The sets for which the equation holds for all , are the sets "exactly" approximated by , therefore these are also called -measurable sets. This condition of measurability was introduced by the mathematician Constantin Carathéodory and is named after him.
Mathe für Nicht-Freaks: Vorlage:Definition
Mathe für Nicht-Freaks: Vorlage:Hinweis
Mathe für Nicht-Freaks: Vorlage:Warnung
Application of the measurability criterion
We invented a condition which is intended to allow us to find the sets on which an outer volume is additive. And indeed this works. The proof is not difficult:
Mathe für Nicht-Freaks: Vorlage:Satz
We can even already say something about the structure of :
Mathe für Nicht-Freaks: Vorlage:Satz
So we already have a -algebra without "": all that is missing is the closedness with respect to countably infinite unions. A set system with these properties is accordingly called an algebra:

Mathe für Nicht-Freaks: Vorlage:Definition
Inductively, from follows naturally the closedness with respect to any finite union.
Remember: every algebra is a ring. Every ring with is an algebra.
In summary, we found that:
Mathe für Nicht-Freaks: Vorlage:Satz
-
Recall: A -algebra contains the basic set and all limiting sets within it.
-
Recall: An algebra (of sets) also must contain . But limits of sets need not be included.
-sub-additivity and outer volumes
At this point, we have come quite far. Only the -additivity and closure with respect to countable unions is missing in order to get a measure. It is tempting to just take the limit and conclude that we have the same properties for countably infinite sets. But it is not clear whether subadditivity (as generalized monotonicity) is preserved when going over to limit values!
Mathe für Nicht-Freaks: Vorlage:Beispiel
So the reasoning we used in the previous section for finite additivity may not work if we want additivity for infinitely many disjoint sets. This is because in order for us to infer -additivity and stability under countable unions, it is necessary that subadditivity is also preserved under limit values. In other words, the inequality in the definition of subadditivity should also hold for coverings with (countably) infinite sets. The example shows that this is not true in general and has to be required separately. So we extend the notion of subadditivity to coverings with countably many sets and call this new property -subadditivity:
Mathe für Nicht-Freaks: Vorlage:Definition
Before we investigate whether we reach our goal for a -additive set function on , we introduce a new name for outer volumes with this property. We called subadditive set functions defined on the power set with outer volumes earlier. The turns a "volume" into a "measure". So it is natural to call a -subadditive set function with an outer measure.
Mathe für Nicht-Freaks: Vorlage:Definition
Mathe für Nicht-Freaks: Vorlage:Warnung
Because , every outer measure is also finitely subadditive (and hence monotonic). We can just choose as covering sets.
Construction of an outer measure
Let us recall the extension "without the " we constructed above. Maybe, it is possible to copy some useful ideas from it.
We started from a function defined on any set system with and . Then we constructed an outer volume , which we did using finite coverings that approximate by sets from :
The set function defined this way is actually subadditive on the entire power set with , so it is an outer volume. We have seen that it is a continuation of , meaning that it coincides with on the set system , provided that also has the properties of an outer volume, i.e. it is subadditive on in addition to .
Now we want to construct a -subadditive set function defined on the power set with . We call a set function with these properties an outer measure. Thus, it should also hold for countably infinite covers of a set , , that
When proving the subadditivity of the outer volume constructed above, we exploited that the value is given by the infimum over all possible finite coverings of a set . From the definition we immediately obtained an inequality very similar to subadditivity
for a set covered by sets . However, we cannot expect from the above that it is also -subadditive: The infimum is formed only over finite coverings, and it is not guaranteed that the inequality is preserved when moving to countably infinite coverings. With the Jordan volume on and the set we have already seen an example for this.
So to be able to infer the -subadditivity of and to get the inequality also for infinite covers, we must form the infimum also over these and correspondingly tweak the definition, such that it becomes:
Note that since we have also included finite covers: choose . The set function thus constructed is in fact -subadditive, and the proof is analogous to the proof of subadditivity of the outer volume constructed above:
Mathe für Nicht-Freaks: Vorlage:Satz
For the same reasons as for the construction of an outer volume, must have the properties of an outer measure on to be continued by :
Mathe für Nicht-Freaks: Vorlage:Satz
To denote that the outer measure defined above is a continuation of , we write for it. In summary, we have proved:
Mathe für Nicht-Freaks: Vorlage:Satz
Mathe für Nicht-Freaks: Vorlage:Warnung
From an outer measure to a measure
Equipped with the additional property of -additivity, we can now also show that is a -algebra and is even -additive on it. The proof is based on taking a limit starting from the intermediate result to finite additivity and going to countably infinite additivity:
Mathe für Nicht-Freaks: Vorlage:Satz
From the above estimate, by appropriate choice of , the -additivity of on directly follows:
Mathe für Nicht-Freaks: Vorlage:Satz
So, in summary, we have proved the following theorem, named after the mathematician Constantin Carathéodory:
Mathe für Nicht-Freaks: Vorlage:Satz
Intermediate conclusion of results
Let us conclude the above definitions and results:
Construction of an outer measure
We have learned the property of -subadditivity. It generalizes subadditivity to coverings (approximations) of a set with countably infinite sets and can be understood as a form of subadditivity which is preserved when passing to limits.
Mathe für Nicht-Freaks: Vorlage:Definition
An outer measure is a -subadditive function defined on the entire power set. It can be interpreted as an approximation of the volume of the subsets of , but is in general not a measure (not -additive) on the power set.
Mathe für Nicht-Freaks: Vorlage:Definition
One can construct an outer measure out of nearly every set function defined on some set system. The idea of construction is to understand the property of an outer measure as an outer approximation by coverings that should be as precise as possible. If itself has the properties of an outer measure (-subadditivity), then the outer measure constructed out of it is a continuation of .
Mathe für Nicht-Freaks: Vorlage:Satz
Theorem of Carathéodory
Using the measurability condition of Carathéodory one can find those sets on which an external measure is even additive. The sets for which the condition is fulfilled can be understood as sets which can be exactly approximated (or measured) by the outer measure.
Mathe für Nicht-Freaks: Vorlage:Definition
The set of measurable sets with respect to an outer measure is a -algebra. Further, an outer measure on the set of measurable sets is a measure: By definition of the measurability condition, a subadditive set function on the measurable sets behaves additively. If the subadditivity is preserved even in the transition to the limit, then from -subadditivity before taking the limit, we can infer -additivity after taking the limit.
Mathe für Nicht-Freaks: Vorlage:Satz
The continuation theorem
We now know: If is a -subadditive function defined on a set system with , then we can use it to construct an outer measure on the power set which continues . For this we define for any :
We can define the sets measurable with respect to an outer measure. These form a -algebra and the outer measure is -additive (a measure) to it. In what follows we keep the names , and and use them in the same sense.
The goal now is to apply these results to construct the continuation. For this we want to restrict to the -algebra generated by and finally get a measure on . What still has to be done is to prove that the original set system is really contained in the -algebra of the -measurable sets. So each original set in is indeed -measurable.
If this was not the case, we would be in serious trouble: Just restricting the to -measurable sets would then not work, since , implies . So the -algebra would be "too small", then.
Conversely, if , then , wecause the -opearator jast picks the smallest -algebra larger than and is such a -algebra.
So what we need to continue to a measure on is the measurability of sets in . In other words,
should hold for all and all . So we need a further condition on .
However, instead of simply requiring the above equation as a condition, we will use a slightly weaker condition of measurability of the sets from , which is still sufficient. For this we approximate an arbitrary set by sets . Then it suffices for the measurability of a set to require that the above equality holds only for all sets , rather than for any .
So let be any set, for which we want to show measurabilit. Let further be arbitrary and let such that
The aim is to show
by exploiting that the equation is satisfied for the in place of . From subadditivity and -subadditivity of the external measure , we conclude:
Now we have assumed that the measurability equation is satisfied for sets in . This holds for all as the are from :
The last equality holds, since the outer measure was constructed as a continuation of (see above) and on it agrees with . It follows that
Now note that by definition of we can approximate the value by appropriate choice of covers of to arbitrary precision. Let thus and let be chosen such that
It follows together with the estimates made above that
and taking the limit we get measurability of .
Thus we have finally shown this result for the measurability of the sets from :
Mathe für Nicht-Freaks: Vorlage:Satz
Finding a suitable condition for the measurability of the sets from was the last step to construct a continuation of to a measure on the -algebra generated by the set system . This finally allows us to write down the main theorem about measure continuation:
Mathe für Nicht-Freaks: Vorlage:Satz
Alternative versions of the continuation theorem
Often, the literature states the measure continuation theorem in other versions than the one formulated by us. Often not of an arbitrary set system (with ) is assumed, but additionally a certain structure is presupposed. This is especially useful with respect to the uniqueness of a continuation, because only for sufficiently "large" set systems , the measure which continues a set function is uniquely determined by the values on . This question will concern us in detail in the next chapter "Uniqueness of a continuation". Here we will only briefly consider alternative formulations of the continuation theorem.
If the set system is stable under taking differences, then the condition formulated by us in the continuation theorem for the measurability of the sets from is equivalent to (and hence also ) being additive on . This is the content of the following little theorem.
Mathe für Nicht-Freaks: Vorlage:Satz
Thus, if we assume that is a ring, we can replace the somewhat unwieldy condition for measurability of sets from with additivity in our version of the continuation theorem. (Instead of a ring, one can of course substitute any set system stable under differences (e.g. an algebra)). In fact, even a "restricted" stability under differences, as in the case of semi-rings is sufficient. Semi-rings are set systems which have somewhat less structure than rings. In particular, the difference of two sets does not necessarily lie in the semi-ring again, but can always be written as a disjoint union of finitely many sets from the set system.
Mathe für Nicht-Freaks: Vorlage:Beispiel
One can show that the continuation of a (-)additive set function of a semi-ring on the ring generated by it is always possible while preserving the (-)additivity. This justifies the following variant of the continuation theorem:
Mathe für Nicht-Freaks: Vorlage:Satz
(A German reference, where this version can be found, is Vorlage:Literatur)
We can also show that a volume on a ring is -subadditive if and only if it is -additive (a premeasure). So if is a ring (or an algebra, because every algebra is a ring), then we can summarize additivity and -subadditivity in our version of the continuation theorem as follows:
Mathe für Nicht-Freaks: Vorlage:Satz
However, the assumptions made here are relatively strong. Set rings can be large (for example, the ring of cuboid aggregates), so it may be difficult to prescribe all values of a premeasure on it. Here the following, also often used variant of the continuation theorem helps, which gets along with somewhat weaker assumptions. Also here the reason lies in the fact that a continuation of a semi-ring on the ring generated by it is possible under preservation of the -additivity.
Mathe für Nicht-Freaks: Vorlage:Satz
(A German reference, where this version can be found, is Vorlage:Literatur)
{{#invoke:Mathe für Nicht-Freaks/Seite|unten}}