Questions tagged [karamata-inequality]

Inequalities, which we can prove by the Karamata's inequality

We'll say that $$(a_1,a_2,...,a_n)\succ(b_1,b_2,...,b_n)$$ iff $$a_1\geq a_2\geq...\geq a_n,$$ $$b_1\geq b_2\geq...\geq b_n$$ and $$a_1\geq b_1,$$ $$a_1+a_2\geq b_1+b_2,$$ $$\cdot$$ $$\cdot$$ $$\cdot$$ $$a_1+a_2+...+a_n=b_1+b_2+...+b_n.$$

The Karamata's inequality says:

  • Let $(a_1,a_2,...,a_n)\succ(b_1,b_2,...b_n)$ and $f$ is a convex function. Prove that: $$f(a_1)+f(a_2)+...+f(a_n)\geq f(b_1)+f(b_1)+...+f(b_n).$$

  • Let $(a_1,a_2,...,a_n)\succ(b_1,b_2,...b_2)$ and $f$ is a concave function. Prove that: $$f(a_1)+f(a_2)+...+f(a_n)\leq f(b_1)+f(b_1)+...+f(b_n).$$

A proof for the convex function.

Induction respect to $n$.

For $n=1$ and $n=2$ it's obvious.

For example, for $n=2$ let $A_1(a_1,f(a_1)),$ $A_2(a_2,f(a_2)),$

$B_1(b_1,f(b_1)),$ $B_2(b_2,f(b_2))$,

$M\left(\frac{a_1+a_2}{2},\frac{f(a_1)+f(a_2)}{2}\right)$ and $M\left(\frac{b_1+b_2}{2},\frac{f(b_1)+f(b_2)}{2}\right)$.

Since $f$ is a convex function, the segment $A_1A_2$ is placed above the segment $B_1B_2$, which gives $M$ is placed above $N$, which says $f(a_1)+f(a_2)\geq f(b_1)+f(b_2).$

Now, let $f(a_1)+f(a_2)+...+f(a_k)\geq f(b_1)+f(b_1)+...+f(b_k)$ for $(a_1,a_2,...,a_k)\succ(b_1,b_2,...b_k)$ for any $k\leq n-1$ and $n\geq2.$

Let $b_1+b_n=constant$ and $b_1$ increases.

Let for $b_1'\geq b_1$ in the first time happens: $$a_1+a_2+...+a_l=b_1'+b_2+...+b_l.$$ Thus, $$a_1\geq b_1',$$ $$a_1+a_2\geq b_1'+b_2,$$ $$\cdot$$ $$\cdot$$ $$\cdot$$ $$a_1+a_2+...+a_l=b_1'+b_2+...+b_l,$$ $$a_1+a_2+...+a_{l+1}\geq b_1'+b_2+...+b_{l+1},$$ $$\cdot$$ $$\cdot$$ $$\cdot$$ $$a_1+a_2+...+a_n=b_1'+b_2+...+b_n'$$ or $$a_1\geq b_1',$$ $$a_1+a_2\geq b_1'+b_2,$$ $$\cdot$$ $$\cdot$$ $$\cdot$$ $$a_1+a_2+...+a_l=b_1'+b_2+...+b_l,$$ $$a_{l+1}\geq b_{l+1},$$ $$\cdot$$ $$\cdot$$ $$\cdot$$ $$a_{l+1}+a_{l+2}+...+a_n=b_{l+1}+b_{l+2}+...+b_n',$$ which by the assumption of the induction gives: $$f(a_1)+f(a_2)+...+f(a_l)\geq f(b_1')+f(b_2)+...+f(b_l)$$ and $$f(a_{l+1})+f(a_{l+2})+...+f(a_n)\geq f(b_{l+1})+f(b_{l+2})+...+f(b_n'),$$ which gives $$f(a_1)+f(a_2)+...+f(a_n)\geq f(b_1')+f(b_2)+...+f(b_n')$$ and since by Karamata for $n=2$ we have $$f(b_1')+f(b_n')\geq f(b_1)+f(b_n),$$ we are done!

76 questions
9
votes
2 answers

About a Conjecture: $-\left(\frac{x^{n}+1}{x^{n-1}+1}\right)^{n}-\left(\frac{x+1}{2}\right)^{n}+\left(x^{\frac{x}{x+1}}+\sqrt{x}-1\right)^{n}+1\leq 0$

Hi it's a conjecture wich refine for $0< x\leq 1$ the inequality Refinement of a famous inequality : Problem/Conjecture Let $0
Barackouda
  • 3,879
9
votes
2 answers

Minimum and maximum sum of squares given constraints

Say that we know that $$\sum_{i=1}^n x_i = x_1+x_2+...+x_n = 1$$ for some positive integer $n$, with $x_1 \le x_2 \le x_3 \le ... \le x_n$. The values of $x_1$ and $x_n$ are also known. How can the minimum and maximum values of $$\sum_{i=1}^n…
8
votes
2 answers

Why does this Olympiad inequality proving technique (Isolated Fudging) work?

A few years ago, I was in a math olympiad training camp and they taught us a technique to prove inequalities. I just came across it again recently. However, I am not able to understand why it works. So, here is how it goes. Suppose, you want to…
8
votes
4 answers

Find the number of natural solutions of $5^x+7^x+11^x=6^x+8^x+9^x$

Find the number of natural solutions of $5^x+7^x+11^x=6^x+8^x+9^x$ It's easy to see that $x=0$ and $x=1$ are solutions but are these the only one? How do I demonstrate that? I've tried to write them…
7
votes
4 answers

Inequality $(1+x^k)^{k+1}\geq (1+x^{k+1})^k$

Let $k$ be a positive integer and $x$ a positive real number. Prove that $(1+x^k)^{k+1}\geq (1+x^{k+1})^k$. This looks similar to Bernoulli's inequality. If we write $X=x^k$, the inequality is equivalent to $(1+X)^{\frac{k+1}{k}}\geq…
6
votes
2 answers

If a,b,c are sides of a triangle, prove: $ \sqrt{a+b-c} + \sqrt{b+c-a} + \sqrt{c+a-b} \le \sqrt{a} + \sqrt{b} + \sqrt{c} $

I did substitute $a=x+y, b=x+z, c=y+z$ and I arrived at $\sqrt{2x} + \sqrt{2y} + \sqrt{2z} \le \sqrt{x+y} + \sqrt{x+z} + \sqrt{y+z}$. However, after this, I tried various methods like AM-GM and Cauchy-Schwarz inequality for hours and I still can't…
6
votes
5 answers

Upper Bound for a Sum

Can you help me prove the following inequality: $$ (\sum_{k=1}^na_kb_kc_k)^2 \leq \sum_{k=1}^na_k^2\sum_{k=1}^nb_k^2\sum_{k=1}^nc_k^2 $$ where $a's,b's,c's \in \mathrm{R}$ I tried to use Cauchy's inequality to prove this but got stuck.
6
votes
1 answer

Proving a convexity inequality

Given $f: \mathbb{R} \to \mathbb{R}$ convex, show that: $$ \frac{2}{3}\left(f\left(\frac{x+y}{2}\right) + f\left(\frac{z+y}{2}\right) + f\left(\frac{x+z}{2}\right)\right) \leq f\left(\frac{x+y+z}{3}\right) + \frac{f(x) + f(y) + f(z)}{3}.$$ I…
6
votes
3 answers

Prove that: $\sqrt[3]{a_1^3+ a_2^3 +\cdots+a_n^3} \le \sqrt{a_1^2 + a_2^2 +\cdots+a_n^2}$

Let $a_1, a_2, \ldots, a_n \in \mathbb{R}$. Prove that the following inequality holds: $$\sqrt[3]{a_1^3+ a_2^3 +\cdots+a_n^3} \le \sqrt{a_1^2 + a_2^2 +\cdots+a_n^2}$$ I first tried to restrict the inequality to $\mathbb{R}^{+}$ and that's fairly…
5
votes
3 answers

How prove this inequality

in $\Delta ABC$, if $A,B,C\in (0,\pi/2]$,show that $$\sin{A}+\sin{B}+\sin{C}>2$$ This problem have many nice methods? Thank you
user94270
5
votes
1 answer

Given three non-negative numbers $x, y, z$ so that $x+ y+ z= 100$ and $x, y, z\notin\left ( 33, 34 \right )$, show that $xyz\leq 33\cdot 34\cdot 33$

Given three non-negative numbers $x, y, z$ so that $x+ y+ z= 100$ and $x, y, z\notin\left ( 33, 34 \right )$, show that $$xyz\leq 33\cdot 34\cdot 33$$ I would like to see a solution that is different from the following approach by a Vietnamese…
5
votes
3 answers

Let $A, B$ and $C$ be the angles of an acute triangle. Show that: $\sin A+\sin B +\sin C > 2$.

Let $A, B$ and $C$ be the angles of an acute triangle. Show that: $\sin A+\sin B +\sin C > 2$. I started from considering $$\begin{align}\sin A+\sin B+\sin (180^o-A-B) &= \sin A+\sin B+\sin(A+B) \\&=\sin A+\sin B+\sin A\cos B + \cos A\sin B…
5
votes
4 answers

How to show $(a + b)^n \leq a^n + b^n$, where $a, b \geq 0$ and $n \in (0, 1]$?

Does anyone happen to know a nice way to show that $(a+b)^n \le a^n+b^n$, where $a,b\geq 0$ and $n \in (0,1]$? I figured integrating might help, but I've been unable to pull my argument full circle. Any suggestions are appreciated :)
4
votes
0 answers

Stronger than Jensen's inequality

I'm interested by the following problem : Let $f(x)$ be a twice differentiable function on an interval $I$ with : 1)$f''(x)\geq 0\quad \forall x \in I$ 2)$f(x)\neq \text{constant function} $ Then we have for $x,y \in I$: …
user674646
4
votes
2 answers

Number of real roots of $3^x+4^x=2^x+5^x$ with proof

This equation $$3^x+4^x=2^x+5^x$$ has two obvious real roots. The question is if it has more real roots than two. A proof is required in any case.
1
2 3 4 5 6