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
3
votes
0 answers

Cauchy-Schwarz for more than two vectors?

Given three or more vectors in an inner product space, $x,y,z, \ldots$, I am wondering whether there exist generalisations to the Cauchy-Schwarz inequality: \begin{equation} \left| \langle x,y \rangle \right|^2 \leq \langle x,x \rangle \cdot…
AG1123
  • 354
3
votes
2 answers

Is this inequality true?

Clearly if $a,b >0$ and $p \in \mathbb{N}$ $$ a^{p} + b^{p} \le (a+b)^{p} $$ Is there a constante $C = C(p)$ such that if $a,b >0$ and $p \in \mathbb{N}$ then \begin{equation} a^{p} - b^{p} \le C(p)(a-b)^{p} ? \end{equation}
user29999
  • 5,211
3
votes
1 answer

Bounds for $S=\sqrt{x(y+1)}+\sqrt{y(z+1)}+\sqrt{z(x+1)}$

Let $x,y,z\in[0,2]$ and $x+y+z=3$. What are the maximum and minimum of $$S=\sqrt{x(y+1)}+\sqrt{y(z+1)}+\sqrt{z(x+1)}?$$ When $x=y=z=1$, we have $S=3\sqrt{2}$. For the upper bound, we can use the AM-GM inequality to get…
Alexi
  • 1,882
3
votes
1 answer

How to prove that inequality with $a\le a_{i}\le b$

Let $a_i \in [a,b]$, and $x_i,y_i\in R$, $$\sum_{i=1}^n x^2_i=\sum_{i=1}^n y^2_i=1$$ show that $$\left|\sum_{i=1}^n a_i x^2_i - \sum_{i=1}^n a_i y^2_i\right| \le (b-a) \sqrt{1-\left(\sum_{i=1}^n x_i y_i\right)^2}$$
user225250
3
votes
2 answers

Proof of a Basic Inequality

I am new to this stack exchange and if I have any wrongdoing please let me know. My question is how to prove the following inequality: $2^{n+1}>n^2$ assuming $n \in \mathbb{N}$ My thought is to prove this by mathematical induction. Let $P(n)$ be…
3
votes
2 answers

Prove that $(x_1y_1 + x_2y_2 - 1)^2 \ge (x_1^2 + x_2^2 - 1)(y_1^2 + y_2^2 - 1)$

$x_1, y_1, x_2, y_2 \in \mathbb R$ $x_1^2 + x_2^2 \le 1$ Prove that $(x_1y_1 + x_2y_2 - 1)^2 \ge (x_1^2 + x_2^2 - 1)(y_1^2 + y_2^2 - 1)$ I don't know how to start.
3
votes
1 answer

Show the inequality $\log(k)\log(n-k)<\log^2(n/2)$ holds

How to show $\log(k)\log(n-k)<\log^2(n/2)$, for all $n,k >3$, where log is the natural log. I plotted the function $\log(k)\log(n-k)-\log^2(n/2)$ and found the values are all negative, but I don't know how to show it.
Rann
  • 719
3
votes
2 answers

prove or disprove this inequality? $q(q-1)x^q-p(p-1)x^p\ge 0$

Let $x\in(0,1)$,and $-11,p,q\in\mathbb R$. Prove or disprove $$q(q-1)x^q-p(p-1)x^p\ge 0.$$
user253631
3
votes
0 answers

Inequality with $x^2+y^2+z^2+xyz=4$ condition

For $x,y,z \geqslant 0$ and $x^2+y^2+z^2+xyz=4$, prove that $$ 4(xy+yz+zx-xyz) \geqslant (x^2y+z)(y^2z+x)(z^2x+y)$$ Observations The condition $x^2+y^2+z^2+xyz=4$ is special. One can use the transformation $x=2cosA,y=2cosB,z=2cosC$ and the…
HN_NH
  • 4,361
3
votes
2 answers

if $x_{1},x_{2} $ is $nx-x^n=a$ two roots, show that $|x_{1}-x_{2}|<\dfrac{a}{1-n}+2$

Assmue that $n$ be postive integers,and $a$is real number,and the equation $$nx-x^n=a$$ has postive real roots $x_{1},x_{2}$,show that $$|x_{1}-x_{2}|<\dfrac{a}{1-n}+2$$ By condition, I showed…
user237685
3
votes
3 answers

Proving a progression inequality

Prove that $$1+ \frac{1}{2^3} + \cdot \cdot \cdot + \frac{1}{n^3} < \frac{5}{4} $$ I got no idea of how to approach this problem.
3
votes
2 answers

Is $|x+y|\geq\big||x|-|y|\big|$ true?

I was seeing a solved problem and someone said that $|x+y|\geq\big||x|-|y|\big|$ was part of the triangle inequality. But this isn't the way the triangle inequality is presented. Namely its presented as $$|x+y|\leq|x|+|y|$$ So I was left wondering.…
DLV
  • 1,740
  • 4
  • 17
  • 28
3
votes
0 answers

Inequality - Why do I not check for these other solutions?

Given, for example: $$ \Big(\frac{2x}{x-2}\Big)^{3x^2-x} \leq \Big(\frac{2x}{x-2}\Big)^{x^2+3x+6} $$ After checking when $x-2 \ne 0$ , the teacher taught us to check 3 cases: 1. $ \Big(\frac{2x}{x-2}\Big)> 1 $ , and then the inequality sign remains…
3
votes
2 answers

Given $a, b,c,d$ non-negative and $a+b+c+d=4$. Prove that $a^3b+b^3c+c^3d+d^3a+23abcd \le 27.$

This is a problem on Mathlinks.ro and it have had no solution. So I hope it would have a nice answer and as simply as possible. Given $a, b,c,d$ are non-negative numbers and $a+b+c+d=4$. Prove that $$a^3b+b^3c+c^3d+d^3a+23abcd \le 27.$$
mja
  • 1,389
3
votes
1 answer

Sharper than Mean Value Inequality

Prove that $$|x\ln x-y\ln y| \le |x-y|^{1-1/e}$$ for $0