Maths Olympiad Prep

Library / India — Team Selection Test /14 of 77

India — Team Selection Test, 2009

Geometry Difficulty 5.3 AIME, harder Prove it India

Let v1,v2,…,vnv_1, v_2, \dots, v_n be n(≥2)n (\ge 2) unit vectors in the plane. Prove that there exist λ1,λ2,…,λn\lambda_1, \lambda_2, \dots, \lambda_n, each equal to +1+1 or −1-1, such that
∣λ1v1+λ2v2+⋯+λnvn∣≤2. |\lambda_1 v_1 + \lambda_2 v_2 + \dots + \lambda_n v_n| \le \sqrt{2}.
(Here ∣v∣|v| denotes the length of the vector vv.)

Solution

We prove the result for a more general class of vectors having magnitude not exceeding 11. We use induction on nn. If n=2n = 2, parallelogram law gives
∣v1+v2∣2+∣v1−v2∣2=2(∣v1∣2+∣v2∣2)≤4. |v_1 + v_2|^2 + |v_1 - v_2|^2 = 2(|v_1|^2 + |v_2|^2) \le 4.
Hence either ∣v1+v2∣≤2|v_1 + v_2| \le \sqrt{2} or ∣v1−v2∣≤2|v_1 - v_2| \le \sqrt{2}, giving the result. Suppose n≥3n \ge 3 and the result is true for n−1n-1 vectors. Consider nn vectors v1,v2,…,vnv_1, v_2, \dots, v_n such that ∣vj∣≤1|v_j| \le 1, for 1≤j≤n1 \le j \le n. Among the six vectors ±v1,±v2,±v3\pm v_1, \pm v_2, \pm v_3, there are two vectors, the angle θ\theta between which is ≤60∘\le 60^\circ. If we denote these two by u1u_1 and u2u_2, we have
∣u1−u2∣2=∣u1∣2+∣u2∣2−2∣u1∣∣u2∣cos⁡θ≤2−2cos⁡θ≤2−2cos⁡60∘=1. \begin{aligned} |u_1 - u_2|^2 &= |u_1|^2 + |u_2|^2 - 2|u_1||u_2| \cos \theta \\ &\le 2 - 2 \cos \theta \\ &\le 2 - 2 \cos 60^\circ = 1. \end{aligned}
Thus ∣u1−u2∣≤1|u_1 - u_2| \le 1. After renaming if necessary, we can take u1−u2=λ1′v1+λ2′v2u_1 - u_2 = \lambda_1' v_1 + \lambda_2' v_2. Now consider n−1n-1 vectors u1−u2,v3,…,vnu_1 - u_2, v_3, \dots, v_n. Induction hypothesis applies to this set of vectors. We therefore get
∣λ′(λ1′v1+λ2′v2)+λ3v3+⋯+λnvn∣≤2. |\lambda'(\lambda_1' v_1 + \lambda_2' v_2) + \lambda_3 v_3 + \dots + \lambda_n v_n| \le \sqrt{2}.
Taking λj=λ′λj′\lambda_j = \lambda'\lambda'_j, for j=1,2j = 1, 2, we get
∣λ1v1+λ2v2+λ3v3+⋯+λnvn∣≤2. |\lambda_1 v_1 + \lambda_2 v_2 + \lambda_3 v_3 + \dots + \lambda_n v_n| \le \sqrt{2}.

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.