Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma A.1 — E1,E2,E3E_1, E_2, E_3E1​,E2​,E3​ partition inc(P)\mathrm{inc}(P)inc(P) and none contains a pair together with its reverse

Proved
SingleMachinePrec.ConvexBipartite.lemma_A_1

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

convex-bipartite-orderp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1posetsrealizer

Let P=(N,P)\mathbf P = (N, P)P=(N,P) be a convex bipartite order and let E1,E2,E3E_1, E_2, E_3E1​,E2​,E3​ be the sets of incomparable pairs defined in the Appendix. Then:

  1. the sets E1,E2,E3E_1, E_2, E_3E1​,E2​,E3​ form a partition of inc(P)\mathrm{inc}(\mathbf P)inc(P): a pair (x,y)(x,y)(x,y) is incomparable if and only if it lies in E1∪E2∪E3E_1 \cup E_2 \cup E_3E1​∪E2​∪E3​, and the three sets are pairwise disjoint;
  2. for every (x,y)∈inc(P)(x, y) \in \mathrm{inc}(\mathbf P)(x,y)∈inc(P) and every m∈{1,2,3}m \in \{1,2,3\}m∈{1,2,3},
(x,y)∈Em  ⟹  (y,x)∉Em.(x,y) \in E_m \implies (y,x) \notin E_m .(x,y)∈Em​⟹(y,x)∈/Em​.

Part 2 ensures that no Eˉm\bar E_mEˉm​ forces both orders of an incomparable pair, and part 1 that every incomparable pair is placed in some Eˉm\bar E_mEˉm​ in the direction it will be reversed.

Formalization Note "Partition" is read as covering plus pairwise disjointness; some of the EmE_mEm​ may be empty (for instance E3=∅E_3 = \emptysetE3​=∅ when there are no plus jobs). No numbering assumption on the plus jobs is used.

Preamble
import Mathlib
import Definitions.Def_SingleMachinePrec_ConvexBipartite_IncPartition
Formal statement
namespace SingleMachinePrec.ConvexBipartite

open ConvexBipartiteOrder

/-- Lemma A.1 (Ambühl et al. 2011, p. 668). For a convex bipartite order:
(i) `E₁, E₂, E₃` form a partition of `inc(P)` — every incomparable pair lies in one of them,
each of them consists of incomparable pairs, and they are pairwise disjoint;
(ii) for every incomparable pair `(x, y)` and every `m ∈ {1, 2, 3}`, if `(x, y) ∈ E_m` then
`(y, x) ∉ E_m`. -/
theorem lemma_A_1 {a b : ℕ} (C : ConvexBipartiteOrder a b) :
    ((∀ x y : Job a b, SingleMachinePrec.Framework.Incomparable C.prec x y ↔ (C.E1 x y ∨ C.E2 x y ∨ C.E3 x y)) ∧
      (∀ x y : Job a b, ¬ (C.E1 x y ∧ C.E2 x y)) ∧
      (∀ x y : Job a b, ¬ (C.E1 x y ∧ C.E3 x y)) ∧
      (∀ x y : Job a b, ¬ (C.E2 x y ∧ C.E3 x y))) ∧
    (∀ x y : Job a b, SingleMachinePrec.Framework.Incomparable C.prec x y →
      (C.E1 x y → ¬ C.E1 y x) ∧ (C.E2 x y → ¬ C.E2 y x) ∧ (C.E3 x y → ¬ C.E3 y x)) := by sorry

end SingleMachinePrec.ConvexBipartite
Source
Ambühl, Mastrolilli, Mutsanas, Svensson, On the Approximability of Single-Machine Scheduling with Precedence Constraints, Math. Oper. Res. 36(4) (2011), p. 668, Lemma A.1
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