Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3, p. 21 — the anchor u^R solving u^R = c^R + βp_0′u_m is f(m) of (31)

Proved
MaintPOMDP.Frontier.lemma_3

by mikedeng1 · Oct 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

machine-maintenancep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pomdp

Under the standing assumptions and γ0≠γ1\gamma_0\ne\gamma_1γ0​=γ1​, fix m∈{0,1,… }m\in\{0,1,\dots\}m∈{0,1,…}. Suppose uRu^RuR satisfies

uR=cR+βp0′um,u^R=c^R+\beta\mathbf p_0'\mathbf u_m,uR=cR+βp0′​um​,

where um\mathbf u_mum​ is the mmm-th term of the production sequence u0=(uR,uR)′\mathbf u_0=(u^R,u^R)'u0​=(uR,uR)′, 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 uF=uR+cF−cRu_F=u^R+c^F-c^RuF​=uR+cF−cR. Then uR=f(m)u^R=f(m)uR=f(m), where

f(m)=ρˉ0ρˉ1cR+[βγ0+γ0γ1−γ0(ρˉ0ρ1m+1−ρˉ1ρ0m+1)][cP+βγ1(cF−cR)]ρˉ0ρˉ1−β2γ0γ1−1−βγ1−γ0(γ1ρˉ1ρ0m+1−γ0ρˉ0ρ1m+1).f(m)=\frac{\bar\rho_0\bar\rho_1c^R+\Big[\beta\gamma_0+\frac{\gamma_0}{\gamma_1-\gamma_0}\big(\bar\rho_0\rho_1^{m+1}-\bar\rho_1\rho_0^{m+1}\big)\Big]\big[c^P+\beta\gamma_1(c^F-c^R)\big]}{\bar\rho_0\bar\rho_1-\beta^2\gamma_0\gamma_1-\frac{1-\beta}{\gamma_1-\gamma_0}\big(\gamma_1\bar\rho_1\rho_0^{m+1}-\gamma_0\bar\rho_0\rho_1^{m+1}\big)} .f(m)=ρˉ​0​ρˉ​1​−β2γ0​γ1​−γ1​−γ0​1−β​(γ1​ρˉ​1​ρ0m+1​−γ0​ρˉ​0​ρ1m+1​)ρˉ​0​ρˉ​1​cR+[βγ0​+γ1​−γ0​γ0​​(ρˉ​0​ρ1m+1​−ρˉ​1​ρ0m+1​)][cP+βγ1​(cF−cR)]​.

In particular the anchor f(m)f(m)f(m) of the mission's definitions (the solution of this affine equation) equals the closed form above.

The function fff is the one minimized in Theorem 1: the recurrent-replacement frontier is anchored at (f(m†),f(m†))′(f(m^\dagger),f(m^\dagger))'(f(m†),f(m†))′.

Formalization Note The closed form divides by γ1−γ0\gamma_1-\gamma_0γ1​−γ0​, so γ0≠γ1\gamma_0\ne\gamma_1γ0​=γ1​ is a hypothesis (footnote 2 and App. B treat γ0=γ1\gamma_0=\gamma_1γ0​=γ1​ separately). The second conjunct links the formula to the definition of fff used by the main theorems.

Preamble
import Mathlib
import Definitions.Def_MaintPOMDP_Frontier_Setting
open Filter Topology
Formal statement
namespace MaintPOMDP.Frontier

/-- Lemma 3 (p. 21): for γ0 ≠ γ1, if u^R = c^R + β p0′u_m, where u_m is the m-th term of the
production sequence started at u_0 = (u^R, u^R)′ with u_F = u^R + c^F − c^R, then u^R = f(m) with
f the closed form (31); in particular the anchor f(m) equals (31). -/
theorem lemma_3 (M : Params) (hM : M.Standing) (hγ : M.γ0 ≠ M.γ1) (m : ℕ) :
    (∀ uR : ℝ,
        uR = M.cR + M.β * dot M.p0 (M.prodSeq (diag uR) (uR + M.cF - M.cR) m) →
        uR = M.f31 m) ∧
      M.f m = M.f31 m := 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. 21, Lemma 3, (31)
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