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.
Finite MDP with bounded real rewards
Definition
Let be a finite nonempty state set and let be a finite nonempty action set for each , as in the finite-MDP convention. Put with its discrete sigma-algebra. Equip with its power-set sigma-algebra, with its Borel sigma-algebra, and with the product sigma-algebra. A finite MDP with bounded real rewards specifies a probability kernel from to ; equivalently, each admissible has a probability measure on that product measurable space. The reward-coordinate projection is measurable because the preimage of each Borel set is the product rectangle . Define the next-state law by and the mean reward by . At each time, conditional on the observed history and the selected action, the next-state/reward pair has this law. Assume the Axiom of Choice for the path-space construction under policies.
Definition references
Finite-MDP supplier: supplies the finite state/action and joint one-step-law conventions; its reward alphabet is finite, while this definition explicitly permits every Borel reward law on .
Borel sigma-algebra: specifies the Borel events on the reward interval.
Product sigma-algebra: specifies measurable events on .
Probability measure: is a probability measure for each admissible pair.
Probability kernel: the family has measurable event sections over the finite pair set .
Expectation as an integral: defines the mean reward integral.
UCRL2 model and reward scope: Introduction, finite state/action, reward, and transition model (PDF lines 34–41).
Ionescu–Tulcea path-law construction: unique path law from a specified initial probability law and sequential probability kernels under Choice.
Axiom of Choice: assumed by the path-law construction.
Axiom use
The Axiom of Choice is assumed exactly for the path-space construction under policies. The one-step kernel and its finite state marginal require no choice.
For a measurable history-dependent policy and an initial state distribution on , start the construction with (use the point mass when starting at a specified state ). Alternate the policy action kernels with the observation kernels . The cited Ionescu–Tulcea theorem then supplies a unique interaction law for this initial distribution and policy. The MDP kernel alone does not specify an initial distribution.
Depends on
- Finite Markov decision process with joint reward-transition law
- The Borel sigma-algebra of a topological space
- The product sigma-algebra and its finite iterates
- Probability measures and probability spaces
- Measure kernel and probability kernel
- Expectation of a nonnegative or integrable random variable
- Ionescu-Tulcea construction of a Markov chain
- The Axiom of Choice
Used by
- Extended value iteration for a confidence set Algorithm
- UCRL2 for finite communicating MDPs Algorithm
- Average reward and pathwise regret Definition
- Communicating MDP and diameter Definition
- A noncommunicating MDP can have state-dependent average reward Example
- A random reward separates pathwise and expected regret Example
- One-state MDP and normalized diameter Example
- Adaptive MDP visits admit fixed sample tapes Lemma
- Uniform empirical reward and transition confidence bounds Lemma
- Communicating MDPs have a common optimal average reward Theorem
Dependency tree · two levels
39 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
- Thomas Jaksch, Ronald Ortner, and Peter Auer, Near-optimal Regret Bounds for Reinforcement Learning (standard reference, not scraped)
- Christos Dimitrakakis and Ronald Ortner, Decision Making Under Uncertainty and Reinforcement Learning: Theory and Algorithms (standard reference, not scraped)