Notes

Borel algebra

If A and B are any two sets, let AB be the set of all elements in A that are not in B (This does not imply BA).

A family R of sets is called a ring if A,BR implies

ABR,

. ABR.

Notice that the conditions imply ABR if its a ring.

A ring is called a σ ring if

n=1AnR,

for any countable sequence of sets AnR.

If this condition is fulfilled, then

n=1AnR

also holds.

A set function ϕ defined on R assigns to every element of a number ϕ(A) of the extended number system. ϕ is additive if AB=0 implies

ϕ(AB)=ϕ(A)+ϕ(B),

and it is countably additive if AiAj=0 (ij) implies

ϕ(n=1An)=n=1ϕ(An).

Notice that nonnegative additive set functions are monotonic by inclusion. In addition, for additive set functions,

ϕ(AB)=ϕ(A)ϕ(B)

if BA and |ϕB|<+.

Suppose ϕ is countably additive on a ring R. If AnR and AnAn+1,AR and

A=n=1An,

Then as n,

ϕ(An)ϕ(A)

Lebesgue measure

An elementary set is a union of a finite element of intervals. The family of all elementary subsets of Rp is denoted E.

The following properties may be verified,

  1. E is a ring but not a σ-ring.
  2. m defined by m([a,b])=Πi=1p(biai) is well defined and additive on E.

A nonnegative additive set function is regular if for every AE and to every ε>0 there exist sets F,GE such that F is closed, G is open, FAG, and

ϕ(G)εϕ(A)ϕ(F)+ε

m is regular, μ(a,b)=α(b)α(a) where α is monotonically increasing is regular on the real line.

Every regular set function on E can be extended to a countably additive set function on a σ -ring which contains E.

Let μ be additive, regular, nonnegative and finite on E. Consider countable coverings of any set ERp by open elementary sets An:

En=1An

Define μ(E)=infn=1μ(An), the inf being taken over all countable coverings of E by open elementary sets. μ(E) is called the outer measure of E, corresponding to μ.

Properties of an outer measure.

  1. The outer measure is nonnegative for all E.
  2. It is monotonic by inclusion.
  3. Its restriction to elementary set is equivalent to the original measure.
  4. Subadditivity: If E=1En, then

μ(E)n=1μ(En)

Distances between sets

For any A,BRp, we define the symmetric difference and the distance functions

S(A,B)=(AB)(BA), d(A,B)=μ(S(A,B)).

We write AnA if limnd(A,An)=0.

  1. If there is a sequence of elementary sets converging to A, we say its finitely μ measurable

and write AMF(μ).

  1. If A is the union of a countable collection of finitely μ measurable sets, then A is μ measureable and write AM(μ).

Properties of the symmetric difference and the distance function.

  1. S(A,B)S(A,C)S(C,B).
  2. S(A1A2,B1B2),S(A1A2,B1B2),S(A1A2,B1B2)S(A1,B1)S(A2,B2)

The distance function follow analagous relations with the relevant set operations becoming the appropriate arithmetic operations.

There is also the property

|μ(A)μ(B)|d(A,B)

if at least one of μ(A),μ(B) is finite.

The distance function is almost a true metric but different sets can have zero distance. Thus we may instead define equivalence in terms of vanishing distance. This equivalence relation makes MF(μ) be the closure of E.j

M(μ) is a σ-ring and μ is countably additive on M(μ).

The extended set function is called a measure, and the Lebesgue measure on Rp is thus the special case μ=m.

Borel sets

A borel set is a set that can be obtained by a countable number of unions,intersectoins or complements starting from open sets. The collection of all Borel sets is a σ -ring, in fact the smallest one which contains all open sets. An element of a borel set is μ measureable. Every μ measurable set is the union of a Borel set and a set of measure zero.

Measure spaces

A set X is a measure space if there exists a σ ring M of subsets of X (the measurable sets) and a non-negative countably additive measure defined on M. If, in adddition, XM, then X is said to be a measurable space.

Measurable functions

A function is measurable if the set {x|f(x)>a} is measurable for every real a. Equality can be included.

Making more measurable functions.

  1. If f is measurable, then |f| is measurable.
  2. Let {fn} be a sequence of measurable functions. For xX, put

g(x)=supfn(x)

h(x)=limnsupfn(x), Then g and h are measurable.

This results in the following corollaries,

  1. If f and g are measurable, then max(f,g) and min(f,g) are measurable
  2. The limit of a convergent sequence of measurable functions is measurable.

Common binary operations are also preserve measurability.

Let f and g be measurable real-valued functions defiend on X, let F be real and continuous on R2. Then F(f(x),g(x)) is measurable.

Thus common operations of analysis can be applied to measurable functions to give measurable functions. An example where measurability doesn’t carry over is h(x)=f(g(x)), where f is measurable and g is continuous, but h is not necessarily measurable. Interestingly, we were able to define measurable functions without referencing any particular measure. Thus, the class of measurable functions on X depends on the σ ring M.

Simple functions

Let s be a real-valued function defined on X. If the range of s is finite, then s is a simple function. Let EX and put define KE(x)=1 when xE and zero otherwise as the characteristic function of E. Denoting Ei=s1({ci}) where ci make up the range of s, we can decompose any simple function into a linear combinations of characteristic functions, s=i=1nciKEi.

s is measurable iff Ei are measurable.

This allows us to approximate every function by simple functions.

Let f be a real function on X. There exists a sequence {sn} of simple funcitons such that sn(x)f(x) as n, for every xX. If f is measurable, {sn} may be chosen to be a sequence of measurable functions. If f0, {sn} may be chosen to be a monotonically increasing sequence.

sn can be constructed as

sn=i=1n2ni12nKEni+nKFn

for non-negative f. For general functions, the function can be split into the difference between its positive and negative components. The sequence converges uniformly to f if f is bounded.

Lebesgue Integration

Suppose (xX,ci>0) s(x)=i=1nciKEi(x) is measurable and EM. We define

IE(s)=i=1nciμ(EEi). If f is measurable and non-negative, we define

Efdμ=supIE(s),

where the sup is taken over all measurable simple functions s such that 0sf.

The integral may have the value +. If the integral of each of the positive and negative components of a function is finite, then f is said to be integrable, or fL(μ). Integrability carries over to subsets.

Suppose f is measurable and non-negative on X. For AM, define

ϕ(A)=Afdμ.

Then ϕ is countably additive on M. The same conclusion holds for any fL(μ).

Suppose EM. Let {fn} be a sequence of measurable functions such that 0f1(x)f2(x). Let f be defined by fn(x)f(x) as n. Then

EfndμEfdμ

A corollary of the result is that the lebesgue integral and summation of a sequence of measurable functions commute.

Suppose EM. If {fn} is a sequence of non-negative measurable functions and

f(x)=limninffn(x),

then

EfdμlimninfEfndμ

Suppose EM. Let {fn} be a sequence of measurable functions such that fn(x)f(x) as n. If there exists a function gL(μ) such that

|fn(x)|g(x)

for all n, then,

limnEfndμ=Efdμ

In summary, the limits of measurable functions are always measurable, whereas the limits of Riemann-integrable functions may fail to be Riemann-integrable.