Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

H1=∑i=1NhiH_1=\sum_{i=1}^Nh_iH1​=∑i=1N​hi​

Proved
RoslingAssembly.end_install_cost_eq_sum

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

assembly-systemsinventorymulti-echelon-inventoryoperations-researchstochastic-control

In every assembly network, for every vector of installation holding costs H∈RNH\in\mathbb R^NH∈RN, the installation holding cost of the end item equals the sum of all echelon holding costs:

H1=∑i=1Nhi,hi=Hi−∑k∈P(i)Hk.H_1=\sum_{i=1}^Nh_i,\qquad h_i=H_i-\sum_{k\in P(i)}H_k .H1​=i=1∑N​hi​,hi​=Hi​−k∈P(i)∑​Hk​.

It ties the backlog coefficient p+H1p+H_1p+H1​ of (2) to the echelon costs.

Formalization Note The end item is Lean item 000.

Differences from the source:

  • generalization: the items are indexed so that M_i ≥ M_{i−1} for all i (p. 567) → not assumed; only the clause k < i for k ∈ A(i) is kept (Network.s_lt); reason: the clause is never used; every tree has such an indexing and the statement is invariant under reindexing, so the Lean statement specializes to the paper's
  • encoding: items 1, …, N, end item 1, s(1) = 0, M_0 = 0 → items Fin N, 0-based, end item 0, s 0 = none, Ms 0 = 0; reason: renaming of indices; same instances
Preamble
import Mathlib
import Definitions.Def_RoslingAssembly_Network_h
Formal statement
namespace RoslingAssembly

/-- **H_1 = Σ h_i** (Appendix A1, p. 575, unnumbered). Rosling, *Optimal Inventory Policies for
Assembly Systems under Random Demands*, Operations Research 37(4), 1989, Appendix A, §1, p. 575:
"Recalling that H_1 = Σ_{i=1}^N h_i, the modifications are".

The installation holding cost of the end item equals the sum of the echelon holding costs of all
items, `H_1 = Σ_i h_i`, where `h_i = H_i − Σ_{k∈P(i)} H_k`.

**Formalization Note.** Items are `Fin N`, 0-based: the end item (paper item 1) is Lean item
`0`; `[NeZero N]` makes it exist. `H` is arbitrary. -/
theorem end_install_cost_eq_sum {N : ℕ} [NeZero N] (net : Network N) (H : Fin N → ℝ) :
    H 0 = ∑ i, net.h H i := by sorry

end RoslingAssembly
Source
Rosling, Optimal Inventory Policies for Assembly Systems under Random Demands, Operations Research 37(4), 1989, Appendix A, §1, p. 575 (unnumbered)

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