Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.2, p. 16 — an IBR experiment is an experiment with marginals q, and its worst-case variance is the sum of the worst-case variances of its blocks

Proved
CorrClusterExp.IBR.ibr_additivity

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

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

Let 0<q≤120<q\le\tfrac120<q≤21​, let w1,…,wn≥0w_1,\dots,w_n\ge 0w1​,…,wn​≥0 be cluster sizes, and partition the clusters into consecutive blocks B1,…,BLB_1,\dots,B_LB1​,…,BL​. Consider the IBR experiment that, independently on each block BjB_jBj​ with mjm_jmj​ clusters, treats a uniformly random set of ⌊qmj⌋\lfloor qm_j\rfloor⌊qmj​⌋ clusters with probability pj=⌈qmj⌉−qmjp_j=\lceil qm_j\rceil-qm_jpj​=⌈qmj​⌉−qmj​ and of ⌈qmj⌉\lceil qm_j\rceil⌈qmj​⌉ clusters otherwise. Then every cluster is treated with probability qqq, and the worst-case variance of the IBR experiment is the sum of the worst-case variances of its blocks:

max⁡y∈×i∈[n][0,wi]y⊤Σy=∑j=1L max⁡y∈×i∈Bj[0,wi]y⊤Σj y,\max_{y\in\times_{i\in[n]}[0,w_i]} y^\top\Sigma y=\sum_{j=1}^{L}\ \max_{y\in\times_{i\in B_j}[0,w_i]} y^\top\Sigma_j\, y ,y∈×i∈[n]​[0,wi​]max​y⊤Σy=j=1∑L​ y∈×i∈Bj​​[0,wi​]max​y⊤Σj​y,

where Σ\SigmaΣ is the correlation matrix of the IBR experiment and Σj\Sigma_jΣj​ that of the block law on BjB_jBj​.

This additivity is what makes the optimal partition computable by the dynamic program (4).

Formalization Note Blocks are given by c : Composition n; block jjj has c.blocksFun j clusters, embedded by c.embedding j.

Differences from the source:

  • generalization: the page speaks of the worst-case variance only → Lean also concludes that the IBR law is an experiment (marginals qqq); reason: p. 14 states that IBR treats a fraction qqq of each block; the added conclusion is needed for VOPT≤VDPV^{\mathrm{OPT}}\le V^{\mathrm{DP}}VOPT≤VDP and dropping it gives the page's claim.
  • generalization: blocks of the clusters sorted by decreasing size → any consecutive blocks of any w≥0w\ge 0w≥0, sorted or not; reason: the sizes play no role in additivity; the sorted case is an instance.
Preamble
import Mathlib
import Definitions.Def_CorrClusterExp_IBR_Setting
Formal statement
namespace CorrClusterExp.IBR

open Matrix Finset

theorem ibr_additivity (q : ℝ) (hq0 : 0 < q) (hq : q ≤ 1 / 2) (n : ℕ) (c : Composition n)
    (w : Fin n → ℝ) (hw0 : ∀ i, 0 ≤ w i) :
    IsExperiment q (ibrLaw q c) ∧
      VIBR q w c = ∑ j : Fin c.length,
        worstCase (corr q (fracLaw q (c.blocksFun j))) (fun i => w (c.embedding j i)) := 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. 16, §3.2 (unnumbered claim after Lemma 3.3); IBR experiment p. 14
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