Questions tagged [inequality]

Questions on proving, manipulating and applying inequalities. Do not use this tag just because an inequality appears somewhere in your question.

An inequality is a mathematical relation between two quantities that are not necessarily equal, but bigger or smaller.

To prove inequalities, a number of proven inequalities can be used, including:

  • The AM-GM inequality

    Let $x_i>0$, $\alpha_i>0$ such that $\alpha_1+\alpha_2+...+\alpha_n=1$. Prove that $$\alpha_1x_1+\alpha_2x_2+...+\alpha_nx_n\geq x_1^{\alpha_1}x_2^{\alpha_2}...x_n^{\alpha_n}$$

For $\alpha_1=\alpha_2=...=\alpha_n=\frac{1}{n}$ we obtain the well-known $$\frac{x_1+x_2+\cdots+x_n}{n} \ge \sqrt[n]{x_1x_2\cdots x_n}$$

  • The Power Mean inequality (P-M).

    Let $a_1, a_2,\cdots, a_n$ be positive numbers and $p>q$. Then $$\left(\frac{a_1^p+a_2^p+\cdots+a_n^p}{n}\right)^{\frac{1}{p}} \geq \left(\frac{a_1^q+a_2^q+\cdots+a_n^q}{n}\right)^{\frac{1}{q}}$$

  • The Rearrangement inequality (R).

    Let $a_1\le\dots\le a_n$ and $b_1\le\dots\le b_n$. For all permutations $\sigma\in S_n$, $$\sum_{i=1}^na_ib_{n-i+1}\le\sum_{i=1}^na_ib_{\sigma(i)}\leq\sum_{i=1}^na_ib_i.$$

The rearrangement generalizes similar for more than two sequences of numbers.

  • The Cauchy-Schwarz inequality (C-S).

    If $a_1, a_2, \cdots, a_n$ and $b_1, b_2,\cdots, b_n$ are two sequences of real numbers, then $$\sum^{n}_{i=1} a_i^2 \sum^{n}_{i=1} b_i^2\geq\left(\sum^{n}_{i=1} a_ib_i \right)^2$$

  • The H$\ddot o$lder inequality (H).

    Let $a_1$, $a_2$,..., $a_n$, $b_1$, $b_2$,..., $b_n$, $\alpha$ and $\beta$ be positive numbers. Then $$\left(\sum_{i =1}^n a_i\right )^\alpha \left(\sum_{i =1}^n b_i \right )^\beta\geq \left(\sum_{i =1}^n (a_ib_i)^\frac{1}{\alpha+\beta}\right )^{\alpha+\beta} $$

  • The Schur inequalities (S):

    Let $x$, $y$ and $z$ be positive numbers and $t$ is a real number. Prove that:$$x^t(x-y)(x-z)+y^t(y-z)(y-x)+z^t (z-x)(z-y)\ge 0$$

  • Muirhead inequalities

    A sequence $a_1 \geq a_2 \geq \dots \geq a_n$ majorizes a sequence $b_1 \geq b_2 \geq \dots \geq b_n$ if $$\sum_{i=1}^k a_i \geq\sum_{i=1}^k a_i $$ for all $1\leq k < n$ and $$\sum_{i=1}^n a_i =\sum_{i=1}^n a_i $$ If sequence $(a_i)$ majorizes $(b_i)$ (notated as $a_i \succ b_i$), then $$\sum_{\text{sym}}x_1^{a_1}x_2^{a_2}\dots x_n^{a_n}\geq \sum_{\text{sym}}x_1^{b_1}x_2^{b_2}\dots x_n^{b_n}$$

30160 questions
22
votes
7 answers

Prove $(-a+b+c)(a-b+c)(a+b-c) \leq abc$, where $a, b$ and $c$ are positive real numbers

I have tried the arithmetic-geometric inequality on $(-a+b+c)(a-b+c)(a+b-c)$ which gives $$(-a+b+c)(a-b+c)(a+b-c) \leq \left(\frac{a+b+c}{3}\right)^3$$ and on $abc$ which gives $$abc \leq \left(\frac{a+b+c}{3}\right)^3.$$ Since both inequalities…
user35801
  • 221
22
votes
2 answers

An "AGM-GAM" inequality

For positive real numbers $x_1,x_2,\ldots,x_n$ and any $1\leq r\leq n$ let $A_r$ and $G_r$ be , respectively, the arithmetic mean and geometric mean of $x_1,x_2,\ldots,x_r$. Is it true that the arithmetic mean of $G_1,G_2,\ldots,G_n$ is never…
tipshoni
  • 794
  • 5
  • 12
21
votes
3 answers

Prove $a^{ab}b+b^{bc}c+c^{ca}a \geqslant \sqrt[6]{5}$

$a,b,c >0$, and $a+b+c=3$, prove $$ a^{ab}b+b^{bc}c+c^{ca}a \geqslant \sqrt[6]{5}$$ I try to substitute $c=3-a-b$ to reduce the number of variables, but cannot further proceed to solve the problem. I made an Excel spreadsheet and test 100 pairs of…
HN_NH
  • 4,361
20
votes
4 answers

How to prove this inequality $\frac{a_{1}a_{2}+a_{2}a_{3}+\cdots+a_{n-1}a_{n}}{a^2_{1}+a^2_{2}+\cdots+a^2_{n}}\le\cos{\frac{\pi}{n+1}}$

Let $a_{1},a_{2},\cdots,a_{n},n\ge 2$ be real numbers,show that $$\dfrac{a_{1}a_{2}+a_{2}a_{3}+\cdots+a_{n-1}a_{n}}{a^2_{1}+a^2_{2}+\cdots+a^2_{n}}\le\cos{\dfrac{\pi}{n+1}}$$ I think this result is interesting. When $n=2$,…
math110
  • 93,304
20
votes
1 answer

How prove this inequality $\tan{(\sin{x})}>\sin{(\tan{x})}$

How prove this inequality $$\tan{(\sin{x})}>\sin{(\tan{x})},0
math110
  • 93,304
20
votes
2 answers

How prove this inequality $2a^ab^bc^cd^d\ge ac+bd$

Let $a,b,c,d$ be positive numbers such that $a+b+c+d=2$. Show that $$2a^ab^bc^cd^d\ge ac+bd$$ My try: I think maybe I can use this inequality $$(1+x)^n\ge 1+nx \hspace{12pt} (n>1)$$ then I can't get it to work. I think this inequality may be solved…
user94270
19
votes
2 answers

How to prove $\frac{1}{4}(\frac{a^2}{b}+\frac{b^2}{c}+\frac{c^2}{d}+\frac{d^2}{a})\ge \sqrt[4]{\frac{a^4+b^4+c^4+d^4}{4}}$

Let $a,b,c,d>0$, show that $$\dfrac{1}{4}\left(\dfrac{a^2}{b}+\dfrac{b^2}{c}+\dfrac{c^2}{d}+\dfrac{d^2}{a}\right)\ge \sqrt[4]{\dfrac{a^4+b^4+c^4+d^4}{4}}$$ I know this is interesting inequality,and Mathlinks can't solution,Thank you for you…
math110
  • 93,304
19
votes
3 answers

Stuck trying to prove an inequality

I have been trying to prove (the left half of) the following inequality: $$ \underbrace{\sum_i \sum_j |x_i| \le \sum_i \sum_j |x_i + x_j|}_\textrm{?} \le 2 \sum_i \sum_j |x_i|$$ (All $x_i$s are arbitrary reals and sums are over $1, 2, \dots, n$) The…
19
votes
2 answers

Show that $\frac 1 {\sqrt{x+y}}+\frac 1 {\sqrt{y+z}}+\frac 1 {\sqrt{z+x}}\geq2+\frac 1 {\sqrt2}$.

Given $x,y,z\geq0$ and $xy+yz+zx=1$. Show that $\displaystyle\frac 1 {\sqrt{x+y}}+\frac 1 {\sqrt{y+z}}+\frac 1 {\sqrt{z+x}}\geq2+\frac 1 {\sqrt2}$. I've tried many things but all failed. The only thing I know is that the equality holds when…
JSCB
  • 13,456
  • 15
  • 59
  • 123
19
votes
6 answers

Inequality. $\frac{1}{16}(a+b+c+d)^3 \geq abc+bcd+cda+dab$

I want to prove the following inequality : $$\frac{1}{16}(a+b+c+d)^3 \geq abc+bcd+cda+dab, $$ $a,b,c,d \in \mathbb{R}_{+} .$ In my book, at the answers chapter the author uses AM $\geq$ GM, but I haven't any idea how I can use that. Thanks…
Iuli
  • 6,790
18
votes
5 answers

An Inequality problem relating $\prod\limits^n(1+a_i^2)$ and $\sum\limits^n a_i$

Let $(a_1,\space a_2,\space \cdots, \space a_n) \in \mathbb R^n_+$ such that $\displaystyle \prod^n_{i=1 }a_i = 1$. Prove that $$\displaystyle \prod^n_{i=1} (1+a_i^2) \le \cfrac {2^n}{n^{2n-2}}\left (\sum^n_{i=1} a_i\right)^{2n-2}$$
user31280
18
votes
4 answers

Why is absolute difference of max of functions less than max of absolute difference of functions

Title is wordy, but the question (I believe) is simple. Why does the following inequality hold? It is used as a step in the solution key for a homework assignment of mine, but doesn't explain why. Is there a name for this property?: $|\max f(x) -…
Canovice
  • 293
17
votes
2 answers

How to prove this inequality $\left|x\sin{\frac{1}{x}}-y\sin{\frac{1}{y}}\right|<2\sqrt{|x-y|}$?

For any real numbers $x,y\neq 0$,show that $$\left|x\sin{\dfrac{1}{x}}-y\sin{\dfrac{1}{y}}\right|<2\sqrt{|x-y|}$$ I found this problem when I dealt with this problem. But I can't prove it. Maybe the constant $2$ on the right hand side can be…
math110
  • 93,304
17
votes
2 answers

Various proofs of Hardy's inequality

For any $p > 1$ and for any sequence $\{a_j\}_{j=1}^\infty$ of nonnegative numbers, a classical inequality of Hardy states that $$ \sum\limits_{k=1}^n\left(\frac{\sum_{i=1}^ka_i}{k}\right)^p\le \left(\frac{p}{p-1}\right)^p \sum\limits_{k=1}^n…
Sunni
  • 4,536
17
votes
4 answers

Prove $\sum_{i=1}^{n}\frac{a_{i}}{a_{i+1}}\ge\sum_{i=1}^{n}\frac{1-a_{i+1}}{1-a_{i}}$ if $a_{i}>0$ and $a_{1}+a_{2}+\cdots+a_{n}=1$

Let $a_{i}>0,i=1,2,\cdots,n$, and $a_{1}+a_{2}+\cdots+a_{n}=1$. How can we prove that $$\displaystyle\sum_{i=1}^{n}\dfrac{a_{i}}{a_{i+1}}\ge\displaystyle\sum_{i=1}^{n}\dfrac{1-a_{i+1}}{1-a_{i}}$$ where $a_{n+1}=a_{1}$? I think this can be done using…
math110
  • 93,304