Rearrangement Inequality

Let
x_1 \leq \cdots \leq x_n\quad \mbox{and}\quad y_1 \leq \cdots \leq y_n
be real numbers and
x_{\sigma (1)}, \dots ,x_{\sigma (n)}
be any permutation of x_1, \dots , x_n. Then the rearrangement inequality states that
x_1y_1 + \cdots + x_ny_n \geq x_{\sigma (1)}y_1 + \cdots + x_{\sigma (n)}y_n \geq x_ny_1 + \cdots + x_1y_n.
The rearrangement inequality can be proved by induction. Many famous inequalities can be proved by the rearrangement inequality, such as the arithmetic mean - geometric mean inequality, the Cauchy-Schwartz inequality, and Chebyshev's sum inequality.

 

<< PreviousWord BrowserNext >>
barbu stirbey
suranet
samuel butler
samuel butler (1835 1902)
national fantasy fan federation
station point
sanxingdui
henry james byron
edward caird
taimen
sneaker (comic)
lambda rail network
souvenir
john caird
edmund calamy
gravity anomaly
matthew macfadyen
nerd boy
net.work.virginia
john francis campbell
great sioux nation
super magnetic neo
percy b. molesworth
peter firth
mid atlantic crossroads
princess ileana of romania
angola at the 2004 summer olympics
hulme grammar school
stun
liberalism and radicalism in ecuador
ilia (star trek)
nila hkedal
2004 republican national convention protest activity
western maryland
antigua and barbuda at the 2004 summer olympics
galatasaray lisesi
susan saint james
paolo cassius
mabon
bunty
tanstagi
the corries
leo yankevich
ethiopia at the 2004 summer olympics