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

How to prove that a given set of inequalities is true?

Consider the following inequality: \begin{gather} c\cdot(n+1)^n<(c-y)\cdot(n+1+y)^{n+y} \end{gather} where $n,c,y$ are all integers satisfying $n\geqslant0$, $c\geqslant3$, $y\geqslant1$ and $c-y\geqslant2$. I have spent the last weeks trying to see…
EoDmnFOr3q
  • 1,050
4
votes
2 answers

Proving $1+\frac{3}{a+b+c}\geq \frac{6}{ab+bc+ca}$, given $abc=1$

Let a, b, c be positive numbers such that $abc=1$. Prove that $1+\frac{3}{a+b+c}\geq \frac{6}{ab+bc+ca}$ The usual methods do not seem to work, including a substitution $a=\frac{x}{y}, b=\frac{y}{z}, c=\frac{z}{x}$ and trying to apply Muirhead's…
4
votes
2 answers

How to prove $\sum \sqrt{\frac{a^2+2bc}{b+c}} \geq \frac{3\sqrt{2}}{2}\sqrt{a+b+c}$ for all $a,b,c \ge 0$?

Let $a,b,c$ be non-negative real numbers such that $ab+bc+ca>0$, prove that $$\sqrt{\frac{a^2+2bc}{b+c}}+\sqrt{\frac{b^2+2ca}{c+a}}+\sqrt{\frac{c^2+2ab}{a+b}} \ge \frac{3\sqrt{2}}{2}\sqrt{a+b+c}$$ I found it here and also here. But there are no…
4
votes
2 answers

Monotonicity of $\ell_{p}$ norm and Holder's inequality

For any vector $x \in \mathbf{R}^{n}$, and any natural numbers $p \geq q \geq 1$, we have that $\lVert x \rVert_{p} \leq \lVert x \rVert_{q}$. Some proofs of this fact are given here and here. However, I am interested in proving this result using…
Stirling
  • 499
4
votes
1 answer

Proving $\frac12(u-v)^2\left[\log(1-\frac{2uv}{u^2+v^2})\right]^2+\frac12(u+v)^2\left[\log(1+\frac{2uv}{u^2+v^2})\right]^2\leq4v^2$

I am trying to prove the following log inequality: $$\frac{1}{2}(u-v)^2 \left[\log\left(1-\frac{2uv}{u^2+v^2}\right)\right]^2+\frac{1}{2}(u+v)^2 \left[\log\left(1+\frac{2uv}{u^2+v^2}\right)\right]^2\leq 4v^2$$ Here $u,v$ are variables. Things I have…
matilda
  • 169
4
votes
2 answers

Plus sign after a number means?

This maybe a stupid question but if I suffix a plus sign (+) after a number, it means at least?I mean, 5000+ means atleast 5000 but it doesn't mean more than 5000, right? Because to indicate a possibility of more than you use the more than sign…
Mark
  • 43
4
votes
1 answer

Prove that:$\frac{1}{a^n}+\frac{1}{b^n}+\frac{1}{c^n}\geqslant a^n+b^n+c^n$

Find $n\in\mathbb{N}^+$ For all Positive real numbers $a,b,c$ sastifying $a+b+c=3$ $\frac{1}{a^n}+\frac{1}{b^n}+\frac{1}{c^n}\geqslant a^n+b^n+c^n$
Steven Sun
  • 1,190
4
votes
2 answers

How to prove the following inequality in “Hardy-Littlewood-Polya inequality” book

Here, however, we can go a little further, since $$ \frac{1}{m+n-1-\alpha} + \frac{1}{m+n-1+\alpha} > \frac{2}{m+n-1} > $$ for $ 0 < \alpha < 1 $, and sob $$ \int^m_{m - 1}\int^n_{n - 1} \frac{dxdy}{x+y} > \frac{1}{m+n-1} $$ If now we replace $m$…
4
votes
4 answers

How to prove $(1+x)^7>7^{7/3} x^4, x>0$

In 2004, IIT JEE asked the proof of $$[(1+a)(1+b)(1+c)]^7> 7^7 a^4 b^4 c^4, a,b,c>0,$$ which can be done by noticing that $$F=(1+a)(1+b)(1+c)=1+a+b+c+ab+bc+ca+abc \implies F-1=a+b+c+ab+bc+ca+abc.$$ By AM-GM of 7 items, we prove that $$(F-1)^7 \ge…
Z Ahmed
  • 43,235
4
votes
2 answers

$a,b,c>0$, prove that $\frac{1}{\sqrt[3]{abc}}+5\ge 2\sqrt{3}\left(\frac{1}{\sqrt{a+2}}+\frac{1}{\sqrt{b+2}}+\frac{1}{\sqrt{c+2}}\right).$

Problem. Let $a,b,c>0$, prove that $$\frac{1}{\sqrt[3]{abc}}+5\ge 2\sqrt{3}\left(\frac{1}{\sqrt{a+2}}+\frac{1}{\sqrt{b+2}}+\frac{1}{\sqrt{c+2}}\right).$$ I have an ugly proof. After replacing $(a,b,c)\rightarrow (x^3,y^3,z^3)$, we $$…
TATA box
  • 1
  • 1
  • 5
  • 29
4
votes
1 answer

Prove that: $\sqrt{x^2+21}+\sqrt{2y^2+14}+\sqrt{z^2+91}\ge 19$

Let $x, y, z$ be real number such that $xy+yz+zx=11$. Prove the inequality: $$\sqrt{x^2+21}+\sqrt{2y^2+14}+\sqrt{z^2+91}\ge 19$$ I think that inequality can be solved by Minkowski. Equality holds if only is $(x;y;z)=(2;1;3)$...But I couldn't…
my_melody
  • 179
4
votes
3 answers

Can this question be done with AM-GM-HM inequality?

I was a solving a question on biquadratic equations and almost reached the answer and got a stuck on particular step which had to be solved, I think by AM-GM inequality. The constraints given are as follows: $2a+b=2$ $0\leqslant a,b\leqslant1$ I had…
4
votes
1 answer

Cramer-Rao inequality in model-based pricing

Given a constant vector $\mathbf{h}^* \in R^d$, define ${{\mathbf{h}}^{\delta}}={{\mathbf{h}}^{*}}+\mathbf{w}$, where $\mathbf{w}\sim N(\mathbf{0},(\delta /d)\cdot {{\mathbf{I}}_{d}}$. Define a function $g:{\mathcal{H}^{k}}\to \mathcal{H}$ such that…
kaixin yan
  • 41
  • 2
4
votes
2 answers

Bounding the sum of squares of some positive real numbers given their sum and an upper bound on them

Let's say we have $k$ real numbers $a_1, a_2, \dots, a_k$ and a positive real number $n$ that satisfy the following constraints: $\sum\limits_{i=1}^{k}a_i=n$, $\forall_{i\in\{1,2,\dots,k\}} \quad 0 \leq a_i \leq \sqrt{n}$. Can we prove that the…
4
votes
4 answers

How to show that $x^2 \ge \frac{x^2}{2!} + \frac{x^3}{3!} + \frac{x^4}{4!} + \dots$?

I wanted to show that for any $|x| \le 1$ we have: $e^x \le 1 + x + x^2$ So thought that using Taylor series would be a good starting point: $$e^x = 1 + x + \frac{x^2}{2!} + \frac{x^3}{3!} + \dots$$ So all I need to do is to show that $x^2 \ge…
Xaphanius
  • 155