Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§9, p. 666 — val(σ) = Σᵢ (σ(i+1) − σ(i))·i = n² − Σᵢ σ(i)

Proved
SingleMachinePrec.Biclique.value_identity

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

gantt-chartp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1scheduling

Let G=(U,V,E)G=(U,V,E)G=(U,V,E) be an nnn-by-nnn bipartite graph and σ\sigmaσ any schedule (any ordering) of all the jobs U∪VU\cup VU∪V of SGS_GSG​. For i≥1i\ge1i≥1 let σ(i)\sigma(i)σ(i) be the number of jobs of VVV scheduled before iii jobs of UUU have been scheduled. Then σ(n+1)=n\sigma(n+1)=nσ(n+1)=n, and

val(σ)=∑i=1n(σ(i+1)−σ(i)) i=n2−∑i=1nσ(i).\mathrm{val}(\sigma)=\sum_{i=1}^{n}\bigl(\sigma(i+1)-\sigma(i)\bigr)\,i=n^2-\sum_{i=1}^{n}\sigma(i).val(σ)=i=1∑n​(σ(i+1)−σ(i))i=n2−i=1∑n​σ(i).

The identity expresses the objective of SGS_GSG​ through the profile σ(1)≤⋯≤σ(n)\sigma(1)\le\dots\le\sigma(n)σ(1)≤⋯≤σ(n) of the schedule's "work line" in the two-dimensional Gantt chart; it turns the lower bound of Lemma 9.1 into an upper bound on ∑iσ(i)\sum_i\sigma(i)∑i​σ(i).

Formalization Note The paper states this for an optimal schedule σ∗\sigma^*σ∗ and sets σ∗(n+1)=n\sigma^*(n+1)=nσ∗(n+1)=n by convention; here it is stated for every ordering of the jobs (feasibility is not needed), and σ(n+1)=n\sigma(n+1)=nσ(n+1)=n is a consequence of the definition of σ(i)\sigma(i)σ(i), stated as the first conclusion.

Preamble
import Mathlib
import Definitions.Def_SingleMachinePrec_Biclique_SG
Formal statement
namespace SingleMachinePrec.Biclique

/-- §9, p. 666 (proof of Lemma 9.1, value identity). Let `G = (U, V, E)` be an `n`-by-`n`
bipartite graph and `l` any sequence of all the jobs `U ∪ V` of `S_G`. With `σ(i)` the number of
jobs of `V` scheduled before `i` jobs of `U` have been scheduled (`vBefore l i`), one has
`σ(n + 1) = n`, and the value of `l` is
`Σ_{i=1}^{n} (σ(i + 1) − σ(i)) · i = n² − Σ_{i=1}^{n} σ(i)`. -/
theorem value_identity {U V : Type*} [Fintype U] [Fintype V] [DecidableEq U] [DecidableEq V]
    (n : ℕ) (hU : Fintype.card U = n) (hV : Fintype.card V = n) (l : List (U ⊕ V))
    (hl : MooreLateJobs.Shared.IsSchedule Finset.univ l) :
    vBefore l (n + 1) = n ∧
      valSG l = ∑ i ∈ Finset.Icc 1 n, ((vBefore l (i + 1) : ℝ) - (vBefore l i : ℝ)) * (i : ℝ) ∧
      valSG l = (n : ℝ) ^ 2 - ∑ i ∈ Finset.Icc 1 n, (vBefore l i : ℝ) := by sorry

end SingleMachinePrec.Biclique
Source
Ambühl, Mastrolilli, Mutsanas, Svensson, On the Approximability of Single-Machine Scheduling with Precedence Constraints, Math. Oper. Res. 36(4) (2011), p. 666, §9, proof of Lemma 9.1 (displayed identity)
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

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