Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Uniqueness of the original Q2 scheduling encoding

Proved
ResourceScheduling.Graph.encQ2_injective

by arexychen · Oct 2, 2026 · Mathlib 0df444a (Lean v4.33.1)

encodinginjectivityscheduling

The separator-terminated unary encoding of the two-machine scheduling instances is injective. For any two pairs of positive integer speeds and resource-constrained instance data ppp and qqq,

encQ2⁡(p)=encQ2⁡(q)⟹p=q.\operatorname{encQ2}(p)=\operatorname{encQ2}(q)\Longrightarrow p=q.encQ2(p)=encQ2(q)⟹p=q.

In particular, an encoded word uniquely determines both speeds, the numbers of jobs and resources, every requirement, and the makespan threshold. The statement includes zero jobs and zero resources, and is needed when interpreting encoded yes-instances in the language reduction.

Preamble
import Definitions.Def_ResourceScheduling_Graph_ResDot11
Formal statement
namespace ResourceScheduling.Graph
theorem encQ2_injective : Function.Injective encQ2 := by sorry
end ResourceScheduling.Graph
Source
New elementary encoding lemma for the exact Prove2Me ResourceScheduling.Graph encodings (ResourceScheduling_Graph_Complexity, ResourceScheduling_Graph_GraphPartition, ResourceScheduling_Graph_ResDot11, ResourceScheduling_Graph_Construction). Construction: Blazewicz, Lenstra and Rinnooy Kan, Discrete Applied Mathematics 5 (1983), p. 15, Theorems 2-3, https://doi.org/10.1016/0166-218X(83)90012-4; author preprint https://ir.cwi.nl/pub/9642/9642D.pdf, printed pp. 5-6. The numerical encoding bound and parser lemmas are auxiliary results for the platform encoding, not numbered claims of the paper.

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