Using the setup of lemma 4.14.10 and the variables from its proof, we derive a degree- polynomial upper bound for . We retain the parameter from eq. 4.72.
The degree- construction leading to eq. 4.73 extends to two positive touching points. We derive these points from the moments and check the binomial corrections separately.
The entries have vanishing odd moments, and every positive even moment is . To compute the moments of the sum, let . For each positive integer , independence and the binomial expansion give
Here , with zeroth moment equal to . For example, the surviving terms of the sixth moment have exponent patterns , , and , so
The second and fourth moments are given in eq. 4.71. Collecting the terms above, and applying the same recurrence through order eight, gives the remaining exact identities
| (A.1) |
We retain these identities rather than replacing every moment by an upper bound: the coefficients of the polynomial alternate in sign.
We use the polynomial form in eq. 4.75, with coefficients determined below. The terms in eqs. 4.71 and A.1 depending only on are
These are not the full binomial moments. We first seek positive weights and points such that
| (A.2) |
Matching coefficients requires
Each of the two points satisfies . Multiplying by further powers and taking the same weighted sums eliminates the weights:
Substitution of the four values of gives
Therefore the touching points are
| (A.3) |
The first two moment equations then give
Simplifying, all three weights are positive:
For a polynomial satisfying , the right-hand side of eq. A.2 is smallest when the polynomial equals the exponential at and . Applying the same tangency condition as in eq. 4.73, we impose
These four equations determine the four coefficients. The construction below also verifies that their solution is an upper bound on the whole nonnegative axis.
First construct a cubic that matches the two values and two slopes. Write and , and start at the left point:
The two conditions at already hold. The conditions at are
Solving this two-by-two system gives
Expanding , we obtain
The quartic term and its derivative both vanish at the touching points. We can therefore add a multiple of this term without changing any of the four conditions. Choose that multiple to make the value at equal to :
Using the sum and product of the touching points,
Consequently the coefficients in the original variable are
| (A.4) |
All these coefficients depend on the same free parameter through ; no numerical value of has been fixed.
The interpolation remainder has one factor for matching the value at and two factors for matching the value and slope at each positive point. For each away from the touching points, the Hermite remainder is
for some in the interval containing . At the touching points equality holds by construction. Thus for every and .
We will also need three coefficient inequalities. First, applying the cubic remainder to at gives
so . The numerator in eq. 4.74 was shown to be nonnegative. Applying this with , the cubic coefficient satisfies
Therefore
| (A.5) |
Finally, subtract the endpoint derivatives of the cubic:
Substituting eq. A.4 gives
| (A.6) |
Each inequality holds throughout , including when is identically .
Substitution of the exact moments gives
where
The coefficient inequalities proved above imply
Hence
We use two inequalities between the coefficient sums. Term by term,
and consequently . Also the weights sum to . Jensen’s inequality for the cube function on nonnegative inputs gives
Thus . Since , these two inequalities preserve the upper-bound direction. Writing , we obtain
This proves the comparison with the moment terms depending only on , uniformly in and throughout .
Since and , eq. A.2 now yields
| (A.7) |
This holds for every . The moment matching minimizes the expression among degree- polynomial upper bounds. The separate argument for is what permits its use for the actual binomial variables.
Substituting eq. A.7 into eq. 4.69, and using , bounds the small-coordinate probability by
We minimize this expression including its exponential prefactor. Put and , so . Since , the sign of is the sign of
Both , so
Moreover and . Thus has exactly one zero, which is the unique global minimum of on the nonnegative axis. Numerically,
The rational choice gives essentially the same value:
For a certified inequality, rational interval bounds for and the exponential give
The numerical minimum remains slightly above , and satisfies the target in lemma 4.14.10.