Alan Stuart Created 2026-10-25 Updated 2026-11-05
Alan Stuart was a statistician and professor at the London School of Economics, closely associated with the systematic presentation of statistical theory in Maurice Kendall's textbook tradition. The publisher credits him as an author of the sixth edition of Kendall's Advanced Theory of Statistics, volume 1, Distribution Theory, published in 1994. Its scope runs from moments and characteristic functions to sampling distributions, order statistics and multivariate normal distributions. This connects the probability distribution of raw observations to the sampling distribution of the statistics used for inference.[ref]
https://www.wiley-vch.de/en/areas-interest/mathematics-statistics/statistics-16st/probability-mathematical-statistics-16st1/kendall-39-s-advanced-theory-of-statistics-volume-1-distribution-theory-978-0-470-66530-5. Publisher catalogue, sixth-edition authorship, contents and Alan Stuart author information
Portrait of Alan Stuart, circa 1979
. Library of the London School of Economics and Political Science, via Wikimedia Commons. The source records no known copyright restrictions; this is not an asserted Creative Commons licence. Source. Almost sure convergence criterion for an independent Gaussian series Created 2026-10-14 Updated 2026-11-05
For independent standard Gaussian random variables, the partial sums have characteristic functions , where . A finite almost-sure limit implies convergence of these characteristic functions to one continuous at zero; would instead give zero at every nonzero . Conversely, bounded makes the partial sums a martingale bounded in L2 space, which converges almost surely and in L2 space.
For any real separable Hilbert space , any orthonormal basis and independent standard normal random variables , the displayed series converges almost surely for each fixed and in L2 space. Indeed, the Parseval identity for a Hilbertian basis gives , so the partial sums form an L2 space-bounded martingale. The martingale convergence theorem supplies both limits. Every finite linear combination has the normal distribution with variance . Thus its finite-dimensional characteristic function is , independent of the chosen orthonormal basis. This proves equality of the finite-dimensional distributions of the resulting isonormal Gaussian processes; pathwise equality needs a coupling.
Brownian zero mode of a fluctuating interface Created 2026-10-05 Updated 2026-11-05
An unpinned uniform height driven by Gaussian white noise is Brownian motion. Its variance grows as and it has no stationary distribution on the real height axis for . Indeed, a stationary characteristic function would obey , incompatible with continuity at zero. Quotienting out the uniform height can still leave stationary shape fluctuations.
Cauchy convolution semigroup Created 2026-10-20 Updated 2026-11-05
The centered Cauchy densitiesform a convolution semigroup: . With Fourier convention , the characteristic function is . Multiplying characteristic functions proves the semigroup identity. Equivalently, the sum of independent centered Cauchy random variables has scale equal to the sum of their scales; for example, scales two and three combine to scale five.
This family permits an exact deconvolution calculation for a particular right-hand side. If , the integral equationhas probability-density solution . If , the probability-measure solution is the Dirac measure at zero rather than an ordinary density. If , a probability-measure solution would have characteristic function , which exceeds one in modulus for nonzero and is impossible.
Subtracting scales works because both sides belong to this convolution family. For a general right-hand side, Fourier deconvolution instead multiplies its transform by , potentially amplifying high-frequency errors. The semigroup identity does not make arbitrary Cauchy-kernel integral equations stable or solvable by a scale subtraction.
Cauchy distribution Created 2026-09-24 Updated 2026-11-05
The Cauchy distribution with location and scale has probability density functionThe standard Cauchy distribution has , , characteristic function , and infinite first absolute moment.
Central limit theorem Created 2026-09-24 Updated 2026-10-14
Let be real independent and identically distributed random variables with expected value and finite, strictly positive variance . Write and for their sum and sample mean. The central limit theorem statesPrecisely, for every real ,where is the standard normal distribution function. The conclusion is convergence in distribution to the standard normal distribution. If the variance is zero, every observation equals almost surely; the displayed normalization is then undefined and there is no fluctuating error to describe.
The striking feature is that the observations need not have a normal distribution. They may be binary, bounded, or strongly skewed. Their detailed probability distribution disappears from this limit except through the expected value and variance. The subtraction removes predictable growth: . The division implements variance normalization: variance additivity for independent random variables gives , so every has expected value zero and variance one. For nonzero , an uncentered sum drifts; without rescaling its spread grows.
For a concrete example, let each have a Bernoulli distribution with success probability . Then has a binomial distribution, with expected value and variance . Its exact probability mass function and its normalized count areHere is a binomial coefficient. Individual trials are conspicuously skewed, yet their centered, rescaled counts approach the same standard normal distribution as sums of fair trials.
Exact standardized binomial distributions approach the standard normal curve
. For independent Bernoulli trials with , each blue bar has width equal to the normalized lattice spacing and area equal to the exact binomial distribution mass at its center. Heights are mass divided by spacing, so they can be compared with the orange probability density function of the standard normal distribution. All four normalized counts have expected value zero and variance one. The rectangles visualize discrete masses; they do not make the discrete probability distributions continuous. Details.At , has expected value and standard deviation . The exact binomial distribution gives . A normal approximation with the continuity correction uses the interval to :The small discrepancy is an approximation error, not an equality supplied by the central limit theorem.
The strong law of large numbers and weak law of large numbers locate the average: , respectively by almost sure convergence and convergence in probability. The central limit theorem magnifies that shrinking error and describes its shape. In terms of the sample mean, the resulting normal approximation is , with standard error . This explains why four times as many independent observations halve the standard error. When is known, has approximately coverage for at large , giving a confidence interval. This coverage refers to repeated samples, not a guarantee for an individual interval.
A useful application is the Monte Carlo method: estimate a success probability by the proportion of successful simulated trials. Nicholas Metropolis and S. Ulam's original paper, "The Monte Carlo Method" (1949), illustrates this with games of solitaire and estimation of a region's volume by randomly selected points, and discusses why estimates require probabilistic error control. The strong law of large numbers justifies convergence of such proportions for independent repetitions; the central limit theorem supplies their large-sample error scale when .[ref]
https://hedibert.org/wp-content/uploads/2013/12/1949MetropolisUlam.pdf. Metropolis and Ulam, The Monte Carlo Method, JASA 44 (1949), 335–341, especially pp. 336–337
There are three useful limits to this picture:
- A heavy-tailed distribution can have infinite variance, so the displayed hypothesis must be checked. A Pareto distribution with minimum one and shape has finite expected value three but infinite variance. The strong law of large numbers still applies, but the stated central limit theorem does not. More dramatically, the Cauchy sample mean has an unchanged distribution: even averaging need not concentrate when the expected value is undefined. A heavy-tailed distribution with finite variance is allowed by the stated central limit theorem.
- Independence matters. If all equal the same nonconstant Bernoulli random variable, then and . There is no accumulation of new information, and the variance of the sum grows like , not . Other versions of the central limit theorem can allow dependence, but require hypotheses controlling it.
- Convergence in distribution is a limiting assertion, with no universal sample size or error rate under finite variance alone. It does not automatically give accurate relative estimates of very small tail probabilities. Nor does it mean that discrete point masses converge as probability density functions: a binomial distribution remains discrete for every finite . If the success probability changes with so that and , the relevant result is the Poisson limit theorem, rather than the fixed- argument above.
A historical original-paper reference is J. W. Lindeberg's "Eine neue Herleitung des Exponentialgesetzes in der Wahrscheinlichkeitsrechnung" (1922), published in Mathematische Zeitschrift 15, pp. 211–225. The Lindeberg condition and Lindeberg-Feller central limit theorem below describe a version for sums whose summands need not share a probability distribution.[ref]
https://doi.org/10.1007/BF01494395. Lindeberg, Eine neue Herleitung des Exponentialgesetzes in der Wahrscheinlichkeitsrechnung (1922)
A brief proof outline uses the characteristic function of . Its expected value is zero and its variance is one, so the finite second moment givesThe Taylor expansion of the complex exponential, with its remainder controlled by , and the dominated convergence theorem justify this step without a third-moment assumption. Independence then gives the characteristic function of :The limit is the characteristic function of the standard normal distribution; the Lévy continuity theorem turns this into convergence in distribution.
Characteristic function Created 2026-09-24 Updated 2026-10-18
The characteristic function of a real random variable isIt determines the probability distribution of .
Here and . By Euler's formula, its real part and imaginary part are and . The complex exponential has absolute value one, so this expected value exists for every real random variable, even without finite absolute moments. Moreover,The bound uses the triangle inequality for a vector-valued integral; the last identity is complex conjugate symmetry.[ref]
Probability: Theory and Examples (fifth edition) by Rick Durrett. §3.3.1 definition, printed p. 125; Theorem 3.3.1(a)–(c), printed p. 126
Consequently the real part is an even function and the imaginary part is an odd function.For a discrete probability distribution with values and probabilities , the characteristic function is : a weighted average of points on the unit circle in the complex plane. For example, if has the Bernoulli distribution with and , thenEach point being averaged has absolute value one, but their directions partially cancel. At , the same average is ; at , it returns to one. The characteristic function is thus neither a probability density function nor a probability mass function: its argument is a frequency parameter, and its values can be complex numbers. This Bernoulli distribution has no probability density function with respect to Lebesgue measure, yet its characteristic function is defined at every frequency.
For a probability density function , the same definition becomes , the Fourier transform with the displayed sign convention. The Laplace transform of a nonnegative random variable instead uses for , a real decaying weight. For the Bernoulli distribution above, it is ; neither transform is the probability density function. The uniqueness theorem for characteristic functions explains why the oscillating averages still retain the entire probability law, while the characteristic function of a sum of independent variables turns combining laws into multiplication. These two properties make the representation useful even when directly computing a sum's probability distribution is cumbersome.
If is an integer and , the characteristic function has continuous derivatives through order , withThus finite absolute moments justify recovering moments from derivatives.[ref]
For a short justification of differentiation under the integral sign, the difference quotient for the st derivative has integrand . Its absolute value is at most , since for real . Lower absolute moments are finite because . Apply the dominated convergence theorem successively, then use the same integrable bound to obtain continuity of each derivative.
For the Bernoulli distribution with parameter , direct differentiation gives and , agreeing with . Its variance is therefore . Existence and continuity of a characteristic function alone do not authorize these moment calculations: the standard Cauchy distribution, whose expected value is undefined, still has a characteristic function. The stated finite absolute moment hypothesis is a sufficient condition for the derivative formula, not an assumption built into the definition of a characteristic function.
Characteristic-function derivative under an absolute first moment Created 2026-10-14 Updated 2026-10-20
If , the characteristic function satisfies . The bound and the dominated convergence theorem justify differentiation at zero. For mean zero, extends continuously by , and by a finite geometric series. This supplies a direct characteristic-function proof of the weak law of large numbers.
// Target: martingale.bigb
The characteristic function assigns every coalition its total attainable transferable payoff, with . It determines the efficiency condition of an imputation and all constraints of the core of a cooperative game. For the glove game, ; for miners requiring people to carry one lump, . This game-theoretic function is distinct from the characteristic function of a probability distribution.
Characteristic function of a sum of independent variables Created 2026-09-24 Updated 2026-10-18
Independence makes the characteristic function of a sum equal the product of the individual characteristic functions.
For mutually independent random variables , write . ThenThis is the expectation of a product of independent random variables applied to bounded complex exponentials; no moment hypothesis is needed.[ref]
Identical probability distributions are unnecessary. When the random variables are independent and identically distributed random variables, the product is . A deterministic rescaling also follows directly from the definition: for real . Consequently the sample mean has characteristic function , and a sum divided by has characteristic function .
The independence assumption does real work. Let take and with equal probabilities and set . Both characteristic functions are , but , not . At they give and zero respectively. Knowing the two marginal probability distributions does not determine the sum without their joint probability distribution.
Characteristic function of the Cauchy distribution Created 2026-10-03 Updated 2026-11-05
Let be independent and identically distributed random variables taking and with equal probabilities, the Rademacher distribution. The two opposite complex exponentials give . Their expected value is zero and their variance is one. For , the characteristic functions of its sample mean and its variance normalization are respectivelyFor each fixed , the bases are positive for all sufficiently large . The Taylor expansion at zero then givesExponentiating proves the two displayed pointwise limits. The first limit is the characteristic function of the constant zero; the second is that of the standard normal distribution. The Lévy continuity theorem gives the corresponding convergence in distribution statements. Averaging has variance , whereas dividing the sum by preserves variance one. This sign calculation illustrates why the law of large numbers and the central limit theorem use different scales; it is not a proof for arbitrary probability distributions.
Characteristic-function tail bound Created 2026-10-14 Updated 2026-10-18
Average over . Multiplication by gives , with value zero at . This is at least when . Tonelli's theorem then gives the displayed bound for a probability measure with characteristic function . The bound converts control of the characteristic function near zero into tightness of probability measures and is useful in proving the Lévy continuity theorem.
Characteristic-function tightness bound 2026-10-14
For a probability measure on the real line with characteristic function , averaging over gives . This is at least when . Integrating gives the displayed bound. Consequently pointwise convergence of characteristic functions to a function continuous at zero implies tightness of probability measures, by the dominated convergence theorem on and a separate tail bound for the finitely many initial measures.
Clopen evaluation embedding 2026-10-31
The characteristic functions of a clopen topological basis give a topological embedding of a zero-dimensional topological space into a product of discrete two-point topological spaces. The separation axiom makes those functions distinguish points, and their coordinate preimages recover the original topological basis.
For a unit-amplitude random phase screen with standard normal marginal distribution, the characteristic function gives coherent amplitude . The coherent power is , although the total power remains one. In homogeneous paraxial space the mean constant transverse field propagates without additional attenuation. Under decorrelation at large separation, the remaining power is diffuse.
Conditional characteristic function Created 2026-10-07 Updated 2026-10-14
For a real random variable and a sigma-algebra , the conditional characteristic function is . If it equals the nonrandom characteristic function of a probability law for every , then has that law and is independent of . To verify the independence assertion, multiply the identity by any bounded -measurable test variable and use the uniqueness theorem for characteristic functions on the resulting finite measures. Equality for rational extends by continuity, so simultaneous null sets can be arranged when needed.
For an adapted continuous process starting at zero, the displayed conditional characteristic function identifies every increment as and makes it independent of the preceding sigma-field. Multiply by the indicator of an event in that sigma-field, then use the uniqueness theorem for characteristic functions for finite measures. Thus the process is a Brownian motion in the given filtration.


