ss#Probability #MeasureTheory >[!def] Distribution >Let (Ω,F,P) be a Probability Space. Let (Xn)n∈N be a sequence of RVs and X an RV s.t. Xn,X:Ω→R. We define the pushforward measure X#P as the law or distribution of X i.e. for any B∈B(R): X#P(B):=μ(B)=P(X−1(B))=P({ω∈Ω:X(ω)∈B})=P(X∈B)Since μ is the distribution of a rv then (R,B,μ) is a valid probability space.
X∼μ means μ is the of X. We also use L(X)to refer to the law of X (i.e. μ).
Let X,Y be rvs. Then L(X)=L(Y)⟺FX(x)=FY(x), ∀x∈R
This makes some application of Extension Theorem
Let X,Y be rvs. Then L(X)=L(Y)⟺E[f(X)]=E[f(Y)], ∀ Borel f:R→R
If X=Y a.s. then X∼Y.
\begin{proof} Consider the probability space (R,B,μ) and let X(ω)=ω. Then "Prob(X∈B)"=μ(ω∈B)=μ(B) \end{proof}