Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1, p. 19 — the production sequence u_{i+1} = g^P(u_F) + βP^P u_i in closed form (29)–(30)

Proved
MaintPOMDP.Frontier.lemma_1

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 uR∈Ru^R\in\mathbb RuR∈R and uF>0u_F>0uF​>0, and define u0=(uR,uR)′\mathbf u_0=(u^R,u^R)'u0​=(uR,uR)′ and ui+1=gP(uF)+βPPui\mathbf u_{i+1}=\mathbf g^P(u_F)+\beta\mathbf P^P\mathbf u_iui+1​=gP(uF​)+βPPui​. With γˉx=1−γx\bar\gamma_x=1-\gamma_xγˉ​x​=1−γx​, ρx=βγˉx\rho_x=\beta\bar\gamma_xρx​=βγˉ​x​, ρˉx=1−ρx\bar\rho_x=1-\rho_xρˉ​x​=1−ρx​, for every i≥0i\ge0i≥0,

ui,0=γ1γ1−γ0(uR−γ0γ1cP+βγ1uFρˉ0)ρ0i−γ0γ1−γ0(uR−cP+βγ1uFρˉ1)ρ1i+βγ0(cP+βγ1uF)ρˉ0ρˉ1,u_{i,0}=\frac{\gamma_1}{\gamma_1-\gamma_0}\Big(u^R-\frac{\gamma_0}{\gamma_1}\frac{c^P+\beta\gamma_1u_F}{\bar\rho_0}\Big)\rho_0^i-\frac{\gamma_0}{\gamma_1-\gamma_0}\Big(u^R-\frac{c^P+\beta\gamma_1u_F}{\bar\rho_1}\Big)\rho_1^i+\frac{\beta\gamma_0(c^P+\beta\gamma_1u_F)}{\bar\rho_0\bar\rho_1},ui,0​=γ1​−γ0​γ1​​(uR−γ1​γ0​​ρˉ​0​cP+βγ1​uF​​)ρ0i​−γ1​−γ0​γ0​​(uR−ρˉ​1​cP+βγ1​uF​​)ρ1i​+ρˉ​0​ρˉ​1​βγ0​(cP+βγ1​uF​)​, ui,1=(uR−cP+βγ1uFρˉ1)ρ1i+cP+βγ1uFρˉ1.u_{i,1}=\Big(u^R-\frac{c^P+\beta\gamma_1u_F}{\bar\rho_1}\Big)\rho_1^i+\frac{c^P+\beta\gamma_1u_F}{\bar\rho_1}.ui,1​=(uR−ρˉ​1​cP+βγ1​uF​​)ρ1i​+ρˉ​1​cP+βγ1​uF​​.

The production sequence carries the extreme points of the frontier created by action PPP; the closed form is what turns the anchor equation of Lemma 3 into the explicit function fff.

Formalization Note The paper writes the formula without the hypothesis γ0≠γ1\gamma_0\ne\gamma_1γ0​=γ1​ and reads it by L'Hôpital's rule at γ0=γ1\gamma_0=\gamma_1γ0​=γ1​ (footnote 2); here γ0≠γ1\gamma_0\ne\gamma_1γ0​=γ1​ is a hypothesis, since Lean's division by zero returns 0. The hypothesis 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 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
  • 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