Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7.1 b), p. 33 — OPT_SCH(R(I)) = 4n + 4m − OPT_SAT(I)

Proved
SkutellaCQP.MaxSNP.lemma_7_1_b

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

l-reductionmax-3-satp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1schedulingtotal-completion-time

Let III be an instance of 3-OCCURRENCE MAX3SAT with nnn variables and mmm clauses, and let R(I)R(I)R(I) be the scheduling instance constructed from it. Then R(I)R(I)R(I) has an optimal schedule, and the optimal values of R(I)R(I)R(I) and of III are related by

OPTSCH(R(I))=4n+4m−OPTSAT(I),\mathrm{OPT}_{\mathrm{SCH}}(R(I))=4n+4m-\mathrm{OPT}_{\mathrm{SAT}}(I),OPTSCH​(R(I))=4n+4m−OPTSAT​(I),

where OPTSCH(R(I))\mathrm{OPT}_{\mathrm{SCH}}(R(I))OPTSCH​(R(I)) is the minimum total completion time of a feasible schedule and OPTSAT(I)\mathrm{OPT}_{\mathrm{SAT}}(I)OPTSAT​(I) is the maximum number of clauses satisfied by a truth assignment.

Together with part a) this identifies the scheduling optimum with the satisfiability optimum up to the affine map k↦4n+4m−kk\mapsto 4n+4m-kk↦4n+4m−k.

Formalization Note OPTSCH\mathrm{OPT}_{\mathrm{SCH}}OPTSCH​ is not a primitive: the statement asserts a feasible schedule S0S_0S0​ with VAL(S0)=4n+4m−OPTSAT(I)\mathrm{VAL}(S_0)=4n+4m-\mathrm{OPT}_{\mathrm{SAT}}(I)VAL(S0​)=4n+4m−OPTSAT​(I) and VAL(S0)≤VAL(S)\mathrm{VAL}(S_0)\le\mathrm{VAL}(S)VAL(S0​)≤VAL(S) for every feasible SSS. The existence of an optimal schedule is part of the page's claim (it speaks of "the values of optimal solutions").

Preamble
import Mathlib
import Definitions.Def_SkutellaCQP_MaxSNP_Setting
Formal statement
namespace SkutellaCQP.MaxSNP

/-- Lemma 7.1 b) (p. 33). `R(I)` has an optimal schedule, and its value is
`OPT_SCH(R(I)) = 4n + 4m − OPT_SAT(I)`. -/
theorem lemma_7_1_b {n m : ℕ} (I : Occ3Max3Sat n m) (hI : I.IsValid) :
    ∃ S₀ : Sched n m, Feasible I S₀ ∧ VAL S₀ = (4 * n + 4 * m : ℝ) - optSat I ∧
      ∀ S, Feasible I S → VAL S₀ ≤ VAL S := by sorry

end SkutellaCQP.MaxSNP
Source
Skutella, Convex quadratic and semidefinite programming relaxations in scheduling, J. ACM 48 (2001), p. 33, Lemma 7.1 b)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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