In statistics, Samuelson's inequality, named after the economist Paul Samuelson,[1] also called the Laguerre–Samuelson inequality,[2][3] after the mathematician Edmond Laguerre, states that every one of any collection x1, ..., xn, is within √n − 1 uncorrected sample standard deviations of their sample mean.

Statement of the inequality

If we let

\( \overline{x} = \frac{x_1+\cdots+x_n}{n} \)

be the sample mean and

\( s = \sqrt{\frac{1}{n} \sum_{i=1}^n (x_i - \overline{x})^2 } \)

be the standard deviation of the sample, then

\( {\displaystyle {\overline {x}}-s{\sqrt {n-1}}\leq x_{j}\leq {\overline {x}}+s{\sqrt {n-1}}\qquad {\text{for }}j=1,\dots ,n.}[4]

Equality holds on the left (or right) for \( x_{j} \) if and only if all the n − 1 \( x_{i} \)s other than \( x_{j} \) are equal to each other and greater (smaller) than \( {\displaystyle x_{j}.} \) [2]

Comparison to Chebyshev's inequality

Main article: Chebychev's inequality § Samuelson's inequality

Chebyshev's inequality locates a certain fraction of the data within certain bounds, while Samuelson's inequality locates all the data points within certain bounds.

The bounds given by Chebyshev's inequality are unaffected by the number of data points, while for Samuelson's inequality the bounds loosen as the sample size increases. Thus for large enough data sets, Chebychev's inequality is more useful.

Applications

Samuelson's inequality may be considered a reason why studentization of residuals should be done externally.

Relationship to polynomials

Samuelson was not the first to describe this relationship: the first was probably Laguerre in 1880 while investigating the roots (zeros) of polynomials.[2][5]

Consider a polynomial with all roots real:

\( a_0x^n + a_1x^{n-1} + \cdots + a_{n-1}x + a_n = 0 \)

Without loss of generality let \( a_0 = 1 \) and let

\( t_1 = \sum x_i \) and \( t_2 = \sum x_i^2 \)

Then

\( a_1 = - \sum x_i = -t_1 \)

and

\( a_2 = \sum x_ix_j = \frac{t_1^2 - t_2}{2} \qquad \text{ where } i < j \)

In terms of the coefficients

\( t_2 = a_1^2 - 2a_2 \)

Laguerre showed that the roots of this polynomial were bounded by

\( -a_1 / n \pm b \sqrt{n - 1} \)

where

\( {\displaystyle b={\frac {\sqrt {nt_{2}-t_{1}^{2}}}{n}}={\frac {\sqrt {na_{1}^{2}-a_{1}^{2}-2na_{2}}}{n}}} \)

Inspection shows that \( -\tfrac{a_1}{n} \) is the mean of the roots and that b is the standard deviation of the roots.

Laguerre failed to notice this relationship with the means and standard deviations of the roots, being more interested in the bounds themselves. This relationship permits a rapid estimate of the bounds of the roots and may be of use in their location.

When the coefficients \( a_1 \) and \( a_2 \) are both zero no information can be obtained about the location of the roots, because not all roots are real (as can be seen from Descartes' rule of signs) unless the constant term is also zero.

References

Samuelson, Paul (1968). "How Deviant Can You Be?". Journal of the American Statistical Association. 63 (324): 1522–1525. doi:10.2307/2285901. JSTOR 2285901.

Jensen, Shane Tyler (1999). The Laguerre–Samuelson Inequality with Extensions and Applications in Statistics and Matrix Theory (PDF) (MSc). Department of Mathematics and Statistics, McGill University.

Jensen, Shane T.; Styan, George P. H. (1999). "Some Comments and a Bibliography on the Laguerre-Samuelson Inequality with Extensions and Applications in Statistics and Matrix Theory". Analytic and Geometric Inequalities and Applications. pp. 151–181. doi:10.1007/978-94-011-4577-0_10.

Barnett, Neil S.; Dragomir, Sever Silvestru (2008). Advances in Inequalities from Probability Theory and Statistics. Nova Publishers. p. 164. ISBN 978-1-60021-943-6.

Laguerre E. (1880) Mémoire pour obtenir par approximation les racines d'une équation algébrique qui a toutes les racines réelles. Nouv Ann Math 2e série, 19, 161–172, 193–202

Undergraduate Texts in Mathematics

Graduate Studies in Mathematics

Hellenica World - Scientific Library

Retrieved from "http://en.wikipedia.org/"

All text is available under the terms of the GNU Free Documentation License