Samuelson's inequality

Uses your system voice; voice and rate in settings.

Snapshot

≈ 4 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

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

edit edit source

If we let

x‾=x1+⋯+xnn

be the sample mean and

s=1n∑i=1n(xi−x‾)2

be the standard deviation of the sample, then

x‾−sn−1≤xj≤x‾+sn−1for j=1,…,n.[4]

Equality holds on the left (or right) for xj if and only if all the n − 1 xis other than xj are equal to each other and greater (smaller) than xj.[2]

If you instead define s=1n−1∑i=1n(xi−x‾)2 then the inequality x‾−sn−1≤xj≤x‾+sn−1 still applies and can be slightly tightened to x‾−sn−1n≤xj≤x‾+sn−1n.

Comparison to Chebyshev's inequality

edit edit source

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, Chebyshev's inequality is more useful.

Applications

edit edit source

Samuelson’s inequality has several applications in statistics and mathematics. It is useful in the studentization of residuals which shows a rationale for why this process should be done externally to better understand the spread of residuals in regression analysis.

In matrix theory, Samuelson’s inequality is used to locate the eigenvalues of certain matrices and tensors.

Furthermore, generalizations of this inequality apply to complex data and random variables in a probability space.[5][6]

Relationship to polynomials

edit edit source

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


Consider a polynomial with all roots real:

a0xn+a1xn−1+⋯+an−1x+an=0

Without loss of generality let a0=1 and let

t1=∑xi and t2=∑xi2

Then

a1=−∑xi=−t1

and

a2=∑xixj=t12−t22 where i<j

In terms of the coefficients

t2=a12−2a2

Laguerre showed that the roots of this polynomial were bounded by

−a1/n±bn−1

where

b=nt2−t12n=na12−a12−2na2n

Inspection shows that −a1n 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 a1 and a2 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

edit edit source
  1. ^ Samuelson, Paul (1968). "How Deviant Can You Be?". Journal of the American Statistical Association. 63 (324): 1522–1525. doi:10.2307/2285901. JSTOR 2285901.
  2. ^ a b c 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.
  3. ^ 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. ISBN 978-94-010-5938-1.
  4. ^ 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.
  5. ^ JIN, HONGWEI; BEN´ITEZ, JULIO (2017). "Some generalizations and probability versions of Samuelson's inequality" (PDF). Mathematical Inequalities & Applications: 1–12. doi:10.7153/mia-20-01. Retrieved 4 September 2024.
  6. ^ Demuynck, Thomas; Hjertstrand, Per (2019). "Samuelson's Approach to Revealed Preference Theory: Some Recent Advances" (PDF). Paul Samuelson. Remaking Economics: Eminent Post-War Economists. pp. 193–227. doi:10.1057/978-1-137-56812-0_9. ISBN 978-1-137-56811-3.
  7. ^ Laguerre, E. (1880). Sur une méthode pour obtenir par approximation les racines d'une équation algébrique qui a toutes ses racines réelles. Nouvelles Annales de Mathématiques : journal des candidats aux écoles polytechnique et normale, 2e série, 19, 161–171, 193–202. PDF (Part I) • PDF (Part II)

Text derived from https://en.wikipedia.org/w/index.php?oldid=1341817499 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

4 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.