The integral is $\int\limits_{p(x) > 0}p^{-\lambda + 1}(x) \, \left| \ln p(x) \right|^k \, dx$.
Assumptions:
- $\lambda > 0, k > 0$
- $\int\limits_{p(x) > 0}p^{-\lambda + 1}(x) \, dx < \infty$
- $p$ is a probability density function satisfying $\int p(x) \, dx = 1$.
This comes from the first few paragraphs in this paper on a topic in information theory -- http://arxiv.org/pdf/1204.3661.pdf (see eq. 2.4), which states that "it is not hard to see that ..." The paper explains the exact context in a few lines around eq. 2.1-2.5. The claim doesn't seem obvious to me. In fact, I am not 100% confident it is even always true. Perhaps I'm missing an obvious connection that makes this clear ... Please view the specified portion of the reference before attempting to answer.
Below is the detailed proof of the integral $\int\limits_{p(x)>0} p^{-\lambda+1}(x) \| \ln p(x) \|^k dx$ is finite for any positive integer k under the assumption that
According to the definition of $\lambda^*$, for any $\lambda$ strictly less than $\lambda^*$, $\int p^{-\lambda+1}(x) dx < +\infty$. Also, the claim $\int\limits_{p(x)>0} p^{-\lambda+1}(x) \| \ln p(x) \|^k dx$ is finite is only for any $\lambda$ strictly less than $\lambda^*$.
First, we can show that $B(\lambda) = \int\limits_{p(x) \geq 1} p^{-\lambda+1}(x) dx$ and $ C(\lambda) = \int\limits_{0 < p(x) < 1} p^{-\lambda+1}(x) dx$ are both finite for $0 < \lambda < \lambda^*$. Let $A (\lambda) = \int\limits_{p(x)>0} p^{-\lambda+1}(x) dx$ be a fintie number depending on $\lambda$.
$$ B(\lambda) + C(\lambda) = A(\lambda)$$ $$ 0 \leq B(\lambda) = \int\limits_{p(x) \geq 1} p^{-\lambda+1}(x) dx = \int\limits_{p(x) \geq 1} p^{-\lambda}(x) p(x) dx \leq \int\limits_{p(x) \geq 1} p(x) dx \leq \int\limits_{p(x) > 0} p(x) dx = 1$$
Therefore,
$$ A(\lambda)-1 \leq C(\lambda) \leq A(\lambda)$$
Now given a $\lambda$ and a $k$, notice that $\ln y \leq \frac{1}{\alpha} y^{\alpha}$ when $y \geq 1$ and $\ln 1/y \leq \frac{1}{\alpha} y^{-\alpha}$ when $0 < y < 1$ for any positive $\alpha$. First, let $\alpha = \frac{\lambda}{2k}$. Consequently,
\begin{align} \int\limits_{p(x) \geq 1} p^{-\lambda+1}(x) \| \ln p(x) \|^k dx &\leq \int\limits_{p(x) \geq 1} p^{-\lambda+1}(x) \left( \frac{2k}{\lambda} \right)^k p^{\frac{\lambda}{2}}(x) dx \\ &= \left( \frac{2k}{\lambda} \right)^k \int\limits_{p(x) \geq 1} p^{-\frac{\lambda}{2}+1}(x) dx \\ &= \left( \frac{2k}{\lambda} \right)^k B(\lambda/2) \end{align}
Then, let $\alpha = \frac{\lambda^* - \lambda}{2k}$,
\begin{align} \int\limits_{0 < p(x) < 1} p^{-\lambda+1}(x) \| \ln p(x) \|^k dx &= \int\limits_{0 < p(x) < 1} p^{-\lambda+1}(x) \left( \frac{2k}{\lambda^* - \lambda} \right)^k \ln^{k} \frac{1}{p(x)} dx \\ &\leq \left( \frac{2k}{\lambda^* - \lambda} \right)^k \int\limits_{0 < p(x) < 1} p^{-\lambda+1}(x) p^{-\frac{\lambda^* - \lambda}{2}}(x) dx \\ &= \left( \frac{2k}{\lambda^* - \lambda} \right)^k \int\limits_{0 < p(x) < 1} p^{-\frac{\lambda^*+\lambda}{2}+1}(x) dx \\ &= \left( \frac{2k}{\lambda^* - \lambda} \right)^k C \left(\frac{\lambda^*+\lambda}{2}\right) \end{align}
Consequently,
$$\int\limits_{p(x)>0} p^{-\lambda+1}(x) \| \ln p(x) \|^k dx \leq \left( \frac{2k}{\lambda} \right)^k B(\lambda/2) + \left( \frac{2k}{\lambda^* - \lambda} \right)^k C\left(\frac{\lambda^*+\lambda}{2}\right)$$
Since $0 < \lambda < \lambda^*$, so are $\frac{\lambda}{2}$ and $\frac{\lambda^*+\lambda}{2}$, and therefore both $B(\lambda/2)$ and $C(\frac{\lambda^*+\lambda}{2})$ are finite. And the proof is finished.
Notice that the claim never mentions what whould happen if $\lambda = \lambda^*$. In fact, the counter example just shows that $\int\limits_{p(x)>0} p^{-\lambda+1}(x) \| \ln p(x) \|^k dx$ can be unbounded when $\lambda = \lambda^*$. Indeed, it can be shown that $\lambda^* = 2$ for $p(x)$ given by the counter example. To see that, just try to bound $\int\limits p^{-\lambda+1}(x) dx$ for any $\lambda > 2$ and you will see that no matter how close $\lambda$ is with $2$, $\int\limits p^{-\lambda+1}(x) dx$ is always unbounded.