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

Showing inequality in $L^p$ and $L^2$

I'd like to show that \begin{align} ||f||_{L^p(0,1)} \leq \lambda_p ||f'||_{L^2(0,1)} \end{align} for all $f \in H^{1}_{0}(0,1)$. I thought about doing something like \begin{align} \Big(\int_0^1|f(t)|^pdt \Big)^{1/p} = \Big( \int_0^1 |\int_0^t…
2
votes
1 answer

Given such $n$th degree polynomial $P(x)$ and positive numbers $a, b\in\mathbb{R}$, does $\sqrt[n]{P(a+b)} \leq \sqrt[n]{P(a)} + \sqrt[n]{P(b)}$ hold?

Given any $n$th degree polynomial $P(x)$ with positive coefficients and positive numbers $a, b\in\mathbb{R}$, does $\sqrt[n]{P(a+b)} \leq \sqrt[n]{P(a)} + \sqrt[n]{P(b)}$ hold? I've worked it out for $n=2$: $$P(x) = Ax^2 + Bx + C$$ $$\sqrt{Aa^2 + Ba…
pjq42
  • 707
2
votes
0 answers

Show the "trivial bound" $\left|\frac{\log{2}}{\log{3}}-\frac{p}{q}\right|\ge c \frac{1}{2^q}$ holds for $c > 0$ and integers $p, q$ with $q$ positive

Given the identities: $3^p - 2^q = 3^p (1 - 3^{q\left(\frac{\log{2}}{\log{3}} - \frac{p}{q}\right)})$ for all integers $p, q$ with $q$ positive. $\left|3^p - 2^q\right| \ge 1$ for all positive integers $p, q$. Show there exists a constant $c >…
2
votes
3 answers

How do we prove $x^6+3x^3+2x^2+x+1 \geq 0$

Question How do we prove $$x^6 + 3x^3+2x^2+x+1\geq0$$ My progress $$x^6+3x^3+2x^2+x+1=(x+1)^2(x^4-2x^3+3x^2-x+1)$$ I appreciate your interest
2
votes
1 answer

Demonstrate an inequality $|(x+y+z+a^2xyz)|\ /\ |1+a^2(xy+xz+yz)|<1/a$

For $a>0, x,y,z\in\mathbb{R}$ $$|x|
marinaaaa
  • 183
2
votes
1 answer

Does this hold for these absolute values

Suppose $\left|x_{1}\right|\ge\left|x_{2}\right|$, $\left|y_{1}\right|\ge\left|y_{2}\right|$ and $\left(x_{1}-y_{1}\right)\left(x_{2}-y_{2}\right)\left(x_{1}-y_{2}\right)\left(x_{2}-y_{1}\right)<0$, Can anyone show or is it true that…
rona
2
votes
1 answer

$S_p = \dfrac{1}{(y+z) x^p} + \dfrac{1}{(z+x) y^p} + \dfrac{1}{(x+y) z^p} \geq \dfrac{3}{2}$

Main Problem: Let $x,y,z$ be positive real numbers and $xyz = 1$. For any $p$ real number, let's define $$ S_p = \dfrac{1}{(y+z) x^p} + \dfrac{1}{(z+x) y^p} + \dfrac{1}{(x+y) z^p} $$ Prove (or disprove) that for all $p\geq 2$ values, $S_p\geq…
scarface
  • 1,933
2
votes
3 answers

A system of 2 inequalities with 2 variables

Solve for (x,y) satisfies $$ \left\{\begin{matrix} x-y \in \left [ -1,1 \right ] & \\ 3x-4y \in \left [ 2,3 \right ] \end{matrix}\right. $$ I have tried to solve this by multiplying the first inequality by 4 and subtracting the two inequalities…
nbdaaa
  • 51
  • 2
2
votes
2 answers

Prove that there is always an even number in the interval $[ \sqrt{9 + 8n} - 3, \sqrt{1 + 8n} - 1]$ for all positive integers n

I found this problem on a PDF that I could not find the solutions for. I initially tried thinking about the size of the interval, however it is always smaller than 2 and therefore does not guarantee an even number. I thought that maybe the left hand…
60q
  • 87
2
votes
2 answers

Prove or disprove $ab+bc+cd+da\leq1$ if $a+b+c+d=2$

Non-negative real numbers $a,b,c,d$ are such that $a+b+c+d=2$. Prove or disprove that $$ab+bc+cd+da\leq1$$ I see there are multiple equality cases, where $(a,b,c,d)$ is for example $(\frac{1}{2},\frac{1}{2},\frac{1}{2},\frac{1}{2})$,…
2
votes
1 answer

How to solve $2^k - (bk + a) \ge 0 $?

With given $a , b \in \mathbb{N} $, is there any way to find the smallest $ k \in \mathbb{N} $ that satisfies the following inequality (without trying for $k=1,2,...$): $$2^k - (bk + a) \ge 0 $$
vauge
  • 323
2
votes
0 answers

Inequality with smoothing technique:$\sum_{i=1}^{n}\frac{x_{i}}{\sqrt{1-x_{i}}}\geq \sqrt{\frac{n}{n-1}}$ subject to $\sum_{i=1}^{n} x_{i}=1 $

first of all I would like to point out that i am able to solve this inequality using standard techniques such as Rearrangement inequality , C-S , Jensen's.... However I'm in the middle of learning a new technique in inequality solving , which is the…
Adam Boussif
  • 343
  • 1
  • 7
2
votes
0 answers

Prove or Disprove : $a^{\frac{4}{a}}+b^{\frac{4}{b}}+c^{\frac{4}{c}}+d^{\frac{4}{d}}\geq 4$ for $a,b,c,d>0$ and $a+b+c+d=4$

I didn't find it on Aops so let me propose it. It's the case $n=4$ of Prove that $a^{4/a} + b^{4/b} + c^{4/c} \ge 3$ Problem: Let $a,b,c,d>0$ such that $a+b+c+d=4$ then it seems we…
2
votes
0 answers

How to solve quadratic inequality $(a \pm b)^2 \le (c \pm x)^2$?

How can one solve for $x$ the inequality $(a \pm b)^2 \le (c \pm x)^2$? If squares were not there, one could easily break $(a + b) \le (c + x)$ and $(a - b) \le (c - x)$, and then solve as usual. But the square seem to make it complicated.
User101
  • 505