Exercises:Measure Theory - 2016 - 1/Section B/Problem 1

From Maths
Jump to: navigation, search

Section B

Problem B1

Part i)

Suppose that An are algebras of sets satisfying AnAn+1. Show that nNAn is an algebra.

  • Caution:Is or desired?
Solution
  1. Closed under complementation: AnNAn[AnNAn]
    • Let AnNAn be given.
      • By definition of union: [AnNAn][iN[AAi]]
        • As Ai is an algebra of sets itself:
          • AAi
        • Thus AnNAn
    • Since AnNAn was arbitrary, we have shown this for all such A, thus nNAn is closed under complementation.
  2. Closed under union: A,BnNAn[ABnNAn]
    • Let A,BnNAn be given.
      • By definition of union we see:
        1. iN[AAi] and
        2. jN[BAj]
        • Define k:=Max({i,j})
          • Now AiAk and AjAk (at least one of these will be strict equality, it matters not which)
          • Thus A,BAk
          • As Ak is an algebra of sets:
            • C,DAk[CDAk]
          • Thus ABAk
          • So ABnNAn (explicitly, hN[ABAh] - namely choosing h to be k as we have defined it, and we have this if and only if AB is in the union, by the definition of union)
    • Since A,BnNAn were arbitrary we have shown this for all such A and B. As required.

Part ii)

Check that if the An are all sigma-algebras that their union need not be a sigma-algebra.

Is a countable union of sigma-algebras (whether monotonic or not) an algebra?

Hint: Try considering the set of all positive integers, Z1 with its sigma-algebras An:=σ(Cn) where Cn:=P({1,2,,n}) where {1,2,,n}N and P denotes the power set

Check that if B1 and B2 are sigma-algebras that their union need not be an algebra of sets

Solution

Suppose all the Ais are sigma-algebras now, and suppose that AnAn+1 still holds. We wish to show that their union, nNAn is not a sigma-algebra.

  • Our first guess will be that the σ--closed property does not hold. That is:
  • ¬[(An)nNnNAn[nNAnnNAn]] which is equivalent to (in that or if and only if):
    • (An)nNnNAn[nNAnnNAn] (Caution:Things look very similar here! Read with care!)
  • As before: nNAnnNAn¬(kN[nNAnAk]) kN[nNAnAk]
    • So we need to find a (An)n=1nNAn such that kN[nNAnAk]
      • As AnAn+1 we know AAn+1[AAn], as they're proper subsets of each other.
        • Thus, define An:=Xn where XnAn+1 and XnAn (which we have just shown to exist).
          • Now we must prove kN[nNAnAk]
            • Caution:Not convinced this is all "okay" - I also may have spotted why we're given the hint

It is easier to come up with an instance of AnAn+1 and prove this for that instance than do it in general.

Using hint as instance

Let An:=P({1,2,,n}N). Let A:=nNAn for convenience. We claim A is not a sigma-algebra and we suggest this based on the σ--closed property. That is we claim:

  • ¬(σ--closed(An)nNA[nNAnA]) (An)nNA[nNAnA]
    • Notice: nNAnA nNAnnNAn ¬(jN[nNAnAj]) jN[nNAnAk]
  • Combining these we see we want to show: (An)nNA[jN[nNAnAj]] or just: (An)nNAjN[nNAnAj]

Proof: (An)nNAjN[nNAnAj]

  • Let An:=P({1,,n}N) - where P denotes the power set of the finite set {1,,n} - which is a portion of N - the naturals.
  • We see that we have AnAn+1 or more specifically in fact: AnAn+1.
    • Define (An)n=1A as An:={n}
      • Clearly AnAn for each n.
      • Let jN be given (so j is arbitrary and we show the following for all j)
        • We must show nNAnAj
        • Lemma: abc[(abUc[aU])bc]
          • Let a, b and c be given.
            1. Suppose (abUc[aU]) is false, then by the nature of logical implication we do not care about the truth or falsity of the RHS and we're done
            2. Suppose (abUc[aU]) is true. We must show that in this case bc
              • Suppose bc. Then Uc[aU] - namely U:=b (as by hypothesis, ab)
                • But this is the negation of Uc[aU]! Contradicting the hypothesis
              • Thus we cannot have bc if (abUc[aU]) is true.
              • So we must have bc - as required.
          • This completes the proof of the lemma.
        • Notice j+1nNAn (trivial: j+1N and Aj+1:={j+1}, so j+1Aj+1nNAn, thus j+1nNAn)
        • Notice also that UAj[j+1U]. Proof:
          • Let UAj be given.
            • Then U{1,,j}, by the implies-subset relation, xUx{1,,j}.
            • Suppose j+1U, then j+1{1,,j} which is a contradiction! Thus we cannot have j+1U
            • We must have j+1U
        • By the lemma: (abUc[aU])bc, in this case:
        • (j+1nNAnUAj[j+1U])nNAnAj
      • Thus we see nNAnAj is true for all jN (since it was arbitrary)
    • For this choice of (An)nN

Thus nNAn cannot be a sigma-algebra as it isn't closed under countable union (of pairwise disjoint sets as it happens)

Part iii)

There isn't really a part 3 but the last part of part 2 is:

Then there's

  • Check that if B1 and B2 are σ-algebras that their union need not be an algebra.

If we do the second one first, we have shown the first, as (B1,B2,{},{},) is a countable collection of sigma-algebras containing B1B2 and thus its union cannot be a sigma-algebra.

Solution

Let B1 and B2 be σ-algebras. Is B1B2 an algebra?


Notes

References