Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§9, p. 666 — the schedule U∖A → B → A → V∖B is feasible and has value n² − |A|·|B|

Proved
SingleMachinePrec.Biclique.upper_bound_schedule

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

bicliquep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1precedence-constraintsscheduling

Let G=(U,V,E)G=(U,V,E)G=(U,V,E) be an nnn-by-nnn bipartite graph (∣U∣=∣V∣=n|U|=|V|=n∣U∣=∣V∣=n), SGS_GSG​ its bipartite scheduling instance, and (A,B)(A,B)(A,B) an edge biclique of GGG (A⊆UA\subseteq UA⊆U, B⊆VB\subseteq VB⊆V, A×B⊆EA\times B\subseteq EA×B⊆E). Then a schedule of all jobs of SGS_GSG​ in the block order

U∖A  →  B  →  A  →  V∖BU\setminus A\;\to\;B\;\to\;A\;\to\;V\setminus BU∖A→B→A→V∖B

exists, and every such schedule σ\sigmaσ is feasible for SGS_GSG​ and has value

val(σ)=(n−∣A∣) ∣B∣+n (n−∣B∣)=n2−∣A∣⋅∣B∣.\mathrm{val}(\sigma)=(n-|A|)\,|B|+n\,(n-|B|)=n^2-|A|\cdot|B| .val(σ)=(n−∣A∣)∣B∣+n(n−∣B∣)=n2−∣A∣⋅∣B∣.

This is the upper half of Lemma 9.1: applied to a maximum edge biclique it gives val(σ∗)≤n2−MEB(G)\mathrm{val}(\sigma^*)\le n^2-\mathrm{MEB}(G)val(σ∗)≤n2−MEB(G).

Formalization Note The paper writes val(σ)≤⋯=n2−∣A∣⋅∣B∣\mathrm{val}(\sigma)\le\dots=n^2-|A|\cdot|B|val(σ)≤⋯=n2−∣A∣⋅∣B∣; the value is in fact equal to n2−∣A∣⋅∣B∣n^2-|A|\cdot|B|n2−∣A∣⋅∣B∣, which is what is stated. Feasibility, which the paper argues from the absence of precedence constraints from AAA to BBB, is part of the conclusion.

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

/-- §9, p. 666 (proof of Lemma 9.1, upper bound). Let `G = (U, V, E)` be an `n`-by-`n` bipartite
graph and `(A, B)` an edge biclique of `G`. A sequence of all the jobs of `S_G` in the order
`U \ A → B → A → V \ B` exists; every such sequence observes the precedence constraints
`P = (U × V) \ E` of `S_G`, and its value is `n² − |A| · |B|`. -/
theorem upper_bound_schedule {U V : Type*} [Fintype U] [Fintype V] [DecidableEq U]
    [DecidableEq V] (E : U → V → Prop) (n : ℕ) (hU : Fintype.card U = n)
    (hV : Fintype.card V = n) (A : Finset U) (B : Finset V) (hAB : IsEdgeBiclique E A B) :
    (∃ l : List (U ⊕ V), InBlockOrder A B l) ∧
      ∀ l : List (U ⊕ V), InBlockOrder A B l →
        LawlerPrec.MinMax.IsFeasible (precSG E) Finset.univ l ∧
          valSG l = (n : ℝ) ^ 2 - (A.card : ℝ) * (B.card : ℝ) := 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 (upper bound)
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