Chapter XI, Theorem 3 (corrected) — for the recurrence
ProvedBellmanDP.Markovian.discrete_growth_asymptoticsAssume the setting and conditions (10.3) of Theorem 2 (with ), and assume in addition that the Perron root attains its maximum over at exactly one joint parameter . Let with for all and , and define
Let and with be the solution of the homogeneous system of Theorem 2. Then there is a constant with
that is, for every .
The theorem describes the long-run growth of the optimally controlled discrete process: it grows geometrically at the maximal Perron root, in the direction of the positive eigenvector of Theorem 2.
Formalization Note The book prints "a unique for which the maximum value of is assumed"; a parameter has no maximum value, and the proof works with " \dots the value of for which ", so the hypothesis is read as uniqueness of the maximizer of (condition (10.3c)). The book takes and then ", without loss of generality"; for the sequence is identically zero and with fails, so is assumed. Asymptotic equivalence with a positive limit is stated as convergence of the ratio.
import Mathlib import Definitions.Def_BellmanDP_Markovian_Discrete
namespace BellmanDP.Markovian
open Filter Topology
/-- Bellman, *Dynamic Programming*, Ch. XI, Theorem 3, p. 330 (corrected: the printed "unique
q for which the maximum value of q is assumed" is read as the maximum of the Perron root `φ(q)`,
as in (10.3c) and the proof). Under (10.3a)–(c), if `φ` has a unique maximizer on `S` and the
initial vector `c ≥ 0` is not zero, then for the positive solution `(λ, y)` of (10.2) the sequence
(10.1) satisfies `x_i(n) ~ a y_i λⁿ` with a constant `a = a(c) > 0`, i.e.
`x_i(n) / λⁿ → a y_i` for every `i`. -/
theorem discrete_growth_asymptotics {N : ℕ} (hN : 0 < N) {Q : Fin N → Type*}
(a : (i : Fin N) → Q i → Fin N → ℝ) (S : (i : Fin N) → Set (Q i)) (m : ℝ)
(h : MarkovHyp a S m)
(huniq : ∃! qs, qs ∈ Set.pi Set.univ S ∧ ∀ q ∈ Set.pi Set.univ S,
perronRoot (matOf a q) ≤ perronRoot (matOf a qs))
(c : Fin N → ℝ) (hc : ∀ i, 0 ≤ c i) (hc0 : c ≠ 0)
(lam : ℝ) (y : Fin N → ℝ) (hlam : 0 < lam) (hy : ∀ i, 0 < y i)
(hey : IsMaxEigenpair a S lam y) :
∃ α : ℝ, 0 < α ∧ ∀ i : Fin N,
Tendsto (fun n : ℕ => maxIter a S c n i / lam ^ n) atTop (𝓝 (α * y i)) := by sorry
end BellmanDP.Markovian
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.