Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Observation 2.3, p. 8 — S_1 is active, so R*_1 ∈ R*

Proved
ContJRP.Align.observation_2_3_first_segment_active

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

approximation-schemejoint-replenishmentp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let ϵ∈(0,12)\epsilon\in(0,\tfrac12)ϵ∈(0,21​), let T∗T^*T∗ be a policy with n≥1n\ge1n≥1 and all Ti∗>0T^*_i>0Ti∗​>0, and let T~min⁡\tilde T_{\min}T~min​ satisfy (2), (1−ϵ/2)Tmin⁡∗≤T~min⁡≤Tmin⁡∗(1-\epsilon/2)T^*_{\min}\le\tilde T_{\min}\le T^*_{\min}(1−ϵ/2)Tmin∗​≤T~min​≤Tmin∗​. Then the first segment

S1=[T~min⁡,(1+ϵ)T~min⁡)S_1=[\tilde T_{\min},(1+\epsilon)\tilde T_{\min})S1​=[T~min​,(1+ϵ)T~min​)

is active, i.e. 1∈A∗1\in\mathcal A^*1∈A∗; hence its representative R1∗R^*_1R1∗​ belongs to R∗\mathcal R^*R∗.

This guarantees that the large-interval option ⌈Timax⁡⌉(R^1)\lceil T^{\max}_i\rceil^{(\hat R_1)}⌈Timax​⌉(R^1​) of the final policy is a multiple of an approximate representative, so it falls on placed joint orders.

Formalization Note In Lean the paper's S1S_1S1​ is segment index 000, so the statement is 0 ∈ active ε Tt Tstar; it includes 1≤L1\le L1≤L.

Preamble
import Mathlib
import Definitions.Def_ContJRP_Align_Model
import Definitions.Def_ContJRP_Align_Alignment
import Definitions.Def_ContJRP_Align_Policy
Formal statement
namespace ContJRP.Align

theorem observation_2_3_first_segment_active (ε : ℝ) (hε0 : 0 < ε) (hε1 : ε < 1 / 2)
    {n : ℕ} [NeZero n] (Tstar : Fin n → ℝ) (hTstar : ∀ i, 0 < Tstar i)
    (Tt : ℝ) (hTt1 : (1 - ε / 2) * tmin Tstar ≤ Tt) (hTt2 : Tt ≤ tmin Tstar) :
    0 ∈ active ε Tt Tstar := by sorry

end ContJRP.Align
Source
Segev, The Continuous-Time Joint Replenishment Problem: ϵ-Optimal Policies via Pairwise Alignment, arXiv:2302.09941v1, p. 8, Observation 2.3
Human review
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

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