Lemma 5 — density base cases through eight tasks
ProvedRealPinwheel.FiveSixths.density_basep2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1pinwheel-schedulingreal-periods
Let be a real-period instance with , and write . Then
Validity quantifies over every task, every positive multiplicity and every window start. This supplies the small-dimension density cases, including equality at the density boundary. No certificate acceptance or coverage hypothesis is imposed.
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 5, printed p. 2 (PDF p. 3), repeated printed p. 10 (PDF p. 11). -/
theorem density_base {n : ℕ} (A : Instance n) (hn : n ≤ 8)
(hD : density 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 5, printed p. 2 (PDF p. 3); repeated printed p. 10 (PDF p. 11), proof printed p. 11 (PDF p. 12)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.