Definition
Let (Ω,F,P) be a probability space, and X be a random variable on the space.
Further, denote μ the distribution of X, s.t.,
μ(A)=P(X−1(A)),∀A∈B,where B is the collection of Borel set on R.
Definition. The characteristic function r.w.t. μ is given by
φ(t)=∫Reitxμ(dx).
Theorem.
φ(t)=E[eitX].
Proof.
Recall that, by definition of expectation, we have
E[eitX]≐∫ΩeitX(ω)P(dω)≐∫Ω(sin(tX(ω))+i⋅cos(tX(ω)))P(dω)=(a)∫Rsin(tx)μ(dx)+i⋅∫Rcos(tx)μ(dx)=∫Reitxμ(dx)=φ(t),where in Equation (a), we have applied the fact that for each function f that is measurable B/B,
∫Ωf(X(ω))P(dω)=∫Rf(x)μ(dx).□
Independence
Theorem. Let X and Y be independent random variables.
Then
φ(X+Y)=φ(X)φ(Y).
Proof.
Since X and Y are independent, the following pairs of random variables are independent
- sin(tX(ω)), sin(tY(ω));
- cos(tX(ω)), cos(tY(ω));
- sin(tX(ω)), cos(tY(ω));
- cos(tX(ω)), sin(tY(ω)).
φ(X+Y)=E[eit(X+Y)]=E[(sin(tX(ω))+i⋅cos(tX(ω)))(sin(tY(ω))+i⋅cos(tY(ω)))]=E[sin(tX(ω))]E[sin(tY(ω))]−E[cos(tX(ω))]E[cos(tY(ω))]+iE[sin(tX(ω))]E[cos(tY(ω))]+iE[cos(tX(ω))]E[sin(tY(ω))]=φ(X)φ(Y).□
Uniqueness
Theorem. Let μ and ν be probability measures on R.
If μ and ν has the same characteristic functions, then
μ(A)=ν(A),∀A∈B.
The proof follows from the following lemma:
Lemma. Let a,b∈R, s.t. a<b.
If μ({a})=μ({b})=0, then
μ((a,b])=T→∞lim2π1∫−TTite−ita−e−itbφ(t)dt.
Proof of the Theorem.
For each n∈N+, define En≐{x∈R:μ({x})≥1/n}.
It is easy to see that ∣En∣≤n.
It follows that the E≐∪n∈N+En is countable.
Consider the set S={(a,b]:a<b,μ({a})=μ({b})=0}.
Obviously this is a π system.
Further, it generates B.
To see this, for each point c∈E, we can find
- a sequence a1,a2,… from Eˉ that increases to c,
- a sequence b1,b2,… from Eˉ that decreases to c.
Then (ai,bi]∈S, and ∩i≥1(ai,bi]=[c,c].
It follows that every interval (a,b]⊆R can be generated by intervals in S.
According to the lemma, μ and ν agrees on a π system that generates B.
By π-λ theorem, they agree on each set in B.
□
Proof of the Lemma.
We are going to prove that, for each a<b,
T→∞lim2π1∫−TTite−ita−e−itbφ(t)dt=μ(a,b)+μ({a,b}).Define
IT≐∫−TTite−ita−e−itbφ(t)dt=∫−TT∫Rite−it(a−x)−e−it(b−x)μ(dx)dt=(a)∫R∫−TTite−it(a−x)−e−it(b−x)dtμ(dx)=(b)∫R∫−TT[tsin((x−a)t)−tsin((x−b)t)]dtμ(dx)=(c)2∫R∫0T[tsin((x−a)t)−tsin((x−b)t)]dtμ(dx)where
-
Equation (a) holds: since e−ix=1+∫0xe−isds,
ite−it(a−x)−e−it(b−x)=∫(b−x)(a−x)e−isds≤∣b−a∣is therefore bounded.
Hence, by Fubini's theorem, we can exchange the order of the double integral over finite product measure.
-
Equation (b) holds: since cos((x−a)t)/(it) and cos((x−b)t)/(it) are odd functions over [−T,T]
-
Equation (c) holds: since sin((x−a)t)/(it) and sin((x−b)t)/(it) are even functions over [−T,T]
Next, define S(T)≐∫0Txsinxdx.
Introducing the function
sgn(θ)=⎩⎨⎧1,0,−1, if θ>0, if θ=0, if θ<0,we can write
R(θ,T)≐∫0Txsinθxdx=sgn(θ)⋅S(∣θ∣T).Since T→∞, S(T)→π/2, we have R(θ,T)→sgn(θ)⋅π/2.
Hence,
T→∞lim{R(x−a,T)−R(x−b,T)}=⎩⎨⎧0,π/2,π,π/2,0,x<a,x=a,a<x<b,x=b,x>b.Finally, ∣R(θ,T)∣=S(∣θ∣T)≤suptS(t)<∞, by bounded convergence theorem,
T→∞limIT=2T→∞lim∫R∫0T[tsin((x−a)t)−tsin((x−b)t)]dtμ(dx)=2T→∞lim∫R{R(x−a,T)−R(x−b,T)}μ(dx)=2∫RT→∞lim{R(x−a,T)−R(x−b,T)}μ(dx)=2π⋅μ(a,b)+πμ({a,b}),which concludes the proof.
Remark.
Here, let fT(x)≐R(x−a,T)−R(x−b,T), and f(x)≐limT→∞fT(x).
Since fT(x) is bounded, assume that ∣fT(x)∣≤B,∀x,T.
Let ϵ>0.
For each T∈R+, define ET≐{x∈R:∣fT(x)−f(x)∣≤ϵ}.
Then
∫RfT(x)−f(x)μ(dx)≤∫R∣fT(x)−f(x)∣μ(dx)=∫ET∣fT(x)−f(x)∣μ(dx)+∫ET∣fT(x)−f(x)∣μ(dx)≤ϵ+2B⋅μ(ET).Finally, for x∈/(a−ϵ,a+ϵ)∪(b−ϵ,b+ϵ), we have ∣x−a∣T,∣x−b∣T≥ϵT.
Hence,
∣fT(x)−f(x)∣≤2⋅∣S(ϵT)−S(∞)∣,which approaches 0 as T→∞.
So
∫RfT(x)−f(x)μ(dx)→(1+2B)⋅ϵ.□
Reference
[1] P. Billingsley, Probability and measure Anniversary Edition, 3rd ed. New York: Wiley, 1995.
[2] R. Durrett, “Probability : theory and examples,” p. 432.