Theorem 3 — real-period five-sixths bound with bounded period
ProvedRealPinwheel.FiveSixths.five_sixths_periodicp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1pinwheel-schedulingreal-periods
Let be any nonempty real-period pinwheel instance with . The periods may be irrational and repeated period values still label distinct tasks. If , then there exist a positive integer and a schedule assigning exactly one task to each day such that
and
The integer is a period of the schedule and need not be its least period. The result supplies both a valid infinite schedule and a strict dimension-dependent bound on a finite word representing it. Neither conclusion is conditional on certificate data.
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
/-- Theorem 3, printed p. 2 (PDF p. 3); proof printed p. 11 (PDF p. 12).
The length is a positive period, not necessarily the least one. -/
theorem five_sixths_periodic {n : ℕ} (A : Instance n)
(hD : density A ≤ (5 : ℝ) / 6) :
∃ (L : ℕ) (S : ℕ → Fin n),
0 < L ∧ L < 4 * 2 ^ n ∧
(∀ t : ℕ, S (t + L) = S t) ∧ Valid A.period S := by sorry
end RealPinwheel.FiveSixths
Source
Hiroshi Fujiwara, Grzegorz Gutowski, Katsuhisa Ouchi, Alexander Wolff, STOC 2027 submission #885 (October 2026), Theorem 3, printed p. 2 (PDF p. 3); proof printed p. 11 (PDF p. 12)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.