1. Random
  2. 0. Foundations
  3. 1
  4. 2
  5. 3
  6. 4
  7. 5
  8. 6
  9. 7
  10. 8
  11. 9
  12. 10
  13. 11
  14. 12
  15. 13
  16. 14
  17. 15
  18. 16
  19. 17
  20. 18
  21. 19

11. Measurable Spaces

In this section we discuss some topics from measure theory that are a bit more advanced than the topics in the early sections of this chapter. However, measure-theoretic ideas are essential for a deep understanding of probability, since probability is itself a measure. The most important of the definitions is the σ-algebra, a collection of subsets of a set with certain closure properties. Such collections play a fundamental role, even for applied probability, in encoding the state of information about a random experiment.

On the other hand, we won't be overly pedantic about measure-theoretic details in this text. Unless we say otherwise, we assume that all sets that appear are measurable (that is, members of the appropriate σ-algebras), and that all functions are measurable (relative to the appropriate σ-algebras).

Although this section is somewhat abstract, many of the proofs are straightforward. Be sure to try the proofs yourself before expanding the details.

Algebras and σ-Algebras

Suppose that S is a set playing the role of a universal set for a particular mathematical model. It is sometimes impossible to include all subsets of S in our model, particularly when S is uncountable. In a sense, the more sets that we include, the harder it is to have consistent theories. However, we almost always want the collection of admissible subsets to be closed under the basic set operations. This leads to some important definitions.

Algebras of Sets

Suppose that S is a nonempty collection of subsets of S. Then S is an algebra (or field) if it is closed under complement and union:

  1. If AS then AcS.
  2. If AS and BS then ABS.

If S is an algebra of subsets of S then

  1. SS
  2. S
Details:
  1. Since S is nonempty, there exists AS. Hence AcS so S=AAcS.
  2. =ScS

Suppose that S is an algebra of subsets of S and that AiS for each i in a finite index set I.

  1. iIAiS
  2. iIAiS
Details:
  1. This follows by induction on the number of elements in I.
  2. This follows from (a) and De Morgan's law. If AiS for iI then AicS for iI. Therefore iIAicS and hence iIAi=(iIAic)cS.

Thus it follows that an algebra of sets is closed under a finite number of set operations. That is, if we start with a finite number of sets in the algebra S, and build a new set with a finite number of set operations (union, intersection, complement), then the new set is also in S. However in many mathematical theories, probability in particular, this is not sufficient; we often need the collection of admissible subsets to be closed under a countable number of set operations.

σ-Algebras of Sets

Suppose that S is a nonempty collection of subsets of S. Then S is a σ-algebra (or σ-field) if the following axioms are satisfied:

  1. If AS then AcS.
  2. If AiS for each i in a countable index set I, then iIAiS.

Clearly a σ-algebra of subsets is also an algebra of subsets, so the basic results for algebras in still hold. In particular, SS and S.

If AiS for each i in a countable index set I, then iIAiS.

Details:

The proof is just like the one in [3] for algebras. If AiS for iI then AicS for iI. Therefore iIAicS and hence iIAi=(iIAic)cS.

Thus a σ-algebra of subsets of S is closed under countable unions and intersections. This is the reason for the symbol σ in the name. As mentioned in the introductory paragraph, σ-algebras are of fundamental importance in mathematics generally and probability theory specifically, and thus deserve a special definition:

If S is a set and S a σ-algebra of subsets of S, then (S,S) is called a measurable space.

The term measurable space will make more sense when we discuss positive measures on such spaces.

Suppose that S is a set and that S is a finite algebra of subsets of S. Then S is also a σ-algebra.

Details:

Any countable union of sets in S reduces to a finite union.

However, there are algebras that are not σ-algebras. Here is the classic example:

Suppose that S is an infinite set. The collection of finite and co-finite subsets of S defined below is an algebra of subsets of S, but not a σ-algebra: F={AS:A is finite or Ac is finite}

Details:

SF since Sc= is finite. If AF then AcF by the symmetry of the definition. Suppose that A,BF. If A and B are both finite then AB is finite. If Ac or Bc is finite, then (AB)c=AcBc is finite. In either case, ABF. Thus F is an algebra of subsets of S.

Since S is infinite, it contains a countably infinite subset {x0,x1,x2,}. Let An={x2n} for nN. Then An is finite, so AnF for each nN. Let E=n=0An={x0,x2,x4,}. Then E is infinite by construction. Also {x1,x3,x5,}Ec, so Ec is infinite as well. Hence EF and so F is not a σ-algebra.

General Constructions

Recall that P(S) denotes the collection of all subsets of S, called the power set of S. Trivially, P(S) is the largest σ-algebra of S. The power set is often the appropriate σ-algebra if S is countable, but as noted above, is sometimes too large to be useful if S is uncountable. At the other extreme, the smallest σ-algebra of S is given next:

The collection {,S} is a σ-algebra.

Details:

Clearly {,S} is a finite algebra: S and are complements of each other, and S=S. Hence {S,} is a σ-algebra by [7].

In many cases, we want to construct a σ-algebra that contains certain basic sets. The next two results show how to do this.

Suppose that Si is a σ-algebra of subsets of S for each i in a nonempty index set I. Then S=iISi is also a σ-algebra of subsets of S.

Details:

The proof is completely straightforward. First, SSi for each iI so SS. If AS then ASi for each iI and hence AcSi for each iI. Therefore AcS. Finally suppose that AjS for each j in a countable index set J. Then AjSi for each iI and jJ and therefore jJAjSi for each iI. It follows that jJAjS.

Note that no restrictions are placed on the index set I, other than it be nonempty, so in particular it may well be uncountable.

Suppose that S is a set and that B is a collection of subsets of S. The σ-algebra generated by B is σ(B)={S:S is a σ-algebra of subsets of S and BS} A σ-algebra that is generated by a countable collection of sets is said to be countably generated.

So the σ-algebra generated by B is the intersection of all σ-algebras that contain B, which by [10] really is a σ-algebra. Note that the collection of σ-algebras in the intersection is not empty, since P(S) is in the collection. Think of the sets in B as basic sets that we want to be measurable, but do not form a σ-algebra.

The σ-algebra σ(B) is the smallest σ algebra containing B.

  1. Bσ(B)
  2. If S is a σ-algebra of subsets of S and BS then σ(B)S.
Details:

Both of these properties follows from the definition of σ(B) in [11].

Note that the conditions in [12] completely characterize σ(B). If S1 and S2 satisfy the conditions, then by (a), BS1 and BS2. But then by (b), S1S2 and S2S1.

If A is a subset of S then σ{A}={,A,Ac,S}

Details:

Let S={,A,Ac,S}. Clearly S is an algebra: A and Ac are complements of each other, as are and S. Also, AAc=AS=AcS=SS=S=SA=AA=AAc=AcAc=Ac= Since S is finite, it is a σ-algebra by [4]. Next, AS. Conversely, if T is a σ-algebra and AT then of course ,S,AcT so ST. Hence S=σ{A}

We can generalize [13]. Recall that a collection of subsets A={Ai:iI} is a partition of S if AiAj= for i,jI with ij, and iIAi=S.

Suppose that A={Ai:iI} is a countable partition of S into nonempty subsets. Then σ(A) is the collection of all unions of sets in A. That is, σ(A)={jJAj:JI}

Details:

Let S={jJAj:JI}. Note that SS since S=iIAi. Next, suppose that BS. Then B=jJAj for some JI. But then Bc=jJcAj, so BcS. Next, suppose that BkS for kK where K is a countable index set. Then for each kK there exists JkI such that Bk=jJkAj. But then kKBk=kKjJkAj=jJAj where J=kKJk. Hcnce kKBkS. Therefore S is a σ-algebra of subsets of S. Trivially, AS. If T is a σ-algebra of subsets of S and AT, then clearly jJAjT for every JI. Hence ST.

A σ-algebra of this form is said to be generated by a countable partition. Note that since Ai for iI, the representation of a set in σ(A) as a union of sets in A is unique. That is, if J,KI and JK then jJAjkKAk. In particular, if there are n nonempty sets in A, so that #(I)=n, then there are 2n subsets of I and hence 2n sets in σ(A).

Suppose now that A={A1,A2,,An} is a collection of n subsets of S (not necessarily disjoint). To describe the σ-algebra generated by A we need a bit more notation. For x=(x1,x2,,xn){0,1}n (a bit string of length n), let Bx=i=1nAixi where Ai1=Ai and Ai0=Aic.

In the setting above,

  1. B={Bx:x{0,1}n} partitions S.
  2. Ai={Bx:x{0,1}n,xi=1} for i{1,2,,n}.
  3. σ(A)=σ(B)={xJBx:J{0,1}n}.
Details:
  1. Suppose that x,y{0,1}n and that xy. Without loss of generality we can suppose that for some j{1,2,,n}, xj=0 while yj=1. Then BxAjc and ByAj so Bx and By are disjoint. Suppose that sS. Construct x{0,1}n by xi=1 if sAi and xi=0 if sAi, for each i{1,2,,n}. Then by definition, sBx. Hence B partitions S.
  2. Fix i{1,2,,n}. Again if x{0,1}n and xi=1 then BxAi. Hence {Bx:x{0,1}n,xi=1}Ai. Conversely, suppose sAi. Define y{0,1}n by yj=1 if sAj and yj=0 if sAj for each j{1,2,,n}. Then yi=1 and sBy. Hence s{Bx:x{0,1}n,xi=1}.
  3. Clearly, every σ-algebra of subsets of S that contains A must also contain B, and every σ-algebra of subsets of S that contains B must also contain A. It follows that σ(A)=σ(B). The characterization in terms of unions now follows from [14].

Recall that there are 2n bit strings of length n. The sets in A are said to be in general position if the sets in B are distinct (and hence there are 2n of them) and are nonempty. In this case, there are 22n sets in σ(A).

Open the Venn diagram app. This app shows two subsets A and B of S in general position, and lists the 16 sets in σ{A,B}.

  1. Select each of the 4 sets that partition S: AB, ABc, AcB, AcBc.
  2. Select each of the other 12 sets in σ{A,B} and note how each is a union of some of the sets in (a).

Sketch a Venn diagram with sets A1,A2,A3 in general position. Identify the set Bx for each x{0,1}3.

If a σ-algebra is generated by a collection of basic sets, then each set in the σ-algebra is generated by a countable number of the basic sets.

Suppose that S is a set and B a nonempty collection of subsets of S. Then

σ(B)={AS:Aσ(C) for some countable CB}
Details:

Let S denote the collection on the right. We first show that S is a σ-algebra. First, pick BB, which we can do since B is nonempty. Then Sσ{B} so SS. Let AS so that Aσ(C) for some countable CB. Then Acσ(C) so AcS. Finally, suppose that AiS for i in a countable index set I. Then for each iI, there exists a countable CiB such that Aiσ(Ci). But then iICi is also countable and iIAiσ(iICi). Hence iIAiS.

Next if BB then Bσ{B} so BS. Hence σ(B)S. Conversely, if Aσ(C) for some countable CB then trivially Aσ(B).

We have seen examples of finite σ algebras and infinite σ-algebras. It turns out that a σ-algebra cannot be countably infinite.

Suppose that S is a σ-algebra of subsets of a set S. Then S is either finite or uncountable.

Details:

The proof is by contradiction. Suppose that S is countably infinite. Clearly the base set S is infinite since SP(S) and P(S) is finite if S is finite. Define Ax={AS:xA},xS Then AxS for xS since the intersection is over a countable collection of sets in S. Clearly Ax is the smallest set in S containing x. We next show that the distinct sets in the collection A={Ax:xS}S are disjoint. Suppose that x,yS and AxAy. If xAy then AxAyS is a proper subset of Ax containing x, which contradicts the definition of Ax. Hence xAy and therefore AxAy. By a symmetric argument, AyAx and hence Ax=Ay. So we conclude that for every x,yS, either AxAy= or Ax=Ay. Trivially, if AS then A=xAAx. So if A is finite then S is finite, since there can only be a finite number of distinct unions of a finite collection of sets. But this contradicts the assumption that S is countably infinite. On the other hand, if A is countably infinite then S is uncountable, since there are uncountably many distinct unions of a countably infinite collection of sets. But this is also a contradiction.

A σ-algebra on a set naturally leads to a σ-algebra on a subset.

Suppose that (S,S) is a measurable space, and that RS. Let R={AR:AS}. Then

  1. R is a σ-algebra of subsets of R.
  2. If RS then R={BS:BR}.
Details:
  1. First, SS and SR=R so RR. Next suppose that BR. Then there exists AS such that B=AR. But then AcS and RB=RBc=RAc, so RBR. Finally, suppose that BiR for i in a countable index set I. For each iI there exists AiS such that Bi=AiR. But then iIAiS and iIBi=(iIAi)R, so iIBiR.
  2. Suppose that RS. Then ARS for every AS, and of course, ARR. Conversely, if BS and BR then B=BR so BR

The σ-algebra R is the σ-algebra on R induced by S. If RS then (R,R) is a subspace of (S,S). The following construction is useful for counterexamples. Compare this example with example [8] for finite and co-finite sets.

Let S be a nonempty set. The collection of countable and co-countable subsets of S is C={AS:A is countable or Ac is countable}

  1. C is a σ-algebra
  2. C=σ{{x}:xS}, the σ-algebra generated by the singleton sets.
Details:
  1. First, SC since Sc= is countable. If AC then AcC by the symmetry of the definition. Suppose that AiC for each i in a countable index set I. If Ai is countable for each iI then iIAi is countable. If Ajc is countable for some jI then (iIAi)c=iIAicAjc is countable. In either case, iIAiC.
  2. Let D=σ{{x}:xS}. Clearly {x}C for xS. Hence DC. Conversely, suppose that AC. If A is countable, then A=xA{x}D. If Ac is countable, then by an identical argument, AcD and hence AD.

Of course, if S is itself countable then C=P(S). On the other hand, if S is uncountable, then there exists AS such that A and Ac are uncountable. Thus, AC, but A=xA{x}, and of course {x}C. Thus, we have an example of a σ-algebra that is not closed under general unions. Here is another use of this σ-algebra as a counterexample:

Suppose that S is an uncountable set. The σ-algebra C of countable and co-countable sets is not countably generated.

Details:

The proof is by contradiction. Suppose that A={Ai:iI} is a countable collection of sets in C and that C=σ(A). For each iI, let Bi=Ai if Ai is countable and Bi=Aic if Aic is countable. Then BiC for each iI. The countable collection B={Bi:iI} generates the same σ-algebra as A, so C=σ(B). Now let B=iIBi. Then B is a countable union of countable sets, so B is countable. Therefore σ{{x}:xB}=P(B)}, the collection of all subsets of B. Since BiP(B) for each iI and {x}C for each xB we have C=σ(B)P(B)C So C=P(B). But this is clearly a contradiction since SP(B).

Topology and Measure

One of the most important ways to generate a σ-algebra is by means of topology. Recall that a topological space consists of a set S and a topology S, the collection of open subsets of S. Most spaces that occur in probability and stochastic processes are topological spaces, so it's crucial that the topological and measure-theoretic structures are compatible.

Suppose that (S,T) is a topological space. Then S=σ(T) is the Borel σ-algebra on S, and (S,S) is a Borel measurable space.

So the Borel σ-algebra on S, named for Émile Borel is generated by the open subsets of S. Thus, a topological space (S,T) naturally leads to a measurable space (S,σ(T)). Since a closed set is simply the complement of an open set, the Borel σ-algebra contains the closed sets as well (and in fact is generated by the closed sets). Here are some other sets that are in the Borel σ-algebra:

Suppose again that (S,T) is a topological space and let S=σ(T) denote the Borel σ-algebral. Suppose also that I is a countable index set.

  1. If Ai is open for each iI then iIAiS. Such sets are called Gδ sets.
  2. If Ai is closed for each iI then iIAiS. Such sets are called Fσ sets.
  3. If (S,T) is Hausdorff then {x}S for every xS.
Details:
  1. This follows from [5].
  2. This follows from [4].
  3. This follows since {x} is closed for each xS if the topology is Hausdorff.

In terms of part (c), recall that a topological space is Hausdorff, named for Felix Hausdorff, if the topology can distinguish individual points. Specifically, if x,yS are distinct then there exist disjoint open sets U,V with xU and yV. This is a very basic property possessed by almost all topological spaces that occur in applications. A simple corollary of (c) is that if the topological space (S,T) is Hausdorff then AS for every countable AS.

Let's note the extreme cases. If S has the discrete topology P(S), so that every set is open (and closed), then of course the Borel σ-algebra is also P(S). As noted above, this is often the appropriate σ-algebra if S is countable, but is often too large if S is uncountable. If S has the trivial topology {S,}, then the Borel σ-algebra is also {S,}, and so is also trivial.

Recall that a base for a topological space (S,T) is a collection BT with the property that every set in T is a union of a collection of sets in B. In short, every open set is a union of some of the basic open sets.

Suppose that (S,T) is a topological space with a countable base B. Then σ(B)=σ(T).

Details:

Since BT it follows trivially that σ(B)σ(T). Conversely, if UT, there exists a collection of sets in B whose union is U. Since B is countable, Uσ(B).

The topological spaces that occur in probability and stochastic processes are usually assumed to have a countable base (along with other nice properties such as the Hausdorff property and locally compactness). The σ-algebra used for such a space is usually the Borel σ-algebra, which by the previous result, is countably generated.

Measurable Functions

Recall that a set usually comes with a σ-algebra of admissible subsets. A natural requirement on a function is that the inverse image of an admissible set in the co-domain be admissible in the domain. Here is the formal definition.

Suppose that (S,S) and (T,T) are measurable spaces. A function f:ST is measurable if f1(A)S for every AT.

If the σ-algebra in the co-domain is generated by a collection of basic sets, then to check the measurability of a function, we need only consider inverse images of basic sets:

Suppose again that (S,S) and (T,T) are measurable spaces, and that T=σ(B) for a collection of subsets B of T. Then f:ST is measurable if and only if f1(B)S for every BB.

Details:

First BT, so if f:ST is measurable then the condition in the theorem trivially holds. Conversely, suppose that the condition in the theorem holds, and let U={AT:f1(A)S}. Then TU since f1(T)=SS. If AU then f1(Ac)=[f1(A)]cS, so AcU. If AiU for i in a countable index set I, then f1(iIAi)=iIf1(Ai)S, and hence iIAiU. Thus U is a σ-algebra of subsets of T. But BU by assumption, so T=σ(B)U. Of course UT by definition, so U=T and hence f is measurable.

If you have reviewed topology then you may have noticed a striking parallel between the definition of continuity for functions on topological spaces and the defintion of measurability for functions on measurable spaces: A function from one topological space to another is continuous if the inverse image of an open set in the co-domain is open in the domain. A function from one measurable space to another is measurable if the inverse image of a measurable set in the co-domain is measurable in the domain. If we start with topological spaces, which we often do, and use the Borel σ-algebras to get measurable spaces, then we get the following (hardly surprising) connection.

Suppose that (S,S) and (T,T) are topological spaces, and that we give S and T the Borel σ-algebras σ(S) and σ(T) respectively. If f:ST is continuous, then f is measurable.

Details:

If VT then f1(V)Sσ(S). Hence f is measurable by [27].

Measurability is preserved under composition, the most important method for combining functions.

Suppose that (R,R), (S,S), and (T,T) are measurable spaces. If f:RS is measurable and g:ST is measurable, then gf:RT is measurable.

Details:

If AT then g1(A)S since g is measurable, and hence (gf)1(A)=f1[g1(A)]R since f is measurable.

If T is given the smallest possible σ-algebra or if S is given the largest one, then any function from S into T is measurable.

Every function f:ST is measurable in each of the following cases:

  1. T={,T} and S is an arbitrary σ-algebra of subsets of S
  2. S=P(S) and T is an arbitrary σ-algebra of subsets of T.
Details:
  1. Suppose that T={,T} and that S is an arbitrary σ-algebra on S. If f:ST, then f1(T)=SS and f1()=S so f is measurable.
  2. Suppose that S=P(S) and that T is an arbitrary σ-algebra on T. If f:ST, then trivially f1(A)S for every AT so f is measurable.

When there are several σ-algebras for the same set, then we use the phrase with respect to so that we can be precise. If a function is measurable with respect to a given σ-algebra on its domain, then it's measurable with respect to any larger σ-algebra on the domain. If the function is measurable with respect to a σ-algebra on the co-domain then its measurable with respect to any smaller σ-algebra on the co-domain.

Suppose that S has σ-algebras R and S with RS, and that T has σ-algebras T and U with TU. If f:ST is measurable with respect to R and U, then f is measureable with respect to S and T.

Details:

If AT then AU. Hence f1(A)R so f1(A)S.

The following construction is particularly important in probability theory:

Suppose that S is a set and (T,T) is a measurable space. Suppose also that f:ST and define σ(f)={f1(A):AT}. Then

  1. σ(f) is a σ-algebra on S.
  2. σ(f) is the smallest σ-algebra on S that makes f measurable.
Details:
  1. The key to the proof is that the inverse image preserves all set operations First, Sσ(f) since TT and f1(T)=S. If Bσ(f) then B=f1(A) for some AT. But then AcT and hence Bc=f1(Ac)σ(f). Finally, suppose that Biσ(f) for i in a countable index set I. Then for each iI there exists AiT such that Bi=f1(Ai). But then iIAiT and iIBi=f1(iIAi). Hence iIBiσ(f).
  2. If S is a σ-algebra on S and f is measurable with respect to S and T, then by definition f1(A)S for every AT, so σ(f)S.

Appropriately enough, σ(f) is called the σ-algebra generated by f. Often, S will have a given σ-algebra S and f will be measurable with respect to S and T. In this case, σ(f)S. We can generalize to an arbitrary collection of functions on S.

Suppose S is a set and that (Ti,Ti) is a measurable space for each i in a nonempty index set I. Suppose also that fi:STi for each iI. The σ-algebra generated by this collection of functions is σ{fi:iI}=σ{σ(fi):iI}=σ{fi1(A):iI,ATi}

Again, this is the smallest σ-algebra on S that makes fi measurable for each iI.

Product Sets

Product sets arise naturally in the form of the higher-dimensional Euclidean spaces Rn for n{2,3,}. In addition, product spaces are particularly important in probability, where they are used to describe the spaces associated with sequences of random variables. More general product spaces arise in the study of stochastic processes. We start with the product of two sets; the generalization to products of n sets and to general products is straightforward, although the notation gets more complicated.

Suppose that (S,S) and (T,T) are measurable spaces. The product σ-algebra on S×T is S×T=σ{A×B:AS,BT}

So the definition is natural: the product σ-algebra is generated by products of measurable sets. Note however that S×T is not the Cartesian product of the collections S and T, even though the same notation is used. Our next goal is to consider the measurability of functions defined on, or mapping into, product spaces. Of basic importance are the projection functions. If S and T are sets, let p1:S×TS and p2:S×TT be defined by p1(x,y)=x and p2(x,y)=y for (x,y)S×T. Recall that p1 is the projection onto the first coordinate and p2 is the projection onto the second coordinate. The product σ algebra is the smallest σ-algebra that makes the projections measurable:

Suppose again that (S,S) and (T,T) are measurable spaces. Then S×T=σ{p1,p2}.

Details:

If AS then p11(A)=A×TS×T. Similarly, if BT then p21(B)=S×BS×T. Hence p1 and p2 are measurable, so σ{p1,p2}S×T. Conversely, if AS and BT then A×B=p11(A)p21(B)σ{p1,p2}. Since sets of this form generate the product σ-algebra, we have S×Tσ{p1,p2}.

Projection functions make it easy to study functions mapping into a product space.

Suppose that (R,R), (S,S) and (T,T) are measurable spaces, and that S×T is given the product σ-algebra S×T. Suppose also that f:RS×T, so that f(x)=(f1(x),f2(x)) for xR, where f1:RS and f2:RT are the coordinate functions. Then f is measurable if and only if f1 and f2 are measurable.

Details:

Note that f1=p1f and f2=p2f. So if f is measurable then f1 and f2 are compositions of measurable functions, and hence are measurable by [29]. Conversely, suppose that f1 and f2 are measurable. If AS and BT then f1(A×B)=f11(A)f21(B)R. Since products of measurable sets generate S×T, it follows that f is measurable.

Our next goal is to consider cross sections of sets in a product space and cross sections of functions defined on a product space. It will help to introduce some new functions, which in a sense are complementary to the projection functions.

Suppose again that (S,S) and (T,T) are measurable spaces, and that S×T is given the product σ-algebra S×T.

  1. For xS the function 1x:TS×T, defined by 1x(y)=(x,y) for yT, is measurable.
  2. For yT the function 2y:SS×T, defined by 2y(x)=(x,y) for xS, is measurable.
Details:

To show that the functions are measurable, if suffices to consider inverse images of products of measurable sets, since such sets generate S×T. Thus, let AS and BT.

  1. For xS note that 1x1(A×B) is B if xA and is if xA. In either case, 1x1(A×B)T.
  2. Similarly, for yT note that 2y1(A×B) is A if yB and is if yB. In either case, 2y1(A×B)S.

Now our work is easy.

Suppose again that (S,S) and (T,T) are measurable spaces, and that CS×T. Then

  1. For xS, {yT:(x,y)C}T.
  2. For yT, {xS:(x,y)C}S.
Details:

These result follow immediately from the measurability of the functions 1x and 2y in [37]:

  1. For xS, 1x1(C)={yT:(x,y)C}.
  2. For yT, 2y1(C)={xS:(x,y)C}.

The set in (a) is the cross section of C in the first coordinate at x, and the set in (b) is the cross section of C in the second coordinate at y. As a simple corollary to the theorem, note that if AS, BT and A×BS×T then AS and BT. That is, the only measurable product sets are products of measurable sets. Here is the measurability result for cross-sectional functions:

Suppose again that (S,S) and (T,T) are measurable spaces, and that S×T is given the product σ-algebra S×T. Suppose also that (U,U) is another measurable space, and that f:S×TU is measurable. Then

  1. The function yf(x,y) from T to U is measurable for each xS.
  2. The function xf(x,y) from S to U is measurable for each yT.
Details:

Note that the function in (a) is just f1x, and the function in (b) is just f2y, both are compositions of measurable functions.

A measurable space (S,S) has a measurable diagonal if D={(x,x):xS}S×S

A space (S,S) with a measurable diagonal has many nice properties. First, {x}S for xS. Even more impressive is the following theorem:

Suppose that the measurable space (T,T) has a measurable diagonal. If (S,S) is another measurable space and f:ST is a measurable function, then the graph of f is measurable: {(x,f(x)):xS}S×T

Because of properties such as these, measurable diagonal is sometimes used as an assumption. Here are a few technical connections: A space (S,S) has a measurable diagonal if and only if S is generated by a countable collection of sets A that separated points. That is, if x,yS then there exists AA such that xA and yA, or yA and xA. Here is a standard example of a measurable space without a measurable diagonal:

If S is an uncountable set and C is the σ-algebra of countable and co-countable subsets, then (S,C) does not have a measurable diagonal.

Details:

This follows from [22].

The results for products of two spaces generalize in a completely straightforward way to a product of n spaces.

Suppose nN+ and that (Si,Si) is a measurable space for each i{1,2,,n}. The product σ-algebra on the Cartesian product set S1×S2××Sn is S1×S2××Sn=σ{A1×A2××An:AiSi for all i{1,2,,n}}

So again, the product σ-algebra is generated by products of measurable sets. Results analogous to the theorems above hold. In the special case that (Si,Si)=(S,S) for i{1,2,,n}, the Cartesian product becomes Sn and the corresponding product σ-algebra is denoted Sn. The notation is natural, but again potentially confusing. Note that Sn is not the Cartesian product of S of order n, but rather the σ-algebra generated by sets of the form A1×A2××An where AiS for i{1,2,,n}.

We can also extend these ideas to a general product. To recall the definition, suppose that Si is a set for each i in a nonempty index set I. The product set iISi consists of all functions x:IiISi such that x(i)Si for each iI. To make the notation look more like a simple Cartesian product, we often write xi instead of x(i) for the value of a function in the product set at iI. The next definition gives the appropriate σ-algebra for the product set.

Suppose that (Si,Si) is a measurable space for each i in a nonempty index set I. The product σ-algebra on the product set iISi is iISi=σ{iIAi:AiSi for each iI and Ai=Si for all but finitely many iI}

The definition can also be understood in terms of projections. Recall that the projection onto coordinate jI is the function pj:iISiSj given by pj(x)=xj. The product σ-algebra is the smallest σ-algebra on the product set that makes all of the projections measurable.

Suppose again that (Si,Si) is a measurable space for each i in a nonempty index set I, Then iISi=σ{pi:iI}.

Details:

Let jI and ASj. Then pj1(A)=iIAi where Ai=Si for ij and Aj=A. This set is in iISi so pj is measurable. Hence σ{pi:iI}iISi. For the other direction, consider a product set iIAi where Ai=Si except for iJ, where JI is finite. Then iIAi=jJpj1(Aj). This set is in σ{pi:iI}. Product sets of this form generate iISi so it follows that iISiσ{pi:iI}.

In the special case that (S,S) is a fixed measurable space and (Si,Si)=(S,S) for all iI, the product set iIS is just the collection of functions from I into S, often denoted SI. The product σ-algebra is then denoted SI, a notation that is natural, but again potentially confusing. Here is the main measurability result for a function mapping into a product space.

Suppose that (R,R) is a measurable space, and that (Si,Si) is a measurable space for each i in a nonempty index set I. As before, let iISi have the product σ-algebra. Suppose now that f:RiISi. For iI let fi:RSi denote the ith coordinate function of f, so that fi(x)=[f(x)]i for xR. Then f is measurable if and only if fi is measurable for each iI.

Details:

Suppose that f is measurable. For iI note that fi=pif is a composition of measurable functions, and hence is measurable by [29]. Conversely, suppose that fi is measurable for each iI. To show that measurability of f we need only consider inverse images of sets that generate the product σ-algebra. Thus, suppose that AjSj for j in a finite subset JI, and let Ai=Si for iIJ. Then f1(iIAi)=jJfj1(Aj). This set is in R since the intersection is over a finite index set.

Just as with the product of two sets, cross-sectional sets and functions are measurable with respect to the product measure. Again, it's best to work with some special functions.

Suppose that (Si,Si) is a measurable space for each i in an index set I with at least two elements. For jI and uSj, define the function ju:iI{j}iISi by ju(x)=y where yi=xi for ij and yj=u. Then ju is measurable with respect to the product σ-algebras.

Details:

Once again, it suffices to consider the inverse image of the sets that generate the product σ-algebra. So suppose AiSi for iI with Ai=Si for all but finitely many iI. Then ju1(iIAi)=iI{j}Ai if uAj, and the inverse image is otherwise. In either case, ju1(iIAi) is in the product σ-algebra on iI{j}Si.

In words, for jI and uSj, the function ju takes a point in the product set iI{j}Si and assigns u to coordinate j to give a point in iISi. If AiISi, then ju1(A) is the cross section of A in coordinate j at u. So it follows immediately from the previous result that the cross sections of a measurable set are measurable. Cross sections of measurable functions are also measurable. Suppose that (T,T) is another measurable space, and that f:iISiT is measurable. The cross section of f in coordinate jI at uSj is simply fju:SI{j}T, a composition of measurable functions.

However, a non-measurable set can have measurable cross sections, even in a product of two spaces.

Suppose that S is an uncountable set with the σ-algebra C of countable and co-countable sets as defined in [21]. Consider S×S with the product σ-algebra C×C. Let D={(x,x):xS}, the diagonal of S×S. Then D has measurable cross sections, but D is not measurable.

Details:

For xS, the cross section of D in the first coordinate at x is {yS:(x,y)D}={x}C. Similarly, for yS, the cross section of D in the second coordinate at y is {xS:(x,y)D}={y}C. But as noted in [42], D is not measurable.

In terms of topology, suppose that (S,U) and (T,V) are topological spaces. Recall that the product topology on S×T is the topology with base B={A×B:AU,BV}. Given the similarities of the definitions, you might think that the Borel σ-algebra on S×T corresponding to the product topolgy is the product of the Borel σ-algebras of S and T. That fails in general, but is true if the topological spaces are sufficiently nice.

Suppose that (S,U) and (T,V) are topological spaces corresponding to separable metric spaces. Then the Borel σ-algebra on S×T corresponding to the product topology is the product of the Borel σ-algebras on S and T. In symbols σ(U×V)=σ(U)×σ(V)

As noted above, having a measurable diagonal in [40] is a simple property that implies a number of seemingly stronger properties. Here is the connection to topology.

Suppose that (S,U) is a topological space corresponding to a separable metric space and let S=σ(U) be the Borel σ-algebra. Then (S,S) has a measurable diagonal.

Details:

Since (S,U) is Hausdorff, the diagonal D={(x,x):xS} is closed in the product topology, and hence is measurable for the Borel σ-algebra corresponding to the product topology. But by [49], this is the product of the Borel σ-algebras on S.

In particular, the previous results apply to the standard LCCB topological spaces.

Special Cases

Most of the sets encountered in applied probability are either countable, or subsets of Rn for some n, or more generally, subsets of a product of a countable number of sets of these types. In the study of stochastic processes, various spaces of functions play an important role. In this subsection, we will explore the most important special cases.

Discrete Spaces

If S is countable and S=P(S) is the collection of all subsets of S, then (S,S) is a discrete measurable space.

Thus if (S,S) is discrete, all subsets of S are measurable and every function from S to another measurable space is measurable. The power set is also the discrete topology on S, so S is a Borel σ-algebra as well. As a topological space, (S,S) is complete, locally compact, Hausdorff, and since S is countable, separable. Moreover, the discrete topology corresponds to the discrete metric d, defined by d(x,x)=0 for xS and d(x,y)=1 for x,yS with xy.

Euclidean Spaces

Recall that for nN+, the Euclidean topology on Rn is generated by the standard Euclidean metric dn given by dn(x,y)=i=1n(xiyi)2,x=(x1,x2,,xn),y=(y1,y2,,yn)Rn With this topology, Rn is complete, connected, locally compact, Hausdorff, and separable.

For nN+, the n-dimensional Euclidean measurable space is (Rn,Rn) where Rn is the Borel σ-algebra corresponding to the standard Euclidean topology on Rn.

The one-dimensional case is particularly important. In this case, the standard Euclidean metric d is given by d(x,y)=|xy| for x,yR. The Borel σ-algebra R can be generated by various collections of intervals.

Each of the following collections generates R.

  1. B1={IR:I is an interval}
  2. B2={(a,b]:a,bR,a<b}
  3. B3={(,b]:bR}
Details:

The proof involves showing that each set in any one of the collections is in the σ-algebra of any other collection. Let Si=σ(Bi) for i{1,2,3}.

  1. Clearly B2B1 and B3B1 so S2S1 and S3S1.
  2. If a,bR with ab then [a,b]=n=1(a1n,b] and (a,b)=n=1(a,b1n], so [a,b],(a,b)S2. Also [a,b)=n=1[a,b1n] so [a,b)R2. Thus all bounded intervals are in S2. Next, [a,)=n=1[a,a+n), (a,)=n=1(a,a+n), (,a]=n=1(an,a], and (,a)=n=1(an,a), so each of these intervals is in S2. Of course RS2, so we now have that IS2 for every interval I. Thus S1S2, and so from (a), S2=S1.
  3. If a,bR with a<b then (a,b]=(,b](,a] so (a,b]S3. Hence S2S3. But then from (a) and (b) it follows that S3=S1.

Since the Euclidean topology has a countable base, R is countably generated. In fact each collection of intervals above, but with endpoints restricted to Q, generates R. Moreover, R can also be constructed from σ-algebras that are generated by countable partitions as in [14]. First recall that for nN, the set of dyadic rationals (or binary rationals) of rank n or less is Dn={j/2n:jZ}. Note that Dn is countable and DnDn+1 for nN. Moreover, the set D=nNDn of all dyadic rationals is dense in R. The dyadic rationals are often useful in various applications because Dn has the natural ordered enumeration jj/2n for each nN. Now let Dn={(j/2n,(j+1)/2n]:jZ},nN Then Dn is a countable partition of R into nonempty intervals of equal size 1/2n, so En=σ(Dn) consists of unions of sets in Dn as described in [14]. Every set Dn is the union of two sets in Dn+1 so clearly EnEn+1 for nN. Finally, the Borel σ-algebra on R is R=σ(n=0En)=σ(n=0Dn). This construction turns out to be useful in a number of settings.

For n{2,3,}, the Euclidean topology on Rn is the n-fold product topology formed from the Euclidean topology on R. So the Borel σ-algebra Rn is also the n-fold product σ-algebra formed from R. Finally, Rn can be generated by n-fold products of sets in any of the three collections in [53].

Space of Real Functions

Suppose that (S,S) is a measurable space. Recall that the usual arithmetic operations on functions from S into R are defined pointwise.

If f:SR and g:SR are measurable and aR, then each of the following functions from S into R is also measurable:

  1. f+g
  2. fg
  3. fg
  4. af
Details:

These results follow from the fact that the arithmetic operators are continuous, and hence measurable. That is, (x,y)x+y, (x,y)xy, and (x,y)xy are continuous as functions from R2 into R. Thus, if f,g:SR are measurable, then (f,g):SR2 is measurable by . Then, f+g, fg, fg are the compositions, respectively, of +, , with (f,g). Of course, (d) is a simple corollary of (c).

Similarly, if f:SR{0} is measurable, then so is 1/f. Recall that the set of functions from S into R is a vector space, under the pointwise definitions of addition and scalar multiplication. But once again, we usually want to restrict our attention to measurable functions. Thus, it's nice to know that the measurable functions from S into R also form a vector space. This follows immediately from the closure properties (a) and (d) of [54]. Of particular importance in probability and stochastic processes is the vector space of bounded, measurable functions f:SR, with the supremum norm f=sup{|f(x)|:xS}

The elementary functions that we encounter in calculus and other areas of applied mathematics are functions from subsets of R into R. The elementary functions include algebraic functions (which in turn include the polynomial and rational functions), the usual transcendental functions (exponential, logarithm, trigonometric), and the usual functions constructed from these by composition, the arithmetic operations, and by piecing together. As we might hope, all of the elementary functions are measurable.