The finite-range claim in degree seven #
The first odd degree, and the prototype for the general odd-degree argument. Here the
exponent (n-4)/2 is 1 + 1/2, so Sendov.integral_rpow_le replaces the square root by
the average of the moments of Q and Q ^ 2, after which the argument runs exactly as in
degree six.
With M 7 = 6, A 7 α = 1 - α/3 and c 7 α = (18 - α²)/(6(3+α)):
∫ t in 0..1, t³ (Q + Q²)/2 dt = 1/4 - 3c/5 + (4c² + 3A)/12 - 2cA/7 + A²/16;- the resulting upper bound for
R 7 αis1 - P α / (2592 (3+α)³)withP α = -5α⁶ - 222α⁵ - 2619α⁴ + 17388α³ + 19413α² - 5022α + 33291; - feasibility enters only through
Sendov.alpha_le_half_M, which givesα ≤ 3.
P is positive up to α = 5.338, so once again there is ample room. The exact feasible
range is α ≤ 2.710, cut out by -α⁴ - 12α³ + 108α ≥ 0, but that is not needed. Since
the odd-degree bound is an inequality rather than an identity, the loss it incurs is real
but small: the exact maximum of R 7 α over the feasible range is about 0.598, against
0.664 for this upper bound.
The upper bound for R 7 α obtained from Sendov.integral_seven.