Canonical: https://knowlpedia.com/asymptotics/logarithmic-loss-absorption/

# Absorbing logarithmic losses into a power

Every fixed power of a logarithm grows more slowly than any negative power of a small parameter.

For fixed \(a>0\) and \(m\ge0\),
\[
\varepsilon^a(1+|\log\varepsilon|)^m\longrightarrow0
\qquad(\varepsilon\downarrow0).
\]
Consequently, for \(b<a\),
\[
\varepsilon^a(1+|\log\varepsilon|)^m=o(\varepsilon^b).
\]
The [logarithmic](https://knowlpedia.com/real-analysis/natural-logarithm/) factor can be absorbed by spending an arbitrarily small positive amount of power.

## Proof and uniformity

Put \(s=-\log\varepsilon\). The expression becomes \(e^{-as}(1+s)^m\). Choose an integer \(n>m\) and use \(e^{as/2}\ge(as/2)^n/n!\); the resulting bound tends to zero. Constants depend on \(a,m\). The conclusion does not give a common threshold for unbounded \(m\) without extra information.
