Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 7.1.1 — costs over finitely many initial transitions do not affect the average cost

Proved
SennottDP.SEN.prop_7_1_1_average_cost_tail

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

average-costp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1

Let KKK be a positive integer, iii an initial state and θ\thetaθ a policy such that the KKK-horizon cost vθ,K(i)v_{\theta,K}(i)vθ,K​(i) is finite. Then the average cost can be computed from the costs incurred from time KKK on:

Jθ(i)=lim sup⁡n→∞1n−K Eθ[∑t=Kn−1C(Xt,At) ∣ X0=i].(7.1)J_\theta(i) = \limsup_{n\to\infty} \frac{1}{n-K}\, E_\theta\Big[\sum_{t=K}^{n-1} C(X_t,A_t) \,\Big|\, X_0 = i\Big]. \qquad (7.1)Jθ​(i)=n→∞limsup​n−K1​Eθ​[t=K∑n−1​C(Xt​,At​)​X0​=i].(7.1)

The costs accumulated over any fixed finite number of transitions do not change the average cost, provided they are finite; the finiteness hypothesis cannot be dropped (Example 7.1.2).

Formalization Note The expectation of the sum is the sum over K≤t<nK \le t < nK≤t<n of the expected costs, in ℝ≥0∞. For n≤Kn \le Kn≤K the natural-number difference n−Kn - Kn−K is 000 and the quotient is a junk value; the limit supremum along n→∞n \to \inftyn→∞ is unaffected.

Preamble
import Mathlib
import Definitions.Def_SennottDP_SEN_Criteria

open scoped ENNReal NNReal
open Filter
Formal statement
namespace SennottDP.SEN

/-- Sennott (1999), Proposition 7.1.1, p. 128: let `K` be a positive integer, `i` an initial
state and `θ` a policy with `v_{θ,K}(i) < ∞`. Then
`J_θ(i) = limsup_{n→∞} (1/(n − K)) E_θ[∑_{t=K}^{n-1} C(X_t,A_t) | X_0 = i]` (7.1).
The expectation of the sum is the sum of the expected costs `E_θ[C(X_t,A_t) | X_0 = i]`,
`K ≤ t < n`; the terms with `n ≤ K` (where `n − K = 0` in `ℕ`) do not affect the limit supremum. -/
theorem prop_7_1_1_average_cost_tail {S : Type} [Countable S] {Act : Type} (M : SennottDP.Discounted.MDC S Act)
    (K : ℕ) (hK : 0 < K) (i : S) (θ : SennottDP.Discounted.Policy M) (hfin : horizonCost M θ K i < ⊤) :
    avgCost M θ i =
      limsup (fun n : ℕ => (∑ t ∈ Finset.Ico K n, SennottDP.Discounted.expCost M θ i t) / ((n - K : ℕ) : ℝ≥0∞))
        atTop := by sorry

end SennottDP.SEN
Source
Sennott, Stochastic Dynamic Programming and the Control of Queueing Systems (Wiley, 1999), p. 128, Proposition 7.1.1, (7.1)
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 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