Bellman equation derivation

From Machinelearning
Revision as of 00:21, 1 September 2019 by IssaRice (talk | contribs)

Bellman equation for .

We want to show for all states .

The core idea of the proof is to use the law of total probability to go from marginal to conditional probabilities, and then invoke the Markov assumption.

The law of total probability states that if is an event, and are events that partition the sample space, then .

For fixed event , the mapping is another valid probability measure. So the law of total probability states that .