Let $X_n$ be a bounded random process and let $T$ be a stopping time that is finite almost surely.
Suppose we have the inequality $E(X_n) \geq c$, where $c$ is a constant.
Does it follow that $E(X_n^T) \geq c$ as well?
Here $X_n^T = X_{T \wedge n}$, where $T \wedge n$ is the minimum of $T$ and $n$.
If this is correct, an argument or even a sketch of an argument would be appreciated. If this is incorrect, then a counterexample would be great; also, under what conditions do we have such an inequality for $E(X_n^T)$?
This is not correct. Let $\mathbb{P}(X_1 = 2c) = \mathbb{P}(X_1 = 0) = \frac 12$ and $X_2 = 0$ if $X_1 = 2c$ and $X_2 = 2c$ if $X_1 = 0$. Then if $T = \inf\{X_n = 0\}$ we have $T \le 2 < \infty$, but $\mathbb{E}[X_2^T] = 0$.
I'm not sure what the tightest conditions to get this inequality are, but $X$ being a supermartingale is certainly sufficient.