I am following the Measure Theory series by D.H. Fremlin and blogging my notes here.
Continuing from where I left off last time,
111X (e)
Let X be a set, A a family of subsets of X, and Σ the σ-algebra of subsets of X generated by A. Suppose that Y is another set and ϕ:Y→X a function. Show that {ϕ−1[E]:E∈Σ} is the σ-algebra of subsets of Y generated by {ϕ−1[A]:A∈A}.
I have a confession to make. This problem had been troubling me for DAYS. It all came down to proving an equality and I was only able to prove one side of it. I eventually had to look up the solution and found one here on StackExchange. Before I start the proof however, there is an interesting comment on the selected answer that I would like to talk about here:
Nate Eldredge said,
The general trick is that if you want to show something (call it P) holds for all sets A in a σ-algebra σ(C) generated by a known collection, the obvious approach “let A∈σ(C), show A satisfies P” is often not helpful, because you don’t know what A might look like. Instead, try considering the collection B of all sets satisfying P. If you can show that B is a σ-algebra containing C, you will be done.
One question I had immediately upon reading this was: Why will we be done if we can show that B is a σ-algebra containing C? Then I realised, that the σ-algebra generated by C is defined as the intersection of the set of all σ-algebras that contain C, i.e.,
σ(C)=⋂{Σ:Σ is a σ-algebra and C⊆Σ}
which means that B is also a part of this intersection, and hence, every element of σ(C) must satisfy P because every element of B satisfies P.
I think this is a nice approach. Anyways, let’s get back to the proof,
Proof.
We want to show that {ϕ−1[E]:E∈Σ} is the σ-algebra of subsets of Y generated by {ϕ−1[A]:A∈A}. Or in other words, {ϕ−1[E]:E∈Σ} equals ⋂T where
T={Ω:Ω is a σ-algebra of subsets of Y and {ϕ−1[A]:A∈A}⊆Ω}
First we will show that ⋂T⊆{ϕ−1[E]:E∈Σ}.
- In 111X (d) we proved that {ϕ−1[E]:E∈Σ} is a σ-algebra of subsets of Y (the domain of ϕ).
- A⊆Σ
⟹{ϕ−1[A]:A∈A}⊆{ϕ−1[E]:E∈Σ}}
⟹{ϕ−1[E]:E∈Σ}∈T
⟹⋂T⊆{ϕ−1[E]:E∈Σ}
Now we will show that {ϕ−1[E]:E∈Σ}⊆⋂T. For this we will use the new approach we read about above.
Let D be a family of subsets of X such that for every D in D we have, ϕ−1[D]∈⋂T, i.e.,
D={D:D⊆X and ϕ−1[D]∈⋂T}
Now,
(i) We know that ∅⊆X and ϕ−1[∅]=∅∈⋂T. Thus, ∅∈D.
(ii) Let D∈D. For every ϕ−1[D]∈⋂T we have,
Y∖ϕ−1[D]∈⋂T⟹ϕ−1[X∖D]∈⋂T
Also, it is obvious that X∖D⊆X. Thus, X∖D∈D∀D∈D.
(iii) Let ⟨En⟩n∈N be a sequence of sets in D. Then ⟨ϕ−1[En]⟩n∈N∈⋂T. This means that,
n∈N⋃ϕ−1[En]∈⋂T⟹ϕ−1[n∈N⋃En]∈⋂T
Also, ⋃n∈NEn⊆X. Thus, ⋃n∈NEn∈D.
From (i), (ii) and (iii) it is clear that D is a σ-algebra of subsets of X.
(iv) From the definition of T,
{ϕ−1[A]:A∈A}⊆⋂T⟹A⊆D
Thus, D is a σ-algebra of subsets of X that contains A. This means that
Σ⊆D
and therefore from the definition of D,
ϕ−1[E]∈⋂T∀E∈Σ⟹{ϕ−1[E]:E∈Σ}⊆⋂T
We have thus proved both the sides, ⋂T⊆{ϕ−1[E]:E∈Σ} and
{ϕ−1[E]:E∈Σ}⊆⋂T. Therefore,
{ϕ−1[E]:E∈Σ}=⋂T□
Phew, that was one troublesome problem. If you have reached the end of this post, I commend your willpower. Let me know if there are any mistakes in my solution, or you know of a more elegant / easier / better proof for this problem. Drop an email at ricekot [at] gmail [dot] com.