Prove that if non-zero complex numbers α1,α2,α3 are distinct and noncollinear on the plane, and satisfy α1+α2+α3=0, then there holds i=1∑3(∣αi∣∣αi+1−αi+2∣(∣αi+1∣1+∣αi+2∣1−∣αi∣2))≤0(⋆) where α4=α1,α5=α2. Verify further the sufficient and necessary condition for the equality holding in (★).
Solution
Consider the triangle A1A2A3 having these three points as vertices, where A1(α1),A2(α2),A3(α3). By the given condition we know that its centroid O is at the origin; let si=∣αi+1−αi+2∣ be the side length of Ai+1Ai+2. Then, mi=23∣αi∣ is the length of the median to Ai+1Ai+2. Thus (*) is equivalent to ∑i=13misi(mi+11+mi+21−mi2)≤0, which after rearrangement gives the equivalent inequality: i=1∑3mimi+1si+si+1≤2i=1∑3misi,(∗∗) where (s4,m4,s5,m5)=(s1,m1,s2,m2). We will prove that the following inequality holds: mimi+1si+si+1≤misi+mi+1si+1,i=1,2,3.(#) Proof of (\#): First, squaring both sides of inequality (\#) and rearranging, we obtain an equivalent inequality mimi+1(si2+si+12)≤mi+12si2+mi2si+12,i=1,2,3.(#1) We will show that equality in (\#1) holds only when si=si+1. Step 1. Note that mi=22(si+12+si+22)−si2. We first give an upper bound estimate for mimi+1: (4mimi+1)2=(2si+12+2si+22−si2)(2si+22+2si2−si+12)=(4si+24+si+12si2)+2(si2+si+12)si+22−2(si+12−si2)2=(2si+22+si+1si)2+2(si−si+1)2si+22−2(si+12−si2)2=(2si+22+si+1si)2+2(si−si+1)2(si+2+si+1+si)(si+2−si+1−si)≤(2si+22+si+1si)2. Therefore, 4mimi+1≤2si+22+si+1si(#2) (equality holds if and only if si=si+1.) Step 2. From (\#2) we obtain 4mi+12si2+4mi2si+12−4mimi+1(si2+si+12)≥(2si+22+2si2−si+12)si2+(2si+12+2si+22−si2)si+12−(2si+22+si+1si)(si2+si+12)=(2si2−si+12)si2+(2si+12−si2)si+12−si+1si(si2+si+12)=2(si2−si+12)2−si+1si(si−si+1)2=(si−si+1)2[2(si+si+1)2−si+1si]≥0. This establishes (\#1). Hence we also obtain (#). Since (**) is obtained by the cyclic sum of (#), and () is equivalent to (**), we thus obtain (*), where equality holds only when α1,α2,α3 are the vertices of an equilateral triangle with centroid at the origin O (for example: αi+1/αi=e2iπ−1/3,i=1,2.)
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement translated into English from zh; metadata (topic, difficulty) added by this project.