Some of this presentation borrows liberally from Durrett’s book.
definition: A system of sets of the set is a collection of subsets of
.
definition: A -system of
is a system of sets of
which is closed under intersection.
definition: a semi-algebra of is a system of sets
of
that is closed under intersection and such that the complement of any set in the system is a finite disjoint union of sets of the system.
definition: an algebra of is a system of sets
that is closed under intersection and complement.
lemma: the system of finite unions of sets of a semi-algebra
is the smallest algebra containing
.
proof: Suppose that is a finite disjoint union of sets of
. Then for each
the complement
is a finite disjoint union of sets
of
.
. The intersection of sets of
is a set of
. Let
. Then if
it follows that for all ,
since
is a disjoint collection. Hence the complement is a disjoint union of sets of
and so is an element of
.
If then there are disjoint
and disjoint
such that
and
. The intersection
and since the intersection of elements of is an element of
, and if
implies
and
and so
. Hence the intersection of two elements of
is a finite disjoint union of elements of
.
Hence the set is closed under complement and finite intersection and so is an algebra.
Let be any algebra containing the semi-algebra
. Let
be a finite union of elements of
. Then since
is closed under finite union, it contains
. Since this is true for any such
, it
contains
.
lemma: Let be a semialgebra of
and
be a real-valued function on
such that
and when
is an element of
and
are disjoint elements of
,
. Then
when is the algebra generated from
, then
- for any
that is the finite disjoint union of sets
of
then
.
- for any
that is contained in a finite union of sets
of
then
.
proof:
In the first case, since each is also a finite disjoint union of sets
where
is an element of
, it follows that their union is a finite disjoint union of sets of
. And so
.
The second case is harder to establish. A proof by induction is a good starting point. If for elements
, it follows that
, is disjoint and the first component is a finite disjoint union of elements of
, and the second component is also a finite disjoint union of elements of
, so the (disjoint) union of the two components is a disjoint union of elements of
.
Assume the claim is valid for all sets of that are contained in a union of at most
elements of
. Then
is a disjoint finite union of sets of . and since
is a disjoint union of sets of , and by the first case
but since the case has been established,
and so
theorem: Let be the semi-algebra of open-closed intervals of the extended real line, and let
be a stieltjes function of the real line. Define
. Then there is a unique measure the borel sets of the real line that is consistent with
.
proof: the proof utilizes the extension theorem and the prior lemma.
If is a disjoint union, wlog one may assume that the intervals are ordered by increasing left endpoint, in which case
and
, and
for
. so
establishing the first requirement of the extension theorem.
Assume are real numbers. If
then wlog assume
are real numbers.
Since is right-continuous, for any
there is a
such that
and for each
there is a
such that
.
Since the open intervals cover
and by the Heine Borel theorem the open intervals have a finite subcover. Hence by the second conclusion of the support lemma,
and so
a statement true for all . hence the second requirement of the extension theorem is valid when
are real numbers such that
.
If when
are extended real numbers, then for any
that are real numbers such that
and so
.
Since this is valid for all such , it follows that
and the second condition of the extension theorem is satisfied. Hence the measure can be extended to the algebra containing the semi-algebra of open-closed intervals, and since the stieltjes function is bounded, it is sigma finite and therefore the measure can be extended to the sigma algebra containing the semi-algebra. But this collection coincides with the borel sets.
