Lemma 1, p. 19 — the production sequence u_{i+1} = g^P(u_F) + βP^P u_i in closed form (29)–(30)
ProvedMaintPOMDP.Frontier.lemma_1linear-recurrencemachine-maintenancep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pomdp
Under the standing assumptions and , let and , and define and . With , , , for every ,
The production sequence carries the extreme points of the frontier created by action ; the closed form is what turns the anchor equation of Lemma 3 into the explicit function .
Formalization Note The paper writes the formula without the hypothesis and reads it by L'Hôpital's rule at (footnote 2); here is a hypothesis, since Lean's division by zero returns 0. The hypothesis is kept as printed.
Preamble
import Mathlib import Definitions.Def_MaintPOMDP_Frontier_Setting open Filter Topology
Formal statement
namespace MaintPOMDP.Frontier
/-- Lemma 1 (p. 19): for γ0 ≠ γ1, the production sequence u_0 = (u^R, u^R)′,
u_{i+1} = g^P(u_F) + β P^P u_i is given by the closed form (29)–(30). -/
theorem lemma_1 (M : Params) (hM : M.Standing) (hγ : M.γ0 ≠ M.γ1) (uR uF : ℝ) (huF : 0 < uF)
(i : ℕ) : M.prodSeq (diag uR) uF i = M.seq29_30 uR uF i := by sorry
end MaintPOMDP.Frontier
Source
Zhang, Zhang, Analytical Solution to a Partially Observable Machine Maintenance Problem with Obvious Failures, SSRN 2945049 (version of 2022-08-21), p. 19, Lemma 1, (29)–(30)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.