Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generated
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 S, finite state-action set D, finite reward alphabet R, and discount 0≤γ<1. Put M=max⁡ρ∈R∣ρ∣. On a discrete filtered probability space (Ω,F,(Fn)n≥0,P), let Q0∈RD be deterministic. At time n, the current pair In=(Sn,An)∈D is Fn-measurable, the reward Rn+1∈R almost surely and next state Sn+1∈S are Fn+1-measurable, and

E[1{Sn+1=s′, Rn+1=ρ}∣Fn]=p(s′,ρ∣Sn,An)

almost surely for every s′∈S and ρ∈R. Define Nn(i)=#{k<n:Ik=i}. Suppose every i∈D is selected infinitely often almost surely and the deterministic per-pair step sizes satisfy

0≤αk(i)≤1,∑k≥0αk(i)=∞,∑k≥0αk(i)2<∞(i∈D).

Apply the Q-learning update

Qn+1(In)=Qn(In)+αNn(In)(In)[Rn+1+γmax⁡b∈A(Sn+1)Qn(Sn+1,b)−Qn(In)],

leaving all other coordinates unchanged.

For each initial pair (s,a)∈D, define Q∗(s,a) as the supremum of E[∑k=0∞γkRk+1] over all discrete filtered processes with initial pair (S0,A0)=(s,a) almost surely, Sn∈S, An∈A(Sn), Rn+1∈R almost surely, current state-action pairs measurable at time n, next states and rewards measurable at time n+1, 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 Qn converges almost surely in the finite-state sup norm to the unique function Q∗∈RD satisfying

Q∗(s,a)=∑s′∈S∑ρ∈Rp(s′,ρ∣s,a)[ρ+γmax⁡b∈A(s′)Q∗(s′,b)]((s,a)∈D).

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.

Facts & Assumptions

Given: The Axiom of Choice, a finite MDP, 0≤γ<1, 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.

[A1]

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.

[F1]

Finite Markov decision process with joint reward-transition law: for each admissible pair (s,a), p(s′,ρ∣s,a)≥0 and its finite sum over (s′,ρ) is 1; r(s,a)=∑s′,ρρp(s′,ρ∣s,a) and P(s′∣s,a)=∑ρp(s′,ρ∣s,a); the expected reward is bounded in absolute value by M.

[F2]

Bellman optimality operator: (T∗V)(s)=max⁡a∈A(s)∑s′,ρp(s′,ρ∣s,a)[ρ+γV(s′)].

[F3]

Finite-MDP Bellman operators are gamma contractions with unique fixed points: T∗ has a unique fixed point V∗∈RS when 0≤γ<1.

[F4]

Optimal action-value Bellman operator: (HQ)(s,a)=∑s′,ρp(s′,ρ∣s,a)[ρ+γmax⁡b∈A(s′)Q(s′,b)].

[F5]

Tabular Q-learning: the visited action-value coordinate is updated toward Rn+1+γmax⁡bQn(Sn+1,b).

[F6]

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.

[F7]

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.

[F8]

Basic algebra and order properties of conditional expectation and Taking out what is known: conditional expectation is linear, expectation preserving, and order preserving (if X≤Y almost surely then E[X∣Fn]≤E[Y∣Fn] almost surely); bounded measurable factors can be taken outside.

[F9]

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.

[F10]

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 ∑s′,ρp(s′,ρ∣s,a)[ρ+γV∗(s′)], where V∗ is the unique fixed point of T∗.

Proof

Given: The hypotheses, definitions, and conventions in the Statement and [A1], [F1]–[F10].

1.1A1F1F2F3F4F10algebra

Let V∗ be the unique fixed point of T∗ supplied by [F3], and define Q†(s,a)=∑s′,ρp(s′,ρ∣s,a)[ρ+γV∗(s′)]. For each (s,a), the finite sum in [F1] gives Q†(s,a)=r(s,a)+γ∑s′P(s′∣s,a)V∗(s′). Thus [F2] and T∗V∗=V∗ give max⁡a∈A(s)Q†(s,a)=V∗(s). Substituting this identity into [F4] yields HQ†=Q†. For finite lists (xb) and (yb), let m=max⁡b∣xb−yb∣; then xb≤yb+m for every b, so max⁡bxb≤max⁡byb+m, and exchanging the lists gives ∣max⁡bxb−max⁡byb∣≤m. Therefore, for each (s,a), ∣(HQ)(s,a)−(HQ~)(s,a)∣≤γ∑s′,ρp(s′,ρ∣s,a)∣max⁡bQ(s′,b)−max⁡bQ~(s′,b)∣≤γ∥Q−Q~∥∞. Taking the maximum over (s,a)∈D proves ∥HQ−HQ~∥∞≤γ∥Q−Q~∥∞. Any other fixed point Q would then satisfy ∥Q−Q†∥∞≤γ∥Q−Q†∥∞; since γ<1, this forces Q=Q†. 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 Q∗ in the Statement.

1.2givenF1F5algebrainduction

Put C=max⁡{∥Q0∥∞,M/(1−γ)}. Then M+γC≤C. If ∥Qn∥∞≤C, the sampled target Yn+1=Rn+1+γmax⁡bQn(Sn+1,b) lies in [−M−γC,M+γC]⊆[−C,C]. The update is a convex combination of Qn(In) and Yn+1 because 0≤αNn(In)(In)≤1; hence induction gives ∥Qn∥∞≤C for every n.

2.1A1F1F4F5F6F7F8F9step 1.1step 1.2algebra

By induction from deterministic Q0, the update and the observation measurability in the Statement make Qn Fn-measurable. Define ξn+1=Yn+1−(HQn)(In). Expand Yn+1 as a finite sum over s′∈S and ρ∈R using the indicators of (Sn+1,Rn+1)=(s′,ρ). Since Qn and In are Fn-measurable, the conditional transition-reward identity in the Statement, linearity, and taking out known factors [F7]–[F8] give E[Yn+1∣Fn]=(HQn)(In). Thus ξn+1 is an Fn+1-measurable martingale difference by [F6]. Step 1.2 bounds both Yn+1 and its conditional expectation by C, so ∣ξn+1∣≤2C almost surely. Rewriting the update as Qn+1(i)=Qn(i)+1{In=i}αNn(i)(i)[(HQn)(i)−Qn(i)+ξn+1] shows that all hypotheses of [F9] hold for index set D, map H, fixed point Q∗ from step 1.1, and contraction constant γ.

3.1step 2.1F9∎

Applying [F9] gives Qn→Q∗ almost surely in ∥⋅∥∞. This is the asserted convergence.

Depends on

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