Lemma 1 -- coefficient-sum geometric dichotomy
Statement
Let 0<α<π/2, let b1,…,bn−1∈C, and put
A0=1,Ak=1+b1+⋯+bk.
For every 1≤k≤n−1, at least one of the following inequalities
holds:
∣Ak−1−kbk∣≥sinα∣Ak−1∣,(1)
or
∣Ak∣≥∣Ak−1∣+cosα∣bk∣.(2)
Moreover, if (2) holds for every 1≤k≤s, where
s≤n−1, then
∣As∣>cosα(1+∣b1∣+⋯+∣bs∣).(3)
Proof of the dichotomy
Fix k and abbreviate u=Ak−1 and v=bk. If u=0, then (1) is
automatic and (2) follows from 1≥cosα. If v=0, then (1) and
(2) are both automatic. We may therefore suppose that u,v=0.
Let θ∈[0,π] be the smaller angle between the two vectors u and
v in the complex plane. Suppose first that θ≤α. Direct
expansion gives
∣u+v∣2−(∣u∣+cosα∣v∣)2=sin2α∣v∣2+2∣u∣∣v∣(cosθ−cosα)≥0.
Taking nonnegative square roots yields (2).
Now suppose that θ>α. If θ<π/2, resolve u−kv
parallel and perpendicular to the line through v:
∣u−kv∣2=(k∣v∣−∣u∣cosθ)2+∣u∣2sin2θ>∣u∣2sin2α.
If instead θ≥π/2, then
Re(uv)≤0, and hence
∣u−kv∣2=∣u∣2+k2∣v∣2−2kRe(uv)≥∣u∣2>∣u∣2sin2α.
Thus (1) holds whenever θ>α, completing the dichotomy.
Iteration
If (2) holds for k=1,…,s, repeated application starting from
∣A0∣=1 gives
∣As∣≥1+cosα(∣b1∣+⋯+∣bs∣).
Because 0<cosα<1, the right-hand side is strictly greater than
cosα(1+∣b1∣+⋯+∣bs∣),
which proves (3).
Source scope
This is Lemma 1 on printed pp. 210--211, physical PDF pp. 224--225, of the
published volume scan.
The page's (1) and (2) are the print's (3) and (4), and its (3) is the
print's unlabeled closing assertion.
In the print the bk are the coefficients of the polynomial with roots
z2,…,zn fixed in the proof of Theorem 1; the argument uses no
property of them, so the lemma is recorded here for arbitrary complex
b1,…,bn−1.
The print also notes (p. 211) that the geometric step can be replaced by
its Lemma 2 applied with A=k and z=bk/(1+b1+⋯+bk−1).
The source summarizes the first part as an elementary geometric
consideration; the squared-distance calculations above make both angular
regions and all degenerate cases explicit.
Used by.
[[analysis/biro_1994_problem_turan_concerning_sums_powers_complex/theorem_1|Theorem
1]].
Bears on. Problem 519.