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

Proof of an inequality that seems intuitive

I'm looking for a short proof of the following statement: Let $x_1 \ge \cdots \ge x_n \ge 0$ and let $0 \le a_1,\dots,a_n \le 1$. If $\sum_{k=1}^n a_k \le m$ for some integer $m$, then $$\sum_{k=1}^n a_k x_k \le \sum_{k=1}^m x_k.$$ My intuition…
wj32
  • 4,236
10
votes
3 answers

Need help with an inequality

$1<\frac{1}{1001}+\frac{1}{1002}+...+\frac{1}{3001}<1\frac{1}{3}$ The first part is trivial with $AM-HM $ inequality. Having problem with the second part.
Soham
  • 9,990
10
votes
3 answers

Prove: $\sqrt[3]{\frac{a^{2}+bc}{b^2+c^2}}+\sqrt[3]{\frac{b^{2}+ac}{a^2+c^2}}+\sqrt[3]{\frac{c^{2}+ab}{a^2+b^2}}\geq 9\frac{\sqrt[3]{abc}}{a+b+c}$

Let $a,b,c\in \mathbb{R^+}$. Prove: $\sqrt[3]{\frac{a^{2}+bc}{b^2+c^2}}+\sqrt[3]{\frac{b^{2}+ac}{a^2+c^2}}+\sqrt[3]{\frac{c^{2}+ab}{a^2+b^2}}\geq 9\frac{\sqrt[3]{abc}}{a+b+c}$ PS: I don't have ay ideas about this problem :( Thanks
10
votes
3 answers

Proving of $\cos (\frac{2}{3})>\frac{\pi }{4}$

How can I prove that $$\cos \left(\frac{2}{3}\right)>\frac{\pi }{4}$$
user189855
10
votes
0 answers

How prove this integral inequality $\int_{0}^{1}(f(x)+g(x))dx\ge\int_{0}^{1}f(g(x))dx$?

let two function $f(x),g(x):[0,1]\to [0,1]$ are Continuous function,and $f(x)$ strictly monotone increasing, show that $$\int_{0}^{1}(f(x)+g(x))dx\ge\int_{0}^{1}f(g(x))dx$$ I am not comfortable with compositions and don't have any idea on how to…
math110
  • 93,304
9
votes
1 answer

How prove this $(x_{1}+x_{2})(x_{2}+x_{3})\cdot (x_{n}+x_{1})\ge 2^n-n^2+n\sum_{i=1}^{n}x_{i}$

Let $x_{i}>0,i=1,2,\ldots,n$ and such $\prod_{i=1}^{n}x_{i}=x_{1}x_{2}\cdots x_{n}=1$. Show that this inequality $$(x_{1}+x_{2})(x_{2}+x_{3})\cdots (x_{n}+x_{1})\ge 2^n-n^2+n\sum_{i=1}^{n}x_{i}$$ and this inequality …
math110
  • 93,304
9
votes
1 answer

How find the minimum of the value $\frac{\sum_{i=1}^{n}a_{i}b_{i}}{\sum_{i=1}^{n}a^2_{i}}$

Let $a_{i},b_{i}\in [p,q](p,q>0),i=1,2,3,...,n$,($n$ is given number,and $p,q$ is given too) and such that $$\sum_{i=1}^{n}a^2_{i}=\sum_{i=1}^{n}b^2_{i}$$ Find the minimum of the …
math110
  • 93,304
9
votes
1 answer

How prove this inequality $(\sum_{k=1}^{3n}a_{k})^3\ge 27n^2\sum_{k=1}^{n}a_{k}a_{n+k}a_{2n+k}$

let $$0\le a_{1}\le a_{2}\le \cdots\le a_{3n}$$ show that $$\left(a_{1}+a_{2}+a_{3}+\cdots+a_{3n-1}+a_{3n}\right)^3\ge 27n^2\sum_{k=1}^{n}a_{k}a_{n+k}a_{2n+k}$$ we know when $n=1$,this is $$(a+b+c)^3\ge 27abc$$ this is AM-GM…
math110
  • 93,304
9
votes
1 answer

Proving an estimate of Weyl

I'm working through some problems of Fourier Analysis by Stein, Shakarchi and I got stuck trying to solve the following problem: Let $S_N = \sum_{n=1}^N e^{2\pi i f(n)}$. Show that for $H\le N$, one has $$|S_N|^2 \le c \frac NH \sum_{h=0}^H\, …
Sam
  • 15,908
9
votes
3 answers

Proving $1-\exp(-4x^2/ \pi) \ge \text{erf}(x)^2$

This is a follow-up to this question. I came across a tighter potential bound and checked it numerically for $0\le x\le 5$. I think it holds for all positive $x$, can anyone see a proof? $$1-\exp(-4x^2/ \pi) \ge \text{erf}(x)^2$$ Note: using…
9
votes
3 answers

How prove this $x^2+y^2+z^2+3\ge 2(xy+yz+xz)$

let $x,y,z$ be real numbers, and such $$x+y+z+xyz=4$$ show that $$x^2+y^2+z^2+3\ge 2(xy+yz+xz)$$ My try: let $$x+y+z=p,xy+yz+xz=q,xyz=r$$ then $$p+r=4$$ then $$\Longleftrightarrow p^2+3\ge 4q$$ But I can't.Thank you
math110
  • 93,304
9
votes
4 answers

If $x,y,z\in\mathbb R\setminus \{1\}$ and $xyz=1$, prove that $\frac{x^2}{(x-1)^2}+\frac{y^2}{(y-1)^2}+\frac{z^2}{(z-1)^2}\ge 1$.

If $x,y,z\in\mathbb R\setminus \{1\}$ and $xyz=1$, prove that $$\frac{x^2}{(x-1)^2}+\frac{y^2}{(y-1)^2}+\frac{z^2}{(z-1)^2}\ge 1$$ Without using calculus. There are a few ways I've tried solving this: $1)$ We could try using the Cauchy-Schwarz…
user26486
  • 11,331
9
votes
3 answers

Prove lower bound $\sum\limits_{k=1}^{n}\frac{1}{\sqrt{n^2+k^2}}\ge\left(1-\frac{1}{n}\right)\ln{(1+\sqrt{2})}+\frac{\sqrt{2}}{2n}$

Consider $$S_n=\sum_{k=1}^{n}\frac{1}{\sqrt{n^2+k^2}}$$ and show that, for every positive integer $n$, $$S_n\ge\left(1-\frac{1}{n}\right)\ln{(1+\sqrt{2})}+\dfrac{\sqrt{2}}{2n}$$ I can prove a related upper…
math110
  • 93,304
9
votes
3 answers

How prove this $ \sqrt{\frac{a}{a+3b+5bc}}+\sqrt{\frac{b}{b+3c+5ca}}+\sqrt{\frac{c}{c+3a+5ab}}\geq 1.$

Let $a,b,c$ be nonnegative real numbers such that $a+b+c=3$, Prove that $$ \sqrt{\frac{a}{a+3b+5bc}}+\sqrt{\frac{b}{b+3c+5ca}}+\sqrt{\frac{c}{c+3a+5ab}}\geq 1.$$ This problem is from …
math110
  • 93,304
9
votes
5 answers

How to prove: $a+b+c\le a^2+b^2+c^2$, if $abc=1$?

Let $a,b,c \in \mathbb{R}$, and $abc=1$. What is the simple(st) way to prove inequality $$ a+b+c \le a^2+b^2+c^2. $$ (Of course, it can be generalized to $n$ variables).
Oleg567
  • 17,295