4

I need to prove the following sentence for $a\in\mathbb{R}$:

$$ |a-1|+|a-2|+|a-3| \ge 2$$

Breaking the equation into cases it does work, i.e. for $a\le 1$:

$$-a+1-a+2-a+3\ge 2$$ $$-3a \ge -4$$ $$a \le 4/3$$ Which is always true since $a \le 1$, but writing all the cases like that doesn't really seem like a sufficient proof, or a very smart way of doing it. Is there a better way to prove it?

guest
  • 75
  • 2
    The LHS is a convex function of $a$ (as the sum of three convex functions) symmetric with respect to $a=2$ (since this symmetry leaves $|a-2|$ unchanged and exchanges $|a-1|$ and $|a-3|$) hence it is minimal at $a=2$. – Did Mar 14 '15 at 15:48
  • Hello and welcome to math.stackexchange. The problem will be a bit easier if you set $b = a-2$. Then the inequality becomes $|b+1| + |b| + |b-1| \ge 2$. Next explain to yourself that you can assume $b \ge 0$ without losing generality. After that, the cases become more manageable. – Hans Engler Mar 14 '15 at 15:50
  • See http://math.stackexchange.com/questions/113270 – Bart Michels Apr 04 '15 at 09:08

5 Answers5

11

The triangle inequality doesn't seem to be necessary: $$\underbrace{|a-1|}_{\ge a-1}+\underbrace{|a-2|}_{\ge0}+\underbrace{|a-3|}_{\ge 3-a}\ge(a-1)+0+(3-a)=2$$

robjohn
  • 345,667
10

Apply the triangle inequality $|x|+|y|\geq |x+y|$ three times: \begin{align*} |a-1|+|a-2|&=|a-1|+|2-a|\geq 1\\ |a-2|+|a-3|&=|a-2|+|3-a|\geq 1\\ |a-3|+|a-1|&=|3-a|+|a-1|\geq 2. \end{align*} Summing these and dividing by $2$ gives the desired result.

Kim Jong Un
  • 14,794
  • 1
  • 24
  • 49
  • 2
    Nice, +1. This yields, for every $u>v>w$, the optimal lower bound $$|a-u|+|a-v|+|a-w|\geqslant u-w.$$ – Did Mar 14 '15 at 16:06
3

You can use the triangle inequality of the absolute value: $$ |a\pm b| \leq |a|+|b|$$ Now $2 = |2| = |(a-1)-(a-3)| \leq |a-1|+|a-3|$ so in fact $$|a-1|+|a-2|+|a-3| \geq 2+|a-2| \geq 2$$ Notice that equality is achieved when $a = 2$.

Jef
  • 3,821
3

can't we argue this geometrically. $$|a-1| + |a-2| + |a-3|$$ is the sum of the distances of the point $a$ on the number line from the three points $1, 2$ and $3.$ if the point $a$ is between $1$ and $3,$ then the distances from $1$ and $3$ themselves add up to $2,$ therefore the three distances must be $\ge 2.$ if you take a point outside then either of the distances from $1$ or $3$ must be $\ge 2.$ that takes care of all the possibilities.

abel
  • 29,170
3

It is known that the number $a$ minimizing $\sum_i |a-x_i|$ is the median of the $a_i$; a proof of this already appears on the site (if you can find it!). In our case, this means $$ |a-1| + |a-2| + |a-3| \geq |2-1| + |2-2| + |2-3| = 2. $$

Yuval Filmus
  • 57,157