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

Prove that $\frac{ab}{c}+\frac{bc}{a}+\frac{ac}{b}\ge a+b+c$

How to prove that \begin{equation*}\frac{ab}{c}+\frac{bc}{a}+\frac{ac}{b}\ge a+b+c,\ where \ a,b,c>0\end{equation*} I tried the following: \begin{equation*}abc(\frac{1}{a^2}+\frac{1}{b^2}+\frac{1}{c^2})\ge a+b+c\end{equation*} Using Chebyshev's…
3
votes
2 answers

Find the domain of $x$ in $4\sqrt{x+1}+2\sqrt{2x+3}\leq(x-1)(x^2-2)$

Solve this equation for $x$: $4\sqrt{x+1}+2\sqrt{2x+3}\leq(x-1)(x^2-2)$ I have no idea to solve that, but I know solutions are $x=-1$ or $x\ge 3$.
idiots
  • 425
3
votes
3 answers

Prove $a^\alpha b^\beta + c^\alpha d^\beta \leq (a+c)^\alpha (b+d)^\beta$

I'm trying to prove that the sum of two log-convex functions is log-convex. I've figured out that this can be done by proving: $a^\alpha b^\beta + c^\alpha d^\beta \leq (a+c)^\alpha (b+d)^\beta$ for $a,b,c,d,\alpha,\beta \in \mathbb{R}$ and…
3
votes
3 answers

Doubt in application of AM-GM inequality

The Question is What is the minimum value of $9\sec^2 x + \cos^2 x$ ? Now, I tried applying AM-GM inequality, and the answer comes out as 6. But sec2x has a minimum value of 1. So the least value should be greater than 9. Now, We have $\frac{9\sec^2…
3
votes
1 answer

Let $a,b,c$ be the nonnegative real numbers such that $a+b+c=1$. Prove that $\sqrt{a+\frac{(b-c)^2}4}+\sqrt b+\sqrt c\le\sqrt3$

Let $a,b,c$ be the nonnegative real numbers such that $a+b+c=1$. Prove that $$\sqrt{a+\frac{(b-c)^2}4}+\sqrt b+\sqrt c\le\sqrt3$$ I first wrote $a$ as $1-b-c$ and substituted it in main inequality $$\sqrt{4(1-b-c)+(b-c)^2}+2\sqrt b+2\sqrt…
user164524
3
votes
2 answers

How prove Reversing the Arithmetic mean – Geometric mean inequality?

Let $x_1,x_2,\cdots,x_n$ $(n\geq2)$ be a non-decreasing monotonous sequence of positive numbers such that $x_1,\frac{x_2}{2},\cdots,\frac{x_n}{n}$ be a non-increasing monotonous sequence .Prove that $$\dfrac{\displaystyle\sum_{i=1}^{n} x_i }{n\left…
user223800
3
votes
2 answers

Let $a,b,c >0$ Prove the inequality $\displaystyle{\frac{a}{a+1}+\frac{b}{b+1}+\frac{c}{c+1}+\frac{1}{a+b+c+1} \geq 1}$

Let $a,b,c >0$ Prove the inequality $\displaystyle{\frac{a}{a+1}+\frac{b}{b+1}+\frac{c}{c+1}+\frac{1}{a+b+c+1} \geq 1}$ I dont even know where to begin. Only interested in hints (not solution)
Kirthi Raman
  • 7,564
  • 2
  • 36
  • 60
3
votes
3 answers

$(W_1+W_2+\cdots+W_n)^a \leq W_1^a +\cdots + W_n^a$ for $n$ integer, $n\geq 2$, $W\gt 0$ and $a$ constant, real, $0\lt a\lt 1$

I am looking for a proof that this inequality: $$(W_1+W_2+\cdots+W_n)^a \leq W_1^a +\cdots + W_n^a$$ is valid. I have a power function $f(W)=W^a$ where $a$ is a real number, constant but usually $0\lt a\lt 1$. The $W_i$ are real positive…
Antonis
3
votes
1 answer

Real number inequality

Suppose $a,b,c\in\mathbb{R}_{\geq 0}$ and $p,q\in\mathbb{Q}\cap[0,1]$ are fixed with $p+q=1$. Is it necessarily true that $a\leq b^pc^q$ implies $(a+\varepsilon)\leq(b+\varepsilon)^p(c+\varepsilon)^q$ for any $\varepsilon>0$?
user31415926535
  • 729
  • 4
  • 13
3
votes
2 answers

Prove cyclic inequality

Please help me to prove this. Assume$\forall n,a_n>0$, then $${a_1a_2\over a_3}+{a_2a_3\over a_4}+\dots+{a_{n-1}a_n\over a_1}+{a_na_1\over a_2}\geq a_1+\dots+a_n.$$ I can prove for $n=3$, but it seems impossible to extend it to the general case.…
3
votes
2 answers

Let $x,y,z>0$ such that $x^2+y^2+z^2=1$. Prove that $x^2yz+y^2zx+z^2xy\le \frac13$

Let $x,y,z>0$ such that $x^2+y^2+z^2=1$. Prove that $x^2yz+y^2zx+z^2xy\le \dfrac13$ My attempt: I tried using AM-GM and also weighted AM-GM but both seems to be unyielding. So, please help. Thank you.
Swadhin
  • 1,381
3
votes
3 answers

Let $x,y,z>0,xyz=1$. Prove that $\frac{x^3}{(1+y)(1+z)}+\frac{y^3}{(1+x)(1+z)}+\frac{z^3}{(1+x)(1+y)}\ge \frac34$

Let $x,y,z>0$ and $xyz=1$. Prove that $\dfrac{x^3}{(1+y)(1+z)}+\dfrac{y^3}{(1+x)(1+z)}+\dfrac{z^3}{(1+x)(1+y)}\ge \dfrac34$ My attempt: Since it is given that $xyz=1$, I tried substituting $x=\dfrac{a}{b},y=\dfrac{b}{c},z=\dfrac{c}{a}$. But the…
Swadhin
  • 1,381
3
votes
2 answers

Let $a,b,c,d>0$ and $a+b+c+d=1$. Prove that $\frac{abc}{1+bc}+\frac{bcd}{1+cd}+\frac{cda}{1+ad}+\frac{dab}{1+ab}\le \frac{1}{17}$

Let $a,b,c,d>0$ and $a+b+c+d=1$. Prove that $\dfrac{abc}{1+bc}+\dfrac{bcd}{1+cd}+\dfrac{cda}{1+ad}+\dfrac{dab}{1+ab}\le \dfrac{1}{17}$ My attempt: I figured out that if each of the element could be like $\dfrac{abc}{1+bc}\le \dfrac{1}{68}$ then…
Swadhin
  • 1,381
3
votes
4 answers

Proving the inequality $\frac12\frac34....\frac{2n-1}{2n}<\frac1{\sqrt{2n+1}}$

How to show this inequality: $\dfrac{1}{2}\dfrac{3}{4}....\dfrac{2n-1}{2n}<\dfrac{1}{\sqrt{2n+1}}$ Using induction the inequality is verified for $n=1$ now assume that that the inequality holds for $n$,to show it for…
Learnmore
  • 31,062
3
votes
1 answer

How to prove/dispute the following log inequality?

I was wondering if the following inequality is true: $$\forall x,N\in \mathbb N^+: \lceil \log_2\left(\lfloor\frac{N}{x}+1\rfloor\right)\rceil\leq \lceil\log_2 (N+1)\rceil - \lfloor\log_2 (x)\rfloor $$ I need this inequality to hold for my…
Ar Co
  • 39