Exercises:Measure Theory - 2016 - 1/Section B/Problem 1
Contents
[hide]Section B
Problem B1
Part i)
Suppose that An are algebras of sets satisfying An⊂An+1. Show that ⋃n∈NAn is an algebra.
- Caution:Is ⊂ or ⊆ desired?
Solution
- Closed under complementation: ∀A∈⋃n∈NAn[A∁∈⋃n∈NAn]
- Let A∈⋃n∈NAn be given.
- By definition of union: [A∈⋃n∈NAn]⟺[∃i∈N[A∈Ai]]
- As Ai is an algebra of sets itself:
- A∁∈Ai
- Thus A∁∈⋃n∈NAn
- As Ai is an algebra of sets itself:
- By definition of union: [A∈⋃n∈NAn]⟺[∃i∈N[A∈Ai]]
- Since A∈⋃n∈NAn was arbitrary, we have shown this for all such A, thus ⋃n∈NAn is closed under complementation.
- Let A∈⋃n∈NAn be given.
- Closed under union: ∀A,B∈⋃n∈NAn[A∪B∈⋃n∈NAn]
- Let A,B∈⋃n∈NAn be given.
- By definition of union we see:
- ∃i∈N[A∈Ai] and
- ∃j∈N[B∈Aj]
- Define k:=Max({i,j})
- Now Ai⊆Ak and Aj⊆Ak (at least one of these will be strict equality, it matters not which)
- Thus A,B∈Ak
- As Ak is an algebra of sets:
- ∀C,D∈Ak[C∪D∈Ak]
- Thus A∪B∈Ak
- So A∪B∈⋃n∈NAn (explicitly, ∃h∈N[A∪B∈Ah] - namely choosing h to be k as we have defined it, and we have this if and only if A∪B is in the union, by the definition of union)
- By definition of union we see:
- Since A,B∈⋃n∈NAn were arbitrary we have shown this for all such A and B. As required.
- Let A,B∈⋃n∈NAn be given.
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, Z≥1 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 An⊂An+1 still holds. We wish to show that their union, ⋃n∈NAn is not a sigma-algebra.
- Our first guess will be that the σ-∪-closed property does not hold. That is:
- ¬[∀(An)n∈N⊆⋃n∈NAn[⋃n∈NAn∈⋃n∈NAn]] which is equivalent to (in that ⟺ or if and only if):
- ∃(An)n∈N⊆⋃n∈NAn[⋃n∈NAn∉⋃n∈NAn] (Caution:Things look very similar here! Read with care!)
- As before: ⋃n∈NAn∉⋃n∈NAn⟺¬(∃k∈N[⋃n∈NAn∈Ak]) ⟺ ∀k∈N[⋃n∈NAn∉Ak]
- So we need to find a (An)∞n=1⊆⋃n∈NAn such that ∀k∈N[⋃n∈NAn∉Ak]
- As An⊂An+1 we know ∃A∈An+1[A∉An], as they're proper subsets of each other.
- Thus, define An:=Xn where Xn∈An+1 and Xn∉An (which we have just shown to exist).
- Now we must prove ∀k∈N[⋃n∈NAn∉Ak]
- Caution:Not convinced this is all "okay" - I also may have spotted why we're given the hint
- Now we must prove ∀k∈N[⋃n∈NAn∉Ak]
- Thus, define An:=Xn where Xn∈An+1 and Xn∉An (which we have just shown to exist).
- As An⊂An+1 we know ∃A∈An+1[A∉An], as they're proper subsets of each other.
- So we need to find a (An)∞n=1⊆⋃n∈NAn such that ∀k∈N[⋃n∈NAn∉Ak]
It is easier to come up with an instance of An⊂An+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:=⋃n∈NAn 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)n∈N⊆A[⋃n∈NAn∈A]) ⟺∃(An)n∈N⊆A[⋃n∈NAn∉A]
- Notice: ⋃n∈NAn∉A ⟺⋃n∈NAn∉⋃n∈NAn ⟺¬(∃j∈N[⋃n∉NAn∈Aj]) ⟺∀j∈N[⋃n∈NAn∉Ak]
- Combining these we see we want to show: ∃(An)n∈N⊆A[∀j∈N[⋃n∈NAn∉Aj]] or just: ∃(An)n∈N⊆A∀j∈N[⋃n∈NAn∉Aj]
Proof: ∃(An)n∈N⊆A∀j∈N[⋃n∈NAn∉Aj]
- 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 An⊆An+1 or more specifically in fact: An⊂An+1.
- Define (An)∞n=1⊆A as An:={n}
- Clearly An∈An for each n.
- Let j∈N be given (so j is arbitrary and we show the following for all j)
- We must show ⋃n∈NAn∉Aj
- Lemma: ∀a∀b∀c[(a∈b∧∀U∈c[a∉U])⟹b∉c]
- Let a, b and c be given.
- Suppose (a∈b∧∀U∈c[a∉U]) 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
- Suppose (a∈b∧∀U∈c[a∉U]) is true. We must show that in this case b∉c
- Suppose b∈c. Then ∃U∈c[a∈U] - namely U:=b (as by hypothesis, a∈b)
- But this is the negation of ∀U∈c[a∉U]! Contradicting the hypothesis
- Thus we cannot have b∈c if (a∈b∧∀U∈c[a∉U]) is true.
- So we must have b∉c - as required.
- Suppose b∈c. Then ∃U∈c[a∈U] - namely U:=b (as by hypothesis, a∈b)
- This completes the proof of the lemma.
- Let a, b and c be given.
- Notice j+1∈⋃n∈NAn (trivial: j+1∈N and Aj+1:={j+1}, so j+1∈Aj+1⊆⋃n∈NAn, thus j+1∈⋃n∈NAn)
- Notice also that ∀U∈Aj[j+1∉U]. Proof:
- Let U∈Aj be given.
- Then U⊆{1,…,j}, by the implies-subset relation, x∈U⟹x∈{1,…,j}.
- Suppose j+1∈U, then j+1∈{1,…,j} which is a contradiction! Thus we cannot have j+1∈U
- We must have j+1∉U
- Let U∈Aj be given.
- By the lemma: (a∈b∧∀U∈c[a∉U])⟹b∉c, in this case:
- (j+1∈⋃n∈NAn∧∀U∈Aj[j+1∉U])⟹⋃n∈NAn∉Aj
- Thus we see ⋃n∈NAn∉Aj is true for all j∈N (since it was arbitrary)
- For this choice of (An)n∈N
- Define (An)∞n=1⊆A as An:={n}
Thus ⋃n∈NAn 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:
- Is a countable union of σ-algebras (whether monotone or not) an algebra of sets?
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 B1∪B2 and thus its union cannot be a sigma-algebra.
Solution
Let B1 and B2 be σ-algebras. Is B1∪B2 an algebra?
Notes
References