If we have two discrete RVs, X, and Y. How can we show:
$$\sum_{x,y} p(x|y)p(y|x) \geq 1.$$
The question goes further with finding a sufficient and necessary condition for equality.
My attempt: For equality, assuming that X, Y are independent will enable us to sum over each variable PMF and get exactly one. However, I am stuck with showing how the inequality holds in general, and I appreciate any hints and tips.
Another similar approach, exploiting the convexity of the logarithmic function, we can write
\begin{equation} \begin{aligned} \log\left(\mathbb{E}\left[\frac{p(y|x)}{p(y)}\right]\right) &\underbrace{\geq}_{\text{Jensen's inequality}} \mathbb{E}\left[\log\left(\frac{p(x,y)}{p(x)p(y)}\right)\right]\\ &\underbrace{=}_{D(p(x,y)||p(x)p(y))}I(X;Y) \geq 0, \end{aligned} \end{equation} such that $I(X;Y) = H(X)-H(X|Y)$ is the mutual information. For equality, $I(X;Y) = 0$, i.e., $X$ and $Y$ are independent.