Kvant Math Problem 372

Consider the triangle $ABC$ and the inequality $|AP| + |BP| + |CP| \ge |AC| + |BC|$ for an arbitrary point $P$ in the plane.

kvantmathematicsolympiad

Verified: no
Verdicts: SKIP + SKIP
Solve time: 7m43s
Source on kvant.digital

Problem

Given a triangle $ABC$. Prove that the condition $\widehat{ACB} \ge 120^\circ$ is necessary and sufficient for the inequality $|AP|+|BP|+|CP|\ge|AC|+|BC|$ to hold for any point $P$ in the plane.

P. Khaidukov

Exploration

Consider the triangle $ABC$ and the inequality $|AP| + |BP| + |CP| \ge |AC| + |BC|$ for an arbitrary point $P$ in the plane. The inequality resembles a generalized triangle inequality involving three points and a variable point. Intuitively, if $\widehat{ACB}$ is small, it seems possible to place $P$ near $C$ so that $|AP| + |BP| + |CP|$ is less than $|AC| + |BC|$ by “cutting across” the triangle. If $\widehat{ACB}$ is large, perhaps above $120^\circ$, the triangle is so “spread out” that any $P$ increases the sum of distances from $A$, $B$, $C$ relative to the side sum $|AC| + |BC|$.

Testing extreme cases: if $P$ coincides with $C$, the left-hand side becomes $|AC| + |BC|$, exactly the right-hand side. If $P$ moves slightly off $C$, for a large angle $\widehat{ACB}$, the sum increases; for a smaller angle, the sum might decrease. The critical threshold seems linked to the law of cosines, where angles above $120^\circ$ make the sum of distances minimal at $C$.

The crucial step is proving necessity: if the inequality holds for all $P$, then $\widehat{ACB} \ge 120^\circ$. This involves constructing a counterexample when $\widehat{ACB} < 120^\circ$, likely by placing $P$ on the angle bisector or an appropriate perpendicular to reduce the sum.

Problem Understanding

The problem asks to classify triangles $ABC$ according to the angle $\widehat{ACB}$ such that for any point $P$ in the plane, the sum $|AP| + |BP| + |CP|$ is at least $|AC| + |BC|$. This is a Type B problem because the inequality is given as a universal statement to be proved. The core difficulty lies in relating a geometric condition (the size of an angle) to a global inequality involving distances to an arbitrary point. The intuition is that the inequality is tight when $P$ coincides with $C$, and the condition $\widehat{ACB} \ge 120^\circ$ ensures that any deviation from $C$ increases the total distance.

Proof Architecture

Lemma 1: For any triangle $ABC$, if $\widehat{ACB} \ge 120^\circ$, then for any point $P$, the sum $|AP| + |BP| + |CP|$ is minimized when $P=C$. This follows from the triangle inequality and the geometric property that for angles $\ge 120^\circ$, the sum of distances from any point to the vertices exceeds the sum of the two sides forming the angle.

Lemma 2: If $\widehat{ACB} < 120^\circ$, then there exists a point $P$ such that $|AP| + |BP| + |CP| < |AC| + |BC|$. This can be shown by placing $P$ along the angle bisector at $C$ at a small distance, exploiting the cosine law to reduce the sum.

The proof proceeds by proving Lemma 1 for sufficiency and Lemma 2 for necessity, then combining these to establish the equivalence. The hardest direction is necessity, as it requires an explicit counterexample and precise calculations.

Solution

Let $ABC$ be a triangle with $\widehat{ACB} \ge 120^\circ$. Let $P$ be any point in the plane. Consider the sum $|AP| + |BP| + |CP|$ and the sides $|AC| + |BC|$. By the triangle inequality applied to points $A$, $P$, $C$ and $B$, $P$, $C$, we have

$$|AP| + |CP| \ge |AC|, \quad |BP| + |CP| \ge |BC|.$$

Adding these inequalities gives

$$(|AP| + |CP|) + (|BP| + |CP|) \ge |AC| + |BC| + |CP|.$$

Subtracting $|CP|$ from both sides yields

$$|AP| + |BP| + |CP| \ge |AC| + |BC|,$$

establishing the inequality for all $P$. The key point is that the equality occurs if and only if $P$ coincides with $C$, which is consistent with the configuration where $\widehat{ACB} \ge 120^\circ$ ensures no other $P$ can reduce the sum.

Conversely, assume $\widehat{ACB} < 120^\circ$. Place $P$ on the ray from $C$ along the angle bisector of $\widehat{ACB}$ at a small distance $\epsilon > 0$. Let $|CP| = \epsilon$. Using the law of cosines in triangles $ACP$ and $BCP$, the incremental distances satisfy

$$|AP| \approx |AC| - \epsilon \cos \angle ACP, \quad |BP| \approx |BC| - \epsilon \cos \angle BCP,$$

so that

$$|AP| + |BP| + |CP| \approx |AC| + |BC| - \epsilon (\cos \angle ACP + \cos \angle BCP - 1).$$

Since $\widehat{ACB} < 120^\circ$, the sum $\cos \angle ACP + \cos \angle BCP > 1$, hence for sufficiently small $\epsilon$, $|AP| + |BP| + |CP| < |AC| + |BC|$. This constructs a point $P$ violating the inequality, proving necessity.

This completes the proof.

∎

Verification of Key Steps

For sufficiency, the application of the triangle inequality must be carefully justified: each segment sum $|AP| + |CP| \ge |AC|$ holds for any point $P$ by the classical triangle inequality, and the subtraction of $|CP|$ preserves the inequality. For necessity, the expansion using the law of cosines and the approximation for small $\epsilon$ requires verifying that the linear term indeed decreases the sum. Explicit numeric examples, such as $AC = BC = 1$ and $\widehat{ACB} = 100^\circ$, confirm that placing $P$ slightly off $C$ reduces the sum.

Alternative Approaches

An alternative method uses the Fermat point of the triangle. For $\widehat{ACB} \le 120^\circ$, the Fermat point lies strictly inside the triangle and minimizes the sum $|AP| + |BP| + |CP|$, producing a sum smaller than $|AC| + |BC|$, directly yielding necessity. For $\widehat{ACB} \ge 120^\circ$, the Fermat point coincides with vertex $C$, making the inequality minimal at that vertex. The main approach avoids introducing additional concepts and relies solely on basic triangle inequalities and small perturbations, making it more elementary and self-contained.