Maths Olympiad Prep

Library / Romanian Mathematical Olympiad - Final Round /8 of 37

Romanian Mathematical Olympiad - Final Round

Geometry Difficulty 5.5 AIME, harder Prove it Romania

Consider the distinct complex numbers a,b,c,da, b, c, d. Prove that the following are equivalent:
i) For any z∈Cz \in \mathbb{C} we have ∣z−a∣+∣z−b∣≥∣z−c∣+∣z−d∣|z-a| + |z-b| \ge |z-c| + |z-d|.
ii) There is t∈(0,1)t \in (0, 1) such that c=ta+(1−t)bc = ta + (1-t)b and d=(1−t)a+tbd = (1-t)a + tb.

Solution

ii)   ⟹  \implies i): We have ∣z−c∣=∣z−ta−(1−t)b∣≤t∣z−a∣+(1−t)∣z−b∣|z-c| = |z-ta - (1-t)b| \le t|z-a| + (1-t)|z-b|. Analogously, ∣z−d∣≤(1−t)∣z−a∣+t∣z−b∣|z-d| \le (1-t)|z-a| + t|z-b|. Summing up, the conclusion follows.

i)   ⟹  \implies ii): For z=az = a we get ∣a−b∣≥∣a−c∣+∣a−d∣|a-b| \ge |a-c| + |a-d|, and for z=bz = b, ∣a−b∣≥∣b−c∣+∣b−d∣|a-b| \ge |b-c| + |b-d|. Summing up, 2∣a−b∣≥∣a−c∣+∣a−d∣+∣b−c∣+∣b−d∣2|a-b| \ge |a-c| + |a-d| + |b-c| + |b-d|.
But ∣a−c∣+∣b−c∣≥∣a−b∣|a-c| + |b-c| \ge |a-b|, ∣a−d∣+∣b−d∣≥∣a−b∣|a-d| + |b-d| \ge |a-b|. It follows that all inequalities are in fact equalities. In particular ∣a−c∣+∣b−c∣=∣a−b∣|a-c| + |b-c| = |a-b| giving the existence of t1∈(0,1)t_1 \in (0, 1) such that c=t1a+(1−t1)bc = t_1a + (1-t_1)b. In the same way, there is t2∈(0,1)t_2 \in (0, 1) such that d=t2a+(1−t2)bd = t_2a + (1-t_2)b.
We shall show that t1+t2=1t_1 + t_2 = 1. We have ∣a−c∣+∣b−c∣=∣a−b∣=∣b−c∣+∣b−d∣|a-c| + |b-c| = |a-b| = |b-c| + |b-d|, implying ∣a−c∣=∣b−d∣|a-c| = |b-d|. These give (1−t1)∣a−b∣=t2∣b−a∣(1-t_1)|a-b| = t_2|b-a|, which concludes the proof.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.