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.
Tabular Q-learning converges under per-pair Robbins–Monro steps and full visitation
Statement
Assume the Axiom of Choice. Let a finite MDP have nonempty state set , finite state-action set , finite reward alphabet , and discount . Put . On a discrete filtered probability space , let be deterministic. At time , the current pair is -measurable, the reward almost surely and next state are -measurable, and
almost surely for every and . Define . Suppose every is selected infinitely often almost surely and the deterministic per-pair step sizes satisfy
Apply the Q-learning update
leaving all other coordinates unchanged.
For each initial pair , define as the supremum of over all discrete filtered processes with initial pair almost surely, , , almost surely, current state-action pairs measurable at time , next states and rewards measurable at time , and the same conditional reward-transition law displayed above at every time. The rewards are bounded, so all these discounted returns are absolutely convergent and integrable.
Then converges almost surely in the finite-state sup norm to the unique function satisfying
This unique fixed point is the optimal action-value function.
The claim uses diminishing per-pair steps and full visitation; it gives no convergence guarantee for a constant step size.
Statement references
The Axiom of Choice assumed for conditional-expectation existence.
The finite joint reward-transition law and bounded reward alphabet.
The state-value Bellman optimality operator.
The state-value Bellman operator is a gamma contraction with a unique fixed point.
The finite action-value Bellman map targeted by Q-learning.
The sampled tabular Q-learning update.
The locally proved coordinate-wise stochastic-approximation result.
Tsitsiklis, Asynchronous Stochastic Approximation and Q-Learning.
Sutton and Barto, Reinforcement Learning: An Introduction.
Yang, Optimal Control and Reinforcement Learning, Chapter 2.
Facts & Assumptions
Given: The Axiom of Choice, a finite MDP, , the filtered interaction process and its conditional transition-reward law, the per-pair visit counts and step sizes, and the Q-learning update in the Statement.
The Axiom of Choice: every family of nonempty sets has a choice function; AC is inherited by conditional-expectation classes and martingale differences used below.
Finite Markov decision process with joint reward-transition law: for each admissible pair , and its finite sum over is ; and ; the expected reward is bounded in absolute value by .
Finite-MDP Bellman operators are gamma contractions with unique fixed points: has a unique fixed point when .
Tabular Q-learning: the visited action-value coordinate is updated toward .
Filtration and filtered probability space and Martingale difference sequence: the filtration is increasing, and a martingale difference is adapted, integrable, and has zero conditional mean given the preceding sigma-algebra.
Conditional expectation given a sigma algebra and Conditional expectation as an ae class: conditional-expectation versions satisfy event-integral identities; the class is unique almost surely and exists under the stated AC assumption.
Basic algebra and order properties of conditional expectation and Taking out what is known: conditional expectation is linear, expectation preserving, and order preserving (if almost surely then almost surely); bounded measurable factors can be taken outside.
Coordinate-wise stochastic approximation converges to a contraction fixed point: a bounded MDS-driven coordinate-wise recursion converges to its contraction fixed point under infinite visitation and per-coordinate Robbins–Monro steps.
The optimal action value is attained by a greedy stationary policy: for each initial state-action pair, the maximal expected discounted return over all adapted MDP continuations is attained by following a greedy stationary policy after the initial action and equals , where is the unique fixed point of .
Proof
Given: The hypotheses, definitions, and conventions in the Statement and [A1], [F1]–[F10].
Let be the unique fixed point of supplied by [F3], and define For each , the finite sum in [F1] gives . Thus [F2] and give . Substituting this identity into [F4] yields . For finite lists and , let ; then for every , so , and exchanging the lists gives . Therefore, for each , Taking the maximum over proves . Any other fixed point would then satisfy ; since , this forces . By [F10], this fixed point is the pointwise maximal expected discounted return from each initial state-action pair and is attained by a greedy stationary continuation, so it is the optimal action-value function in the Statement.
Put . Then . If , the sampled target lies in . The update is a convex combination of and because ; hence induction gives for every .
By induction from deterministic , the update and the observation measurability in the Statement make -measurable. Define . Expand as a finite sum over and using the indicators of . Since and are -measurable, the conditional transition-reward identity in the Statement, linearity, and taking out known factors [F7]–[F8] give . Thus is an -measurable martingale difference by [F6]. Step 1.2 bounds both and its conditional expectation by , so almost surely. Rewriting the update as shows that all hypotheses of [F9] hold for index set , map , fixed point from step 1.1, and contraction constant .
Applying [F9] gives almost surely in . This is the asserted convergence.
Depends on
- Finite Markov decision process with joint reward-transition law
- Bellman optimality operator
- Finite-MDP Bellman operators are gamma contractions with unique fixed points
- Optimal action-value Bellman operator
- Tabular Q-learning
- Coordinate-wise stochastic approximation converges to a contraction fixed point
- Filtration and filtered probability space
- Conditional expectation as an ae class
- Conditional expectation given a sigma algebra
- Martingale difference sequence
- The Axiom of Choice
- Basic algebra and order properties of conditional expectation
- Taking out what is known
- The optimal action value is attained by a greedy stationary policy
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
59 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
- John N. Tsitsiklis, Asynchronous Stochastic Approximation and Q-Learning (standard reference, not scraped)
- Richard S. Sutton and Andrew G. Barto, Reinforcement Learning: An Introduction, 2nd ed. (standard reference, not scraped)
- Han-Dong Yang, Optimal Control and Reinforcement Learning, Chapter 2: Value-based Reinforcement Learning (standard reference, not scraped)