Lemma 6 — nine-task potential base case
ProvedRealPinwheel.FiveSixths.potential_basep2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1pinwheel-schedulingreal-periods
Let be an ordered real-period instance, with every , and let . Then
This covers the full nine-task potential domain, not only instances whose total density is at most . Its total density may reach . The conclusion requires all real-period windows, with no assumption that an external verifier succeeds.
Differences from the source:
- encoding: positive days and task labels 1 through n → natural days starting at zero and task positions Fin n; reason: day t encodes source day t+1 and position i encodes source task i+1; all windows and distinct task identities are preserved
Preamble
import Definitions.Def_RealPinwheel_FiveSixths_Instance
Formal statement
namespace RealPinwheel.FiveSixths
/-- Lemma 6, printed p. 2 (PDF p. 3), repeated printed p. 11 (PDF p. 12). -/
theorem potential_base (A : Instance 9) (hP : potential A ≤ (5 : ℝ) / 6) :
Schedulable A.period := by sorry
end RealPinwheel.FiveSixths
Source
Hiroshi Fujiwara, Grzegorz Gutowski, Katsuhisa Ouchi, Alexander Wolff, STOC 2027 submission #885 (October 2026), Lemma 6, printed p. 2 (PDF p. 3); repeated and proved printed p. 11 (PDF p. 12)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.