The transition operator of an additive random walk preserves convex functions: apply their convexity inequality to and , then integrate. The pointwise maximum of convex functions preserves convexity too, so induction proves convexity of the Snell envelope Bellman functions. Expectations are allowed to be extended-valued until finiteness is justified. Integrability of rewards on a finite horizon implies finiteness of these functions at every state for , by integrability of translated convex random-walk rewards and the bound . At time zero only is observed; if is infinite elsewhere, its finite value at zero has a constant convex extension representing the same Snell envelope. Full statewise Bellman recursion at time zero requires an additional translated-integrability hypothesis.
Articles by others on the same topic
There are currently no matching articles.