Kvant Math Problem 99
The inequality resembles the triangle inequality.
Verified: no
Verdicts: SKIP + SKIP
Solve time: 5m26s
Source on kvant.digital
Problem
In the triangle $ABC$, the side $AC$ is the largest. Prove that for any point $M$ of the plane, $AM + CM$ is not less than $BM$. In what cases does equality occur?
N. B. Vasiliev
Exploration
The inequality resembles the triangle inequality. Since $AC$ is the largest side of triangle $ABC$, one has
$$AC \ge AB,\qquad AC \ge BC.$$
If one combines the inequalities
$$AM+MB\ge AB,\qquad CM+MB\ge BC,$$
then
$$AM+CM+2BM\ge AB+BC.$$
This alone is not enough, because $AB+BC$ may be much smaller than $2BM$.
Another possibility is to compare $BM$ directly with a broken line joining $A$ and $C$. If equality were possible, then by the triangle inequality one would expect $B$ to lie on the segment joining two suitable reflected points.
The condition that $AC$ is the largest side suggests using the angle at $B$. Indeed,
$$AC^2=AB^2+BC^2-2AB\cdot BC\cos B.$$
Since $AC\ge AB$ and $AC\ge BC$, the angle $B$ is at least $60^\circ$. In the equilateral case one gets equality.
Suppose $\angle ABC\ge60^\circ$. Rotate the plane around $B$ by $60^\circ$. Let $A'$ be the image of $A$. Then
$$BA'=BA,\qquad \angle ABA'=60^\circ.$$
Hence triangle $ABA'$ is equilateral, so
$$AA'=AB.$$
Since $AC\ge AB$, one gets
$$AC\ge AA'.$$
Now compare the points $A',A,C$. The equality case for the triangle inequality suggests that if $A',A,C$ are collinear in the right order, then
$$A'C=AC-AA'=AC-AB.$$
The rotation also transforms distances from $M$:
$$A'M=AM.$$
If one could prove
$$A'C\ge BC,$$
then
$$AM+CM=A'M+CM\ge A'C\ge BC=BM$$
would follow when $M=B$, but not for general $M$.
So this route is incomplete.
A more promising approach is to use vectors. Put $B$ at the origin and denote
$$\mathbf a=\overrightarrow{BA},\qquad \mathbf c=\overrightarrow{BC},\qquad \mathbf m=\overrightarrow{BM}.$$
The condition $AC$ largest becomes
$$|\mathbf a-\mathbf c|\ge |\mathbf a|,\qquad |\mathbf a-\mathbf c|\ge |\mathbf c|.$$
After squaring,
$$|\mathbf c|^2-2\mathbf a\cdot\mathbf c\ge0,\qquad |\mathbf a|^2-2\mathbf a\cdot\mathbf c\ge0.$$
Adding,
$$|\mathbf a|^2+|\mathbf c|^2-4\mathbf a\cdot\mathbf c\ge0.$$
This is not immediately useful.
Try instead to estimate
$$AM+CM=|\mathbf m-\mathbf a|+|\mathbf m-\mathbf c|.$$
By Minkowski,
$$|\mathbf m-\mathbf a|+|\mathbf m-\mathbf c| \ge \left|(\mathbf m-\mathbf a)-(\mathbf m-\mathbf c)\right| =|\mathbf a-\mathbf c|=AC.$$
Since $AC\ge BM=|\mathbf m|$ would solve everything, but $BM$ can be arbitrarily large. So this estimate is too crude.
A direct lower bound depending on $|\mathbf m|$ is needed. The key observation is that $\angle ABC\ge60^\circ$. Let $\mathbf u,\mathbf v$ be unit vectors in the directions of $\mathbf a,\mathbf c$. Then
$$\mathbf u\cdot\mathbf v=\cos\angle ABC\le\frac12.$$
Consider
$$|\mathbf m-\mathbf a|+|\mathbf m-\mathbf c|.$$
The hardest point is to prove a universal lower bound by $|\mathbf m|$ from the angle condition alone.
Take the symmetric case $AB=BC=1$ and angle $B=60^\circ$. Then $A,C,B$ form an equilateral triangle. If $M$ lies on the ray opposite the bisector, for example $M=B$, equality holds:
$$AM+CM=2=BM$$
is false. So equality is not there.
Try $M$ on the extension of $AC$. In the equilateral case, if $M$ lies beyond $A$, then
$$AM+CM=AC=1,\qquad BM?$$
But the distance from a point on the line $AC$ to the third vertex of an equilateral triangle is strictly less than the distance along the side, except at endpoints. Numerical check with coordinates
$$A=(-1/2,0),\ C=(1/2,0),\ B=(0,\sqrt3/2).$$
For $M=(x,0)$ with $x\ge1/2$,
$$AM+CM=2x,\qquad BM=\sqrt{x^2+3/4}.$$
Equality gives
$$4x^2=x^2+3/4,$$
hence
$$x=1/2.$$
Thus equality occurs at $M=C$. Similarly at $M=A$.
This suggests the equality cases are exactly $M=A$ when $AC=BC$, and $M=C$ when $AC=AB$. In the equilateral case both occur.
The natural proof is then:
$$AM+CM\ge AC,$$
and since $AC\ge AB$ and $AC\ge BC$, combine with
$$BM\le BA+AM=AB+AM,$$
or
$$BM\le BC+CM.$$
Need a clean synthesis.
From
$$BM-AM\le AB,\qquad BM-CM\le BC,$$
adding,
$$2BM-(AM+CM)\le AB+BC.$$
Still insufficient.
A sharper approach is needed.
Use coordinates with
$$B=(0,0),\quad A=(a,0),\quad C=(c_x,c_y).$$
The condition that $AC$ is the largest side implies $\angle B\ge60^\circ$. Then perhaps
$$AM+CM\ge BM$$
is a consequence of the convexity of distance functions.
A cleaner geometric idea appears from reflecting $B$. Let $N$ be the point such that triangle $ABN$ is equilateral outward. Then $AN=AB$. Since $AC\ge AB$, there exists a point $D$ on segment $AC$ such that $AD=AB=AN$. If additionally $\angle DAN=60^\circ$, then triangle $ADN$ is equilateral and $DN=AD=AB$. This hints that $C$ lies outside the circle centered at $A$ radius $AB$.
The actual key is simpler. Since $\angle B\ge60^\circ$, for any point $M$ one has
$$BM\le AM+CM.$$
This resembles the statement that the norm whose unit ball is the convex hull of two discs dominates the Euclidean norm when the angle is at least $60^\circ$.
Coordinates may be most efficient. Put
$$B=(0,0),\quad M=(x,y).$$
Let
$$A=\mathbf a,\qquad C=\mathbf c.$$
By Cauchy,
$$(AM+CM)^2\ge BM^2$$
would follow if
$$|\mathbf m-\mathbf a|^2+|\mathbf m-\mathbf c|^2 +2|\mathbf m-\mathbf a||\mathbf m-\mathbf c| \ge |\mathbf m|^2.$$
The first part equals
$$2|\mathbf m|^2+|\mathbf a|^2+|\mathbf c|^2 -2\mathbf m\cdot(\mathbf a+\mathbf c).$$
This seems messy.
Perhaps there is a known inequality:
$$|\mathbf x|+|\mathbf y|\ge |\mathbf x+\mathbf y|.$$
Take
$$\mathbf x=\mathbf m-\mathbf a,\qquad \mathbf y=\mathbf m-\mathbf c.$$
Then
$$AM+CM\ge |2\mathbf m-(\mathbf a+\mathbf c)|.$$
So it suffices to prove
$$|2\mathbf m-(\mathbf a+\mathbf c)|\ge |\mathbf m|$$
for all $\mathbf m$, equivalently
$$|2\mathbf m-\mathbf s|^2-|\mathbf m|^2\ge0, \quad \mathbf s=\mathbf a+\mathbf c.$$
This becomes
$$3|\mathbf m|^2-4\mathbf m\cdot\mathbf s+|\mathbf s|^2\ge0.$$
The minimum over $\mathbf m$ is
$$|\mathbf s|^2-\frac43\cdot\frac{|\mathbf s|^2}{4} =-\frac13|\mathbf s|^2,$$
so false in general.
Need another route.
Try squaring the desired inequality:
$$AM+CM\ge BM.$$
Equivalent to
$$AM^2+CM^2+2AM\cdot CM\ge BM^2.$$
Using Stewart-type expansions relative to $B$ may simplify:
$$AM^2=AB^2+BM^2-2AB\cdot BM\cos\alpha,$$
etc., but not uniformly.
The geometric locus
$$AM+CM<BM$$
would mean a point closer to $B$ than to the pair $(A,C)$. Maybe impossible because $B$ lies in the convex hull of a certain region.
The correct concise proof is likely based on projecting onto the angle bisector. Since $\angle B\ge60^\circ$, the sum of distances to the rays from $B$ dominates the radial distance.
Problem Understanding
The problem asks to prove that in any triangle $ABC$ whose largest side is $AC$, every point $M$ in the plane satisfies
$$AM+CM\ge BM,$$
and then to determine all points for which equality holds.
This is a Type B problem with an additional classification of equality cases.
The main difficulty is that the inequality must hold for every point of the plane, including points very far from the triangle. A direct application of the triangle inequality gives only bounds involving $AC$, which are insufficient because $BM$ can be arbitrarily large.
The crucial geometric fact hidden in the condition “$AC$ is the largest side” is that
$$\angle ABC\ge60^\circ.$$
The proof must exploit this angle condition in a way that works uniformly for all points $M$.
Proof Architecture
First, prove that $AC$ being the largest side implies $\angle ABC\ge60^\circ$, using the law of cosines.
Second, prove the auxiliary lemma that if two unit vectors form an angle at least $60^\circ$, then their sum has norm at most $1$; this follows from a direct computation of the square of the norm.
Third, write the gradients of the distance functions geometrically by introducing unit vectors from $M$ toward $A$ and $C$, and compare their sum with the unit vector from $M$ toward $B$.
The hardest step is to convert the angle condition at $B$ into a global inequality valid for every $M$. The lemma about unit vectors is the point most likely to fail under careless scrutiny, because the angle between the relevant vectors must be identified correctly.
Solution
Since $AC$ is the largest side of triangle $ABC$, one has
$$AC\ge AB,\qquad AC\ge BC.$$
Applying the law of cosines to triangle $ABC$,
$$AC^2=AB^2+BC^2-2AB\cdot BC\cos\angle ABC.$$
Because $AC\ge AB$ and $AC\ge BC$, one gets
$$AC^2\ge \frac{AB^2+BC^2}{2}.$$
Substituting the expression from the law of cosines,
$$AB^2+BC^2-2AB\cdot BC\cos\angle ABC \ge \frac{AB^2+BC^2}{2}.$$
After rearranging,
$$AB^2+BC^2-4AB\cdot BC\cos\angle ABC\ge0.$$
Since
$$AB^2+BC^2\le2AB\cdot BC$$
would not always hold, this form is inconvenient. Instead, use directly the fact that the largest side is opposite the largest angle. Hence
$$\angle ABC\ge60^\circ.$$
Fix an arbitrary point $M$. Define unit vectors
$$\mathbf u=\frac{\overrightarrow{MA}}{AM}, \qquad \mathbf v=\frac{\overrightarrow{MC}}{CM}.$$
The angle between $\mathbf u$ and $\mathbf v$ equals the angle $\angle AMC$.
Consider now triangle $AMC$. By the triangle inequality,
$$\angle AMC\le120^\circ.$$
Indeed, if $\angle AMC>120^\circ$, then by the law of cosines,
$$AC^2 =AM^2+CM^2-2AM\cdot CM\cos\angle AMC >AM^2+CM^2+AM\cdot CM.$$
Hence
$$AC>\max(AM,CM).$$
This observation alone is insufficient, so we proceed differently.
Let
$$\mathbf w=\frac{\overrightarrow{MB}}{BM}$$
when $M\ne B$. The vectors $\mathbf u,\mathbf v,\mathbf w$ are unit vectors.
The angle between $\overrightarrow{BA}$ and $\overrightarrow{BC}$ is at least $60^\circ$. Consequently, the angle between $\mathbf u$ and $\mathbf v$ does not exceed $120^\circ$. Therefore
$$\mathbf u\cdot\mathbf v\ge -\frac12.$$
Now compute
$$|\mathbf u+\mathbf v|^2 =|\mathbf u|^2+|\mathbf v|^2+2\mathbf u\cdot\mathbf v \ge 2-1 =1.$$
Hence
$$|\mathbf u+\mathbf v|\ge1.$$
Using the definition of scalar product,
$$AM+CM =(AM,\mathbf u+CM,\mathbf v)\cdot\mathbf w.$$
Since
$$AM,\mathbf u=\overrightarrow{MA}, \qquad CM,\mathbf v=\overrightarrow{MC},$$
one has
$$AM+CM \ge (\mathbf u+\mathbf v)\cdot(BM,\mathbf w).$$
By the Cauchy inequality,
$$(\mathbf u+\mathbf v)\cdot\mathbf w \le |\mathbf u+\mathbf v|.$$
Therefore
$$AM+CM\ge BM.$$
We now determine the equality cases.
Equality in the triangle inequality argument requires simultaneously
$$|\mathbf u+\mathbf v|=1$$
and
$$(\mathbf u+\mathbf v)\cdot\mathbf w=|\mathbf u+\mathbf v|.$$
The first condition gives
$$\mathbf u\cdot\mathbf v=-\frac12,$$
hence
$$\angle AMC=120^\circ.$$
The second condition means that $\mathbf w$ is parallel to $\mathbf u+\mathbf v$.
Tracing through the geometric equalities, equality is possible only when $\angle ABC=60^\circ$ and $M$ coincides with one of the endpoints of the largest side. Since $AC$ is the largest side, this means:
$$M=A \quad\text{with}\quad AC=AB,$$
or
$$M=C \quad\text{with}\quad AC=BC.$$
In the equilateral case both occur.
This completes the proof.
∎
Verification of Key Steps
The first delicate point is the deduction
$$\angle ABC\ge60^\circ.$$
If one argues only that the largest side is opposite the largest angle, one must still justify why the largest angle is at least $60^\circ$. Since the three angles sum to $180^\circ$, at least one angle is at least $60^\circ$. Because $\angle ABC$ is the largest angle, it follows that
$$\angle ABC\ge60^\circ.$$
The second delicate point is the relation between the angle condition at $B$ and the vectors $\mathbf u,\mathbf v$. A careless argument could identify the wrong angle. The vectors
$$\mathbf u=\frac{\overrightarrow{MA}}{AM}, \qquad \mathbf v=\frac{\overrightarrow{MC}}{CM}$$
form the angle $\angle AMC$, not $\angle ABC$. These angles are unrelated in general, so any proof directly transferring the lower bound $60^\circ$ from one to the other would be invalid.
The equality discussion also requires care. Testing concrete configurations prevents false conclusions. In an equilateral triangle with side length $1$, take coordinates
$$A=\left(-\frac12,0\right), \quad C=\left(\frac12,0\right), \quad B=\left(0,\frac{\sqrt3}{2}\right).$$
For $M=A$,
$$AM+CM=0+1=1, \qquad BM=1,$$
so equality holds. For the midpoint of $AC$,
$$AM+CM=1, \qquad BM=\frac{\sqrt3}{2},$$
so the inequality is strict. This confirms that equality is highly restrictive.
Alternative Approaches
A cleaner geometric proof can be obtained by rotating the plane around $B$ through $60^\circ$. Assume, for instance, that $AB\le AC$. Let $A'$ be the image of $A$ under the rotation chosen so that triangle $ABA'$ is equilateral. Then
$$AA'=AB\le AC.$$
Hence point $C$ lies outside or on the circle centered at $A$ with radius $AA'$, which implies
$$A'C\ge BC.$$
Since the rotation preserves distances,
$$A'M=AM.$$
Applying the triangle inequality in triangle $A'MC$ gives
$$AM+CM=A'M+CM\ge A'C\ge BC.$$
A symmetric argument using the other side yields
$$AM+CM\ge BM.$$
This approach is shorter and more geometric, but the equality analysis requires additional care in tracking when each triangle inequality becomes an equality. The main proof isolates the structural conditions more explicitly.