3

I need to prove that $$ |(x-x_0)(x-x_1)|\leq \frac {1}{4}(x_1-x_0)^2 $$ for all $x\in < x_0 ; x_1 >$

The only thing I have notived it that the expression with absoltue value is always non-positive, so the inequality is equvalent to $$ -(x-x_0)(x-x_1)\leq \frac {1}{4}(x_1-x_0)^2 $$ but I'm stuck here

2 Answers2

2

For $ x \in (x_0, x_1)$, you have $(x-x_0) + (x_1-x) = x_1-x_0$.

Then prove (it's not difficult) that the product of two numbers whose sum is constant is maximum when those two numbers are equal.

Apply that to your case, $\left\vert(x-x_0)(x-x_1) \right\vert$ is maximum when $x-x_0 = x_1-x = \frac{x_1-x_0}{2}$ and therefore the maximum is indeed equal to $\frac{(x_1-x_0)^2}{4}$.

1

Note

$$0\le (x-\frac{x_0+x_1}2)^2$$

and $$( \frac{x_1-x_0}2)^2 - (x-\frac{x_1+x_0}2)^2 \le ( \frac{x_1-x_0}2)^2 $$

Thus,

$$(x_1-x)(x-x_0) \le \frac14( x_1-x_0)^2 $$

Quanto
  • 97,352
  • could you also help me with question, that is generalisation of this problem? https://math.stackexchange.com/questions/3640493/proving-fracb-ab-x-cdot-fracb-ak1k1-geq-fracb-akk1 – MartinYakuza Apr 23 '20 at 21:02
  • @MartinYakuza - will take a look – Quanto Apr 23 '20 at 21:03