Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.7, p. 23 — f_q(k) ≤ ¼(k + C(q)) with a constant C(q) depending only on q

Proved
CorrClusterExp.IBR.lemma_4_7

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

cluster-randomizationexperimental-designp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1worst-case-variance

Let 0<q≤120<q\le\tfrac120<q≤21​. There is a constant C(q)C(q)C(q), depending only on qqq, such that for every integer k≥1k\ge1k≥1

fq(k)≤14(k+C(q)),f_q(k)\le\frac14\big(k+C(q)\big),fq​(k)≤41​(k+C(q)),

where fq(k)f_q(k)fq​(k) is the optimal value of (1) for kkk clusters all of size one. Thus fqf_qfq​ grows linearly in kkk with slope 14\tfrac1441​; this is the rate used in the asymptotic analysis of §4.2.

Differences from the source:

  • reading: "C(q)C(q)C(q) is a constant that depends only on qqq" → ∃ C∈R\exists\,C\in\mathbb R∃C∈R chosen after qqq and before kkk; reason: the literal meaning of a constant depending only on qqq.
  • encoding: fq(k)f_q(k)fq​(k) for kkk clusters → k≥1k\ge1k≥1; reason: an instance needs at least one cluster.
Preamble
import Mathlib
import Definitions.Def_CorrClusterExp_IBR_Setting
Formal statement
namespace CorrClusterExp.IBR

theorem lemma_4_7 (q : ℝ) (hq0 : 0 < q) (hq : q ≤ 1 / 2) :
    ∃ C : ℝ, ∀ k : ℕ, 1 ≤ k → fq q k ≤ 1 / 4 * ((k : ℝ) + C) := by sorry

end CorrClusterExp.IBR
Source
Candogan, Chen, Niazadeh, Correlated Cluster-Based Randomized Experiments: Robust Variance Minimization, SSRN 3852100 (version of March 22, 2023), p. 23, Lemma 4.7
Human review
  • Endorsed by Shuze Chen · Oct 23, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 23, 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