I was solving the following problem (# 19-46 in Spivak's Calculus, 4th ed.):
Suppose that $\dfrac{f(x)}{x}$ is integrable on every interval $[a,b]$ for $0<a<b$, and that $\lim_{x\to 0}f(x)=A$ and $\lim_{x\to \infty}f(x)=B$. Prove that for all $\alpha, \beta>0$ we have $$\int_0^\infty \frac{f(\alpha x)-f(\beta x)}{x}dx = (A-B)\log\frac\beta\alpha.$$
Having not seen this exercise before, it struck me strange that the improper integral $\int_0^c\frac{f(\alpha x)-f(\beta x)}{x}dx$ must exist. The comparison theorem then implies that $f(\alpha x)-f(\beta x)$ must go to zero faster than $\frac{1}{\log x}$. On the other hand, I claim we can make $f(\alpha x)-f(\beta x)$ go to zero slower than $\frac{1}{\log^{1+\epsilon}x}$, for instance if we choose $f:x\mapsto \dfrac{1}{\log^\delta(x)}$, for $\delta$ small.
Since we can make the sum $\sum\limits_i (f(\alpha x_i)-f(\beta x_i))$ telescope if we choose $x_i = \left( \dfrac{\alpha}{\beta} \right)^i$ (supposing WLOG $\beta> \alpha$), the previous observation is closely related to the fact that $\sum\limits_i \dfrac{1}{\log(\omega^i)}$ does not converge for $0<\omega<1$, but $\sum\limits_i \dfrac{1}{\log^{1+\epsilon}(\omega^i)}$ does converge.
It's strange that $\dfrac{1}{\log x}$ is like the lower "speed limit" for how fast $f(\alpha x)-f(\beta x)$ can go to zero. Is there an intuitive reason why this is so, other than the ones I just pointed out? What are results for other functions $f(\phi(x))-f(\psi(x))$, where $\lim_{x\to 0}\phi(x)=\lim_{x\to 0}\psi(x)=0$?
Not really. Since $f$ was not assumed monotone, the integrand need not have constant sign, and therefore, the comparison theorem need not apply. Another thing to keep in mind is that the integral here is an improper Riemann integral. The function $$ \frac{f(\alpha x)-f(\beta x)}{x} $$ need not be Lebesgue integrable on $[0,1]$.
Indeed, take $\alpha=2$, $\beta=1$. Pick a sequence $c_n$ converging to $0$. Define $f(x) = c_n$ when $2^{1-2n}\le x< 2^{2-2n}$ and $f(x)=0$ otherwise. Then $|f(2x)-f(x)| =|c_n|$ when $2^{-2n}\le x<2^{2-2n}$. Note that $|f(2x)-f(x)|$ can tend to zero as slowly as we want. Consequently, $$ \int_0^1 \frac{|f(2x)-f(x)|}{x}\,dx \ge \sum_n \frac{2^{2-2n}-2^{-2n}}{2^{2-2n}} |c_n| = \frac34 \sum_n |c_n| $$ can easily diverge.
Even when $f$ is monotone (hence the integrand has constant sign and is Lebesgue integrable), it is incorrect to conclude
Rather, you can conclude that $|f(\alpha x)−f(\beta x)|$ cannot be always bounded from below by a multiple of $1/|\log x|$. This still allows $|f(\alpha x)−f(\beta x)|$ to be not-very-small at times. I'll modify the above example: pick a sequence of indices $n_k$. Let $c_n = 2^{-k}$ when $n_k\le n<n_{k+1}$. Define $f(x) = c_n$ when $2^{-n}\le x< 2^{1-n}$. Then $f$ is monotone. On the interval $2^{-n}\le x< 2^{1-n}$ we have $$f(2x)-f(x) =\begin{cases} 2^{-k-1},\quad &n=n_k \\ 0 & \text{otherwise}\end{cases} $$
Note that $x$ can be much smaller than $2^{-k-1}$ since we can make $n_k$ grow as fast as we want.