Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 11 (used in the proof of Theorem 4) — density base through nine tasks

Open
RealPinwheel.FiveSixths.Supplement.density_base

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1pinwheel-schedulingreal-periods

Let A=(a1,…,an)A=(a_1,\ldots,a_n)A=(a1​,…,an​) be a nonempty ordered real-period instance with 1≤a1≤⋯≤an1\le a_1\le\cdots\le a_n1≤a1​≤⋯≤an​. Periods may be irrational, and equal periods label distinct tasks. Write D(A)=∑i=1n1/aiD(A)=\sum_{i=1}^n1/a_iD(A)=∑i=1n​1/ai​ for density and P(A)=∑i=1n−11/aiP(A)=\sum_{i=1}^{n-1}1/a_iP(A)=∑i=1n−1​1/ai​ for potential. Schedulability means that a single schedule assigns exactly one task to each day and, for every task iii, positive integer ℓ\ellℓ and starting day m≥0m\ge0m≥0, executes iii at least ℓ\ellℓ times in [m,m+⌈ℓai⌉)[m,m+\lceil\ell a_i\rceil)[m,m+⌈ℓai​⌉).

If n≤9n\le9n≤9, a1≥4a_1\ge4a1​≥4 and D(A)≤17/20D(A)\le17/20D(A)≤17/20, then

Schedulable⁡(A).\operatorname{Schedulable}(A).Schedulable(A).

This is the density base case supporting Theorem 4, including every nonempty dimension from one through nine and equality at both bounds.

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.Supplement

/-- Lemma 11, printed p. 11 (PDF p. 12); proof printed p. 12 (PDF p. 13).
The first position is the minimum period because Instance includes monotonicity. -/
theorem density_base {n : ℕ} (A : Instance n) (hn : n ≤ 9)
    (hmin : 4 ≤ A.period ⟨0, A.positive_dimension⟩)
    (hD : density A ≤ (17 : ℝ) / 20) :
    Schedulable A.period := by sorry

end RealPinwheel.FiveSixths.Supplement
Source
Hiroshi Fujiwara, Grzegorz Gutowski, Katsuhisa Ouchi, Alexander Wolff, STOC 2027 submission #885 (October 2026), Lemma 11, printed p. 11 (PDF p. 12); proof printed p. 12 (PDF p. 13)

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me