In mathematics, Anderson's theorem is a result in real analysis and geometry which says that the integral of an integrable, symmetric, unimodal, non-negative function f over an n-dimensional convex body K does not decrease if K is translated inwards towards the origin. This is a natural statement, since the graph of f can be thought of as a hill with a single peak over the origin; however, for n ≥ 2, the proof is not entirely obvious, as there may be points x of the body K where the value f(x) is larger than at the corresponding translate of x.
Anderson's theorem, named after Theodore Wilbur Anderson, also has an interesting application to probability theory.
Let K be a convex body in n-dimensional Euclidean space Rn that is symmetric with respect to reflection in the origin, i.e. K = -K. Let f : Rn → R be a non-negative, symmetric, globally integrable function; i.e.
\int | |
Rn |
f(x)dx<+infty.
Suppose also that the super-level sets L(f, t) of f, defined by
L(f,t)=\{x\inRn|f(x)\geqt\},
are convex subsets of Rn for every t ≥ 0. (This property is sometimes referred to as being unimodal.) Then, for any 0 ≤ c ≤ 1 and y ∈ Rn,
\intKf(x+cy)dx\geq\intKf(x+y)dx.
Given a probability space (Ω, Σ, Pr), suppose that X : Ω → Rn is an Rn-valued random variable with probability density function f : Rn → [0, +∞) and that ''Y'' : Ω → '''R'''<sup>''n''</sup> is an [[Statistical independence|independent]] random variable. The probability density functions of many well-known probability distributions are p-concave for some p, and hence unimodal. If they are also symmetric (e.g. the Laplace and normal distributions), then Anderson's theorem applies, in which case
\Pr(X\inK)\geq\Pr(X+Y\inK)
for any origin-symmetric convex body K ⊆ Rn.