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

Prove that if $a^5-a^3+a=3$, then $a^6\geq 5$

The problem, which I encountered in a highschool book, goes as following: Prove that if $a^5-a^3+a=3,$ then $a^6\geq 5$ must hold. Now, obviously, I have tried a lot of things such as: $a^6=a^4-a^2+3a\Rightarrow a^4-a^2+3a\geq 5$ or multiplying…
2
votes
3 answers

Show that $(b_1+b_2)^2\leq (a_1+a_2)(c_1+c_2)$

How to show that if $a_k,b_k,c_k\in \mathbb{R}^+$ for which $a_kc_k-b_k^2\geq 0$ for $k=1,2$, then $$ (b_1+b_2)^2\leq (a_1+a_2)(c_1+c_2)? $$ I tried to check some well-known identities such as Young's inequality, but I failed to make it work.
2
votes
0 answers

Inequality involving three positive numbers

I came across this question on Facebook: Given $a$, $b$, $c$ positive such that $3\geq abc(a+b+c)$, prove that $$\frac{1}{a}+\frac{1}{b}+\frac{1}{c}\geq a+b+c$$ With reference from other posts, I tried to manipulate the 9 in Cauchy Schwartz…
Novice
  • 719
2
votes
0 answers

Find the maximum of the $\sum\limits_{i=1}^{2021}\min(a_{i},a_{i+1})\cdot\min(a_{i+1},a_{i+2})$

let $a_i\ge 0,i=1,2,\cdots,2021$,and such $a_{1}+a_{2}+\cdots+a_{2021}=1$.find the maximum the value $$\sum\limits_{i=1}^{2021}\min(a_{i},a_{i+1})\cdot\min(a_{i+1},a_{i+2})$$ where $a_{2022}=a_{1},a_{2023}=a_{2}$ Sangchul Lee suspect that the…
math110
  • 93,304
2
votes
1 answer

What's the approach for this inequality question?

The question: $a,b,c > 0; ab+bc+ca =3$, Prove that $\sum_{cyc}\frac{a}{\sqrt{a^{3}+5}}\leq\frac{\sqrt{6}}{2}$ The sum is cyclic over $a,b,c$ I've looked at the problem for a long time but still can't think of an approach for this, so how can I solve…
2
votes
2 answers

Using AM-GM Inequalities: For a,b,c all positive and $a+b+c=1$, prove that $ab+bc+ca\le 1/3$

Using AM-GM Inequalities. For a,b,c all positive and $a+b+c=1$, prove that $ab+bc+ca\le 1/3$. My attempt: I took AM-GM of $a+b$ and $c$, and then $a$ and $b+c$ and so on. Using that i got $\le 3/8.$
2
votes
2 answers

An Inequality Involving Sums of Reciprocals of Pair Sums

Let $x_1, \ldots, x_n, y_1, \ldots, y_m$ be positive real numbers. Prove or disprove the following inequality. \begin{equation} \sum_{i=1}^n\sum_{j=1}^n \frac{1}{x_i+x_j} + \sum_{i=1}^m\sum_{j=1}^m \frac{1}{y_i+y_j} \geq 2\sum_{i=1}^n \sum_{j=1}^m…
aaa acb
  • 195
2
votes
1 answer

Proof the following inequality: $ (x -\frac{x^k-r}{kx^{k-1}})^k \geq r $

Given that $k \geq 2$, $r \geq 1$, $x > 0$ and $x^k \geq r$, I am supposed to proof that $(x -\frac{x^k-r}{kx^{k-1}})^k \geq r $. It also says, Bernoulli's inequality might me helpful, but so far I had no success. I only came this far: $(x…
soph6626
  • 121
2
votes
1 answer

Proving the following summation inequality related to n-partition of [0, 1]

We have $n+1$ real numbers $x_0$ to $x_n$, with $x_0=0, x_n=1$ and $x_i < x_{i+1}$ for all $0 \le i < n$. Prove: $$\sum_{i=0}^{n-1}\sqrt{x_{i+1}^2-x_i^2} \le \sqrt n$$ I think I have seen this problem before (it may be well known) but I'm not sure…
2
votes
0 answers

If abc=1, prove: $2(ab+bc+ca)+a+b+c\ge \sqrt{a^2+4(b+c)}+\sqrt{b^2+4(c+a)}+\sqrt{c^2+4(a+b)}$

Let $a,b,c>0: abc=1.$ Prove that: $$2(ab+bc+ca)+a+b+c\ge \sqrt{a^2+4(b+c)}+\sqrt{b^2+4(c+a)}+\sqrt{c^2+4(a+b)}$$ I tried to prove the stronger one which is not true: $$2(ab+bc+ca)+a+b +c\ge\sqrt{3(a^2+b^2+c^2)+24(a+b+c)}$$ The inequality seems…
Sickness
  • 1
  • 4
  • 14
2
votes
2 answers

An inequality involving complex numbers

I would like to prove the following inequality: $$\large{ \left| {1 + re^{ - \frac{2}{3}\theta i} } \right|^2 \left| {1 + re^{\frac{2}{3}\left( {\pi - \theta } \right)i} } \right|^2 \ge \cos ^2 \theta , }$$ for any $r>0$ and…
Gary
  • 31,845
2
votes
0 answers

(Dis)Prove $x \le z+y-d$ given $x \le e+f-a, x \le z+f-c, x \le e+y-b, d \le b+c-a$

we are given the following constraints for x $$x \le e+f-a$$ $$x \le z+f-c$$ $$x \le e+y-b$$ $$d \le b+c-a$$ We need to prove(or disprove) that $$x \le z+y-d$$ where $x, y, z, a, b, c, d, e \in \mathbb{R}$ I tried for some examples and it seems that…
punter147
  • 221
2
votes
0 answers

Given: $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}=\frac{3}{2}.$ prove: $\frac{ab}{c}+\frac{bc}{a}+\frac{ca}{b}+3\ge\sum_{cyc}{\sqrt{a^2+b^2+1}}$

Let $a,b,c>0: \frac{1}{a}+\frac{1}{b}+\frac{1}{c}=\frac{3}{2}.$ Prove that: $$\frac{ab}{c}+\frac{bc}{a}+\frac{ca}{b}+3\ge\sqrt{a^2+b^2+1}+\sqrt{b^2+c^2+1}+\sqrt{c^2+a^2+1}$$ My attempts: I thought that AM-GM may be able to solve. By AM-GM…
Sickness
  • 1
  • 4
  • 14
2
votes
0 answers

Finding a feasible solution to a special case system of inequalities $A^{\tau}A \cdot {\bf x} > {\bf 0}, {\bf x} > {\bf 0}$

Given that $A^{\tau}A$ is full rank $N \times N$ and positive definite matrix. Is it possible to find a ${\bf x} \epsilon R^N$ that satisfies the system below in polynomial time with an exact number of steps. $A^{\tau}A \cdot {\bf x} > {\bf…
2
votes
4 answers

Find an maxima such that $\sqrt a+\sqrt b$, when $27a^2+b^2=27$ (In high-school level!)

How to get a maximum value of $\sqrt a+\sqrt b$, when $27a^2+b^2=27$? I know that using Lagrange multiplier is easiest way in college-level math, but I believe there is a elementary and elegant way to prove that in high-school level. I made…
MH.Lee
  • 5,568