Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 2.4, p. 155 — implications of chosen schedules stay inside every timetable that contains them

Proved
Timetabling85.TwoPeriod.closure_subset_of_stable

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

backtrackingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stable-settimetabling

Let GGG be a graph on the nodes xj=(j,true)x_j=(j,\mathrm{true})xj​=(j,true), xˉj=(j,false)\bar x_j=(j,\mathrm{false})xˉj​=(j,false) of nnn teachers in which xjx_jxj​ and xˉj\bar x_jxˉj​ are linked for every jjj. Let TTT be a set of nnn pairwise non-adjacent nodes of GGG (a timetable), and let S⊆TS\subseteq TS⊆T. Then

cl(S)⊆T,\mathrm{cl}(S)\subseteq T,cl(S)⊆T,

where cl(S)\mathrm{cl}(S)cl(S) is the set of all implications of the choices SSS.

Consequently, if the implications of a set of choices are not pairwise non-adjacent ("for some teacher no schedule can be found"), then no timetable contains those choices. This is what justifies reversing a decision in the limited backtracking.

Preamble
import Mathlib
import Definitions.Def_Timetabling85_TwoPeriod_Backtracking
Formal statement
namespace Timetabling85.TwoPeriod

theorem closure_subset_of_stable {n : ℕ} (G : SimpleGraph (Fin n × Bool))
    (hpair : ∀ j : Fin n, G.Adj (j, false) (j, true))
    (T : Finset (Fin n × Bool)) (hT : G.IsNIndepSet n T)
    (S : Finset (Fin n × Bool)) (hS : S ⊆ T) :
    closure G S ⊆ T := by sorry

end Timetabling85.TwoPeriod
Source
de Werra, An introduction to timetabling, Eur. J. Oper. Res. 19 (1985), p. 155, Proof of Proposition 2.4 ('one considers all the implications of this choice')
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