Let $(\Omega, F, P)$ be our probability space. Denote $\Omega^{(n)}$ to be a partition of $\Omega$ with $n$ components/sets such that each component has equal probability measure. Denote the resulting generated sigma-field by $\sigma(\Omega^{(n)})$. Suppose $X$ is an $\mathbb{R}^d$-valued random variable and $f:\mathbb{R}^d\to\mathbb{R}$ is a convex function.
Is the following true? $$ \mathbb{E}[f(\mathbb{E}[X:\sigma(\Omega^{(n)})])] \leq \mathbb{E}[f(\mathbb{E}[X:\sigma(\Omega^{(n+1)})])] $$
I've done some numerical experiments and it seems to suggest the above is true. However, I can't seem to find any reference on the internet.
It seems that simple counterexamples abound. You might want to check the following: Assume that $\{A,B,C,D\}$ is a partition of $\Omega$ with $$P(A)=P(D)=\tfrac13\qquad P(B)=P(C)=\tfrac16$$ and consider the equipartitions $$\Omega^{(2)}=\{A\cup B,C\cup D\}\qquad\Omega^{(3)}=\{A,B\cup C,D\}$$ and the random variable $$X=3\mathbf 1_B-9\mathbf 1_C$$ Then $$E(X\mid\sigma(\Omega^{(2)}))=\mathbf 1_{A\cup B}-3\mathbf 1_{C\cup D}\qquad E(X\mid\sigma(\Omega^{(3)}))=-3\mathbf 1_{B\cup C}$$ hence $$E(E(X\mid\sigma(\Omega^{(2)}))^2)=5\qquad E(E(X\mid\sigma(\Omega^{(3)}))^2)=3$$