Skip to content

Characteristic Functions

A characteristic function is the Fourier transform of a probability distribution.

For a real random variable XX, its characteristic function is

χX(t)=E[eitX].\chi_X(t) = \mathbb E[e^{itX}].

It packages the whole probability law into a function of the Fourier variable tt. For independent sums, characteristic functions multiply. For distributions with moments, derivatives at t=0t=0 recover those moments.

Characteristic functions are especially useful because they exist for every probability distribution, even when an ordinary density or a moment-generating function does not.

Helpful background. Review expectation values to average a function of a random variable.

Characteristic functions as Fourier averages

Section titled “Characteristic functions as Fourier averages”

Let XX be a real-valued random variable. The characteristic function of XX is

χX(t)=E[eitX],t∈R.\chi_X(t) = \mathbb E[e^{itX}], \qquad t\in\mathbb R.

For a discrete random variable with values xjx_j and probabilities pjp_j,

χX(t)=∑jpjeitxj.\chi_X(t) = \sum_j p_j e^{itx_j}.

For a continuous random variable with density fX(x)f_X(x),

χX(t)=∫−∞∞eitxfX(x) dx.\chi_X(t) = \int_{-\infty}^{\infty} e^{itx}f_X(x)\,dx.

This is a Fourier transform of the probability density, using the sign convention common in probability theory.

Every characteristic function satisfies

χX(0)=1,\chi_X(0)=1,

because ei0X=1e^{i0X}=1.

It also satisfies the bound

∣χX(t)∣≤1,\lvert\chi_X(t)\rvert\le1,

because it is the average of complex numbers of unit magnitude.

If XX and YY have the same characteristic function for all real tt, then they have the same distribution. Thus the characteristic function determines the probability law.

For a density fXf_X, the characteristic function is

χX(t)=∫eitxfX(x) dx.\chi_X(t) = \int e^{itx}f_X(x)\,dx.

Compared with the Fourier convention used on the main Fourier Transform page,

F[f](k)=∫f(x)e−ikx dx,\mathcal F[f](k) = \int f(x)e^{-ikx}\,dx,

one has

χX(t)=F[fX](−t).\chi_X(t) = \mathcal F[f_X](-t).

When the inversion conditions hold, the density can be recovered by

fX(x)=12π∫−∞∞e−itxχX(t) dt.f_X(x) = \frac{1}{2\pi} \int_{-\infty}^{\infty} e^{-itx}\chi_X(t)\,dt.

If no ordinary density exists, the inversion statement must be understood distributionally or in terms of probability measures.

If XX has finite moments up to order nn and the corresponding differentiations are justified, then

χX(n)(0)=inE[Xn].\chi_X^{(n)}(0) = i^n\mathbb E[X^n].

Equivalently,

E[Xn]=(−i)nχX(n)(0).\mathbb E[X^n] = (-i)^n\chi_X^{(n)}(0).

In particular,

E[X]=1iχX′(0),\mathbb E[X] = \frac{1}{i}\chi_X'(0),

and

E[X2]=−χX′′(0).\mathbb E[X^2] = -\chi_X''(0).

The variance is then

Var⁡(X)=−χX′′(0)−[1iχX′(0)]2.\operatorname{Var}(X) = -\chi_X''(0) - \left[ \frac{1}{i}\chi_X'(0) \right]^2.

One must be cautious: a characteristic function always exists, but its derivatives at the origin may not encode finite moments if those moments diverge.

If

Y=aX+b,Y=aX+b,

then

χY(t)=eitbχX(at).\chi_Y(t) = e^{itb}\chi_X(at).

Thus shifting a random variable multiplies the characteristic function by a phase, while scaling changes the Fourier variable.

This is the same structural rule as translation and scaling in Fourier analysis.

If XX and YY are independent, then

χX+Y(t)=χX(t)χY(t).\chi_{X+Y}(t) = \chi_X(t)\chi_Y(t).

Proof:

χX+Y(t)=E[eit(X+Y)]=E[eitXeitY]=E[eitX]E[eitY]=χX(t)χY(t).\begin{aligned} \chi_{X+Y}(t) &= \mathbb E[e^{it(X+Y)}]\\ &= \mathbb E[e^{itX}e^{itY}]\\ &= \mathbb E[e^{itX}]\mathbb E[e^{itY}]\\ &= \chi_X(t)\chi_Y(t). \end{aligned}

The key step is independence. Without independence, the expectation of the product need not factor.

For independent X1,…,XnX_1,\ldots,X_n,

χX1+⋯+Xn(t)=∏j=1nχXj(t).\chi_{X_1+\cdots+X_n}(t) = \prod_{j=1}^n\chi_{X_j}(t).

This product rule is one of the main reasons characteristic functions are central in limit theorems.

For a point mass at aa,

X=awith probability 1,X=a \quad\text{with probability }1,

so

χX(t)=eita.\chi_X(t) = e^{ita}.

For a two-outcome variable with values +1+1 and −1-1,

P(X=+1)=q,P(X=−1)=1−q,\mathbb P(X=+1)=q, \qquad \mathbb P(X=-1)=1-q,

the characteristic function is

χX(t)=qeit+(1−q)e−it.\chi_X(t) = qe^{it}+(1-q)e^{-it}.

For a normal distribution with mean μ\mu and variance s2s^2,

χX(t)=exp⁡(iμt−12s2t2).\chi_X(t) = \exp \left( i\mu t-\frac12s^2t^2 \right).

The Gaussian is special because independent Gaussian sums remain Gaussian; the product of their characteristic functions is again a Gaussian characteristic function. The density, covariance, and Gaussian-integral facts are collected in Gaussian Distributions.

The logarithm of the characteristic function,

KX(t)=log⁡χX(t),K_X(t) = \log\chi_X(t),

is the cumulant-generating function in Fourier form, near t=0t=0 when the logarithm is well behaved.

If the logarithm is analytic near zero, it has the convergent expansion

KX(t)=∑n=1∞κn(it)nn!,K_X(t) = \sum_{n=1}^{\infty} \kappa_n \frac{(it)^n}{n!},

where κn\kappa_n is the nnth cumulant. Finite moments through order nn suffice for derivatives and a finite Taylor expansion through that order; existence of all moments alone does not guarantee convergence of the infinite series. The first two are

κ1=E[X],κ2=Var⁡(X).\kappa_1=\mathbb E[X], \qquad \kappa_2=\operatorname{Var}(X).

For independent variables, cumulants add because characteristic functions multiply and logarithms turn products into sums.

Let X1,X2,…X_1,X_2,\ldots be independent and identically distributed with

E[Xj]=0,Var⁡(Xj)=1.\mathbb E[X_j]=0, \qquad \operatorname{Var}(X_j)=1.

For small uu, the characteristic function has the expansion

χX(u)=1−u22+o(u2),\chi_X(u) = 1-\frac{u^2}{2}+o(u^2),

assuming the variance exists.

For the normalized sum

Sn=X1+⋯+Xnn,S_n = \frac{X_1+\cdots+X_n}{\sqrt n},

independence gives

χSn(t)=[χX(tn)]n.\chi_{S_n}(t) = \left[ \chi_X \left( \frac{t}{\sqrt n} \right) \right]^n.

Using the small-uu expansion,

χSn(t)≈(1−t22n)n⟶e−t2/2.\chi_{S_n}(t) \approx \left( 1-\frac{t^2}{2n} \right)^n \longrightarrow e^{-t^2/2}.

The limiting characteristic function e−t2/2e^{-t^2/2} is that of a standard normal distribution. This is the characteristic-function intuition behind the central limit theorem.

For a quantum observable AA in a state ρ\rho, the outcome distribution has a characteristic function

χA(t)=Tr⁡(ρeitA).\chi_A(t) = \operatorname{Tr}(\rho e^{itA}).

For a pure state,

χA(t)=⟨ψ∣eitA∣ψ⟩.\chi_A(t) = \langle\psi\vert e^{itA}\lvert\psi\rangle.

This is just the characteristic function of the Born-rule probability distribution for measuring AA. The operator exponential is defined through the spectral theorem, reviewed in Spectral Theorem, Practical Version.

Expanding around t=0t=0 gives

χA(t)=1+it⟨A⟩−t22⟨A2⟩+⋯ ,\chi_A(t) = 1+it\langle A\rangle - \frac{t^2}{2}\langle A^2\rangle +\cdots,

as a finite expansion to the order justified by the finite moments. For example, a finite second moment gives a remainder o(t2)o(t^2) after the quadratic term. No norm-convergent operator Taylor series for an unbounded AA is being assumed.

This should not be confused with more specialized phase-space characteristic functions used for Wigner functions and continuous-variable quantum information. Those are related but carry additional structure.

  • Forgetting the sign convention difference between probability characteristic functions and some Fourier-transform tables.
  • Assuming a characteristic function requires an ordinary probability density.
  • Differentiating at t=0t=0 without checking that the corresponding moment exists.
  • Multiplying characteristic functions for sums without independence.
  • Confusing the characteristic function of a measurement-outcome distribution with the wavefunction itself.
  • Treating central-limit behavior as automatic when variance is infinite or independence assumptions fail.
  • P. Billingsley, Probability and Measure, 3rd ed., Wiley, 1995.
  • R. Durrett, Probability: Theory and Examples, 5th ed., Cambridge University Press, 2019 — probability measures, moments, and limit theorems.
  • W. Feller, An Introduction to Probability Theory and Its Applications, Volume II, 2nd ed., Wiley, 1971.
  • G. B. Folland, Fourier Analysis and Its Applications, American Mathematical Society, 2009.
  • B. C. Hall, Quantum Theory for Mathematicians, Springer, 2013.
  1. Let XX take values 00 and 11 with P(X=1)=q\mathbb P(X=1)=q. Find χX(t)\chi_X(t).
Solution

The probabilities are P(X=0)=1−q\mathbb P(X=0)=1-q and P(X=1)=q\mathbb P(X=1)=q. Therefore

χX(t)=(1−q)eit0+qeit=1−q+qeit.\chi_X(t) = (1-q)e^{it0}+qe^{it} = 1-q+qe^{it}.
  1. Use the previous answer to compute E[X]\mathbb E[X] from χX′(0)\chi_X'(0).
Solution

Differentiate:

χX′(t)=iqeit.\chi_X'(t) = iqe^{it}.

Thus

χX′(0)=iq.\chi_X'(0)=iq.

Since E[X]=χX′(0)/i\mathbb E[X]=\chi_X'(0)/i, one gets

E[X]=q.\mathbb E[X]=q.
  1. If XX and YY are independent standard normal variables, use characteristic functions to identify the distribution of X+YX+Y.
Solution

For a standard normal variable,

χX(t)=e−t2/2.\chi_X(t)=e^{-t^2/2}.

Independence gives

χX+Y(t)=e−t2/2e−t2/2=e−t2.\chi_{X+Y}(t) = e^{-t^2/2}e^{-t^2/2} = e^{-t^2}.

This has the form exp⁡(−s2t2/2)\exp(-s^2t^2/2) with s2=2s^2=2. Thus X+YX+Y is normal with mean 00 and variance 22.

  1. Show that if Y=aX+bY=aX+b, then χY(t)=eitbχX(at)\chi_Y(t)=e^{itb}\chi_X(at).
Solution

Use the definition:

χY(t)=E[eit(aX+b)]=eitbE[ei(at)X]=eitbχX(at).\chi_Y(t) = \mathbb E[e^{it(aX+b)}] = e^{itb}\mathbb E[e^{i(at)X}] = e^{itb}\chi_X(at).
  1. Let AA be self-adjoint and ψ\psi normalized with finite spectral second moment. Show that χA(t)=1+it⟨A⟩+O(t2)\chi_A(t)=1+it\langle A\rangle+O(t^2).
Solution

Use the scalar inequality ∣eiu−1−iu∣≤u2/2|e^{iu}-1-iu|\le u^2/2 inside the spectral integral. Its remainder is at most t2∫a2 dμψ(a)/2t^2\int a^2\,d\mu_\psi(a)/2. Consequently,

χA(t)=⟨ψ∣eitA∣ψ⟩=1+it⟨ψ∣A∣ψ⟩+O(t2).\chi_A(t) = \langle\psi\vert e^{itA}\lvert\psi\rangle = 1+it\langle\psi\vert A\lvert\psi\rangle+O(t^2).

The coefficient of itit is therefore ⟨A⟩\langle A\rangle.