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
4
votes
1 answer

How to prove the following inequality?

Show that there exist constant $C= C(n,p)$ depending only on $n$ dimension and $p \in \mathbb{N}$ such that \begin{equation} C|a-b|^{p} \le \langle |a|^{p-2} a - |b|^{p-2}b, a-b \rangle \end{equation} for any $a,b \in \mathbb{R^{n}}$. Thank you.
user29999
  • 5,211
4
votes
2 answers

Prove that $e^\frac{x+y}{2} < \frac{1}{2}(e^x+e^y)$ for $x\neq y$

Should I use the taylor series expansion of the exponential function?
4
votes
3 answers

Sum of $(a+\frac{1}{a})^2$ and $(b+\frac{1}{b})^2$

Prove that: $$ \left(a+\frac{1}{a}\right)^2+\left(b+\frac{1}{b}\right)^2\ge\frac{25}{2} $$ if $a,b$ are positive real numbers such that $a+b=1$. I have tried expanding the squares and rewriting them such that $a+b$ is a term/part of a term but what…
Gayatri
  • 875
4
votes
2 answers

How to prove this $\sqrt{x^2+3}+\sqrt{y^2+3}+\sqrt{xy+3}\ge 6$

Let $x,y>0$, and $x+y=2$, show that $$\sqrt{x^2+3}+\sqrt{y^2+3}+\sqrt{xy+3}\ge 6$$ I tried using Minkowski…
manana
  • 41
4
votes
2 answers

Find the maximum of $\frac{(a+b+c)^3-27abc}{a^3+b^3+c^3-3abc}$ for nonnegative $a$, $b$, $c$.

Show that the maximum of $$\frac{(a+b+c)^3-27abc}{a^3+b^3+c^3-3abc}$$ is $4$ for nonnegative $a$, $b$, $c$. An elegant elementary solution is preferred. Generally, is there an easy way to show that $$ \frac{ \left( a_1 + \dots + a_n \right)^n -…
hbp
  • 157
4
votes
2 answers

Can we extend the idea that if $|a+b|=|a|+|b|$, then $ab \geq 0$?

It is known that if $$|a+b|=|a|+|b|$$ then we can find the solution by simply observing that we can instead solve the inequality $$a b \geq 0$$ My question is, if $|a+b+c|=|a|+|b|+|c|$, then what would be the '3 degree version' of the above?
Trogdor
  • 10,331
4
votes
1 answer

Upper bound for $n^{th}$ power of a sum

Possible Duplicate: Showing the inequality $|\alpha + \beta|^p \leq 2^{p-1}(|\alpha|^p + |\beta|^p)$ We can use Young's inequality to show that $(a+b)^2 \leq 2a^2 + 2b^2$. Does a similar result hold for the n-th power as well? That is, do we have…
mkolar
  • 897
4
votes
0 answers

An improvement of USAMO 2001

Let $x,y,z \geqslant 0$ such that $x^2+y^2+z^2+xyz=4$, prove that $$\tag{1} xy+yz+zx +\frac{(x-y)^2(y-z)^2(z-x)^2}{8} \leqslant 2 + \frac{x+y+z-1}{2}xyz $$ Here is a brief history about this inequality The USAMO 2001 stated that For all $x,y,z…
HN_NH
  • 4,361
4
votes
2 answers

$2\sqrt n-2<1+\frac{1}{\sqrt2}+\frac{1}{\sqrt3}+....+\frac{1}{\sqrt n}<2\sqrt n-1$

If $n\in N$,then prove that $2\sqrt n-2<1+\frac{1}{\sqrt2}+\frac{1}{\sqrt3}+....+\frac{1}{\sqrt n}<2\sqrt n-1$ How should i prove this inequality,neither AM-HM nor any other inequality theorem is working here.
diya
  • 3,589
4
votes
2 answers

Inequality problem: Application of Cauchy-Schwarz inequality

Let $a,b,c \in (1, \infty)$ such that $ \frac{1}{a} + \frac{1}{b} + \frac{1}{c}=2$. Prove that: $$ \sqrt {a-1} + \sqrt {b-1} + \sqrt {c-1} \leq \sqrt {a+b+c}. $$ This is supposed to be solved using the Cauchy inequality; that is, the scalar product…
gonthalo
  • 751
4
votes
1 answer

Prove that $\max a_i \le 4 \min a_i$

Let $a_1,...,a_n$ be given positive reals, such that: $$\sum a_i \times \sum \frac1{a_i} \le (n + \frac12)^2$$ Prove that $\max \{a_i\} \le 4 \min \{a_i\}$ I don't know exactly how to approach this. I wrote it…
user230734
4
votes
3 answers

This inequality $a+b^2+c^3\ge \frac{1}{a}+\frac{1}{b^2}+\frac{1}{c^3}$

Let $0\le a\le b\le c,abc=1$, then show that $$a+b^2+c^3\ge \dfrac{1}{a}+\dfrac{1}{b^2}+\dfrac{1}{c^3}$$ Things I have tried so far: $$\dfrac{1}{a}+\dfrac{1}{b^2}+\dfrac{1}{c^3}=\dfrac{b^2c^3+ac^3+ab^2}{bc^2}$$ Since $abc=1$, it suffices to…
user246384
4
votes
2 answers

Prove this inequality $\frac{1}{1+a}+\frac{2}{1+a+b}<\sqrt{\frac{1}{a}+\frac{1}{b}}$

Let $a,b>0$ show that $$\dfrac{1}{1+a}+\dfrac{2}{1+a+b}<\sqrt{\dfrac{1}{a}+\dfrac{1}{b}}$$ It suffices to show that $$\dfrac{(3a+b+3)^2}{((1+a)(1+a+b))^2}<\dfrac{a+b}{ab}$$ or $$(a+b)[(1+a)(1+a+b)]^2>ab(3a+b+3)^2$$ this idea can't solve it to…
user246384
4
votes
1 answer

How to prove the following inequality $|\prod_{i=1}^{i=n}a_i-\prod_{i=1}^{i=n}b_i| < n\delta$?

The constraints are $0 \le a_1,a_2....a_n,b_1,b_2....b_n \le 1$. $|a_i-b_i|< \delta$ for all $1 \le i \le n $ How do I go about proving the following $$|\prod_{i=1}^n a_i-\prod_{i=1}^n b_i| < n\delta$$ I tried reducing it to two terms where one…
4
votes
2 answers

Given $a_1 \ge \cdots \ge a_n$ and $b_1 \ge \cdots \ge b_n$, then show $\sum a_ib_{\pi(i)}$ is maximum when $\pi=id$.

Suppose $a_1 \ge \cdots \ge a_n$ and $b_1 \ge \cdots \ge b_n$ are two sequences of positive real numbers. Then show $\sum a_ib_{\pi(i)}$ is maximum when $\pi=id$. Here, $\pi \in S_n$. I understand that there are many sums of products, one due…
saubhik
  • 793