Show Menu
Cheatography

Appendix B+ - Measure & Probability Theory Cheat Sheet (DRAFT) by

NM4BIP Appendix B+: Basic Concepts in Measure Theory and Probability Theory

This is a draft cheat sheet. It is a work in progress and is not finished yet.

σ-algebras & Borel sets

𝒜 ⊆ 2Ω is a σ-algebra
if Ω ∈ 𝒜, A ∈ 𝒜 ⇒ Ac ∈ 𝒜, and Ai ∈ 𝒜 ⇒ ⋃i∈N Ai ∈ 𝒜
σ(ℰ)
inters­ection of all σ-algebras containing ℰ
ℬ(V)
σ(open subsets of V)

Measures

Measure
μ(∅)=0 and μ(⋃ Ai)=Σ μ(Ai) for disjoint Ai
Probab­ility
P(Ω)=1
Product
(⊗jμj)(A1 × ... × An)=∏j μj(Aj)
Lebesgue
λd(∏j (aj,bj)) = ∏j (bj-aj)

Measur­ability

Measurable
f-1(A2) ∈ 𝒜1 for all A2 ∈ 𝒜2
Check on generators
𝒜2=σ(ℰ), enough to check
f-1(E) ∈ 𝒜1 for E ∈ ℰ
Strongly measurable
fn simple, fn → f pointwise or μ-a.e.
Pettis
f strongly measurable ⇔ f separably valued and ⟨f,v′⟩ measurable ∀v′ ∈ V

Bochner integr­ation, change of variables

μ-simple
f = Σj=1n 1A_j vj, μ(Aj) < ∞
μ-simple f
∫ f dμ = Σ μ(Aj) vj
Bochner integrable
fn→f μ-a.e. and ∫ ||f-fn|| dμ→0
Bochner criterion
f strongly μ-meas­urable, ∫ ||f|| dμ < ∞
Norm bound
||∫ f dμ|| ≤ ∫ ||f|| dμ
Duality
⟨∫ f dμ, v′⟩ = ∫ ⟨f,v′⟩ dμ
Lp
μ-a.e. equiva­lence classes of strongly μ-meas­urable functions with finite Lp norm
dν/dμ
density of ν w.r.t μ, ν ≪ μ
Pushfo­rward
T# μ(A) = μ(T-1(A))
∫ f d(T#μ) = ∫ f∘T dμ
 

Banach­-valued RVs

Random variable
X:(Ω,𝒜­)→(­V,B(V)) measurable
PX = X#P, so P[X ∈ B]=PX(B)
σ(X) = {X-1(B): B ∈ ℬ(V)}
E[X] = ∫Ω X(ω)dP(ω), if ∫ ||X|| dP < ∞
E[φ(X)] = ∫Ω φ(X(ω)­)dP(ω) = ∫V φ(v)dPX(v)

Condit­ional probab­ility & indepe­ndence

1st Def.
P[A|B] = P[A∩B]­/P[B], P[B]>0
A,B indepe­ndent ⇔ P[A∩B]­=P[­A]P[B]
Xi indepe­ndent ⇔ σ(Xi) indepe­ndent
If X1,...,Xn indepe­ndent and integr­able: E[∏Xi]=∏E[Xi]

Condit­ional expect­ation

For simple Y = Σ 1A_j yj
E
[X|Y]
(ω) = 1/P[Aj]∫A_jX dP for ω ∈ Aj
1st Def.
Z=E[X|ℱ] iff Z is ℱ-meas. and
BZ dP=∫B X dP ∀B ∈ ℱ
2nd Def.
E[X|Y] := E[X|σ(Y)]
P[A|Y] := E[1A|σ(Y)]

Regular condit­ional distri­bution

Goal:
define P[X ∈ B | Y=y] even when P[Y=y]=0
Markov kernel
κX|F: Ω × ℬ(V) → [0,1]
reg. cond. distr. of X given ℱ
P[A∩{X∈B}] = ∫A κX|F(ω,B)d­P(ω), ∀ A∈ℱ, B∈ℬ(V)
Doob-D­ynkin
κ σ(Y)-m­eas­urable ⇔ κ = τ∘Y for measurable τ
reg. cond. distr. of X given Y
P[X∈B | Y=y] := τX|Y(y,B) := κX|σ(Y)(Y-1(y),B)
 

Condit­ional densities

fY(y) = ∫R^m fX,Y(x,y) dx
fX|Y(x|y) = fX,Y(x,y)/fY(y), for fY(y)>0
P[X ∈ B | Y=y] = ∫B fX|Y(x|y) dx

Gaussians

X∼N(μ,σ²):
fX(x) = 1/√(2πσ²) exp(−(­x−μ)²/ (2σ²))
X∼N(μ,Σ):
fX(x) ∝ det(Σ)-1/2 exp(−1/2 (x−μ)TΣ-1(x−μ))
Gaussian facts
marginals Gaussian; condit­ionals Gaussian; jointly Gaussian + uncorr­elated ⇔ indepe­ndent

Distances & Diverg­ences

DTV(P,Q) = supA∈𝒜|P(A)−­Q(A)|
DH(P,Q) = (1/√2)­(∫(­√(d­P/d­μ)−­√(d­Q/dμ))² dμ)1/2
DKL(P||Q) = ∫ log(dP­/dQ)dP if P≪Q; ∞ otherwise
Expect­ation bound
||EP[f] − EQ[f]|| ≤ 2DH(P,Q) (EP||f||²+EQ||f||²)1/2