Proof of Theorem 5.9 — limit policy f, limit function h ≥ −L and constant ρ* along a subsequence β_n → 1
ProvedArapostathisAC.SennottACOI.limit_functionIn the countable-state controlled Markov process of §5, assume Assumptions 5.14 and 5.16, and Assumption 5.15 with the constant , i.e. for all and . Let be a sequence in with , and for each let be -discount optimal. Then there are a subsequence , a policy , a function and a constant such that, for every state ,
and .
This is the first paragraph of the proof of Theorem 5.9: is a limit point of the discount optimal policies, comes from Assumption 5.16 and a diagonal argument, and the limit of does not depend on .
Formalization Note " is a limit point of " is read as convergence in for every (the product topology on , p. 304), along the same subsequence as the other two limits, since the paper passes to a common subsequence. The paper takes ; the statement is made for every sequence in tending to , which includes the increasing ones. The constant of Assumption 5.15 is an explicit argument so that the bound can be stated.
import Mathlib import Definitions.Def_ArapostathisAC_SennottACOI_CMP import Definitions.Def_ArapostathisAC_SennottACOI_Assumptions open MeasureTheory ProbabilityTheory Filter Topology open scoped ENNReal
namespace ArapostathisAC.SennottACOI
variable {A : Type*} [MetricSpace A] [MeasurableSpace A] [BorelSpace A]
/-- Proof of Theorem 5.9 (p. 308), first paragraph: under Assumptions 5.14–5.16 (with the
constant `L` of Assumption 5.15 named), for every sequence of discount factors `β_n ∈ (0, 1)` with
`β_n → 1` and every choice of `β_n`-discount optimal `f_{β_n} ∈ Π_SD`, there are a subsequence
`φ`, a stationary policy `f`, a function `h : S → ℝ` and a constant `ρ* ≥ 0` such that along the
subsequence `f_{β_n}(i) → f(i)`, `h_{β_n}(i) → h(i)` and `(1 − β_n) J*_{β_n}(i) → ρ*` for every
state `i`, and `h ≥ −L`. -/
theorem limit_function (M : ArapostathisAC.VanishingDiscount.CMP A) (h14 : Assumption5_14 M) (L : ℕ)
(hL : ∀ β ∈ Set.Ioo (0 : ℝ) 1, ∀ i, -(L : ℝ) ≤ ArapostathisAC.VanishingDiscount.hRel M β i) (h16 : Assumption5_16 M)
(β : ℕ → ℝ) (hβ : ∀ n, β n ∈ Set.Ioo (0 : ℝ) 1) (hβ1 : Tendsto β atTop (𝓝 1))
(fβ : ℕ → StationaryPolicy M) (hfβ : ∀ n, ArapostathisAC.VanishingDiscount.IsDiscOptimal M (β n) (fβ n)) :
∃ φ : ℕ → ℕ, StrictMono φ ∧ ∃ f : StationaryPolicy M, ∃ h : ℕ → ℝ, ∃ ρ : ℝ, 0 ≤ ρ ∧
(∀ i, Tendsto (fun n => (fβ (φ n)).1 i) atTop (𝓝 (f.1 i))) ∧
(∀ i, Tendsto (fun n => ArapostathisAC.VanishingDiscount.hRel M (β (φ n)) i) atTop (𝓝 (h i))) ∧
(∀ i, -(L : ℝ) ≤ h i) ∧
∀ i, Tendsto (fun n => (1 - β (φ n)) * (ArapostathisAC.VanishingDiscount.discValue M (β (φ n)) i).toReal) atTop
(𝓝 ρ) := by sorry
end ArapostathisAC.SennottACOI
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.