A continuously differentiable function $f$ is $\beta$-smooth if the gradient is $\beta$-Lipschitz: $$ || \nabla f(x) - \nabla f(y)|| \leq \beta ||x-y||, $$ where $\nabla f(\cdot)$ denotes the gradient vector of $f$ at a given point, $\beta$ is a scalar, and $||\cdot||$ is an $\ell_2$-norm.
In the book Convex Optimization: Algorithms and Complexity by Sebastien Bubeck it is said that:
The above Lipschitz condition implies (if the function is twice differentiable) the eigenvalues of the Hessians being smaller than $\beta$.
I cannot see how.