The Characteristic Function

Why the Characteristic Function?

The MGF is a powerful tool, but it has a fatal weakness: it does not always exist. The Cauchy distribution, the log-normal, and many heavy-tailed distributions have infinite MGF for all t≠0t \neq 0.

The characteristic function resolves this by replacing etXe^{tX} with ejuXe^{juX}. Since ∣ejuX∣=1|e^{juX}| = 1 for all real uu and XX, the expectation is always finite. The characteristic function exists for every random variable, without exception.

Definition:

Characteristic Function

The characteristic function (CF) of a random variable XX is

Ο•X(u)=E[ejuX]=βˆ«βˆ’βˆžβˆžejux dF(x),u∈R,\phi_X(u) = \mathbb{E}[e^{juX}] = \int_{-\infty}^{\infty} e^{jux}\,dF(x), \qquad u \in \mathbb{R},

where j=βˆ’1j = \sqrt{-1}. For a continuous random variable with PDF f(x)f(x), this is the Fourier transform of the density with sign convention:

Ο•X(u)=F[f](βˆ’u).\phi_X(u) = \mathcal{F}[f](-u).

The characteristic function always exists and is bounded: βˆ£Ο•X(u)βˆ£β‰€1|\phi_X(u)| \leq 1 for all uu, with Ο•X(0)=1\phi_X(0) = 1. This is the decisive advantage over the MGF.

Characteristic Function

The function Ο•X(u)=E[ejuX]\phi_X(u) = \mathbb{E}[e^{juX}]. It is the Fourier transform of the distribution, always exists, and uniquely determines the distribution of XX.

Related: Moment Generating Function (MGF), Probability Generating Function (PGF)

Theorem: Basic Properties of the Characteristic Function

Let Ο•X(u)=E[ejuX]\phi_X(u) = \mathbb{E}[e^{juX}] be the characteristic function of XX. Then:

  1. Ο•X(0)=1\phi_X(0) = 1 and βˆ£Ο•X(u)βˆ£β‰€1|\phi_X(u)| \leq 1 for all uu.
  2. Ο•X\phi_X is uniformly continuous on R\mathbb{R}.
  3. Ο•X\phi_X is Hermitian: Ο•X(βˆ’u)=Ο•X(u)β€Ύ\phi_X(-u) = \overline{\phi_X(u)}.
  4. Ο•X\phi_X is non-negative definite: for any reals u1,…,unu_1, \ldots, u_n and complex a1,…,ana_1, \ldots, a_n, βˆ‘i,kΟ•X(uiβˆ’uk) ai akβ€Ύβ‰₯0.\sum_{i,k} \phi_X(u_i - u_k)\,a_i\,\overline{a_k} \geq 0.

Theorem: Moments from the Characteristic Function

If E[∣X∣k]<∞\mathbb{E}[|X|^k] < \infty, then Ο•X\phi_X is kk-times differentiable and

E[Xk]=jβˆ’k ϕX(k)(0).\mathbb{E}[X^k] = j^{-k}\,\phi_X^{(k)}(0).

Moreover, Ο•X(u)=βˆ‘i=0kE[Xi]i!(ju)i+o(uk)\phi_X(u) = \sum_{i=0}^{k} \frac{\mathbb{E}[X^i]}{i!}(ju)^i + o(u^k) as uβ†’0u \to 0.

Theorem: Analytic Extension from MGF to CF

If MX(t)<∞M_X(t) < \infty for ∣t∣<a|t| < a with a>0a > 0, then

Ο•X(u)=MX(ju).\phi_X(u) = M_X(ju).

That is, the characteristic function is obtained by evaluating the MGF along the imaginary axis.

The MGF MX(t)M_X(t) is defined for real tt, but when it converges in a strip around the origin, it extends to a complex analytic function. Evaluating at t=jut = ju gives the CF. This means that whenever the MGF exists, you can compute the CF by substitution β€” no separate calculation is needed.

Definition:

Convolution-to-Product Property of the CF

If XX and YY are independent, then

Ο•X+Y(u)=Ο•X(u)β‹…Ο•Y(u).\phi_{X+Y}(u) = \phi_X(u) \cdot \phi_Y(u).

If Y=aX+bY = aX + b, then Ο•Y(u)=ejbu ϕX(au)\phi_Y(u) = e^{jbu}\,\phi_X(au).

Example: CF of the Gaussian Distribution

Find the characteristic function of X∼N(ΞΌ,Οƒ2)X \sim \mathcal{N}(\mu, \sigma^2).

Definition:

Joint Characteristic Function

For a random vector X∈Rn\mathbf{X} \in \mathbb{R}^n with joint CDF FXF_{\mathbf{X}}, the joint characteristic function is

Ο•X(u)=E ⁣[ejuTX]=∫Rnejβˆ‘i=1nuixi dFX(x),u∈Rn.\phi_{\mathbf{X}}(\mathbf{u}) = \mathbb{E}\!\left[e^{j\mathbf{u}^T\mathbf{X}}\right] = \int_{\mathbb{R}^n} e^{j\sum_{i=1}^n u_i x_i}\,dF_{\mathbf{X}}(\mathbf{x}), \qquad \mathbf{u} \in \mathbb{R}^n.

For a pair (X,Y)(X, Y): Ο•X,Y(u,v)=E[ej(uX+vY)]\phi_{X,Y}(u, v) = \mathbb{E}[e^{j(uX + vY)}]. If XβŠ₯YX \perp Y, then Ο•X,Y(u,v)=Ο•X(u) ϕY(v)\phi_{X,Y}(u, v) = \phi_X(u)\,\phi_Y(v).

Characteristic Function: Magnitude and Phase

Explore the characteristic function Ο•X(u)\phi_X(u) for different distributions. The magnitude βˆ£Ο•X(u)∣|\phi_X(u)| and phase arg⁑ϕX(u)\arg\phi_X(u) are shown separately. Notice how the mean shifts the phase and the variance controls how fast the magnitude decays.

Parameters
0
1

Common Mistake: Fourier Transform Sign Convention

Mistake:

Confusing Ο•X(u)=E[ejuX]\phi_X(u) = \mathbb{E}[e^{juX}] with the engineering Fourier transform f^(Ο‰)=∫f(x)eβˆ’jΟ‰x dx\hat{f}(\omega) = \int f(x) e^{-j\omega x}\,dx. The sign in the exponent is opposite.

Correction:

The CF uses the +j+j convention: Ο•X(u)=F[f](βˆ’u)\phi_X(u) = \mathcal{F}[f](-u). When using Fourier inversion tables, replace Ο‰\omega with βˆ’u-u, or equivalently, conjugate the result. In Caire's notation, jj (not ii) denotes the imaginary unit.

Quick Check

The Cauchy distribution has CF Ο•X(u)=eβˆ’βˆ£u∣\phi_X(u) = e^{-|u|}. Does its MGF exist for any tβ‰ 0t \neq 0?

No — the MGF is infinite for all t≠0t \neq 0

Yes β€” the MGF equals eβˆ’βˆ£t∣e^{-|t|}

Yes β€” for ∣t∣<1|t| < 1

It depends on the location parameter

Quick Check

If XX is a real random variable, which of the following is always true about Ο•X(u)\phi_X(u)?

Ο•X(βˆ’u)=Ο•X(u)β€Ύ\phi_X(-u) = \overline{\phi_X(u)} (Hermitian symmetry)

Ο•X(u)\phi_X(u) is always real-valued

βˆ£Ο•X(u)∣=1|\phi_X(u)| = 1 for all uu

Ο•X(u)>0\phi_X(u) > 0 for all uu