Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma A.2 — each Eˉm=Em∪P\bar E_m = E_m \cup PEˉm​=Em​∪P extends to a linear order

Proved
SingleMachinePrec.ConvexBipartite.lemma_A_2

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

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

Let P\mathbf PP be a convex bipartite order whose plus jobs are numbered so that a smaller index never has a larger left end: for plus jobs ji,jjj_i, j_jji​,jj​, i<ji < ji<j implies l(i)≤l(j)l(i) \le l(j)l(i)≤l(j) (the standing assumption of the Appendix, p. 667). Let Eˉm=Em∪P\bar E_m = E_m \cup PEˉm​=Em​∪P for m=1,2,3m = 1, 2, 3m=1,2,3. Then each Eˉm\bar E_mEˉm​ is an extension of PPP in the sense used by the paper: it contains PPP and it contains no cycle, so that it is contained in a linear order on NNN. That is, for each m∈{1,2,3}m \in \{1,2,3\}m∈{1,2,3} there is a linear order LmL_mLm​ on NNN with

Eˉm⊆Lm.\bar E_m \subseteq L_m .Eˉm​⊆Lm​.

Since P⊆EˉmP \subseteq \bar E_mP⊆Eˉm​, every such LmL_mLm​ is a linear extension of PPP; these are the three linear orders of the realizer in Lemma 4.1.

Formalization Note The paper calls Eˉm\bar E_mEˉm​ "extensions of PPP" and its proof shows that they "do not contain cycles"; the next paragraph takes "any linear extensions of Eˉ1,Eˉ2,Eˉ3\bar E_1, \bar E_2, \bar E_3Eˉ1​,Eˉ2​,Eˉ3​". The relation Eˉ2\bar E_2Eˉ2​ itself need not be transitive (with one plus job j3j_3j3​, l(3)=r(3)=2l(3)=r(3)=2l(3)=r(3)=2: (j1,j2)∈E2(j_1,j_2)\in E_2(j1​,j2​)∈E2​, (j2,j3)∈P(j_2,j_3)\in P(j2​,j3​)∈P, but (j1,j3)∈E1(j_1,j_3)\in E_1(j1​,j3​)∈E1​), so "is a partial order" would be false; the formal statement is the existence of a linear order containing Eˉm\bar E_mEˉm​, which is equivalent to acyclicity. The numbering assumption is the hypothesis Monotone C.l.

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

open ConvexBipartiteOrder

/-- Lemma A.2 (Ambühl et al. 2011, p. 668). Assume the plus jobs are numbered so that a smaller
plus index has a smaller or equal left end `l` (Appendix, p. 667). Then each of
`Ē₁ = E₁ ∪ P`, `Ē₂ = E₂ ∪ P`, `Ē₃ = E₃ ∪ P` is contained in a linear order on the jobs
("is an extension of P": it contains `P` and has no cycle), i.e. each has a linear extension. -/
theorem lemma_A_2 {a b : ℕ} (C : ConvexBipartiteOrder a b) (hnum : Monotone C.l) :
    (∃ L : Job a b → Job a b → Prop, IsLinearExtension (C.Ebar C.E1) L) ∧
    (∃ L : Job a b → Job a b → Prop, IsLinearExtension (C.Ebar C.E2) L) ∧
    (∃ L : Job a b → Job a b → Prop, IsLinearExtension (C.Ebar C.E3) L) := 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.2 (numbering assumption from p. 667, Appendix)
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