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.
The optimal action value is attained by a greedy stationary policy
Statement
Assume the Axiom of Choice. Let a finite MDP have nonempty finite state set and discount , and let be its Bellman optimality operator. For a fixed initial pair , an admissible continuation is any discrete filtered process on a probability space such that almost surely, , , almost surely, is measurable with respect to , and are measurable with respect to , and
almost surely for every , , and . Its discounted return is . Let be the unique fixed point of and define as the supremum of over all admissible continuations from . Then this supremum is finite and attained by a continuation that, after the prescribed initial action, always chooses an action maximizing at the current state . In particular,
Statement references
Finite state/action sets, the joint reward-transition law, and bounded rewards.
Adapted processes on a discrete filtration.
The state-value Bellman optimality operator.
Expected discounted policy returns and values.
Unique fixed points of discounted policy and optimality operators.
A stationary policy value is its Bellman fixed point.
Sutton and Barto, Reinforcement Learning: An Introduction.
Kaelbling, Littman, and Cassandra, Brown Technical Report CS-96-08.
Facts & Assumptions
Given: The finite MDP, its reward-transition law, , and the Axiom of Choice.
The Axiom of Choice: every family of nonempty sets has a choice function; this is used for the path-law construction and to select one maximizing action at each state.
Finite Markov decision process with joint reward-transition law: each is finite nonempty, and the reward/state sets are finite, is a probability mass, and .
Filtration and filtered probability space: is increasing; current state-action pairs are measurable at time in an admissible continuation.
Basic algebra and order properties of conditional expectation: conditional expectation is linear, preserves order and constants, and preserves expectation.
Finite-MDP Bellman operators are gamma contractions with unique fixed points: and each stationary-policy operator have unique fixed points for .
Discounted returns and policy values in a finite MDP: is the expected discounted return from state under the policy-induced path law.
Expected discounted policy value is a fixed point of its Bellman operator: under the stated Axiom of Choice and discount hypotheses.
Ionescu-Tulcea construction of a Markov chain: under Choice, an initial law and a sequence of history-dependent probability kernels determine a probability law with the prescribed finite-prefix laws.
A finite MDP policy generates action-state-reward trajectories: a stationary Markov policy has the stated finite-prefix action-state-reward path probabilities from each fixed initial state.
Absolute convergence and tail bound for bounded discounted rewards: bounded rewards give an absolutely convergent discounted return and a uniform tail bound .
Dominated convergence: pointwise-convergent measurable functions under one integrable majorant have convergent expectations.
Expectation of a nonnegative or integrable random variable, The expectation of an indicator is the probability of the event, and Monotonicity and nonnegative homogeneity of the nonnegative integral: a bounded constant is integrable on a probability space because and the nonnegative integral preserves scaling and order.
Finite, countably infinite, countable, uncountable, On the order is membership: , and Every nonzero natural number is a successor: each nonempty finite action set is bijective with a successor natural and can be enumerated by the corresponding finite list .
Every nonempty finite set of reals has a maximum and a minimum and Maximum and minimum of a set: every finite real list has an attained maximum, which is an upper bound for the list and is unique.
Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable: the pointwise limit of a sequence of measurable real functions is measurable.
The product sigma-algebra and its finite iterates: coordinate projections from the history product spaces are measurable.
Measure kernel and probability kernel: a history-dependent assignment of probability measures with measurable event sections is a probability kernel of the type required by [F9].
The product rule: , and : each finite history-coordinate space formed from finitely many finite state, reward, and state-action sets is finite.
Proof
Given: The hypotheses, definitions, and conventions in the Statement and [A1], [F1]–[F20].
The unique fixed point exists by [F6]. Let , which is finite because is finite. Fix and enumerate using [F1] and [F14]. For , [F15] gives an attained list maximum; because the list enumerates all actions, its maximum is exactly the maximum in [F4], independent of the enumeration by uniqueness in [F15]. For each , expanding and by [F1] gives . The triangle inequality, , and the probability-mass identity give . Since the maximum is one of the list entries, . As was arbitrary, . Since , .
Fix any admissible continuation from . For each , expand as the finite sum . These variables are bounded by [F1] and step 1.1, so they are integrable. Conditional linearity and the transition-reward identity in the definition give . The right side is the one-step action value of the measurable current action , so it is at most by [F4] and the fixed-point identity.
The attained list maximum argument in step 1.1 makes the maximizing-action set nonempty at every state. By [A1], choose one such action at every state and call the resulting deterministic stationary policy . Define its stationary probability-family embedding by for . These numbers are nonnegative and sum to one because exactly one legal action equals , so is a stationary Markov policy in [F5]–[F8]. Its policy Bellman sum has only the chosen maximizing action as a nonzero term. The definitions [F4]–[F5] and give . By [F6] this is the unique fixed point of , while [F8] gives ; hence .
Apply order and expectation preservation from [F3] to the conditional inequality in step 2.1, multiply by the nonnegative scalar , and sum for . The intermediate state-value terms cancel, giving . The initial transition law gives . Since by step 1.1 and [F13], it follows that .
Write . Each is measurable because it is a finite sum of measurable rewards, and [F11] gives pointwise convergence to and the bound . Thus is measurable by [F17]; the constant bound is integrable by [F13], so [F12] gives . Also by [F16]. Passing to the limit in the upper bound of step 3.1 shows . The continuation was arbitrary, so .
Construct a continuation with initial pair and thereafter action following each transition. Take and with their discrete sigma-algebras, initial law concentrated at , and history kernels for every measurable , where is the last pair in . For disjoint sets , their preimages are disjoint subsets of the finite set , so only finitely many are nonempty and the finite mass formula is countably additive; its total mass is one by [F1]. It is measurable in because it is a finite sum of functions of the current-pair coordinate projection, which is measurable by [F18]. Thus each is a probability kernel by [F19], and [F9] gives a path law with these prefix products. Set , where and . The coordinate projections make current pairs measurable at time and next observations measurable at time by [F18]. The finite history-coordinate set is finite by [F20], so each atom of fixes a finite history. On a positive-mass atom ending at , the prefix product in [F9] shows that extending it by reward , state , and next action has conditional probability ; all other next-action extensions have conditional probability zero. Thus the conditional probability of given is on every positive-mass atom, which proves the required almost-sure conditional identity. Hence this process is admissible. By the product form of the finite-prefix probabilities, after the first transition its conditional continuation from has the stationary-policy prefix laws in [F10] for : the next action equals at its current state with probability one, so [F7] identifies its conditional expected discounted tail as . The expectation convergence proved for every admissible continuation in step 4.1 passes this prefix identity to the infinite return. Therefore by step 2.2. This admissible continuation attains the upper bound, so and the supremum is a finite maximum.
Since was arbitrary, the formula and finite attainment claim hold on all of .
Depends on
- The Axiom of Choice
- Bellman optimality operator
- Finite, countably infinite, countable, uncountable
- Discounted returns and policy values in a finite MDP
- Expectation of a nonnegative or integrable random variable
- Finite Markov decision process with joint reward-transition law
- Filtration and filtered probability space
- Maximum and minimum of a set
- Measure kernel and probability kernel
- Policy Bellman operator
- The product sigma-algebra and its finite iterates
- Absolute convergence and tail bound for bounded discounted rewards
- A finite MDP policy generates action-state-reward trajectories
- Every nonempty finite set of reals has a maximum and a minimum
- For $|r| < 1$ the sequence $r^k$ is null, and for $|r| > 1$ the sequence $|r|^k$ diverges to $+\infty$
- Every nonzero natural number is a successor
- On $\mathbb{N}$ the order is membership: $m < n \iff m \in n$
- Expected discounted policy value is a fixed point of its Bellman operator
- The expectation of an indicator is the probability of the event
- Monotonicity and nonnegative homogeneity of the nonnegative integral
- Basic algebra and order properties of conditional expectation
- Finite-MDP Bellman operators are gamma contractions with unique fixed points
- Dominated convergence
- Ionescu-Tulcea construction of a Markov chain
- Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable
- The product rule: $\lvert A \times B\rvert = \lvert A\rvert\,\lvert B\rvert$, and $\big\lvert\prod_{i<m} A_i\big\rvert = \prod_{i<m}\lvert A_i\rvert$
Used by
Dependency tree · two levels
120 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)