Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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 S and discount 0≤γ<1, and let T∗ be its Bellman optimality operator. For a fixed initial pair (s,a)∈D, an admissible continuation is any discrete filtered process (Sn,An,Rn+1)n≥0 on a probability space such that (S0,A0)=(s,a) almost surely, Sn,Sn+1∈S, An∈A(Sn), Rn+1∈R almost surely, (Sn,An) is measurable with respect to Fn, Rn+1 and Sn+1 are measurable with respect to Fn+1, and

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

almost surely for every n≥0, s′∈S, and ρ∈R. Its discounted return is G=∑n=0∞γnRn+1. Let V∗ be the unique fixed point of T∗ and define Qopt(s,a) as the supremum of E[G] over all admissible continuations from (s,a). Then this supremum is finite and attained by a continuation that, after the prescribed initial action, always chooses an action maximizing r(s′,b)+γ∑u∈SP(u∣s′,b)V∗(u) at the current state s′. In particular,

Qopt(s,a)=∑s′∈S∑ρ∈Rp(s′,ρ∣s,a)[ρ+γV∗(s′)].

Facts & Assumptions

Given: The finite MDP, its reward-transition law, 0≤γ<1, and the Axiom of Choice.

[A1]

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.

[F1]

Finite Markov decision process with joint reward-transition law: each A(s) is finite nonempty, D and the reward/state sets are finite, p(⋅,⋅∣s,a) is a probability mass, and ∣ρ∣≤M.

[F2]

Filtration and filtered probability space: (Fn) is increasing; current state-action pairs are measurable at time n in an admissible continuation.

[F3]

Basic algebra and order properties of conditional expectation: conditional expectation is linear, preserves order and constants, and preserves expectation.

[F4]

Bellman optimality operator: (T∗V)(s)=max⁡b∈A(s)[r(s,b)+γ∑uP(u∣s,b)V(u)].

[F5]

Policy Bellman operator: (TπV)(s)=∑bπ(b∣s)[r(s,b)+γ∑uP(u∣s,b)V(u)].

[F6]

Finite-MDP Bellman operators are gamma contractions with unique fixed points: T∗ and each stationary-policy operator Tπ have unique fixed points for 0≤γ<1.

[F7]

Discounted returns and policy values in a finite MDP: Vπ(s) is the expected discounted return from state s under the policy-induced path law.

[F8]

Expected discounted policy value is a fixed point of its Bellman operator: TπVπ=Vπ under the stated Axiom of Choice and discount hypotheses.

[F9]

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.

[F10]

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.

[F11]

Absolute convergence and tail bound for bounded discounted rewards: bounded rewards give an absolutely convergent discounted return and a uniform tail bound MγN/(1−γ).

[F12]

Dominated convergence: pointwise-convergent measurable functions under one integrable majorant have convergent expectations.

[F13]

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 E[1Ω]=P(Ω)=1 and the nonnegative integral preserves scaling and order.

[F14]

Finite, countably infinite, countable, uncountable, On N the order is membership: m<n  ⟺  m∈n, 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 a0,…,an.

[F15]

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.

[F17]

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.

[F18]

The product sigma-algebra and its finite iterates: coordinate projections from the history product spaces are measurable.

[F19]

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].

[F20]

The product rule: ∣A×B∣=∣A∣ ∣B∣, and ∣∏i<mAi∣=∏i<m∣Ai∣: 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].

1.1F1F4F6F14F15algebra

The unique fixed point V∗ exists by [F6]. Let B=∥V∗∥∞, which is finite because S is finite. Fix s∈S and enumerate A(s)={a0,…,an} using [F1] and [F14]. For uj=r(s,aj)+γ∑xP(x∣s,aj)V∗(x), [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 j, expanding r and P by [F1] gives uj=∑x,ρp(x,ρ∣s,aj)[ρ+γV∗(x)]. The triangle inequality, ∣ρ∣≤M, and the probability-mass identity give ∣uj∣≤M+γB. Since the maximum is one of the list entries, ∣(T∗V∗)(s)∣≤M+γB. As s was arbitrary, B=∥T∗V∗∥∞≤M+γB. Since 1−γ>0, B≤M/(1−γ).

2.1givenF1F2F3F4step 1.1

Fix any admissible continuation from (s,a). For each n≥1, expand Rn+1+γV∗(Sn+1) as the finite sum ∑s′,ρ(ρ+γV∗(s′))1{Sn+1=s′,Rn+1=ρ}. 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 E[Rn+1+γV∗(Sn+1)∣Fn]=∑s′,ρp(s′,ρ∣Sn,An)[ρ+γV∗(s′)]. The right side is the one-step action value of the measurable current action An, so it is at most (T∗V∗)(Sn)=V∗(Sn) by [F4] and the fixed-point identity.

2.2A1F4F5F6F8step 1.1

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 π^∗(b∣s)=1{b=π∗(s)} for b∈A(s). These numbers are nonnegative and sum to one because exactly one legal action equals π∗(s), 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 T∗V∗=V∗ give Tπ^∗V∗=V∗. By [F6] this is the unique fixed point of Tπ^∗, while [F8] gives Tπ^∗Vπ^∗=Vπ^∗; hence Vπ^∗=V∗.

3.1F1F3F13step 1.1step 2.1algebra

Apply order and expectation preservation from [F3] to the conditional inequality in step 2.1, multiply by the nonnegative scalar γn, and sum for n=1,…,N. The intermediate state-value terms cancel, giving ∑n=1NγnE[Rn+1]+γN+1E[V∗(SN+1)]≤γE[V∗(S1)]. The initial transition law gives E[R1+γV∗(S1)]=∑s′,ρp(s′,ρ∣s,a)[ρ+γV∗(s′)]=:Q†(s,a). Since ∣E[V∗(SN+1)]∣≤B by step 1.1 and [F13], it follows that E[∑n=0NγnRn+1]≤Q†(s,a)+γN+1B.

4.1F11F12F13F16F17step 3.1

Write GN=∑n=0NγnRn+1. Each GN is measurable because it is a finite sum of measurable rewards, and [F11] gives pointwise convergence to G and the bound ∣GN∣≤M/(1−γ). Thus G is measurable by [F17]; the constant bound is integrable by [F13], so [F12] gives E[GN]→E[G]. Also γN+1B→0 by [F16]. Passing to the limit in the upper bound of step 3.1 shows E[G]≤Q†(s,a). The continuation was arbitrary, so Qopt(s,a)≤Q†(s,a).

5.1F1F7F9F10F18F19F20step 4.1step 2.2construct

Construct a continuation with initial pair (s,a) and thereafter action π∗(Sn+1) following each transition. Take E0=D and En+1=R×D with their discrete sigma-algebras, initial law concentrated at (s,a), and history kernels Kn(h,B)=∑s′,ρp(s′,ρ∣sn,an)1B(ρ,(s′,π∗(s′))) for every measurable B⊆En+1, where (sn,an) is the last pair in h. For disjoint sets Bj⊆En+1, their preimages {(s′,ρ):(ρ,(s′,π∗(s′)))∈Bj} are disjoint subsets of the finite set S×R, 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 h because it is a finite sum of functions of the current-pair coordinate projection, which is measurable by [F18]. Thus each Kn is a probability kernel by [F19], and [F9] gives a path law with these prefix products. Set Fn=σ(X0,Y1,…,Yn), where X0=(S0,A0) and Yj=(Rj,(Sj,Aj)). The coordinate projections make current pairs measurable at time n and next observations measurable at time n+1 by [F18]. The finite history-coordinate set is finite by [F20], so each atom of Fn fixes a finite history. On a positive-mass atom ending at (sn,an), the prefix product in [F9] shows that extending it by reward ρ, state s′, and next action π∗(s′) has conditional probability p(s′,ρ∣sn,an); all other next-action extensions have conditional probability zero. Thus the conditional probability of {Rn+1=ρ,Sn+1=s′} given Fn is p(s′,ρ∣Sn,An) 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 S1=s′ 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 Vπ^∗(s′). The expectation convergence proved for every admissible continuation in step 4.1 passes this prefix identity to the infinite return. Therefore E[G]=∑s′,ρp(s′,ρ∣s,a)[ρ+γVπ^∗(s′)]=Q†(s,a) by step 2.2. This admissible continuation attains the upper bound, so Qopt(s,a)=Q†(s,a) and the supremum is a finite maximum.

6.1givenstep 5.1∎

Since (s,a) was arbitrary, the formula and finite attainment claim hold on all of D.

Depends on

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