Power Dominates Logarithm

Theorem
Let $\epsilon > 0$, $B \in \N$ be arbitrary.

Then there exists $N \in \N$ such that $(\log n)^B < n^\epsilon$ for all $n > N$.

Proof
First we show that there exists $N$ such that $\log n < n^\epsilon$ for all $n > N$, i.e. set $B = 1$.

By Exponential is Strictly Increasing and Convex, the exponential is strictly increasing.

Therefore, $\log n < n^\epsilon$ if and only if $n < \exp(n^\epsilon)$.

Choose $k \in \N$ such that $k\epsilon > 2$ and $N = k!$.

By Taylor Series Expansion for Exponential Function we have:


 * $\displaystyle \exp(n^\epsilon) = \sum_{m \geq 0} \frac{n^{m\epsilon}}{m!} > \frac{n^{k\epsilon}}{k!}$

Then we have for all $n > N$:

This completes the proof when $B = 1$.

Now let $\epsilon > 0$, $B \in \N$ be arbitrary.

By the above we can find $N \in \N$ such that $\displaystyle \log n < n^{\epsilon / B}$ for all $n > N$.

Then $(\log n)^B < (n^{\epsilon / B})^B = n^\epsilon$ for all $n > N$.

This completes the proof for arbitrary $B$.