Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.2.1, p. 312 — with n ≥ 2 there are distinct J_r, J_l with a_r ≥ max_{A} bⱼ and b_l ≥ max_{B} aⱼ

Proved
SchedSurvey.O2.exists_r_l

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

makespanopen-shopp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1scheduling

Consider the two-machine open shop with nnn jobs and nonnegative processing times aja_jaj​ on M1M_1M1​ and bjb_jbj​ on M2M_2M2​, and let A={Jj∣aj≥bj}A = \{J_j \mid a_j \ge b_j\}A={Jj​∣aj​≥bj​}, B={Jj∣aj<bj}B = \{J_j \mid a_j < b_j\}B={Jj​∣aj​<bj​}. If n≥2n \ge 2n≥2, there are two distinct jobs JrJ_rJr​ and JlJ_lJl​ such that

ar≥max⁡Jj∈Abj,bl≥max⁡Jj∈Baj.a_r \ge \max_{J_j \in A} b_j, \qquad b_l \ge \max_{J_j \in B} a_j .ar​≥Jj​∈Amax​bj​,bl​≥Jj​∈Bmax​aj​.

The analysis of O2∥Cmax⁡O2\|C_{\max}O2∥Cmax​ in the survey begins by choosing such a pair; this statement asserts that the choice is always possible.

Formalization Note Each maximum is written as a bound on every member (bj≤arb_j \le a_rbj​≤ar​ for all Jj∈AJ_j \in AJj​∈A), which is also correct when AAA or BBB is empty. The hypothesis n≥2n \ge 2n≥2 is added: the page presupposes two distinct jobs.

Preamble
import Mathlib
import Definitions.Def_SchedSurvey_O2_Model
Formal statement
namespace SchedSurvey.O2

/-- §5.2.1, p. 312: with at least two jobs, there are two distinct jobs `r` (`J_r`) and `l`
(`J_l`) with `a_r ≥ max_{Jⱼ ∈ A} bⱼ` and `b_l ≥ max_{Jⱼ ∈ B} aⱼ`; the maxima over `A`, `B`
are written as bounds for every member, which is also correct when `A` or `B` is empty. -/
theorem exists_r_l {n : ℕ} (a b : Fin n → ℝ) (ha : ∀ j, 0 ≤ a j) (hb : ∀ j, 0 ≤ b j)
    (hn : 2 ≤ n) :
    ∃ r l : Fin n, r ≠ l ∧ (∀ j ∈ setA a b, b j ≤ a r) ∧ (∀ j ∈ setB a b, a j ≤ b l) := by sorry

end SchedSurvey.O2
Source
Graham, Lawler, Lenstra, Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey, Ann. Discrete Math. 5 (1979), p. 312, §5.2.1, "Now choose J_r and J_l to be any two distinct jobs …"
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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