A regular hexagon is given in the plane. For every point P of the plane, we call l(P) the sum of the six distances between P and the lines on which the sides of the hexagon lie, and v(P) the sum of the six distances of P from the vertices of the hexagon.
a. For which points P of the plane is l(P) minimal?
b. For which points P of the plane is v(P) minimal?
Solution
Solution:
(a) The points P for which l(P) is minimal are the points interior to the hexagon and those on its boundary. Let us call ABCDEF the hexagon, and a the length of its side, and let us consider the sum of the distances between P and the two opposite sides AB and DE. If H and K are the feet of the perpendiculars from P to the lines AB and DE respectively, then, by definition, PH and PK are the distances of P from the lines AB and DE. P,H and K are collinear, because PH and PK are both perpendicular to the two lines, and HK is equal to the distance between the two lines, that is, to 3a.
If P lies inside the segment HK (endpoints included) then HP+PK=HK=3a. If instead it is outside, then the longer of the two segments PH and PK contains within it the entire segment HK, so in particular PH+PK>HK>3a. It is evident that the first case occurs when P is interior to the strip formed between the two lines AB and DE (boundary included), while the second occurs when P is exterior to that strip. In conclusion, dist(P,AB)+dist(P,DE)=PH+PK⩾3a and equality holds if and only if P is interior to the strip (boundary included). Repeating the reasoning for the other two pairs of opposite sides, we get dist(P,AB)+dist(P,DE)⩾3a,dist(P,BC)+dist(P,EF)⩾3a,dist(P,CD)+dist(P,FA)⩾3a, and equalities hold respectively if P is interior to the three strips determined by the pairs of parallel lines {AB,DE},{BC,EF}, {CD,FA} (boundaries included).
Adding the three relations found, we obtain dist(P,AB)+dist(P,BC)+dist(P,CD)+dist(P,DE)+dist(P,EF)+dist(P,FA)⩾33a. Equality holds when P is in the intersection of the three strips formed by the pairs of opposite sides of the hexagon, that is, when P is inside the hexagon or on its boundary.
(b) The only point for which v(P) is minimal is the center of the hexagon.
To prove this, let us consider the sums of the distances of P from the pairs of opposite vertices {A,D},{B,E}, {C,F} ). By the triangle inequality, AD⩽AP+PD, and equality holds if and only if P is on the segment AD. Similarly, BE⩽BP+PE, with equality only if P lies on the segment BE, and CF⩽CP+PF, with equality only if P lies on the segment CF. Adding the three relations we obtain v=PA+PB+PC+PD+PE+PF=(AP+PD)+(BP+PE)+(CP+PF)⩽AD+BE+CF=6a and equality holds if and only if the equality conditions of the three relations we added hold simultaneously, that is, if P lies simultaneously on the segments AD,BE and CF. It is evident that the only point satisfying this condition is the center of the hexagon.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement translated into English from it; metadata (topic, difficulty) added by this project.