Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.7.1 — for R in C_1 the frequency limit equals the Abel limit of discounted frequencies

Proved
KallenbergLP.Constrained.freq_eq_abel_limit

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

dynamic-programmingmarkov-decision-processp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1state-action-frequencies

Let β\betaβ be an initial distribution and RRR a policy whose expected state-action frequencies xT(R)x^T(R)xT(R) have exactly one limit point x(R)x(R)x(R) (that is, R∈C1R\in C_1R∈C1​). Then for every state jjj and action a∈A(j)a\in A(j)a∈A(j),

xja(R)=lim⁡α↑1(1−α)∑t=1∞αt−1∑iβi PR(Xt=j, Yt=a∣X1=i).x_{ja}(R)=\lim_{\alpha\uparrow1}(1-\alpha)\sum_{t=1}^\infty\alpha^{t-1}\sum_i\beta_i\,\mathbb P_R(X_t=j,\ Y_t=a\mid X_1=i).xja​(R)=α↑1lim​(1−α)t=1∑∞​αt−1i∑​βi​PR​(Xt​=j, Yt​=a∣X1​=i).

The lemma links the average-reward frequencies to normalized discounted frequencies, so that results for discounted problems can be transferred to the average case as the discount factor tends to one.

Formalization Note The limit α↑1\alpha\uparrow1α↑1 is taken along the left neighbourhood filter 𝓝[<] 1; the Lean summation index kkk is the book's t−1t-1t−1.

Preamble
import Mathlib
import Definitions.Def_MarkovDecisionProcesses_AverageReward
import Definitions.Def_KallenbergLP_Constrained_Frequencies
Formal statement
namespace KallenbergLP.Constrained

open MarkovDecisionProcesses Filter Topology

/-- Kallenberg (1983), Lemma 4.7.1, pp. 153–154: for `R ∈ C_1` with unique limit point `x(R)` and
every pair `(j, a)`,
`x_{ja}(R) = lim_{α↑1} (1−α) ∑_{t=1}^∞ α^{t−1} ∑_i β_i ℙ_R(X_t = j, Y_t = a | X_1 = i)`. -/
theorem freq_eq_abel_limit {S A : Type*} [Fintype S] [Fintype A] [DecidableEq S]
    [DecidableEq A] (M : StationaryMDP S A) (β : S → ℝ) (hβ0 : ∀ j, 0 ≤ β j)
    (hβ1 : ∑ j, β j = 1) (R : AvgHRPolicy M) (hR : IsC1 β R)
    (x : KallenbergLP.AverageLP.Pair M → ℝ) (hx : x ∈ limitPoints β R) (p : KallenbergLP.AverageLP.Pair M) :
    Tendsto (fun α : ℝ => (1 - α) * ∑' k : ℕ, α ^ k * ∑ i, β i * prob R k i p)
      (𝓝[<] 1) (𝓝 (x p)) := by sorry

end KallenbergLP.Constrained
Source
Kallenberg, Linear Programming and Finite Markovian Control Problems, Mathematical Centre Tracts 148, Mathematisch Centrum, Amsterdam 1983, pp. 153–154, Lemma 4.7.1
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me