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.
Communicating MDP and diameter
Definition
Assume the Axiom of Choice for the policy path laws used in the expectations below. For a finite MDP with bounded rewards, a policy assigns a probability distribution on to each finite observed history ending in state , with each action probability a measurable function of the history; deterministic policies are included. For states , start at and define , with if is never hit. This is an extended nonnegative measurable random variable because . Take the expectation and the infimum over policies in . The MDP is communicating if for every ordered pair . Its raw diameter is in , and its normalized diameter is in the extended order. Since is finite, is finite for every communicating MDP. Thus a one-state MDP has and .
Definition references
Bounded-reward finite-MDP model: state, action, transition, reward, and path-law conventions.
Finite MDP policy convention: actions are selected from the finite nonempty statewise action sets.
Expectation: defines the expected hitting time.
Extended real line: provides the order used when a target may never be hit.
Extended completeness: provides the extended infimum.
Axiom of Choice: assumed for policy path laws.
UCRL2 diameter convention: Introduction, Definition 1; §2.
Depends on
- Finite MDP with bounded real rewards
- Finite Markov decision process with joint reward-transition law
- Expectation of a nonnegative or integrable random variable
- The extended real line $\overline{\mathbb{R}} = \mathbb{R} \cup \{-\infty, +\infty\}$, its order, and the arithmetic that is left undefined
- Every subset of $\overline{\mathbb{R}}$ has a least upper bound and a greatest lower bound in $\overline{\mathbb{R}}$, agreeing with the real supremum and infimum on nonempty sets bounded in $\mathbb{R}$
- The Axiom of Choice
Used by
- UCRL2 for finite communicating MDPs Algorithm
- Average reward and pathwise regret 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
- Termination of extended value iteration under communicating assumptions Lemma
- Communicating MDPs have a common optimal average reward Theorem
- Expected regret lower bound for communicating MDPs Theorem
- UCRL2 high-probability pathwise regret bound Theorem
Dependency tree · two levels
35 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)