Let n be a positive integer. The polynomial with complex coefficients P(z)=anzn+an−1zn−1+⋯+a1z+a0(an=0) satisfies: for any complex number z with ∣z∣=1, we have ∣P(z)∣≤1. Prove that for any k∈{0,1,…,n−1}, we have ∣ak∣≤1−∣an∣2.
Solution
Proof. Let ℓ∈{1,2,…,n}. For a complex number α∈C, consider Q(z)=P(z)(1+αzℓ)=αanzn+ℓ+⋯+αan−ℓ+1zn+1+(an+αan−ℓ)zn+⋯+(aℓ+αa0)zℓ+aℓ−1zℓ−1+⋯+a0. Take M>2n, then j=1∑MQ(eiM2jπ)2=j=1∑MP(eiM2jπ)2⋅(1+αeiM2jπℓ)2≤j=1∑M(1+αeiM2jπℓ)2=M(1+∣α∣2). On the other hand, j=1∑MQ(eiM2jπ)2=M⋅∣αan∣2+⋯+∣αan−ℓ+1∣2+j=ℓ∑n∣an−j+ℓ+αan−j∣2+∣aℓ−1∣2+⋯+∣a0∣2. Combining the above two estimates, we get ∣α∣2(∣an∣2+⋯+∣an−ℓ+1∣2)+j=ℓ∑n∣an−j+ℓ+αan−j∣2+∣aℓ−1∣2+⋯+∣a0∣2≤1+∣α∣2. In particular, ∣αan∣2+∣an+αan−ℓ∣2≤1+∣α∣2. Choosing α∈C such that ∣α∣=∣an∣1 and arg(an)=arg(αan−ℓ) in the above equation, we get 1+(∣an∣+∣an∣∣an−ℓ∣)2≤1+∣an∣21. Solving this gives ∣an−ℓ∣≤1−∣an∣2. The proof is complete.
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 and solution reproduced as published; topic and difficulty added by this site.