Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7.1 a), p. 32 — every feasible schedule S of R(I) has #(SAT(S)) ≥ 4n + 4m − VAL(S)

Proved
SkutellaCQP.MaxSNP.lemma_7_1_a

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 (v-jobs of length 444 released at 000, c-jobs of length 000 released at 333, a true and a false machine per variable). For every feasible schedule SSS of R(I)R(I)R(I), the truth assignment SAT(S)\mathrm{SAT}(S)SAT(S) read off from the machines of the v-jobs satisfies

#(SAT(S)) ≥ 4n+4m−VAL(S),\#(\mathrm{SAT}(S))\ \ge\ 4n+4m-\mathrm{VAL}(S),#(SAT(S)) ≥ 4n+4m−VAL(S),

where #(t)\#(t)#(t) is the number of clauses satisfied by ttt and VAL(S)\mathrm{VAL}(S)VAL(S) is the total completion time of SSS.

This is the direction of the reduction that maps schedules back to truth assignments without losing more than the schedule's excess over 4n+4m4n+4m4n+4m.

Formalization Note The inequality is stated over the reals, so no natural-number subtraction occurs. The hypothesis that III is a valid instance includes the at-most-three-occurrences condition of the page and the two conventions described in the definitions file (clauses have one to three literals, every variable occurs).

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

/-- Lemma 7.1 a) (p. 32). For every feasible schedule `S` of `R(I)`, the truth assignment
`SAT(S)` satisfies at least `4n + 4m − VAL(S)` clauses of `I`. -/
theorem lemma_7_1_a {n m : ℕ} (I : Occ3Max3Sat n m) (hI : I.IsValid)
    (S : Sched n m) (hS : Feasible I S) :
    (4 * n + 4 * m : ℝ) - VAL S ≤ satCount I (SAT S) := by sorry

end SkutellaCQP.MaxSNP
Source
Skutella, Convex quadratic and semidefinite programming relaxations in scheduling, J. ACM 48 (2001), p. 32, Lemma 7.1 a)
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