Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 9.1 — n² − an²(ln 1/a + 2) ≤ val(σ*) ≤ n² − an² for the instance S_G

Proved
SingleMachinePrec.Biclique.lemma_9_1

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

approximationbicliqueinapproximabilityp2o-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 SGS_GSG​ its bipartite scheduling instance: jobs U∪VU\cup VU∪V, precedence constraints P=(U×V)∖EP=(U\times V)\setminus EP=(U×V)∖E, the jobs of UUU with processing time 111 and weight 000 and the jobs of VVV with processing time 000 and weight 111. Suppose a maximum edge biclique of GGG has value an2a n^2an2 for some a∈(0,1]a\in(0,1]a∈(0,1]. Then SGS_GSG​ has an optimal schedule, and the value of every optimal schedule σ∗\sigma^*σ∗ satisfies

n2−an2(ln⁡1a+2)  ≤  val(σ∗)  ≤  n2−an2,n^2-a n^2\Bigl(\ln\frac1a+2\Bigr)\;\le\;\mathrm{val}(\sigma^*)\;\le\;n^2-a n^2 ,n2−an2(lna1​+2)≤val(σ∗)≤n2−an2,

where ln⁡\lnln is the natural logarithm.

The lemma ties the optimum of 1 ∣ prec ∣ ∑wjCj1\,|\,\mathrm{prec}\,|\,\sum w_jC_j1∣prec∣∑wj​Cj​ on SGS_GSG​ to the maximum edge biclique of GGG up to a logarithmic factor; through the hardness of maximum edge biclique it is the step from which the paper derives that 1 ∣ prec ∣ ∑wjCj1\,|\,\mathrm{prec}\,|\,\sum w_jC_j1∣prec∣∑wj​Cj​ has no PTAS under a complexity assumption (Theorem 9.2, not part of this statement).

Formalization Note The existence of an optimal schedule, implicit in the paper's "an optimal schedule σ∗\sigma^*σ∗", is stated as a conclusion so that the bounds are not vacuous. The paper's proof splits a sum at (1−a)n(1-a)n(1−a)n and uses ⌊an⌋\lfloor an\rfloor⌊an⌋; ananan need not be an integer, and no integrality hypothesis is added.

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

/-- Lemma 9.1 (Ambühl, Mastrolilli, Mutsanas, Svensson 2011, p. 666). Let `G = (U, V, E)` be an
`n`-by-`n` bipartite graph and `S_G` its bipartite scheduling instance (jobs `U ∪ V`, precedence
constraints `P = (U × V) \ E`, the jobs of `U` with processing time `1` and weight `0`, the jobs of
`V` with processing time `0` and weight `1`). If a maximum edge biclique of `G` has value `a n²`
for some `a ∈ (0, 1]`, then an optimal schedule `σ*` of `S_G` exists, and every optimal schedule
satisfies `n² − a n² (ln (1/a) + 2) ≤ val(σ*) ≤ n² − a n²` (natural logarithm). -/
theorem lemma_9_1 {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 : ℝ) (ha0 : 0 < a) (ha1 : a ≤ 1)
    (hmax : (maxBicliqueValue E : ℝ) = a * (n : ℝ) ^ 2) :
    (∃ l : List (U ⊕ V), IsOptimalSG E l) ∧
      ∀ l : List (U ⊕ V), IsOptimalSG E l →
        (n : ℝ) ^ 2 - a * (n : ℝ) ^ 2 * (Real.log (1 / a) + 2) ≤ valSG l ∧
          valSG l ≤ (n : ℝ) ^ 2 - a * (n : ℝ) ^ 2 := 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, Lemma 9.1
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