Theorem 4 (companion theorem; not used in the proof of the goal) — real-period 17/20 bound with bounded period
OpenRealPinwheel.FiveSixths.Supplement.seventeen_twentieths_periodicLet be a nonempty ordered real-period instance with . Periods may be irrational, and equal periods label distinct tasks. Write for density and for potential. Schedulability means that a single schedule assigns exactly one task to each day and, for every task , positive integer and starting day , executes at least times in .
If and , then there exist a positive integer and a schedule such that
and
The integer is a period and need not be the least period. This companion theorem extends the density guarantee for instances whose minimum period is at least four; it is not used in the proof of the published goal Theorem 3. The schedule, validity and strict length bound are unconditional conclusions, including irrational periods and equality in the density bound.
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
import Definitions.Def_RealPinwheel_FiveSixths_Instance
namespace RealPinwheel.FiveSixths.Supplement
/-- Theorem 4, printed p. 2 (PDF p. 3); proof printed p. 12 (PDF p. 13).
The positive integer L is a period, not necessarily the least period.
No finite-covering or periodic-witness hypothesis is assumed. -/
theorem seventeen_twentieths_periodic {n : ℕ} (A : Instance n)
(hmin : 4 ≤ A.period ⟨0, A.positive_dimension⟩)
(hD : density A ≤ (17 : ℝ) / 20) :
∃ (L : ℕ) (S : ℕ → Fin n),
0 < L ∧ L < 19 * 2 ^ n ∧
(∀ t : ℕ, S (t + L) = S t) ∧ Valid A.period S := by sorry
end RealPinwheel.FiveSixths.Supplement