<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=Samuelson%27s_inequality</id>
	<title>Samuelson&#039;s inequality - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=Samuelson%27s_inequality"/>
	<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=Samuelson%27s_inequality&amp;action=history"/>
	<updated>2026-10-28T06:25:53Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.1</generator>
	<entry>
		<id>http://debianws.lexgopc.com/wiki143/index.php?title=Samuelson%27s_inequality&amp;diff=8719670&amp;oldid=prev</id>
		<title>imported&gt;ThaHistorico: Image. The page has no thumbnail</title>
		<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=Samuelson%27s_inequality&amp;diff=8719670&amp;oldid=prev"/>
		<updated>2025-01-09T08:26:43Z</updated>

		<summary type="html">&lt;p&gt;Image. The page has no thumbnail&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;{{Short description|Concept in statistics}}&lt;br /&gt;
[[File:Paul Samuelson.jpg|alt=Samuelson Inequality|thumb]]&lt;br /&gt;
In [[statistics]], &amp;#039;&amp;#039;&amp;#039;Samuelson&amp;#039;s inequality&amp;#039;&amp;#039;&amp;#039;, named after the economist [[Paul Samuelson]],&amp;lt;ref&amp;gt;{{cite journal |first=Paul |last=Samuelson |title=How Deviant Can You Be? |journal=[[Journal of the American Statistical Association]] |volume=63 |issue=324 |year=1968 |pages=1522&amp;amp;ndash;1525 |jstor=2285901 |doi=10.2307/2285901 }}&amp;lt;/ref&amp;gt; also called the &amp;#039;&amp;#039;&amp;#039;Laguerre&amp;amp;ndash;Samuelson inequality&amp;#039;&amp;#039;&amp;#039;,&amp;lt;ref name=Jensen&amp;gt;{{cite thesis |type=MSc |last=Jensen |first=Shane Tyler |date=1999 |title=The Laguerre&amp;amp;ndash;Samuelson Inequality with Extensions and Applications in Statistics and Matrix Theory |publisher=Department of Mathematics and Statistics, [[McGill University]] |url=http://www.collectionscanada.gc.ca/obj/s4/f2/dsk1/tape10/PQDD_0027/MQ50799.pdf }}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite book |first1=Shane T. |last1=Jensen |first2=George P. H. |last2=Styan |year=1999 |chapter=Some Comments and a Bibliography on the Laguerre-Samuelson Inequality with Extensions and Applications in Statistics and Matrix Theory |title=Analytic and Geometric Inequalities and Applications |pages=151–181 |doi=10.1007/978-94-011-4577-0_10 |isbn=978-94-010-5938-1 }}&amp;lt;/ref&amp;gt; after the mathematician [[Edmond Laguerre]], states that every one of any collection &amp;#039;&amp;#039;x&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;,&amp;amp;nbsp;...,&amp;amp;nbsp;&amp;#039;&amp;#039;x&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;n&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt;, is within {{radic|&amp;#039;&amp;#039;n&amp;#039;&amp;#039;&amp;amp;nbsp;&amp;amp;minus;&amp;amp;nbsp;1}} uncorrected sample [[standard deviation]]s of their sample mean.&lt;br /&gt;
&lt;br /&gt;
==Statement of the inequality==&lt;br /&gt;
If we let&lt;br /&gt;
&lt;br /&gt;
: &amp;lt;math&amp;gt; \overline{x} = \frac{x_1+\cdots+x_n}{n} &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
be the sample [[mean]] and&lt;br /&gt;
&lt;br /&gt;
: &amp;lt;math&amp;gt; s = \sqrt{\frac{1}{n} \sum_{i=1}^n (x_i - \overline{x})^2 } &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
be the standard deviation of the sample, then&lt;br /&gt;
&lt;br /&gt;
: &amp;lt;math&amp;gt; \overline{x} - s\sqrt{n-1} \le x_j \le \overline{x} + s\sqrt{n-1}\qquad \text{for } j = 1,\dots,n. &amp;lt;/math&amp;gt;&amp;lt;ref&amp;gt;{{cite book |title=Advances in Inequalities from Probability Theory and Statistics |first1=Neil S. |last1=Barnett |first2=Sever Silvestru |last2=Dragomir |publisher=Nova Publishers |year=2008 |isbn=978-1-60021-943-6 |page=164 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Equality holds on the left (or right) for &amp;lt;math&amp;gt;x_j&amp;lt;/math&amp;gt; [[if and only if]] all the &amp;#039;&amp;#039;n&amp;#039;&amp;#039;&amp;amp;nbsp;&amp;amp;minus;&amp;amp;nbsp;1 &amp;lt;math&amp;gt;x_i&amp;lt;/math&amp;gt;s other than &amp;lt;math&amp;gt;x_j&amp;lt;/math&amp;gt; are equal to each other and greater (smaller) than &amp;lt;math&amp;gt;x_j.&amp;lt;/math&amp;gt;&amp;lt;ref name=Jensen/&amp;gt;&lt;br /&gt;
&lt;br /&gt;
If you instead define &amp;lt;math&amp;gt; s = \sqrt{\frac{1}{n-1} \sum_{i=1}^n (x_i - \overline{x})^2 } &amp;lt;/math&amp;gt; then the inequality &amp;lt;math&amp;gt; \overline{x} - s\sqrt{n-1} \le x_j \le \overline{x} + s\sqrt{n-1}&amp;lt;/math&amp;gt; still applies and can be slightly tightened to &amp;lt;math&amp;gt; \overline{x} - s\tfrac{n-1}{\sqrt{n}} \le x_j \le \overline{x} + s\tfrac{n-1}{\sqrt{n}}. &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Comparison to Chebyshev&amp;#039;s inequality==&lt;br /&gt;
{{Main|Chebyshev&amp;#039;s inequality#Samuelson&amp;#039;s inequality}}&lt;br /&gt;
&lt;br /&gt;
[[Chebyshev&amp;#039;s inequality]] locates a certain fraction of the data within certain bounds, while Samuelson&amp;#039;s inequality locates &amp;#039;&amp;#039;all&amp;#039;&amp;#039; the data points within certain bounds.&lt;br /&gt;
&lt;br /&gt;
The bounds given by Chebyshev&amp;#039;s inequality are unaffected by the number of data points, while for Samuelson&amp;#039;s inequality the bounds loosen as the sample size increases. Thus for large enough data sets, Chebyshev&amp;#039;s inequality is more useful.&lt;br /&gt;
&lt;br /&gt;
==Applications==&lt;br /&gt;
{{expand section|date=July 2017}}&lt;br /&gt;
&lt;br /&gt;
Samuelson’s inequality has several applications in [[statistics]] and [[mathematics]]. It is useful in the [[Studentized residual|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]].&lt;br /&gt;
&lt;br /&gt;
In [[Matrix (mathematics)|matrix theory]], Samuelson’s inequality is used to locate the [[Eigenvalues and eigenvectors|eigenvalues]] of certain matrices and tensors. &lt;br /&gt;
&lt;br /&gt;
Furthermore, generalizations of this inequality apply to complex data and random variables in a [[probability space]].&amp;lt;ref&amp;gt;{{Cite journal |last1=JIN |first1=HONGWEI |last2=BEN´ITEZ |first2=JULIO |title=Some generalizations and probability versions of Samuelson&amp;#039;s inequality |url=https://files.ele-math.com/articles/mia-20-01.pdf |access-date=4 September 2024 |journal=Mathematical Inequalities &amp;amp; Applications |date=2017 |pages=1–12 |language=English |doi=10.7153/mia-20-01}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{Cite book |title= Paul Samuelson|chapter=Samuelson&amp;#039;s Approach to Revealed Preference Theory: Some Recent Advances |chapter-url=https://dipot.ulb.ac.be/dspace/bitstream/2013/314701/3/working_paper.pdf |series=Remaking Economics: Eminent Post-War Economists |date=2019 |doi=10.1057/978-1-137-56812-0_9 |last1=Demuynck |first1=Thomas |last2=Hjertstrand |first2=Per |pages=193–227 |isbn=978-1-137-56811-3 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Relationship to polynomials==&lt;br /&gt;
&lt;br /&gt;
Samuelson was not the first to describe this relationship: the first  was probably [[Laguerre]] in 1880 while investigating the [[Equation solving|root]]s (zeros) of [[polynomial]]s.&amp;lt;ref name=Jensen/&amp;gt;&amp;lt;ref name=Laguerre1880&amp;gt;Laguerre E. (1880) Mémoire pour obtenir par approximation les racines d&amp;#039;une équation algébrique qui a toutes les racines réelles. Nouv Ann Math 2&amp;lt;sup&amp;gt;e&amp;lt;/sup&amp;gt; série, 19, 161–172, 193–202&amp;lt;/ref&amp;gt;&lt;br /&gt;
  &lt;br /&gt;
Consider a polynomial with all roots real:&lt;br /&gt;
 &lt;br /&gt;
: &amp;lt;math&amp;gt; a_0x^n + a_1x^{n-1} + \cdots + a_{n-1}x + a_n = 0 &amp;lt;/math&amp;gt;&lt;br /&gt;
 	&lt;br /&gt;
Without loss of generality let &amp;lt;math&amp;gt;a_0 = 1&amp;lt;/math&amp;gt; and let&lt;br /&gt;
&lt;br /&gt;
: &amp;lt;math&amp;gt; t_1 = \sum x_i &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; t_2 = \sum x_i^2 &amp;lt;/math&amp;gt;&lt;br /&gt;
 	&lt;br /&gt;
Then&lt;br /&gt;
&lt;br /&gt;
: &amp;lt;math&amp;gt; a_1 = - \sum x_i = -t_1 &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
and&lt;br /&gt;
&lt;br /&gt;
: &amp;lt;math&amp;gt; a_2 = \sum x_ix_j = \frac{t_1^2 - t_2}{2} \qquad \text{ where } i &amp;lt; j &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In terms of the coefficients&lt;br /&gt;
&lt;br /&gt;
: &amp;lt;math&amp;gt; t_2 = a_1^2 - 2a_2 &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Laguerre showed that the roots of this polynomial were bounded by&lt;br /&gt;
&lt;br /&gt;
: &amp;lt;math&amp;gt; -a_1 / n \pm b \sqrt{n - 1} &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where&lt;br /&gt;
&lt;br /&gt;
: &amp;lt;math&amp;gt; b = \frac{\sqrt{nt_2 - t_1^2}}{n} = \frac{\sqrt{na_1^2 - a_1^2 - 2na_2}}{n} &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Inspection shows that &amp;lt;math&amp;gt;-\tfrac{a_1}{n}&amp;lt;/math&amp;gt; is the [[mean]] of the roots and that &amp;#039;&amp;#039;b&amp;#039;&amp;#039; is the standard deviation of the roots.&lt;br /&gt;
&lt;br /&gt;
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.&lt;br /&gt;
&lt;br /&gt;
When the coefficients &amp;lt;math&amp;gt; a_1 &amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt; a_2 &amp;lt;/math&amp;gt; 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&amp;#039; rule of signs]]) unless the constant term is also zero.&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
{{reflist}}&lt;br /&gt;
&lt;br /&gt;
[[Category:Statistical inequalities]]&lt;/div&gt;</summary>
		<author><name>imported&gt;ThaHistorico</name></author>
	</entry>
</feed>