Measures

In this section we cover the fundamentals of measures. A measure is mapping from a σ-algebra to [0,] that we think of as assigning a numerical size to each set in the σ-algebra.

Defining measures

Definition

Fix a σ-algebra B on a set X. A measure on (X,B) is a function μ:B[0,] with the following properties.

  1. μ()=0
  2. One has μ(n=1Bn)=n=1μ(Bn) whenever B1,B2,B3, are pairwise disjoint sets in B.

The second property is called countable additivity. A sequence B1,B2, of subsets of X is pairwise disjoint when BiBj= for all ij. We think of the second property as saying that we can calculate the size of a set by breaking it up into infinitely many pieces and summing the sizes.

Note that the definition is plausible: because every σ-algebra contains the empty set we may require a map from B to [0,] satisfies the first property, and because σ-algebra are closed under countable unions, it makes sense to calculate the left-hand side in the second property whenever B1,B2, belong to B.

By a measure space we mean a triple (X,B,μ) where (X,B) is a measurable space and μ is a measure on B.

Examples

Interesting measures tend to be difficult to construct because which sets belong to a σ-algebra is often difficult to describe. The construction of the most important measure - the Lebesgue measure on the real line - takes up most of the next section. We go here through some examples of measures for which there are explicit formulae.

Counting measure

Fix a set X. The counting measure on X is defined on (X,P(X)) by μ(E)=sup{|A|:AE with 0|A|<} and gives the cardinality of E when E is finite, and otherwise. If, for example, we take X=R then μ({2,4,π})=3 and μ(N)=.

Point measure

Fix a non-empty set X and a point aX. The point measure at a is defined on (X,P(X)) by μ(E)={1aE0aE and ascribes size according only to whether it contains the point a. We sometimes write δa for the point measure at a. If, for example, we take X=R and a=2 then μ({2,4,π})=1 and μ(N)=0.

First properties

We cover here some fundamental properties of measures. With the perspective of a measure as assigning sizes to subsets of X each should seem reasonable. For example, the first property says that μ(B)μ(C) whenever BC. It simply verifies that larger sets in the sense of set containment cannot have smaller measure.

Theorem

Fix a measure space (X,B,μ).

  1. Monotonicity If B,CB with BC then μ(B)μ(C)
  2. Subadditivity If B1,B2,B then μ(n=1Bn)n=1μ(Bn)
Proof:

Fix a measure space (X,B,μ).

  1. Fix B,CB with BC. Put D=CB. The sets B and D are disjoint, so we have μ(C)=μ(B)+μ(D)μ(B) because μ(D)0.
  2. Define inductively a sequence C1=B1 and Cn+1=Bn+1(B1Bn) for all nN. The sets C1,C2, all belong to B and are pairwise disjoint. Moreover n=1Cn=n=1Bn and CnBn for all nN so μ(n=1Bn)=μ(n=1Cn)=n=1μ(Cn)n=1μ(Bn) by the definition and part 1. of this theorem.

Fix pairwise disjoint sets B1,B2, in B. Countable additivity gives μ(n=1Bn)=n=1μ(Bn)=limNn=1Nμ(Bn)=limNμ(n=1NBn) which is reminiscent of a continuity property. This is not a precise statement, as we have not said what we mean by placing a limit inside a measure. Nevertheless, limiting properties of measures are important in the development of the theory. The following theorem gives some rigorous examples.

Theorem

Fix a measure μ on a measurable space (X,B).

  1. Continuity I If B1B2 in B then μ(n=1Bn)=limnμ(Bn)
  2. Continuity II If B1B2 in B and μ(B1)< then μ(n=1Bn)=limnμ(Bn)
Proof:

Fix a measure μ on a measure space (X,B).

  1. Define C1=B1 and Cn+1=Bn+1Bn for all nN. The sets C1,C2, all belong to B and are pairwise disjoint. Moreover Bn=C1Cn and therefore μ(n=1Bn)=limni=1nμ(Ci)=limnμ(Bn) from the definition of a measure.
  2. Put Cn=B1Bn for all nN. Then C1C2 and therefore μ(n=1Cn)=limnμ(Cn) by part 3. of this theorem. Since μ(B1)< we also have μ(Bn)< for all nN. Thus μ(Cn)=μ(B1)μ(Bn) and μ(n=1Cn)=μ(B1n=1Bn)=μ(B1)μ(n=1Bn) which all combine to give the desired result.