This basic bound on $e^x$ occasionally pops up in my reading as a relatively tight bound for small positive values of $e^x$, but I have been unable to prove it/find a proof of it. One paper I read says that it follows from "elementary calculus," but I have not yet seen how.
What I've tried:
Near cousins like $1 + x \le e^x$ are easy to prove by differentiating the difference $f(x) = e^x - (1 + x)$ and showing that it has a global minimum at $f(0) = 0$.
When I try this approach for $e^x \le 1 + x + x^2$ (when $x <$ some constant $C$ that presumably works out to 1.79 or thereabouts), however, I arrive at
$$f'(x) = 1 + 2x - e^x = 0,$$
which I suppose I could solve with Lambert's W—but I was expecting something cleaner.
This question shows how to prove a similar inequality whose critical points also lead to a product logarithm expression (namely $e^x > 1 + x^2$) by carefully inspecting the second derivative. But that solution doesn't seem to apply here.
Edit:
This question shows that $e^x \le 1 + x + x^2$ for all $x < ln(2)$, which helps. An answer there solves $f'(x) = 0$ by guessing $x=0$ and showing that it holds (which is cleaner than using Lambert's W).
The puzzle I still can't solve is how to show that the bound holds more generally, up to $x < 1.79$.
I can see that this is true by plotting $f(x)$ in a graphing calculator. Showing that it holds for the portion of the graph where $f(x)$ is positive and $x > ln(2)$ and (thus) $f''(x)$ is negative still has me stumped!
