Loading AI tools

Theorem in probability and statistics From Wikipedia, the free encyclopedia

In probability theory and statistics, the **law of the unconscious statistician**, or **LOTUS**, is a theorem which expresses the expected value of a function *g*(*X*) of a random variable X in terms of g and the probability distribution of X.

The form of the law depends on the type of random variable X in question. If the distribution of X is discrete and one knows its probability mass function *p _{X}*, then the expected value of

Both of these special cases can be expressed in terms of the cumulative probability distribution function *F*_{X} of X, with the expected value of *g*(*X*) now given by the Lebesgue–Stieltjes integral

In even greater generality, X could be a random element in any measurable space, in which case the law is given in terms of measure theory and the Lebesgue integral. In this setting, there is no need to restrict the context to probability measures, and the law becomes a general theorem of mathematical analysis on Lebesgue integration relative to a pushforward measure.

This proposition is (sometimes) known as the *law of the unconscious statistician* because of a purported tendency to think of the identity as the very definition of the expected value, rather than (more formally) as a consequence of its true definition.^{[1]} The naming is sometimes attributed to Sheldon Ross' textbook *Introduction to Probability Models*, although he removed the reference in later editions.^{[2]} Many statistics textbooks do present the result as the definition of expected value.^{[3]}

A similar property holds for joint distributions, or equivalently, for random vectors. For discrete random variables *X* and *Y*, a function of two variables *g*, and joint probability mass function :^{[4]}
In the absolutely continuous case, with being the joint probability density function,

A number of special cases are given here. In the simplest case, where the random variable X takes on countably many values (so that its distribution is discrete), the proof is particularly simple, and holds without modification if X is a discrete random vector or even a discrete random element.

The case of a continuous random variable is more subtle, since the proof in generality requires subtle forms of the change-of-variables formula for integration. However, in the framework of measure theory, the discrete case generalizes straightforwardly to general (not necessarily discrete) random elements, and the case of a continuous random variable is then a special case by making use of the Radon–Nikodym theorem.

Suppose that X is a random variable which takes on only finitely or countably many different values *x*_{1}, *x*_{2}, ..., with probabilities *p*_{1}, *p*_{2}, .... Then for any function g of these values, the random variable *g*(*X*) has values *g*(*x*_{1}), *g*(*x*_{2}), ..., although some of these may coincide with each other. For example, this is the case if *X* can take on both values 1 and −1 and *g*(*x*) = *x*^{2}.

Let *y*_{1}, *y*_{2}, ... enumerate the possible *distinct* values of , and for each i let *I*_{i} denote the collection of all j with *g*(*x*_{j}) = *y*_{i}. Then, according to the definition of expected value, there is

Since a can be the image of multiple, distinct , it holds that

Then the expected value can be rewritten as
This equality relates the average of the outputs of *g*(*X*) as weighted by the probabilities of the outputs themselves to the average of the outputs of *g*(*X*) as weighted by the probabilities of the outputs of X.

If X takes on only finitely many possible values, the above is fully rigorous. However, if X takes on countably many values, the last equality given does not always hold, as seen by the Riemann series theorem. Because of this, it is necessary to assume the absolute convergence of the sums in question.^{[5]}

Suppose that X is a random variable whose distribution has a continuous density f. If g is a general function, then the probability that *g*(*X*) is valued in a set of real numbers K equals the probability that X is valued in *g*^{−1}(*K*), which is given by
Under various conditions on g, the change-of-variables formula for integration can be applied to relate this to an integral over K, and hence to identify the density of *g*(*X*) in terms of the density of X. In the simplest case, if g is differentiable with nowhere-vanishing derivative, then the above integral can be written as
thereby identifying *g*(*X*) as possessing the density *f* (*g*^{−1}(*y*))(*g*^{−1})′(*y*). The expected value of *g*(*X*) is then identified as
where the equality follows by another use of the change-of-variables formula for integration. This shows that the expected value of *g*(*X*) is encoded entirely by the function g and the density f of X.^{[6]}

The assumption that g is differentiable with nonvanishing derivative, which is necessary for applying the usual change-of-variables formula, excludes many typical cases, such as *g*(*x*) = *x*^{2}. The result still holds true in these broader settings, although the proof requires more sophisticated results from mathematical analysis such as Sard's theorem and the coarea formula. In even greater generality, using the Lebesgue theory as below, it can be found that the identity
holds true whenever X has a density f (which does not have to be continuous) and whenever g is a measurable function for which *g*(*X*) has finite expected value. (Every continuous function is measurable.) Furthermore, without modification to the proof, this holds even if X is a random vector (with density) and g is a multivariable function; the integral is then taken over the multi-dimensional range of values of X.

An abstract and general form of the result is available using the framework of measure theory and the Lebesgue integral. Here, the setting is that of a measure space (Ω, *μ*) and a measurable map *X* from Ω to a measurable space Ω'. The theorem then says that for any measurable function g on Ω' which is valued in real numbers (or even the extended real number line), there is
(interpreted as saying, in particular, that either side of the equality exists if the other side exists). Here *X*_{♯} *μ* denotes the pushforward measure on Ω′. The 'discrete case' given above is the special case arising when X takes on only countably many values and μ is a probability measure. In fact, the discrete case (although without the restriction to probability measures) is the first step in proving the general measure-theoretic formulation, as the general version follows therefrom by an application of the monotone convergence theorem.^{[7]} Without any major changes, the result can also be formulated in the setting of outer measures.^{[8]}

If μ is a σ-finite measure, the theory of the Radon–Nikodym derivative is applicable. In the special case that the measure *X*_{♯} *μ* is absolutely continuous relative to some background σ-finite measure ν on Ω′, there is a real-valued function *f*_{X} on Ω' representing the Radon–Nikodym derivative of the two measures, and then
In the further special case that Ω′ is the real number line, as in the contexts discussed above, it is natural to take *ν* to be the Lebesgue measure, and this then recovers the 'continuous case' given above whenever *μ* is a probability measure. (In this special case, the condition of σ-finiteness is vacuous, since Lebesgue measure and every probability measure are trivially σ-finite.)^{[9]}

Seamless Wikipedia browsing. On steroids.

Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.

Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.