Maths Olympiad Prep

Library / Romanian Mathematical Olympiad /32 of 275

Romanian Mathematical Olympiad

Algebra Difficulty 5.0 AIME, harder Prove it Romania

Consider v,wv, w two distinct non-zero complex numbers. Prove that
∣zw+wˉ∣≤∣zv+vˉ∣, |zw + \bar{w}| \leq |zv + \bar{v}|,
for any z∈Cz \in \mathbb{C}, ∣z∣=1|z| = 1, if and only if there exists k∈[−1,1]k \in [-1, 1] such that w=kvw = kv.

Solution

If there exists k∈[−1,1]k \in [-1, 1] such that w=kvw = kv, the inequality is obvious. Conversely, let t>1t > 1 such that w−tv≠0w - tv \ne 0. Setting
z=tvˉ−wˉw−tv, z = \frac{t\bar{v} - \bar{w}}{w - tv},
we have ∣z∣=1|z| = 1 and moreover
zw+wˉ=t(wvˉ−wˉv)w−tv, zw + \bar{w} = \frac{t(w\bar{v} - \bar{w}v)}{w - tv},
zv+vˉ=wvˉ−wˉvw−tv, zv + \bar{v} = \frac{w\bar{v} - \bar{w}v}{w - tv},
implying
∣zw+wˉ∣=t∣zv+vˉ∣. |zw + \bar{w}| = t |zv + \bar{v}|.
As t>1t > 1, the given inequality yields ∣zw+wˉ∣=∣zv+vˉ∣=0|zw + \bar{w}| = |zv + \bar{v}| = 0, so wvˉ−wˉv=0w\bar{v} - \bar{w}v = 0, therefore wv=k∈R\frac{w}{v} = k \in \mathbb{R}.
Plugging back in the initial condition we derive that k∈[−1,1]k \in [-1, 1], as needed.

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.