Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6, p. 27 — the inspection sequence u^I_i in closed form (38)–(39)

Proved
MaintPOMDP.Frontier.lemma_6

by 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\gamma_0\ne\gamma_1γ0​=γ1​, let u0R∈Ru^R_0\in\mathbb Ru0R​∈R be the anchor value and uF>0u_F>0uF​>0. Start from the inspection point (35),

u0I=(u0R−cR+cI, cI+βγ1uF+ρ1u0R)′,\mathbf u^I_0=\big(u^R_0-c^R+c^I,\ c^I+\beta\gamma_1u_F+\rho_1u^R_0\big)',u0I​=(u0R​−cR+cI, cI+βγ1​uF​+ρ1​u0R​)′,

and set ui+1I=gP(uF)+βPPuiI\mathbf u^I_{i+1}=\mathbf g^P(u_F)+\beta\mathbf P^P\mathbf u^I_iui+1I​=gP(uF​)+βPPuiI​. Then for every i≥0i\ge0i≥0

ui,0I=(γ1γ1−γ0cI−cR+γ0γ1−γ0βγ1uF+(1+γ0γ1−γ0ρ1)u0R−γ0γ1−γ0cP+βγ1uFρˉ0)ρ0i−γ0γ1−γ0(cI+βγ1uF+ρ1u0R−cP+βγ1uFρˉ1)ρ1i+βγ0cP+βγ1uFρˉ0ρˉ1,u^I_{i,0}=\Big(\tfrac{\gamma_1}{\gamma_1-\gamma_0}c^I-c^R+\tfrac{\gamma_0}{\gamma_1-\gamma_0}\beta\gamma_1u_F+\big(1+\tfrac{\gamma_0}{\gamma_1-\gamma_0}\rho_1\big)u^R_0-\tfrac{\gamma_0}{\gamma_1-\gamma_0}\tfrac{c^P+\beta\gamma_1u_F}{\bar\rho_0}\Big)\rho_0^i-\tfrac{\gamma_0}{\gamma_1-\gamma_0}\Big(c^I+\beta\gamma_1u_F+\rho_1u^R_0-\tfrac{c^P+\beta\gamma_1u_F}{\bar\rho_1}\Big)\rho_1^i+\beta\gamma_0\tfrac{c^P+\beta\gamma_1u_F}{\bar\rho_0\bar\rho_1},ui,0I​=(γ1​−γ0​γ1​​cI−cR+γ1​−γ0​γ0​​βγ1​uF​+(1+γ1​−γ0​γ0​​ρ1​)u0R​−γ1​−γ0​γ0​​ρˉ​0​cP+βγ1​uF​​)ρ0i​−γ1​−γ0​γ0​​(cI+βγ1​uF​+ρ1​u0R​−ρˉ​1​cP+βγ1​uF​​)ρ1i​+βγ0​ρˉ​0​ρˉ​1​cP+βγ1​uF​​, ui,1I=(cI+βγ1uF+ρ1u0R−cP+βγ1uFρˉ1)ρ1i+cP+βγ1uFρˉ1.u^I_{i,1}=\Big(c^I+\beta\gamma_1u_F+\rho_1u^R_0-\tfrac{c^P+\beta\gamma_1u_F}{\bar\rho_1}\Big)\rho_1^i+\tfrac{c^P+\beta\gamma_1u_F}{\bar\rho_1}.ui,1I​=(cI+βγ1​uF​+ρ1​u0R​−ρˉ​1​cP+βγ1​uF​​)ρ1i​+ρˉ​1​cP+βγ1​uF​​.

The inspection sequence carries the extreme points created by production after an inspection; its closed form yields the function ggg of Lemma 7.

Formalization Note γ0≠γ1\gamma_0\ne\gamma_1γ0​=γ1​ is a hypothesis because the formula divides by γ1−γ0\gamma_1-\gamma_0γ1​−γ0​; uF>0u_F>0uF​>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
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

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