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
2
votes
2 answers

Prove that $ 1 + \sum_{k=0}^{n-1}(\prod_{j=0}^{k-1}(1+w_j))w_k \leq \prod^{n-1}_{k=0}(1+w_k) $ where $(w_n)$ is a nonnegative sequence.

I can't proof this inequality. $$ 1 + \sum_{k=0}^{n-1}\biggl(\prod_{j=0}^{k-1}(1+w_j)\biggr)w_k \leq \prod^{n-1}_{k=0}(1+w_k) $$ where $(w_n)$ is a nonnegative sequence. Any idea? Any helpful trick? Thank you.
user43158
2
votes
1 answer

Proving inequality relation

I would like to get some help with the next problem: I'm trying to prove that $$\sum_{i = 1}^n (x_i - y_i)^2 \le \sum_{i = 1}^n (x_i - z_i)^2 + \sum_{i = 1}^n (z_i - y_i)^2\;\;\;\;\;(1).$$ I tried this: $$ \sum_{i = 1}^n (x_i - y_i)^2 =$$ $$=…
MathsLearner
  • 374
  • 1
  • 14
2
votes
3 answers

Prove that $\frac{a + b + c}{b - a} > 3$ with $ab < b^2 < 4ca$.

$a$, $b$, $c$ are three positives such that $ab < b^2 < 4ca$. Prove that $$\large \dfrac{a + b + c}{b - a} > 3.$$ I can't think of a way to get around this problem. Although I can see that based on the given condition, $ax^2 + bx + c = 0$ has no…
2
votes
2 answers

Prove/disprove that $\frac{x^2 - \sqrt{yz}}{yz - x} + \frac{y^2 - \sqrt{zx}}{zx - y} + \frac{z^2 - \sqrt{xy}}{xy - z} \ge 0$

Prove/disprove that $$ \frac{x^2 - \sqrt{yz}}{yz - x} + \frac{y^2 - \sqrt{zx}}{zx - y} + \frac{z^2 - \sqrt{xy}}{xy - z} \ge 0$$ with $x$, $y$ and $z$ are positives. I tried to use the Schur's inequality for this but it didn't help. If the…
2
votes
1 answer

How to prove the follwing inequality

If $$(a+b+c)abc=3$$ and $$a,b,c > 0$$ prove that $$(a+b)(b+c)(c+a)\geq 8$$ I can fairly easily prove that $(a+b)(b+c)(c+a)\geq8abc$, but then I get stuck.....since then I cannot move forward If I was to prove that $abc\geq1$ this would have…
Avi
  • 305
  • 1
  • 9
2
votes
3 answers

Q: Inequality $\frac{\sum_{k=1}^{M} A_{k}}{\sum_{k=1}^{M} B_{k}} \leq \frac{1}{M} \sum_{k=1}^{M} \frac{A_{k}}{B_{k}}$, where $A_{k}, B_{k} \geq 0$

I wanted to use the following inequality in my research, but I cannot prove whether it is correct or not. $\frac{\sum_{k=1}^{M} A_{k}}{\sum_{k=1}^{M} B_{k}} \leq \frac{1}{M} \sum_{k=1}^{M} \frac{A_{k}}{B_{k}}$, where $A_{k}, B_{k} \geq 0$ I tested…
2
votes
3 answers

How to prove that $\frac{m^{n+1}}{n+1}<1^n+2^n+\dots+m^n<(1+\frac{1}{m})^{n+1}\frac{m^{n+1}}{n+1} $?

The first part of the problem is: Prove that for all integers $n \ge 1$ and real numbers $t>1$, $$ (n+1)t^n(t-1)>t^{n+1}-1>(n+1)(t-1)$$ I have done the first part by induction on $n$ for any real $t>1$. However, I don't know how to do the second…
2
votes
2 answers

Prove that $n^n\left(\frac{n+1}{2}\right)^{2n}\geq (n!)^3$ for natural number $n$

Prove that $$n^n\left(\frac{n+1}{2}\right)^{2n}\geq (n!)^3$$ for a natural number $n$. what i try i have use AM GM inequality $$\frac{1^3+2^3+3^3+\cdots +n^3}{n}\geq ((n!))^{\frac{1}{3n}}$$ how i prove question inequality help me please
jacky
  • 5,194
2
votes
1 answer

Find min & max of $a(b-c)^n+b(c-a)^n+c(a-b)^n$ where $a + b+ c =1$

Find min & max of $a(b-c)^n+b(c-a)^n+c(a-b)^n$ where $a + b+ c =1;\ a,b,c\ge0; \ n \in N$ I am really stuck, I don't remember where I read this problem.
Xeing
  • 2,967
2
votes
4 answers

Absolute Value Inequality (another)

Solve the following inequality $$|a-2| > |a+4|$$ Here I separated it into cases as shown $a<-4$ $$-(a-2) > -(a+4) \implies 2-a>-a-4 \implies 0>-6$$ Always true, so we get $\mathbb{R} \cap (-\infty , -4) = (-\infty ,-4)$ $-4a+4…
Melz
  • 792
2
votes
2 answers

Show that if $x,y\in [0,1]$ and $|x-y|\leq a + b$ then there exists $z\in [0,1]$ such that $|x-z|\leq a$ and $|z-y|\leq b.$

Show that if $x,y\in [0,1], a,b\geq 0$ and $|x-y|\leq a + b$ then there exists $z\in [0,1]$ such that $|x-z|\leq a$ and $|z-y|\leq b.$ I tried to come up with a general $z$ that works but I am unable to do so. Any hints would be much appreciated.
Student
  • 9,196
  • 8
  • 35
  • 81
2
votes
1 answer

Proof about an inequality

We have $a,b,c>0$, prove that: $$\dfrac {1+\sqrt {3}} {3\sqrt {3}}\left( a^{2}+b^{2}+c^{2}\right) \left( \dfrac {1} {a}+\dfrac {1} {b}+\dfrac {1} {c}\right)\geq a+b+c+\sqrt {a^{2}+b^{2}+c^{2}}$$
string
  • 743
2
votes
1 answer

Inequality $n^{\sqrt{n+2}}>(n+1)^{\sqrt{n+1}}$ solution

How to find the solution of inequality $$n^{\sqrt{n+2}}>(n+1)^{\sqrt{n+1}}$$ for integers with basic analysis without derivatives. I don't have any idea how to start with it.
avan1235
  • 637
  • 4
  • 10
2
votes
6 answers

range of $3x^2-2xy$ subjected to $x^2+y^2=1$

If $x^2+y^2=1$. then the range of expression $3x^2-2xy$ without trigonometric substitution method what i have done try here is use arithmetic geometric inequality $\displaystyle x^2+y^2\geq 2xy$ $\displaystyle -2xy\geq -(x^2+y^2)$ $\displaystyle…
jacky
  • 5,194
2
votes
1 answer

maximum value of $x_{1}+x_{2}+x_{3}+\cdots+x_{10}$

Consider the following quantities $x_{1},x_{2},x_{3},\cdots \cdots ,x_{10}$ and $-1\leq x_{1},x_{2},x_{3},\cdots \cdots ,x_{10}\leq 1.$ and $x^3_{1}+x^3_{2}+\cdots+x^{3}_{10}=0.$ Then maximum of $x_{1}+x_{2}+x_{3}+\cdots\cdots+x_{10}$ Try : Let…
DXT
  • 11,241
1 2 3
99
100