Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4 — every pigeonhole design with interval pigeonholes on [0,1] has worst-case expected discrepancy Ω(T^{1/4})

Proved
PigeonholeDesign.Lower.lemma_4

by mikedeng1 · Oct 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

discrepancyexperimental-designlower-boundp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pigeonhole-design

Consider sequential experiments with one continuous covariate (p=1p=1p=1, q=0q=0q=0): TTT subjects (with TTT even) arrive with covariates x1,…,xT∈[0,1]x_1,\dots,x_T\in[0,1]x1​,…,xT​∈[0,1] fixed in advance, and the cost of the final split into a control group AAA and a treated group BBB is the discrepancy dA,Bd_{A,B}dA,B​, the minimum weight of a perfect matching between AAA and BBB under ∣xt−xt′∣|x_t-x_{t'}|∣xt​−xt′​∣.

Let the pigeonhole design use any partition of [0,1][0,1][0,1] into intervals [l0,l1),[l1,l2),…,[lK−1,lK][l_0,l_1),[l_1,l_2),\dots,[l_{K-1},l_K][l0​,l1​),[l1​,l2​),…,[lK−1​,lK​], with 0=l0<l1<⋯<lK=10=l_0<l_1<\dots<l_K=10=l0​<l1​<⋯<lK​=1 and K≥1K\ge1K≥1. There are an absolute constant c>0c>0c>0 and a threshold T0T_0T0​ such that for every even T≥T0T\ge T_0T≥T0​ and every such partition, some arrival sequence x∈[0,1]Tx\in[0,1]^Tx∈[0,1]T gives

E[dA,B]  ≥  c T1/4,\mathbb E\bigl[d_{A,B}\bigr]\;\ge\;c\,T^{1/4},E[dA,B​]≥cT1/4,

where the expectation is over the fair coins of the design. In words: every pigeonhole design suffers a worst-case expected discrepancy of order Ω(T1/4)\Omega(T^{1/4})Ω(T1/4).

Together with Lemma 3 and Corollary 1 of the paper (an upper bound O(T1/4(log⁡T)1/2)O(T^{1/4}(\log T)^{1/2})O(T1/4(logT)1/2) for T\sqrt TT​ uniform pigeonholes), this shows that the uniform pigeonhole design is optimal among pigeonhole designs up to a logarithmic factor.

Formalization Note The paper states the lemma for "any pigeonhole design", and Definition 3 allows any partition of the covariate space; the proof treats partitions of [0,1][0,1][0,1] into KKK intervals, and the statement is formalized for those. The constants ccc and T0T_0T0​ are absolute, chosen before TTT, KKK and the breakpoints, and the hard instance is chosen after the partition. The expectation is the average over all 2T2^T2T coin vectors, not the discrepancy of a single run. T1/4T^{1/4}T1/4 is the real power.

Preamble
import Mathlib
import Definitions.Def_PigeonholeDesign_Lower_Setting
Formal statement
namespace PigeonholeDesign.Lower

theorem lemma_4 :
    ∃ c : ℝ, 0 < c ∧ ∃ T₀ : ℕ, ∀ T : ℕ, T₀ ≤ T → Even T →
      ∀ (K : ℕ) (_hK : 1 ≤ K) (b : Breakpoints K), ∃ x : Fin T → ℝ, (∀ t, x t ∈ Set.Icc (0 : ℝ) 1) ∧
          c * (T : ℝ) ^ ((1 : ℝ) / 4) ≤ PigeonholeDesign.Upper.phdExp (intervalHole b) x := by sorry

end PigeonholeDesign.Lower
Source
Zhao and Zhou, Pigeonhole Design: Balancing Sequential Experiments from an Online Matching Perspective, arXiv:2201.12936v6, p. 18, Lemma 4 (proof pp. ec15-ec16, EC.7)
Human review
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 14, 2026

    Confirmed by the mission captain (proposal self-audit).

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