MathLabs

Worked solution: De Branges's proof of the Bieberbach conjecture via Milin's conjecture (1984)

Step 7 of 8: Conclusion: Milin's inequality implies ∣an∣≤n|a_n| \le n
In plain words

Since Φn(0)=0\Phi_n(0)=0 and Steps 5--6 give Φn′(t)≤0\Phi_n'(t)\le0, we have Φn(1)≤0\Phi_n(1)\le0, hence the full Milin sum is non-positive and the Lebedev--Milin inequality yields ∣an∣≤n|a_n|\le n. The argument also identifies equality: equality throughout forces a constant Loewner driving function, corresponding to rotations of the Koebe function.

Φn(1)≤Φn(0)=0  ⟹  ∑k=1n(n+1−k)k(∣γk∣2−1k2)≤0  ⟹  ∣an∣≤n\Phi_n(1) \le \Phi_n(0)=0 \;\Longrightarrow\; \sum_{k=1}^{n}(n+1-k)k\left(|\gamma_k|^2-\frac1{k^2}\right)\le0 \;\Longrightarrow\; |a_n|\le n
Detailed analysis

Since Φn(0)=0\Phi_n(0)=0 and Steps 5--6 give Φn′(t)≤0\Phi_n'(t)\le0, we have Φn(1)≤0\Phi_n(1)\le0, hence the full Milin sum is non-positive and the Lebedev--Milin inequality yields ∣an∣≤n|a_n|\le n. The argument also identifies equality: equality throughout forces a constant Loewner driving function, corresponding to rotations of the Koebe function.

Knowledge used in this step