Lemma 6, p. 27 — the inspection sequence u^I_i in closed form (38)–(39)
ProvedMaintPOMDP.Frontier.lemma_6by mikedeng1 · Oct 14, 2026 · Mathlib 0df444a (Lean v4.33.1)
linear-recurrencemachine-maintenancep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pomdp
Under the standing assumptions and γ0=γ1, let u0R∈R be the anchor value and uF>0. Start from the inspection point (35),
u0I=(u0R−cR+cI, cI+βγ1uF+ρ1u0R)′,
and set ui+1I=gP(uF)+βPPuiI. Then for every i≥0
ui,0I=(γ1−γ0γ1cI−cR+γ1−γ0γ0βγ1uF+(1+γ1−γ0γ0ρ1)u0R−γ1−γ0γ0ρˉ0cP+βγ1uF)ρ0i−γ1−γ0γ0(cI+βγ1uF+ρ1u0R−ρˉ1cP+βγ1uF)ρ1i+βγ0ρˉ0ρˉ1cP+βγ1uF,
ui,1I=(cI+βγ1uF+ρ1u0R−ρˉ1cP+βγ1uF)ρ1i+ρˉ1cP+βγ1uF.
The inspection sequence carries the extreme points created by production after an inspection; its closed form yields the function g of Lemma 7.
Formalization Note γ0=γ1 is a hypothesis because the formula divides by γ1−γ0; uF>0 is kept as printed.
Preamble
import Mathlib
import Definitions.Def_MaintPOMDP_Frontier_Setting
open Filter Topology
Formal statement
namespace MaintPOMDP.Frontier
/-- Lemma 6 (p. 27): for γ0 ≠ γ1, the inspection sequence u^I_0 = (35) (with anchor u^R_0 and a
given u_F), u^I_{i+1} = g^P(u_F) + β P^P u^I_i, is given by the closed form (38)–(39). -/
theorem lemma_6 (M : Params) (hM : M.Standing) (hγ : M.γ0 ≠ M.γ1) (uR0 uF : ℝ) (huF : 0 < uF)
(i : ℕ) : M.prodSeq (M.inspStart uR0 uF) uF i = M.seq38_39 uR0 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. 27, Lemma 6, (38)–(39); (35), p. 26
View graph
Confirmed by the moderator at approval.