Lemma 8 — period monotonicity
ProvedRealPinwheel.FiveSixths.monotonicityp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1pinwheel-schedulingreal-periods
Let be a real-period instance and let be a valid schedule for it. Choose a task and a real number . Replacing only its period gives a labelled vector with
The very same schedule remains valid, with every task label unchanged. This is the coordinate monotonicity underlying domination by periodic schedules. The replacement vector need not be sorted; a later reordering permutes schedule labels as described immediately after the source lemma.
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_Transformations
Formal statement
namespace RealPinwheel.FiveSixths
/-- Lemma 8, printed p. 3 (PDF p. 4). Labels are unchanged after replacement. -/
theorem monotonicity {n : ℕ} (A : Instance n) (S : ℕ → Fin n)
(hS : Valid A.period S) (j : Fin n) (b : ℝ) (hb : A.period j ≤ b) :
Valid (replacePeriod A.period j b) S := by sorry
end RealPinwheel.FiveSixths
Source
Hiroshi Fujiwara, Grzegorz Gutowski, Katsuhisa Ouchi, Alexander Wolff, STOC 2027 submission #885 (October 2026), Lemma 8, printed p. 3 (PDF p. 4)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.