Definition 4.1 (σ-algebra): Let Ω be a non-empty set. A family of subsets F of Ω is called a σ-algebra on Ω if
Ω∈F
A∈F⟹Ac∈F
(An)n∈N with ∀n∈N:An∈F⟹⋃n∈NAn∈F
Note: Elements of F are called events and denoted by A,B,C, etc.
Example (Trivial σ-algebra): Let Ω=∅ be an arbitrary set. Let F={∅,Ω}. Then, F is a σ-algebra on Ω.
Clearly, Ω∈F.
Let A∈F. Then, there are only two cases, either A=∅ or A=Ω. In each case, Ac∈F.
Consider a countable collection {Ai∣i∈N}⊆F. This collection is composed only of the sets Ai=∅ or Ai=Ω,i∈N. Thus
n∈N⋃Ai={Ω∅if ∃i s.t. Ai=Ωotherwise
and ⋃n∈NAi⊆F.
Example (Power set): Let Ω=∅ be an arbitrary set. Let F be the family which consists of all possible subsets of Ω, i.e. F={A∣A⊆Ω}. This F, called power set and denoted with P(Ω) or 2Ω, is a σ-algebra on Ω.
Since Ω⊆Ω,Ω∈F.
Let A∈F, then by definition Ac=Ω∖A⊆Ω and hence Ac∈F.
Let {Ai∣i∈N}⊆F. Then, by definition
n∈N⋃Ai={ω∈Ω∣∃i s.t. ω∈Ai}⊆Ω
and ⋃n∈NAi⊆F.
Note: The trivial σ-algebra is the smallest possible σ-algebra on Ω. The power set P(Ω) is the largest possible σ-algebra on Ω.
Example (Uncountable Ω, countable A or Ac): Let Ω be an uncountable set. We consider the family
F={A∣A⊆Ω s.t. A is countable or Ac is countable}
Then, F is a σ-algebra on Ω.
We have that Ωc=∅. We know that #∅=0, in particular ∅ is countable. Thus, Ω∈F.
Let A∈F. Thus, A is countable or Ac is countable. Since (Ac)c=A,Ac∈F.
Let {Ai∣i∈N}⊆F. If there exists j∈N s.t. Aj is uncountable, we have that
{n∈N⋃Ai}c=i∈N⋂Aic=i∈N,i=j⋂Aic∩Ajc⊆Ajc
hence, using the fact that Ajc must be countable, we have
#{n∈N⋃Ai}c≤#Ajc≤#N
and ⋃n∈NAi∈F. If for all i∈N we have that Ai is countable we rely on TODO: reference Proposition (Union of countable sets) and conclude that ⋃n∈NAi must be countable as well and hence ⋃n∈NAi∈F.
Note: Notice for the aforementioned σ-algebra that since Ω is uncountable it is not true that F=P(Ω). As an example consider Ω=[0,1), then both A=[0,0.5) and Ac=[0.5,1) are not countable.
Example (σ-algebra restricted on subset): Let Ω be a non empty set and F be a σ-algebra on Ω. Let Ω0⊆Ω s.t. Ω0=∅. Then, the collection F∩Ω0={A∩Ω0∣A∈F} is a σ-algebra on Ω0.
Clearly, Ω0=Ω∩Ω0∈F∩Ω0.
If B∈F∩Ω0, then B=A∩Ω0 for some A∈F and Ω0∖B=(Ω0∖A)∪(Ω0∖Ω0)=Ω0∖A=Ac∩Ω0∈F∩Ω0.
Suppose that {Bi∣i∈N}⊆F∩Ω0. Therefore, for any i∈N,Bi=Ai∩Ω0 for some Ai∈F. Then, since ⋃n∈NBi=(⋃i∈NAi)∩Ω0 and ⋃i∈NAi∈F, it follows that ⋃n∈NBi∈F∩Ω0.
Example (Infinte Ω, finite A,Ac): Let Ω be an infinite set. Define the family
G={A∣A⊆Ω s.t. A is finite or Ac is finite}
Then, G is not a σ-algebra on Ω. To see this, let {ωi∣i∈N} be a countably infinite sequence of distinct points of Ω and define the set A={ω2i∣i∈N}. We note that both A and, since {ω2i+1∣i∈N}⊆Ac,Ac are not finite. Let Ai={ω2i} s.t. A=⋃n∈NAi. It is clear that Ai∈G but A∈G, hence G is not a σ-algebra on Ω.
Example (Left-open real intervals): Let Ω=R and define the family
R={A=(a,b]∣a,b∈R}∪{∅}
Then, R is not a σ-algebra on Ω. To see this, let A=(a,b]∈R with A=∅, then Ac=(−∞,a]∪(b,∞)∈R.
Definition 4.2 (Sub-σ-algebra): Let F be a σ-algebra on Ω. If A⊆F and A is a σ-algebra on Ω0⊆Ω, then A is referred to as a sub-σ-algebra of F.
Example (σ-algebra restricted on subset continued): We show Ω0∈F if and only if F∩Ω0 is a sub-σ-algebra of F. We prove the direction “Ω0∈F” ⟹ “F∩Ω0 is a sub-σ-algebra of F” first. We know that F∩Ω0={A∩Ω0∣A∈F} and from an exercise (TODO, make proposition) we know that if A∈F and Ω0∈F, then A∩Ω0∈F, thus F∩Ω0⊆F. We already proved before that F∩Ω0 is a σ-algebra. For the direction “F∩Ω0 is a sub-σ-algebra of F” ⟹ “Ω0∈F” we note that Ω0∈F∩Ω0 as Ω∩Ω0=Ω0. Hence Ω0∈F follows from F∩Ω0⊆F.
Definition 4.3 (Measurable space): Let Ω=∅ and F be a σ-algebra on Ω. The pair (Ω,F) is referred to as a measurable space.
Note: If A∈F, then A is said to be measurable, i.e. each event is measurable.
4.2 σ-Algebras generated by Families of Sets
The next result is of general importance as it shows that even though a family of subsets G might not be a σ-algebra, one can always find a σ-algebra which is the smallest possible σ-algebra that contains G.
Proposition 4.4 (σ-algebra generated by G): Let Ω=0 and G be a family of subsets of Ω. Then, there exists a σ-algebra σ(G) which satisfies:
G⊆σ(G)
If G⊆U and U is a σ-algebra, then σ(G)⊆U.
Note: The second property means that σ(G) is a sub-σ-algebra of any other σ-algebra U on Ω.
To prove proposition (TODO: ref) we rely on the following result.
Proposition 4.5 (Union of σ-algebras is a σ-algebra): Let Ω=∅ be a set. Let Fi,i∈I be a collection of σ-algebras on Ω over an arbitrary set I. Then F=⋂i∈IFi is a σ-algebra on Ω.
TODO: PROOF
The σ-algebra σ(G) is referred to as the σ-algebra generated by G.
Proposition 4.6 (Properties of σ-algebra generated by G): Let σ(G) be the σ-algebra generated by a family of subsets G of Ω. Let A be another family of subsets of Ω. Then,
if A is a σ-algebra s.t. G⊆A and A⊆σ(G), then A=σ(G)
A⊆G⟹σ(A)⊆σ(G)
A⊆G⊆σ(A)⟹σ(A)=σ(G)
Example (G={∅}): Let Ω=∅ and let G={∅}. Then σ(G)={∅,Ω}, i.e. the trivial σ-algebra on Ω. By 1. of Proposition 4.6 it is enough to show that {∅,Ω}⊆σ(G) since {∅,Ω} is a σ-algebra that contains G. It is clear that {∅,Ω}⊆σ(G) is a σ-algebra, hence it must contain both, ∅ and ∅c=Ω.
Example (G={{1}}): Let Ω={1,2,3} and define G={{1}}. Clearly, σ(G) must contain {1},{1}c={2,3},Ω and ∅. Thus, we claim σ(G)={∅,{1},{2,3},Ω}. More generally, if A⊆Ω, then σ(A)={∅,A,Ac,Ω}.
Example (G={{ω}∣ω∈Ω}): Let Ω be an uncountable set and
F={A∣A⊆Ω s.t. A is countable or Ac is countable}
be the σ-algebra introduced in a previous example. We show that F=σ(G) where G={{ω}∣ω∈Ω}. Clearly G⊆F since each set {ω} has cardinality one. Thus, it remains to show that F⊆σ(G). Let A∈F. Then either A or Ac is countable. Suppose that A is countable, then A={ωi∣i∈N} for some collection of singletons ωi∈Ω. Therefore, A=⋃n∈N{ωi} and thus A∈σ(G) since {ωi}∈σ(G). If Ac is countable, by the latter argument, Ac∈σ(G) and hence also (Ac)c=A∈σ(G).
Note: The set G={{ω}∣ω∈Ω} is referred to as the point-partition on Ω.
Proposition 4.7 (Generating sub-σ-algebra): Let Ω and Ω0⊆Ω be non-empty sets and let G be a family of subsets of Ω. Then σ(G)∩Ω0=σ({A∩Ω0∣A∈G}).
4.3 Borel Sets of Real Coordinate Spaces
Definition 4.8 (Borel σ-algebra on the real numbers): Let Ω=R and
R={(−∞,x]∣x∈R}∪{∅}
be the family of left open intervals with the empty set adjoined. The σ-algebra B(R)=σ(R) is referred to as the Borel σ-algebra on R.
Definition 4.9 (Borel σ-algebra on real coordinate spaces): Let Ω=Rk,k∈N. Define
Rk={AA=i=1⨂k(ai,bi],ai,bi∈R,i=1,…,k}∪{∅}
i.e. the family of rectangles in Rk. Then, the σ-algebra B(Rk)=σ(Rk) is referred to as the Borel σ-algebra on Rk.
Definition 4.10 (Borel σ-algebra on real coordinate spaces subset): Let E⊆Rk s.t. E=∅. The Borel σ-algebra on E is defined by
B(E)=B(Rk)∩E={A∩EA∈B(Rk)}