Exponential domination of polynomials
ID: exponential-domination-of-polynomials
For every real number and nonnegative integer , as . Thus every fixed polynomial grows more slowly in magnitude than a positive-rate exponential function, regardless of the polynomial's coefficients.
A short proof comes from the power series of the exponential function. For , , soApply this estimate term by term to a polynomial. For example, eventually tends to zero even though it can be extremely large at moderately sized . This is an asymptotic statement, not a claim that the exponential function is larger at every positive input. It explains why exponential tails have finite moments of every fixed order and why the proof that the exponential function is a transcendental function works.
New to topics? Read the docs here!