Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7, proof of Theorem 7.2, p. 33 — second L-reduction condition: OPT_SAT(I) − #(SAT(S)) ≤ VAL(S) − OPT_SCH(R(I))

Proved
SkutellaCQP.MaxSNP.l_condition_2

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, let R(I)R(I)R(I) be the scheduling instance constructed from it, and let S0S_0S0​ be an optimal schedule of R(I)R(I)R(I). For every feasible schedule SSS of R(I)R(I)R(I),

OPTSAT(I)−#(SAT(S)) ≤ VAL(S)−OPTSCH(R(I)),\mathrm{OPT}_{\mathrm{SAT}}(I)-\#(\mathrm{SAT}(S))\ \le\ \mathrm{VAL}(S)-\mathrm{OPT}_{\mathrm{SCH}}(R(I)),OPTSAT​(I)−#(SAT(S)) ≤ VAL(S)−OPTSCH​(R(I)),

where OPTSCH(R(I))=VAL(S0)\mathrm{OPT}_{\mathrm{SCH}}(R(I))=\mathrm{VAL}(S_0)OPTSCH​(R(I))=VAL(S0​).

This is the second condition of an L-reduction with constant β=1\beta=1β=1: the loss of the truth assignment recovered from a schedule is at most the excess of the schedule over the optimum.

Formalization Note "S0S_0S0​ optimal" is the pair of hypotheses: S0S_0S0​ is feasible, and VAL(S0)≤VAL(S)\mathrm{VAL}(S_0)\le\mathrm{VAL}(S)VAL(S0​)≤VAL(S) for every feasible SSS. The inequality is stated over the reals.

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

/-- Proof of Theorem 7.2 (p. 33), second L-reduction condition: for an optimal schedule `S₀` and
every feasible schedule `S` of `R(I)`, `OPT_SAT(I) − #(SAT(S)) ≤ VAL(S) − OPT_SCH(R(I))`. -/
theorem l_condition_2 {n m : ℕ} (I : Occ3Max3Sat n m) (hI : I.IsValid)
    (S₀ : Sched n m) (hS₀ : Feasible I S₀) (hopt : ∀ S, Feasible I S → VAL S₀ ≤ VAL S)
    (S : Sched n m) (hS : Feasible I S) :
    (optSat I : ℝ) - satCount I (SAT 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, §7, proof of Theorem 7.2, second display
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