To see why using
![](https://latex.codecogs.com/png.latex?\bg_white D_\text{min.}=|a-2|)
for
![](https://latex.codecogs.com/png.latex?\bg_white \frac{3}{2}<a\leq 2)
is optimal, note that the squared distance function represents a concave up parabola. Therefore, it is minimised at its vertex, and as we saw before, this globally minimising
x-value is
![](https://latex.codecogs.com/png.latex?\bg_white x_\text{vert}=\frac{4a}{3}>2)
as
![](https://latex.codecogs.com/png.latex?\bg_white a>\frac{3}{2})
. So the parabola is minimised at a point where
x > 2, so the closest we can get to this minimal value by taking a point on the ellipse is to make
x on the ellipse closest to this value greater than 2, which is clearly by taking
x = 2, and this point (the point (2,0)) on the ellipse has distance to the point (
a, 0) of
![](https://latex.codecogs.com/png.latex?\bg_white 2-a)
, which is the same as
![](https://latex.codecogs.com/png.latex?\bg_white |a-2|)
as required.
(And we noted earlier that the optimal distance for
a > 2 was
![](https://latex.codecogs.com/png.latex?\bg_white a-2)
, which is equal to
![](https://latex.codecogs.com/png.latex?\bg_white |a-2)
, so in either case
![](https://latex.codecogs.com/png.latex?\bg_white |a-2|)
is optimal.)