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

13. Special Set Structures

There are several other types of algebraic set structures that are weaker than σ-algebras. These are not particularly important in themselves, but are important for constructing σ-algebras and the measures on these σ-algebras. You may want to skip this section if you are not intersted in questions of existence and uniqueness of positive measures.

Basic Theory

Definitions

Throughout this section, we assume that S is a set and S is a nonempty collection of subsets of S. Here are the main definitions we will need.

S is a π-system if S is closed under finite intersections: if A,BS then ABS.

Closure under intersection is clearly a very simple property, but π systems turn out to be useful enough to deserve a name.

S is a λ-system if it is closed under complements and countable disjoint unions.

  1. If AS then AcS.
  2. If AiS for i in a countable index set I and AiAj= for ij then iIAiS.

S is a semi-algebra if it is closed under intersection and if complements can be written as finite, disjoint unions:

  1. If A,BS then ABS.
  2. If AS then there exists a finite, disjoint collection {Bi:iI}S such that Ac=iIBi.

For our final structure, recall that a sequence (A1,A2,) of subsets of S is increasing if AnAn+1 for all nN+. The sequence is decreasing if An+1An for all nN+. Of course, these are the standard meanings of increasing and decreasing relative to the ordinary order on N+ and the subset partial order on P(S).

S is a monotone class if it is closed under increasing unions and decreasing intersections:

  1. If (A1,A2,) is an increasing sequence of sets in S then n=1AnS.
  2. If (A1,A2,) is a decreasing sequence of sets in S then n=1AnS.

If (A1,A2,) is an increasing sequence of sets then we sometimes write n=1An=limnAn. Similarly, if (A1,A2) is a decreasing sequence of sets we sometimes write n=1An=limnAn. The reason for this notation is because of the continuity theorems for positive measures. With this notation, a monotone class S is defined by the condition that if (A1,A2,) is an increasing or decreasing sequence of sets in S then limnAnS.

Basic Theorems

Our most important set structure, the σ-algebra, has all of the properties in the definitions above.

If S is a σ-algebra then S is a π-system, a λ-system, a semi-algebra, and a monotone class.

If S is a λ-system then SS and S.

Details:

The proof is just like the one for an algebra. There exists AS since S is non-empty. Hence AcS and so S=AAcS. Finally =ScS.

Any type of algebraic structure on subsets of S that is defined purely in terms of closure properties will be preserved under intersection. That is, we will have results that are analogous to how σ-algebras are generated from more basic sets, with completely straightforward and analgous proofs. In the following two theorems, the term system could mean π-system, λ-system, or monotone class of subsets of S.

If Si is a system for each i in an index set I and iISi is nonempty, then iISi is a system of the same type.

The condition that iISi be nonempty is unnecessary for a λ-system, by [6]. We can now construct the system generated by a collection of basic sets of some sort.

Suppose that B is a nonempty collection of subsets of S. Then the system S generated by B is the intersection of all systems that contain B: S={T:T is a system and BT} The system S is characterized by the following properties:

  1. BS.
  2. If T is a system and BT then ST.

Note however, that [7] and [8] do not apply to semi-algebras, because the semi-algebra is not defined purely in terms of closure properties (the condition on Ac is not a closure property).

If S is a monotone class and an algebra, then S is a σ-algebra.

Details:

All that is needed is to prove closure under countable unions. Thus, suppose that AiS for iN+. Then Bn=i=1nAiS since S is an algebra. The sequence (B1,B2,) is increasing, so n=1BnS, since S is a monotone class. But n=1Bn=i=1Ai.

By definition, a semi-algebra is a π-system. More importantly, a semi-algebra can be used to construct an algebra.

Suppose that S is a semi-algebra of subsets of S. Then the collection S of finite, disjoint unions of sets in S is an algebra.

Details:

Suppose that A,BS. Then there exist finite, disjoint collections {Ai:iI}S and {Bj:jJ}S such that A=iIAi and B=jJBj. Hence AB=(i,j)I×J(AiBj) But {AiBj:(i,j)I×J} is a finite, disjoint collection of sets in S, so ABS. Suppose AS, so that there exists a finite, disjoint collection {Ai:iI} such that A=iIAi. Then Ac=iIAic. But AicS by definition of semi-algebra, and we just showed that S is closed under finite intersections, so AcS.

We need yet one more definition

A nonempty collection S of subsets of S is closed under proper set difference if A,BS and AB implies BAS

The following theorem gives the basic relationship between λ-systems and monotone classes.

Suppose that S is a nonempty collection of subsets of S.

  1. If S is a λ-system then S is a monotone class and is closed under proper set difference.
  2. If S is a monotone class, is closed under proper set difference, and contains S, then S is a λ-system.
Details:
  1. Suppose that S is a λ-system. Suppose that A,BS and AB. Then BcS, and A and Bc are disjoint, so ABcS. But then (ABc)c=BAc=BAS. Hence S is closed under proper set difference. Next suppose that (A1,A2,) is an increasing sequence of sets in S. Let B1=A1 and Bn=AnAn1 for n{2,3,}. Then BiS for each iN+. But the sequence (B1,B2,) is disjoint and has the same union as (A1,A2,). Hence i=1Ai=i=1BiS. Finally, suppose that (A1,A2,) is a decreasing sequence of sets in S. Then AicS for each iN+ and (A1c,A2c,) is increasing. Hence i=1AicS and therefore (i=1Aic)c=i=1AiS.
  2. Suppose that S is a monotone class, is closed under proper set difference, and SS. If AS then trivially AS so Ac=SAS. Next, suppose that A,BS are disjoint. Then AcS and BAc, so AcB=AcBcS. Hence AB=(AcBc)cS. Finally, suppose that (A1,A2,) is a disjoint sequence of sets in S. We just showed that S is closed under finite, disjoint unions, so Bn=i=1nAiS. But the sequence (B1,B2,) is increasing, and hence n=1Bn=i=1AiS.

The following theorem is known as the monotone class theorem, and is due to the mathematician Paul Halmos.

Suppose that A is an algebra, M is a monotone class, and AM. Then σ(A)M.

Details:

First let m(A) denote the monotone class generated by A, as defined in [8]. The outline of the proof is to show that m(A) is an algebra, so that by [4], m(A) is a σ-algebra. It then follows that σ(A)m(A)M. To show that m(A) is an algebra, we first show that it is closed under complements and then under simple union.

Since m(A) is a monotone class, the collection m(A)={AS:Acm(A)} is also a monotone class. Moreover, Am(A) so it follows that m(A)m(A). Hence if Am(A) then Am(A) so Acm(A). Thus m(A) is closed under complements.

Let M1={AS:ABm(A) for all BA}. Then M1 is a monotone class and AM1 so m(A)M1. Next let M2={AS:ABm(A) for all Bm(A)}. Then M2 is also a monotone class. Let AA. If Bm(A) then BM1 and hence ABm(A). Hence AM2. Thus we have AM2, so m(A)M2. Finally, let A,Bm(A). Then AM2 so ABm(A) and therefore m(A) is closed under simple union.

As noted in [5], a σ-algebra is both a π-system and a λ-system. The converse is also true, and is one of the main reasons for studying these structures.

If S is a π-system and a λ-system then S is a σ-algebra.

Details:

SS, and if AS then AcS by definition of a λ-system. Thus, all that is left is to show closure under countable unions. Thus, suppose that (A1,A2,) is a sequence of sets in S. Then AicS for each iN+. Since S is also a π-system, it follows that for each nN+, Bn=AnA1cAn1cS (by convention B1=A1). But the sequence (B1,B2,) is disjoint and has the same union as (A1,A2,). Hence i=1Ai=i=1BiS.

The importance of π-systems and λ-systems stems in part from Dynkin's π-λ theorem given next. It's named for the mathematician Eugene Dynkin.

Suppose that A is a π-system of subsets of S, B is a λ-system of subsets of S, and AB. Then σ(A)B.

Details:

Let L denote the λ-system generated by A. Then of course ALB. For AL, let LA={BS:BAL} We will show that LA is a λ-system. Note that SA=AL and therefore SLA. Next, suppose that B1,B2LA and that B1B2. Then B1AL and B2AL and B1AB2A. Hence (B2B1)A=(B2A)(B1A)L. Hence B2B1LA. Finally, suppose that {Bi:iI} is a countable, disjoint collection of sets in LA. Then BiAL for each iI, and {BiA:iI} is also a disjoint collection. Therefore, iI(BiA)=(iIBi)AL. Hence iIBiLA.

Next fix AA. If BA then ABA, so ABL and hence BLA. But L is the smallest λ-system containing A so we have shown that LLA for every AA. Now fix BL. If AA then BLA so ABL and therefore ALB. Again, L is the smallest λ-system containing A so we have now shown that LLB for every BL. Finally, let B,CL. Then CLB and hence BCL. It now follows that L is a π-system, as well as a λ-system, and therefore by [14], L is a sigma-algebra. But AL and hence σ(A)L.

Examples and Special Cases

Suppose that S is a set and A is a finite partition of S. Then S={}A is a semi-algebra of subsets of S.

Details:

If A,BA then AB=S. If AS then Ac={BA:BA}

Euclidean Spaces

The following example is particulalry important because it will be used to construct positive measures on R. Let B={(a,b]:a,bR,a<b}{(,b]:bR}{(a,):aR}

B is a semi-algebra of subsets of R.

Details:

Note that the intersection of two intervals of the type in B is another interval of this type. The complement of an interval of this type is either another interval of this type or the union of two disjoint intervals of this type.

It follows from [10] that the collection A of finite disjoint unions of intervals in B is an algebra. Recall also that σ(B)=σ(A) is the Borel σ-algebra of R, named for Émile Borel. We can generalize all of this to Rn for nN+

The collection Bn={i=1nAi:AiB for each i{1,2,,n}} is a semi-algebra of subsets of Rn.

Recall also that σ(Bn) is the σ-algebra of Borel sets of Rn.

Product Spaces

The examples in this discussion are important for constructing positive measures on product spaces.

Suppose that S is a semi-algebra of subsets of a set S and that T is a semi-algebra of subsets of a set T. Then U={A×B:AS,BT} is a semi-algebra of subsets of S×T.

Details:
  1. Suppose that A×B,C×DU, so that A,CS and B,DT. Recall that (A×B)(C×D)=(AC)×(BD). But ACS and BDT so (A×B)(C×D)U.
  2. Suppose that A×BB so that AS and BT. Then (A×B)c=(Ac×B)(A×Bc)(Ac×Bc) There exists a finite, disjoint collection {Ai:iI} of sets in S and a finite, disjoint collection {Bj:jJ} of sets in T such that Ac=iIAi and Bc=jJBj. Hence (A×B)c=[iI(Ai×B)][jJ(A×Bj)][iIjJ(Ai×Bj)] All of the product sets in this union are in U and the product sets are disjoint.

This result extends in a completely straightforward way to a product of a finite number of sets.

Suppose that nN+ and that Si is a semi-algebra of subsets of a set Si for i{1,2,,n}. Then U={i=1nAi:AiSi for all i{1,2,,n}} is a semi-algebra of subsets of i=1nSi.

Note that the semi-algebra of products of intervals in Rn described in [18] is a special case of this result. For the product of an infinite sequence of sets, the result is bit more tricky.

Suppose that Si is a semi-algebra of subsets of a set Si for iN+. Then U={i=1Ai:AiSi for all iN+ and Ai=Si for all but finitely many iN+} is a semi-algebra of subsets of i=1nSi.

Details:

The proof is very much like the previous ones.

  1. Suppose that A=i=1AiU and B=i=1BiU, so that Ai,BiSi for iN+ and Ai=Si for all but finitely many iN+ and Bi=Si for all but finitely many iN+. Then AB=i=1(AiBi). Also, AiBiSi for iN+ and AiBi=Si for all but finitely many inN+. So ABU.
  2. Suppose that A=i=1AiU, where AiSi for iN+ and Ai=Si for i>n, for some nN+. Then Ac=j=1nBj where Bj=A1××Aj1×Ajc×Sj+1×Sj+2×,j{1,2,,n} Note that the product sets in this union are disjoint. But for each j{1,2,,n} there exists a finite disjoint collection {Cj,k:kKj} such that Ajc=kKjCj,k. Substituting and distributing then gives Ac as a finite, disjoint union of sets in U.

Note that this result would not be true with U={i=1Ai:AiSi for all iN+}. In general, the complement of a set in U cannot be written as a finite disjoint union of sets in U.