ScalingStacks

Proof. [04BG]

Original official author HTML, exact retained edition. Historical TeX conversion verdicts remain unchanged. Cited-edition alignment and mathematical self-containment are not assessed.

Complete original source context · Original author HTML

Proof.

We argue by induction. The N=2N=2 case is implied by Lemma 3.25. In general, we view ∑1N|zi|\sum_{1}^{N}|z_{i}| as a function of the imaginary parts of z1,…​zNz_{1},\ldots z_{N} subject to the constraints. Clearly this function achieves its minimum for some (zi)(z_{i}). If z1=a1z_{1}=a_{1}, then we can conclude by induction. Otherwise Im​z1>Im​a1\text{Im}z_{1}>\text{Im}a_{1}. If arg⁡z2<arg⁡z1\arg z_{2}<\arg z_{1}, then we can fix z1+z2z_{1}+z_{2} and decrease ∑12|zi|\sum_{1}^{2}|z_{i}| by Lemma 3.25, which would contradict minimality. Proceding with this argument, we are forced to have

arg⁡z1≤arg⁡z2≤…≤arg⁡zN,\arg z_{1}\leq\arg z_{2}\leq\ldots\leq\arg z_{N},

whence

arg∑1Nzi≥argz1>arga1>arg∑1Nai\arg\sum_{1}^{N}z_{i}\geq\arg z_{1}>\arg a_{1}>\arg\sum_{1}^{N}a_{i}

which contradicts ∑1Nzi=∑1Nai\sum_{1}^{N}z_{i}=\sum_{1}^{N}a_{i}. ∎

Original mathematics by the credited authors. Source-backed reader collection; mathematical self-containment is not assessed.