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

Inequality constant in Papa Rudin

The following inequality appears in Rudin's Real and Complex Analysis, 3ed, in the proof of ($f$) in Theorem 9.2 (Fourier Transforms): if $x\in\mathbb{R}$ and $\phi(x,u):= (e^{-ixu} - 1)/u$ then $|\phi(x,u)|\le |x|$ for all real $u\ne 0$. It seems…
3
votes
5 answers

Proving $\frac{x}{x^2+1}\leq \arctan(x)$ for $x\in [0,1].$

How can I prove this inequality? $$\frac{x}{x^2+1}\leq \arctan(x) \, , x\in [0,1].$$ Thank you so much for tips! Sorry if this is just stupid.
3
votes
1 answer

How Find this maximum $P=\frac{4}{\sqrt{a^2+b^2+c^2+4}}-\frac{9}{(a+b)\sqrt{(a+2c)(b+2c)}}$

let $a,b,c>0$, find the maximum $$P=\dfrac{4}{\sqrt{a^2+b^2+c^2+4}}-\dfrac{9}{(a+b)\sqrt{(a+2c)(b+2c)}}$$ I think this inequality we can use AM-GM inequality to solve it,and Now first we must sure this equality when $a,b,c$ hold maximum Thank…
math110
  • 93,304
3
votes
3 answers

Plotting the regions where $\log_{x}|y-2|-\log_{|y-2|}x>0$

Draw the set: $ S=\{(x,y): \log_{x}|y-2|-\log_{|y-2|}x>0\} $ We know that $x>0$ (base of the logarithm). Also, $$\log_{|y-2|}x=\frac{1}{\log_{x}|y-2|},$$ so we have $$\log_{x}|y-2| - \frac{1}{\log_{x}|y-2|}>0$$ and so…
Jameson
  • 113
3
votes
0 answers

Inequality, symmetric function

Let $$F(x,y)=\dfrac{f\left(\frac{x}{x+y}\right)+f\left(\frac{y}{x+y}\right)}{x+y},$$ where $f>0$ is a concave function. Using brute force computation (computer based proof) with $f(x)=\frac{1-x}{2-x}$, I know that: $$a>b>c>d>0\implies…
3
votes
3 answers

Prove that $a^2 - b^2 + c^2 - d^2 \ge (a - b + c - d)^2$

In thinking about a base case in this problem, I came up with the following question. Given real numbers $a \ge b \ge c \ge d \ge 0$, prove that the following holds: $a^2 - b^2 + c^2 - d^2 \ge (a - b + c - d)^2 \tag{A}$ My attempt: After…
Anant
  • 520
3
votes
4 answers

Prove that $\frac{x \log(x)}{x^2-1} \leq \frac{1}{2}$ for positive $x$, $x \neq 1$.

I'd like to prove $$\frac{x \,\log(x)}{x^2-1} \leq \frac{1}{2} $$ for positive $x$, $x \neq 1$. I showed that the limit of the function $f(x) = \frac{x \,\text{log}(x)}{x^2-1}$ is zero as $x$ tends to infinity. But not sure what to do next.
3
votes
1 answer

If $|a|,|b|<1$, prove that $\frac{|a+b|}{|1+ab|}<1$.

So I've gotten as far as $\displaystyle\frac{|a+b|}{|1+ab|}<\frac{2}{|1+ab|}$ which is clearly wrong because it is greater than 1. What am I doing wrong? Is this question even true?
3
votes
1 answer

If $x,y,z \in \mathbb{R^+}$ such that $x+y+z=3$. Prove the inequality $\sqrt x+\sqrt y+\sqrt z\ge xy+yz+zx$

If $x,y,z \in \mathbb{R^+}$ such that $x+y+z=3$. Prove the inequality $\sqrt x+\sqrt y+\sqrt z\ge xy+yz+zx$. My work: We have $$3(x+y+z)=x^2+y^2+z^2+2(xy+yz+zx) \implies (xy+yz+zx)=\dfrac12(3x-x^2+3y-y^2+3z-z^2)$$ So, we have to prove, $\sqrt…
Hawk
  • 6,540
3
votes
2 answers

Solve inequality: $\frac{2x}{x^2-2x+5} + \frac{3x}{x^2+2x+5} \leq \frac{7}{8}$

Rational method to solve $\frac{2x}{x^2-2x+5} + \frac{3x}{x^2+2x+5} \leq \frac{7}{8}$ inequality? I tried to lead fractions to a common denominator, but I think that this way is wrong, because I had fourth-degree polynomial in the numerator.
3
votes
0 answers

Putnam Competition 2003 A2 - Question

I just wanted to have your opinions on my solution to this question. Any criticism would be welcome, especially with LaTeX formatting. I'm new to this website and still can't seem to get my LaTeX code to work on here. I assume it's not as simple as…
H5159
  • 969
3
votes
2 answers

$a,b,c$ are positive real numbers such that, $a+b+c\ge abc$. Prove that $a^2+b^2+c^2\ge \sqrt{3}abc$

$a,b,c$ are positive real numbers such that, $a+b+c\ge abc$. Prove that $a^2+b^2+c^2\ge \sqrt{3}abc$ My work: I tried using Cauchy-Schwarz inequality to find that, $(a^2+b^2+c^2)(1^2+1^2+1^2)\ge (a+b+c)^2$ $(a^2+b^2+c^2)\ge…
Hawk
  • 6,540
3
votes
1 answer

Triangle Inequality question with fractions

Given $a, b \in \mathbb{R}$, prove that $$\frac{|a + b|}{1 + |a + b|} \le \frac{|a|}{1 + |a|} + \frac{|b|}{1+|b|}$$ When does equality hold? The only useful thing I could get (using the triangle inequality) is: $$\begin{align}1 + \left|\left(a +…
Yiyuan Lee
  • 14,435
3
votes
2 answers

Prove that $a^ab^b>\left(\frac{a+b}{2}\right)^{a+b}$ where $a\ne b$

Prove that $a^a\cdot b^b>\left(\dfrac{a+b}{2}\right)^{a+b}$ where $a\ne b$. My work: $$a^a\cdot b^b>\left(\frac{a+b}{2}\right)^a\cdot\left(\frac{a+b}{2}\right)^b\implies…
Hawk
  • 6,540
3
votes
0 answers

Prove this inequality for all integers $m>2$

Prove this inequality for all integers $m$: $$∑_{n=2}^{m} \frac{1-n^{2α-1}}{n^{\alpha}} > \frac{1-(m+1)^{2α-1}}{(m+1)^{\alpha}}$$ for all $0<α<1/2$ and $m>2$.
DER
  • 3,011