Let $X$ be a random variable with $|X|\le1$, and $\mathcal{A}$ be a $\sigma$-algebra. What is an upper bound for $|E(X|\mathcal{A})-E(X)|$?
Existing results:
It has been known that $E|E(X|\mathcal{A})-E(X)|\le 2\alpha(\sigma(X),\mathcal{A})$, where $\alpha(\sigma(X),\mathcal{A})$ is the $\alpha$ mixing coefficient between $\sigma(X),\mathcal{A}$, and the $\sigma(X)$ is the $\sigma$-algebra generated by $X$. This result shows that $|E(X|\mathcal{A})-E(X)|=O_P(\alpha(\sigma(X),\mathcal{A}))$.
In practice, the above upper bound is too loose, and we need an exponential type upper bound to strengthen it. Suppose we can prove the following
$$
E\psi(|E(X|\mathcal{A})-E(X)|/C)\le\alpha(\sigma(X),\mathcal{A}),
$$
where $\psi(x)=\exp(x^2)-1$. Then one can argue that
$$
|E(X|\mathcal{A})-E(X)|=O_P(\sqrt{\log(1+\alpha(\sigma(X),\mathcal{A})}).
$$
Clearly, this largely improve the first upper bound to a sharper level.
My question is how to prove this?