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 the inequality $ \sqrt{a^2 + b^2} \geq \frac{|a-b|}{\sqrt{2}}$

Please help me to prove the inequality $$ \sqrt{a^2 + b^2} \geq \frac{|a-b|}{\sqrt{2}}. $$
2
votes
1 answer

How prove this inequality $\sum_{i=1}^{n}\frac{\sqrt{1}+\sqrt{2}+\cdots+\sqrt{i}}{i^2}\le\sqrt{2n-1}$

show that $$\sum_{i=1}^{n}\dfrac{\sqrt{1}+\sqrt{2}+\cdots+\sqrt{i}}{i^2}\le\sqrt{2n-1}$$ My try: $$x\in(n-1,n)\Longrightarrow…
math110
  • 93,304
2
votes
3 answers

How prove this two function which is bigger?

let function $$f_{n}(x)=\left(1+x+\dfrac{1}{2!}x^2+\cdots+\dfrac{1}{n!}x^n\right)\left(\dfrac{x^2}{x+2}-e^{-x}+1\right)e^{-x},x\ge 0,n\in N^{+}$$ if $\lambda_{1},\lambda_{2},\mu_{1},\mu_{2}$ is postive numbers,and…
math110
  • 93,304
2
votes
2 answers

Prove : $\frac{1}{a}+\frac{1}{b}-\frac{1}{c}< \frac{1}{abc}$

$a;b;c>0$ such that $a^2+b^2+c^2=\frac{5}{3}$. Prove : $\frac{1}{a}+\frac{1}{b}-\frac{1}{c}< \frac{1}{abc}$
2
votes
1 answer

Prove : $\dfrac{a}{ac+1}+ \dfrac{b}{ab+1}+ \dfrac{c}{bc+1} \le \frac 12 (a^2+b^2+c^2)$

$a;b;c\in \mathbb{R}^{+}$ such that $abc=1$ Prove : $\frac{a}{ac+1}+ \frac{b}{ab+1}+ \frac{c}{bc+1} \leq \frac{1}{2}(a^2+b^2+c^2)$
2
votes
1 answer

How to get value of x and y here?

$x^2=16$ $y =\sqrt{16}$ here I know that when we solve value of $x$ then we get two values $+4$ and $-4$ But why we don't' get two values of $y$. Can you please explain this. Thanks for help.
2
votes
2 answers

Induction $(1+\frac{1}{x^n})(1+\frac{1}{y^n}) \geq (1+2^n)^2$

How to prove this inequality using Induction (or any simpler method): Let (x,y) be real positive numbers, so that x+y=1; and n an integer: Prove this: $\begin{align}(1+\frac{1}{x^n})(1+\frac{1}{y^n}) \geq (1+2^n)^2\end{align}$
Mounir
  • 21
2
votes
2 answers

Inequality $x + \frac1{4x} \ge 1$ holds for all $x > 0$

Let $x > 0$ be a real number. Prove that $x + \dfrac1{4x} \ge 1$. I don't know where to begin with this question, I was hoping someone could help me out with this.
2
votes
2 answers

Proof of an inequality involiving hyperbolic function

How can I get a proof of the following inequality: $$\frac{x}{\sinh^{-1}(x)}\lt\frac{\sinh(x)}{x}?$$ for $x\gt 0$ Thanks
2
votes
1 answer

Proof is needed for an inequality

$L,M,N$ are three positive integers such that $1 \le M, M \le N, M \le L$ and $M$ is a divisor of $N$. It appears that the following inequality is correct (after assigning many random values to $M,N,L$, such that the conditions above are satisfied),…
r1c
  • 528
2
votes
1 answer

Some inequality

Given a probability distribution function $F(x)$, consider other probability distribution functions $F_1$ and $F_2$ such that $aF_1(x)+bF_2(x)=F(x)$ for some $a,b$ for all $x$. Under what conditions on $F_1$ and $F_2$ we…
user12847
  • 115
2
votes
4 answers

How to solve inequalities with infinite terms

Consider the following inequality: $x + 2 < 1 + \dfrac{1}{x} + \dfrac{1}{x^2} + \dfrac{1}{x^3} ... $ with $x>0$. Is there a general way to solve such an inequality with infinite terms? The best I can do is some conjectures: For $x = 2$ the right…
Phaptitude
  • 2,249
2
votes
2 answers

Prove that $\frac{1}{x^2}+\frac{1}{y^2}+\frac{1}{z^2}\geq 27$

How can I prove $\frac{1}{x^2}+\frac{1}{y^2}+\frac{1}{z^2}\geq 27$, given that $(x+y+z)(\frac{1}{x}+\frac{1}{y}+\frac{1}{z})\geq 9$ and $x+y+z=1$. I've already tried using that: $\frac{1}{x} +\frac{1}{y} +\frac{1}{z}\geq 9$ But I can't seem to…
Azza
  • 31
2
votes
1 answer

How prove this equality $(\sum_{k=1}^{n}(-1)^{k+1}a_{k})^r\le \sum_{k=1}^{n}(-1)^{k+1}a^r_{k+1}$

let $\{a_{n}\}_{\ge 0},n\in \Bbb N^{+},a_{n}\ge 0$ is decreasing. show that $$\left(\sum_{k=1}^{n}(-1)^{k+1}a_{k}\right)^r\le \sum_{k=1}^{n}(-1)^{k+1}a^r_{k},(r>0)$$ My try: $$\Longleftrightarrow…
math110
  • 93,304
2
votes
2 answers

How prove this $\displaystyle\sum_{k=1}^{n}\sin\frac{1}{(k+1)^2}\le\ln{2}$

show that $$\sum_{k=1}^{n}\sin\dfrac{1}{(k+1)^2}\le\ln{2}$$ I think this is nice inequality, and idea maybe use this $$\sin{x}
math110
  • 93,304