Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7, p. 27 — the [PIR] anchor u^R_0 solving u^R_0 = c^R + βp_0′u^I_m is g(m) of (40)

Proved
MaintPOMDP.Frontier.lemma_7

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

u0R=cR+βp0′umI,u^R_0=c^R+\beta\mathbf p_0'\mathbf u^I_m,u0R​=cR+βp0′​umI​,

where umI\mathbf u^I_mumI​ is the mmm-th term of the inspection sequence of Lemma 6 started at (35), with uF=u0R+cF−cRu_F=u^R_0+c^F-c^RuF​=u0R​+cF−cR. Then u0R=g(m)u^R_0=g(m)u0R​=g(m), where

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

In particular the anchor g(m)g(m)g(m) of the mission's definitions equals this closed form.

The function ggg is minimized in the recurrent-inspection structure [PIR][PIR][PIR] of Theorem 2.

Formalization Note γ0≠γ1\gamma_0\ne\gamma_1γ0​=γ1​ is a hypothesis because (40) divides by γ1−γ0\gamma_1-\gamma_0γ1​−γ0​. The second conjunct links the formula to the definition of ggg used by the goal theorem.

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

/-- Lemma 7 (p. 27): for γ0 ≠ γ1, if u^R_0 = c^R + β p0′u^I_m, where u^I_m is the m-th term of the
inspection sequence (35), (37) with u_F = u^R_0 + c^F − c^R, then u^R_0 = g(m) with g the closed
form (40); in particular the anchor g(m) equals (40). -/
theorem lemma_7 (M : Params) (hM : M.Standing) (hγ : M.γ0 ≠ M.γ1) (m : ℕ) :
    (∀ uR0 : ℝ,
        uR0 = M.cR + M.β * dot M.p0
          (M.prodSeq (M.inspStart uR0 (uR0 + M.cF - M.cR)) (uR0 + M.cF - M.cR) m) →
        uR0 = M.g40 m) ∧
      M.g m = M.g40 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. 27, Lemma 7, (40)
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