Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Observation 2.2, p. 8 — N(R*, Δ) ≤ N(T*, Δ) for every Δ ≥ 0

Proved
ContJRP.Align.observation_2_2_rep_orders

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

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

Under the standing assumptions below, the representatives place no more joint orders than the policy they are drawn from: for every Δ≥0\Delta\ge0Δ≥0,

N(R∗,Δ)≤N(T∗,Δ).N(\mathcal R^*,\Delta)\le N(T^*,\Delta).N(R∗,Δ)≤N(T∗,Δ).

Standing assumptions. Throughout, ϵ∈(0,12)\epsilon\in(0,\tfrac12)ϵ∈(0,21​); T∗=(T1∗,…,Tn∗)T^*=(T^*_1,\dots,T^*_n)T∗=(T1∗​,…,Tn∗​) is a policy with n≥1n\ge1n≥1 and all Ti∗>0T^*_i>0Ti∗​>0, Tmin⁡∗=min⁡iTi∗T^*_{\min}=\min_i T^*_iTmin∗​=mini​Ti∗​; T~min⁡\tilde T_{\min}T~min​ satisfies (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∗​; and R∗={Rℓ∗}ℓ∈A∗\mathcal R^*=\{R^*_\ell\}_{\ell\in\mathcal A^*}R∗={Rℓ∗​}ℓ∈A∗​ is any choice of representatives, Rℓ∗R^*_\ellRℓ∗​ being some Ti∗T^*_iTi∗​ in the active segment SℓS_\ellSℓ​.

This links the joint orders of the representatives to those of T∗T^*T∗ in the density bound (3).

Formalization Note Segments are 0-indexed in Lean (the paper's SℓS_\ellSℓ​ is Lean index ℓ−1\ell-1ℓ−1, so R1R_1R1​ is R 0). The statement is proved for every positive reference policy T∗T^*T∗, not only an optimal one, and does not assume the difficult regime Tmin⁡∗<(n/ϵ)K0/OPT~T^*_{\min}<(n/\epsilon)K_0/\widetilde{\mathrm{OPT}}Tmin∗​<(n/ϵ)K0​/OPT: the page's argument uses only (2).

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_2_rep_orders (ε : ℝ) (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)
    (Rstar : ℕ → ℝ) (hR : IsRepChoice ε Tt Tstar Rstar) :
    ∀ Δ : ℝ, 0 ≤ Δ → numOrders (active ε Tt Tstar) Rstar Δ ≤ numOrders Finset.univ 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.2
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