How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Discounted returns and policy values in a finite MDP
Definition
Let a finite MDP have and let be a stationary Markov policy. If , define to be the unique empty function; no path law or choice axiom is needed in this case. If , assume the Axiom of Choice and, for each , use the path law started at supplied by the policy-induced reward-state chain; write . The discounted return is
and the state value under is , where is expectation under that start-state law. If , is the unique empty function. The reward sequence bound gives , so each return is measurable and integrable. This is the start-state meaning of when that conditional expectation is defined. The definition concerns discounted infinite-horizon tasks; average-reward and undiscounted continuing models, and improper episodic tasks, are outside its scope.
The coordinate in is only a dummy initial reward; the chain's one-step kernel emits rewards in . Finite partial sums of the return are measurable, their pointwise limit is measurable, and the constant bound is an integrable majorant on the probability space.
Definition references
The finite joint reward-transition model and its bounded reward alphabet.
The Axiom of Choice, used only in the nonempty-state path-law branch.
The policy-induced homogeneous reward-state chain and its start-state path law.
The conditional one-step transition-kernel identity defining a homogeneous Markov chain.
Absolute convergence and the uniform tail bound for bounded discounted rewards.
Finite sums and scalar multiples of measurable functions are measurable.
A measurable real-valued coordinate on a probability space is a real random variable.
A pointwise limit of measurable functions is measurable.
Expectation of an integrable real random variable is its finite Lebesgue integral.
Sutton and Barto, Reinforcement Learning: An Introduction.
Kaelbling, Littman, and Cassandra, Brown Technical Report CS-96-08.
Depends on
- Finite Markov decision process with joint reward-transition law
- The Axiom of Choice
- Time-homogeneous Markov chain with transition kernel
- A finite MDP and stationary policy generate a reward-state Markov chain
- Absolute convergence and tail bound for bounded discounted rewards
- Closure properties of measurable functions used by the integral
- Random elements and real random variables
- Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable
- Dominated convergence
- Expectation of a nonnegative or integrable random variable
Used by
- First-visit Monte Carlo policy evaluation Algorithm
- Tabular on-policy Sarsa control Algorithm
- Tabular TD(0) policy prediction Algorithm
- Episodic returns, temporal-difference errors, and policy support Definition
- Expected discounted policy value is a fixed point of its Bellman operator Lemma
- Finite-episode importance sampling has the target-policy mean under support Lemma
- The optimal action value is attained by a greedy stationary policy Lemma
- Discounted episodic policy gradients from trajectory likelihoods Theorem
- Greedy policy improvement and finite policy-iteration termination Theorem
Dependency tree · two levels
58 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Richard S. Sutton and Andrew G. Barto, Reinforcement Learning: An Introduction, 2nd ed. (standard reference, not scraped)
- Leslie Pack Kaelbling, Michael L. Littman, and Anthony R. Cassandra, Planning and Acting in Partially Observable Stochastic Domains, Brown CS-96-08 (standard reference, not scraped)