CausalSmith · seminar slides

Variance After Random Group Formation

When groups compete for members of a finite population, standard cluster variance calculations can exceed the variance of the estimated treatment effect.

Motivation

  • A population of nn units supplies GnG_n disjoint groups, each of fixed size M≥2M\ge2.
  • Treatment is randomized across groups. Outcomes may depend on who joins each group.
  • We want the average treatment effect across possible group compositions—and its variance over repeated grouping and assignment.
  • The participating population has size Nn=MGnN_n=MG_n. Drawing one group changes the members available to every other group.

Fu et al. (2026), our closest comparison, establish CR2 ratio consistency under boundedness, their other assumptions, and the sparse condition Nn2/n→0N_n^2/n\to0.

What happens when competition for members remains relevant?

Standard Approach

Compare treated and control group means, then use a cluster-robust variance estimator with the CR2 small-sample adjustment.

Let G1nG_{1n} and G0nG_{0n} be the treated and control group counts. Let sz,n2s_{z,n}^2 be the sample variance of observed group means in arm zz, using denominator Gzn−1G_{zn}-1.

V^CR2,n=s1,n2G1n+s0,n2G0n. \widehat V_{\mathrm{CR2},n} = \frac{s_{1,n}^2}{G_{1n}} + \frac{s_{0,n}^2}{G_{0n}}.

This adds the estimated variance of each arm mean.

Pustejovsky and Tipton (2018) develop the adjustment under an independent-cluster working covariance model. Disjoint random groups can covary because they cannot reuse members.

When does this calculation still recover the exact design variance?

Key Idea

Keep the covariance created by drawing groups without replacement.

Separate treatment-effect variation into additive member contributions and remaining composition effects. Only the additive part survives in the leading finite-population correction.

With fixed group size, growing group count, stable treatment shares, convergent participation, and bounded outcomes:

  • CR2 estimates the independent-group variance scale.
  • The exact variance subtracts participation density times additive treatment-effect heterogeneity.

With a positive scaled-variance floor, CR2 is asymptotically conservative; it is sharp exactly when that correction is relatively negligible.

Example

Eight units form four pairs; two pairs receive treatment. All units participate.

Four units have sign ai=+1a_i=+1, and four have sign ai=−1a_i=-1. For pair A={j,k}A=\{j,k\}, both members have potential outcomes

Yi,n(0,A)=0,Yi,n(1,A)=aj+ak2. Y_{i,n}(0,A)=0, \qquad Y_{i,n}(1,A)=\frac{a_j+a_k}{2}.

The treated pair outcome is its average sign. Selecting a pair with positive signs removes those signs from the remaining pool.

The exact variance of the treated–control difference is σn2=1/7\sigma_n^2=1/7, but

E ⁣[V^CR2,n]=27. \mathbb E\!\left[\widehat V_{\mathrm{CR2},n}\right]=\frac{2}{7}.

Expected CR2 is twice the exact variance. Which feature of the outcome table creates this gap?

Model

Draw the disjoint groups uniformly, then independently choose exactly G1nG_{1n} groups for treatment.

For arm z∈{0,1}z\in\{0,1\}, Yi,n(z,A)Y_{i,n}(z,A) is unit ii's fixed potential outcome in group AA. The group table records its average:

hz,n(A)=1M∑i∈AYi,n(z,A). h_{z,n}(A)=\frac{1}{M}\sum_{i\in A}Y_{i,n}(z,A).

Our target averages the treatment contrast over every possible size-MM group; En\mathbb E_n denotes that uniform average:

τn=En ⁣[h1,n−h0,n]. \tau_n=\mathbb E_n\!\left[h_{1,n}-h_{0,n}\right].

For realized group AngA_{ng}, let Zng=1Z_{ng}=1 indicate treatment. The estimator is

τ^n=1G1n∑gZngh1,n(Ang)−1G0n∑g(1−Zng)h0,n(Ang). \widehat\tau_n = \frac{1}{G_{1n}}\sum_g Z_{ng}h_{1,n}(A_{ng}) - \frac{1}{G_{0n}}\sum_g (1-Z_{ng})h_{0,n}(A_{ng}).

It is unbiased for τn\tau_n. Its exact variance, σn2\sigma_n^2, includes both grouping and treatment randomness.

Assumptions

Consider feasible experiments with fixed group size M≥2M\ge2 and deterministic potential outcomes.

  • Group growth: Gn→∞G_n\to\infty, providing many randomized groups.
  • Stable treatment shares: pn=G1n/Gn→p∈(0,1)p_n=G_{1n}/G_n\to p\in(0,1), keeping both arms represented.
  • Convergent participation: Nn/n→ρ∈[0,1]N_n/n\to\rho\in[0,1], recording how much of the population participates.
  • Bounded outcomes: sup⁡n,i,z,A∣Yi,n(z,A)∣≤B<∞\sup_{n,i,z,A}\left|Y_{i,n}(z,A)\right|\le B<\infty, ruling out increasingly extreme outcomes.
  • Variance floor: cσ≤lim inf⁡n→∞Gnσn2c_\sigma\le\liminf_{n\to\infty}G_n\sigma_n^2, with cσ>0c_\sigma>0, preventing the target variance from vanishing too quickly.

The pair-sign example has B=1B=1 and full participation. It illustrates the finite mechanism; the asymptotic results require growing group counts.

Additive Heterogeneity

For a group table ff, its additive component has the form Πn,1f(A)=∑i∈Abi\Pi_{n,1}f(A)=\sum_{i\in A}b_i, with centered member coefficients ∑i=1nbi=0\sum_{i=1}^n b_i=0.

Each bib_i measures a member's additive contribution to the centered group outcome.

The remaining centered table, f−Enf−Πn,1ff-\mathbb E_n f-\Pi_{n,1}f, is orthogonal to every centered additive sum: their product averages to zero over possible groups. This distinguishes member contributions from residual composition effects.

For the treatment-contrast table, define

Eτ,1,n=∥Πn,1(h1,n−h0,n)∥n2. E_{\tau,1,n} = \left\|\Pi_{n,1}(h_{1,n}-h_{0,n})\right\|_n^2 .

The squared norm means average squared additive contrast over possible groups.

In the pair-sign example, bi=ai/2b_i=a_i/2. The contrast is entirely additive, the residual is zero, and Eτ,1,n=V1,n=3/7E_{\tau,1,n}=V_{1,n}=3/7, where V1,nV_{1,n} is the treated-table variance.

Main Result

Let Vz,nV_{z,n} be the variance of arm zz's outcome table over all possible groups. The independent-group variance scale is

Rn=V1,npn+V0,n1−pn. R_n = \frac{V_{1,n}}{p_n} + \frac{V_{0,n}}{1-p_n}.

Under group growth, stable treatment shares, convergent participation, and bounded outcomes,

Gnσn2−(Rn−ρEτ,1,n)→0, G_n\sigma_n^2-\bigl(R_n-\rho E_{\tau,1,n}\bigr)\to 0,

The exact variance, scaled by group count, subtracts the participation-weighted additive contrast variation.

With the variance floor as well,

GnV^CR2,n−Rn→p0 G_n\widehat V_{\mathrm{CR2},n}-R_n \xrightarrow{p}0

CR2 tracks RnR_n, rather than the corrected scale. Neither scale needs to converge to a constant.

Why does dependence change the exact variance while leaving CR2's target intact?

Exact Variance

Let Cab,nC_{ab,n} be the covariance between arm-aa and arm-bb outcomes for a uniformly drawn disjoint pair of groups.

Their treatment-contrast covariance is Cττ,n=C11,n+C00,n−2C10,nC_{\tau\tau,n}=C_{11,n}+C_{00,n}-2C_{10,n}.

For a feasible design with at least two groups per arm,

σn2=RnGn+Cττ,n−C11,nG1n−C00,nG0n, \sigma_n^2 = \frac{R_n}{G_n} + C_{\tau\tau,n} - \frac{C_{11,n}}{G_{1n}} - \frac{C_{00,n}}{G_{0n}},

The within-arm sample variances incorporate the final two terms. Their expected CR2 calculation misses exactly the contrast covariance:

E[V^CR2,n]−σn2=−Cττ,n. \mathbb E[\widehat V_{\mathrm{CR2},n}]-\sigma_n^2=-C_{\tau\tau,n}.

In the pair-sign example, Cττ,n=C11,n=−1/7C_{\tau\tau,n}=C_{11,n}=-1/7. Its negative covariance explains the entire expectation gap of 1/71/7.

Removing Members

For a group table ff, Knf\mathsf K_n f averages its value over groups disjoint from an already chosen group AA:

(Knf)(A)=(n−MM)−1∑C:C∩A=∅f(C). (\mathsf K_n f)(A) = \binom{n-M}{M}^{-1} \sum_{C:C\cap A=\varnothing} f(C).

The Johnson decomposition separates the centered table into mutually orthogonal components Πn,kf\Pi_{n,k}f: degree one is additive; higher degrees contain composition variation left after lower degrees are removed. We use the decomposition of Filmus (2016).

Disjointness multiplies each component separately:

Kn(Πn,kf)(A)=λn,k Πn,kf(A),λn,k=(−1)k(M)k(n−M)k, \mathsf K_n(\Pi_{n,k}f)(A)=\lambda_{n,k}\,\Pi_{n,k}f(A), \qquad \lambda_{n,k}=(-1)^k\frac{(M)_k}{(n-M)_k},

Here kk is the degree and (x)k(x)_k is a falling factorial.

For degree one, λn,1=−M/(n−M)\lambda_{n,1}=-M/(n-M): an above-average additive group leaves a below-average pool.

Accumulating Dependence

Orthogonality turns the treatment-contrast covariance into a sum of separate degree contributions:

Cττ,n=∑k=1Mλn,k∥Πn,k(h1,n−h0,n)∥n2. C_{\tau\tau,n} = \sum_{k=1}^{M}\lambda_{n,k} \bigl\|\Pi_{n,k}(h_{1,n}-h_{0,n})\bigr\|_n^2 .

Each component contributes its mean square times its disjointness multiplier.

  • Degree one: multiplying −M/(n−M)-M/(n-M) by GnG_n leaves the participation correction.
  • Higher degrees: their multipliers decay faster. Bounded outcomes control total component variation; their combined contribution after scaling by GnG_n has absolute value at most C/nC/n, for a constant CC.

Thus

GnCττ,n+ρEτ,1,n→0, G_nC_{\tau\tau,n}+\rho E_{\tau,1,n}\to 0,

The scaled contrast covariance approaches minus the participation-weighted additive energy. The within-arm covariance terms in the scaled exact variance also vanish.

This gives the corrected variance scale. Does it also explain concentration of the observed sample variances?

Concentration Despite Dependence

Yes: apply the same disjointness covariance control to both the outcome table hz,nh_{z,n} and its square hz,n2h_{z,n}^2.

With fixed MM, every nonconstant disjointness multiplier tends to zero. Bounded outcomes keep the total component variation bounded—for the outcome table and for its square. Their disjoint-pair covariances therefore vanish.

For each arm:

  • The variance of an empirical moment has a single-group contribution divided by the growing arm count, plus a disjoint-pair covariance contribution. Both vanish.
  • Consequently, empirical first and second moments concentrate around Enhz,n\mathbb E_n h_{z,n} and En[hz,n2]\mathbb E_n[h_{z,n}^2].
  • Sample variance is second moment minus squared first moment, with a denominator adjustment tending to one. Hence sz,n2−Vz,n→p0s_{z,n}^2-V_{z,n}\xrightarrow{p}0.

Stable treatment shares then yield

GnV^CR2,n−Rn→p0 G_n\widehat V_{\mathrm{CR2},n}-R_n \xrightarrow{p}0

Dependence vanishes for moment estimation, but accumulates in the estimator's variance after scaling by GnG_n.

Conservativeness and Sharpness

Under all five assumptions, the correction is nonnegative and the variance floor permits comparison in relative terms. For every fixed tolerance ε>0\varepsilon>0,

Pr⁡ ⁣{V^CR2,n/σn2<1−ε}⟶0, \Pr\!\left\{ \widehat V_{\mathrm{CR2},n}/\sigma_n^2<1-\varepsilon \right\}\longrightarrow 0 ,

The probability of understating exact variance by a fixed proportion vanishes.

informal · Theorem T-4 With fixed M≥2M\ge2, group growth, stable treatment shares, convergent participation, bounded outcomes, and a positive scaled-variance floor, CR2 is ratio consistent exactly when the correction is relatively negligible.

Precisely, the ratio converges in probability to one if and only if

ρEτ,1,nRn−ρEτ,1,n⟶0. \frac{\rho E_{\tau,1,n}}{R_n-\rho E_{\tau,1,n}}\longrightarrow 0 .

The numerator is the correction; the denominator is the corrected variance scale.

At ρ=0\rho=0, ratio consistency follows. This includes Nn=M⌊n3/4M⌋N_n=M\Big\lfloor \frac{n^{3/4}}{M}\Big\rfloor, where Nn/n→0N_n/n\to0 although Nn2/n→∞N_n^2/n\to\infty, beyond Fu et al. (2026)'s sparsity condition.

Invisible Counterfactual Alignment

Can one realization reveal the correction? Compare two ways to draw bounded potential-outcome schedules:

  • Same signs: each unit receives a fair sign, +1+1 or −1-1, shared by both arms.
  • Independent signs: each unit receives independent fair signs for its two arms.

Outcomes depend only on a unit's assigned-arm sign. Each observed unit reveals one sign, so the two observed-data mixtures are identical.

Yet the scaled exact variances approach different limits:

dsame=1Mp(1−p),dind=1Mp(1−p)−2ρM, d_{\mathrm{same}}=\frac{1}{M p(1-p)}, \qquad d_{\mathrm{ind}}=\frac{1}{M p(1-p)}-\frac{2\rho}{M},

These symbols name the same-sign and independent-sign variance limits.

Under same signs, the contrast energy approaches zero; under independent signs, it approaches 2/M2/M. At ρ>0\rho>0, unobserved cross-arm alignment therefore changes variance by 2ρ/M2\rho/M without changing the observed-data mixture.

One-realization Lower Bound

Let Cdense\mathcal C_{\mathrm{dense}} contain feasible sequences satisfying our five assumptions with fixed parameters M,p,ρ,B,cσM,p,\rho,B,c_\sigma.

Require ρ>0\rho>0, B≥1B\ge1, and 0<cσ<dind0<c_\sigma<d_{\mathrm{ind}}.

informal · Theorem T-9 Under these conditions, every variance statistic based on one realization has a limiting worst-case relative-error probability of at least 1/21/2 at some fixed positive tolerance.

Let On\mathcal O_n contain realized groups, assignments, and observed unit outcomes. Every variance statistic S^n(On)\widehat S_n(\mathcal O_n) satisfies, for some ε>0\varepsilon>0,

12≤lim inf⁡n→∞sup⁡Y∈CdensePr⁡Y ⁣(∣S^n(On)σn2−1∣>ε). \frac12 \le \liminf_{n\to\infty} \sup_{Y\in\mathcal C_{\mathrm{dense}}} \Pr_Y\!\left( \left| \frac{\widehat S_n(\mathcal O_n)}{\sigma_n^2}-1 \right|>\varepsilon \right).

Here Pr⁡Y\Pr_Y is randomization probability for fixed potential outcomes YY.

The sign constructions concentrate on schedules in this class. Their variance targets stay separated while their observed laws remain asymptotically indistinguishable. A statistic cannot reliably hit both targets.

Open Questions

  • Gaussian approximation, studentized testing, and Wald coverage.
  • Finite-sample CR2 conservativeness.
  • Extensions to variable group sizes.

Takeaways

  • Groups compete for finite-population members. Additive member contributions create the dependence that survives at the leading variance scale.
  • CR2's sample variances concentrate around population table variances. The exact design variance subtracts participation density times additive treatment-effect variation.
  • Under our assumptions, CR2 is asymptotically conservative and sharp exactly when that correction is relatively negligible. At positive density, one realization cannot uniformly recover exact variance over the bounded schedule class.

Appendix: Exact Variance

This statement gives unbiasedness, the exact design variance, and the exact expectation gap for equal-group CR2.

Theorem T-2 (Exact PAME variance)

Let n,M,Gn,G1nn,M,G_n,G_{1n} be natural numbers and let G0n=Gn−G1nG_{0n}=G_n-G_{1n}. Suppose that:

  • (Feasible partition.) The two-stage random partition design in Definition P-1 is feasible: MGn≤nM G_n\le n.
  • (Group sizes.) 2≤M2\le M, 2≤G1n2\le G_{1n}, and 2≤G0n2\le G_{0n}.
  • (Potential outcomes.) Yi,n(z,A)Y_{i,n}(z,A) is a deterministic potential-outcome schedule, defined for every A∈Ωn,MA\in\Omega_{n,M}, every i∈Ai\in A, and every z∈Zz\in\mathcal Z.

Set Vz,n=Var⁡A∼Unif(Ωn,M){hz,n(A)},Cab,n=EAEC∣C∩A=∅[ha,n∘(A)hb,n∘(C)], V_{z,n} = \operatorname{Var}_{A\sim\mathrm{Unif}(\Omega_{n,M})}\{h_{z,n}(A)\}, \qquad C_{ab,n} = \mathbb E_{A}\mathbb E_{C\mid C\cap A=\varnothing} \bigl[h_{a,n}^{\circ}(A)h_{b,n}^{\circ}(C)\bigr], and Cττ,n=C11,n+C00,n−2C10,n,Rn=V1,nG1n/Gn+V0,n1−G1n/Gn. C_{\tau\tau,n}=C_{11,n}+C_{00,n}-2C_{10,n}, \qquad R_n=\frac{V_{1,n}}{G_{1n}/G_n}+\frac{V_{0,n}}{1-G_{1n}/G_n}. For the difference-in-means estimator τ^n\widehat\tau_n, the finite-population PAME τn\tau_n, the exact design variance σn2=Var⁡(τ^n)\sigma_n^2=\operatorname{Var}(\widehat\tau_n), and the scalar equal-group CR2 statistic V^CR2,n\widehat V_{\mathrm{CR2},n} in Definition P-7, E[τ^n]=τn, \mathbb E[\widehat\tau_n]=\tau_n, σn2=RnGn+Cττ,n−C11,nG1n−C00,nG0n, \sigma_n^2 = \frac{R_n}{G_n} + C_{\tau\tau,n} - \frac{C_{11,n}}{G_{1n}} - \frac{C_{00,n}}{G_{0n}}, E[V^CR2,n]=V1,n−C11,nG1n+V0,n−C00,nG0n, \mathbb E[\widehat V_{\mathrm{CR2},n}] = \frac{V_{1,n}-C_{11,n}}{G_{1n}} + \frac{V_{0,n}-C_{00,n}}{G_{0n}}, and E[V^CR2,n]−σn2=−Cττ,n. \mathbb E[\widehat V_{\mathrm{CR2},n}]-\sigma_n^2=-C_{\tau\tau,n}.

Appendix: Dense Projection Limit

This statement identifies the degree-one finite-population correction and bounds the aggregate higher-degree contribution.

Theorem T-3 (Dense projection limit)

Fix a common group size M≥2M\ge 2 and real numbers pp, ρ\rho, and BB. There is a constant C>0C>0 such that, for every feasible triangular schedule array with common group size MM and every rowwise choice of Johnson projections Πn,k\Pi_{n,k} on L2(Ωn,M)L^2(\Omega_{n,M}), the following conditions imply the displayed limits below:

  • (Group growth.) The array satisfies Assumption A-1.
  • (Treatment fractions.) The array satisfies Assumption A-2 with limiting treated-group fraction pp.
  • (Sampling fractions.) The array satisfies Assumption A-3 with limiting grouped-unit fraction ρ\rho.
  • (Bounded outcomes.) The array satisfies Assumption A-4 with uniform outcome envelope BB.
  • (Johnson decomposition.) In every row with 2M≤n2M\le n, the projections give the centered orthogonal Johnson decomposition ∑k=1MΠn,kf(A)=f(A)−Enf \sum_{k=1}^{M}\Pi_{n,k}f(A)=f(A)-\mathbb E_n f for every ff and every A∈Ωn,MA\in\Omega_{n,M}, and distinct Johnson degrees are orthogonal under ⟨⋅,⋅⟩n\langle\cdot,\cdot\rangle_n.
  • (Kneser spectrum.) In every row with 2M≤n2M\le n, every f∈Hn,kf\in\mathcal H_{n,k} is an eigenfunction of the unnormalized Kneser adjacency operator with eigenvalue (−1)k( n−M−kM−k ). (-1)^k {\,n-M-k\choose M-k\,}.

Then Gnσn2−(Rn−ρEτ,1,n)→0, G_n\sigma_n^2-\bigl(R_n-\rho E_{\tau,1,n}\bigr)\to 0, GnCττ,n+ρEτ,1,n→0, G_nC_{\tau\tau,n}+\rho E_{\tau,1,n}\to 0, and C11,npn+C00,n1−pn→0. \frac{C_{11,n}}{p_n}+\frac{C_{00,n}}{1-p_n}\to 0. Moreover, for every row nn, the pooled contribution of Johnson degrees k≥2k\ge 2, Gn∑k=2Mλn,k∥Πn,k(h1,n−h0,n)∥n2, G_n\sum_{k=2}^{M}\lambda_{n,k} \left\|\Pi_{n,k}\bigl(h_{1,n}-h_{0,n}\bigr)\right\|_{n}^{2}, has absolute value at most C/nC/n.

Appendix: CR2 Phase Frontier

This statement gives CR2's probability limit, its one-sided conservativeness, and the necessary and sufficient condition for ratio consistency.

Theorem T-4 (CR2 phase frontier)

Let M≥2M\ge 2, and let AA be a triangular array of feasible random-group experiment rows with population sizes nn, group counts Gn>0G_n>0, treated-group counts 0<G1n<Gn0<G_{1n}<G_n, grouped-unit counts Nn=MGn≤nN_n=MG_n\le n, and deterministic potential-outcome schedules. Fix constants p,ρ,B,cσ∈Rp,\rho,B,c_\sigma\in\mathbb R. Suppose that:

  • (Dense array.) The array AA belongs to the dense bounded schedule class Cdense\mathcal C_{\mathrm{dense}} in Definition P-8, with parameters p,ρ,B,cσp,\rho,B,c_\sigma.
  • (Johnson projections.) For every row nn, the spaces L2(Ωn,M)L^2(\Omega_{n,M}) are equipped with linear projections Πn,k\Pi_{n,k}, 0≤k≤M0\le k\le M, whose ranges are the degree-kk Johnson harmonic subspaces Hn,k\mathcal H_{n,k}, which fix functions in their ranges and have residuals orthogonal to Hn,k\mathcal H_{n,k} under ⟨⋅,⋅⟩n\langle\cdot,\cdot\rangle_n.
  • (Orthogonal decomposition.) For every row with 2M≤n2M\le n, every f∈L2(Ωn,M)f\in L^2(\Omega_{n,M}), and every A∈Ωn,MA\in\Omega_{n,M}, ∑k=1MΠn,kf(A)=f(A)−Enf, \sum_{k=1}^{M}\Pi_{n,k}f(A)=f(A)-\mathbb E_n f, and distinct Johnson components are orthogonal: ⟨Πn,kf,Πn,ℓg⟩n=0whenever k≠ℓ. \langle \Pi_{n,k}f,\Pi_{n,\ell}g\rangle_n=0 \qquad\text{whenever } k\ne \ell .
  • (Kneser spectrum.) For every row with 2M≤n2M\le n, every 0≤k≤M0\le k\le M, and every f∈Hn,kf\in\mathcal H_{n,k}, the unnormalized Kneser adjacency operator satisfies ∑C∩A=∅f(C)=(−1)k( n−M−kM−k )f(A). \sum_{C\cap A=\varnothing} f(C) = (-1)^k {\,n-M-k\choose M-k\,} f(A).

Then, as n→∞n\to\infty, GnV^CR2,n−Rn→p0 G_n\widehat V_{\mathrm{CR2},n}-R_n \xrightarrow{p}0 and Gn(V^CR2,n−σn2)−ρEτ,1,n→p0. G_n\bigl(\widehat V_{\mathrm{CR2},n}-\sigma_n^2\bigr) -\rho E_{\tau,1,n} \xrightarrow{p}0 . Moreover, for every ε>0\varepsilon>0, Pr⁡ ⁣{V^CR2,n/σn2<1−ε}⟶0, \Pr\!\left\{ \widehat V_{\mathrm{CR2},n}/\sigma_n^2<1-\varepsilon \right\}\longrightarrow 0 , and the ratio V^CR2,n/σn2\widehat V_{\mathrm{CR2},n}/\sigma_n^2 converges in probability to 11 if and only if ρEτ,1,nRn−ρEτ,1,n⟶0. \frac{\rho E_{\tau,1,n}}{R_n-\rho E_{\tau,1,n}}\longrightarrow 0 .

Appendix: One-realization Lower Bound

This statement proves a nonvanishing worst-case relative-error probability for every one-realization variance statistic at positive density.

Theorem T-9 (Diagonal variance obstruction)

Fix a common group size MM with 2≤M2\le M, and let AA be a triangular schedule array with population sizes nn, group counts Gn>0G_n>0, treated-group counts 0<G1n<Gn0<G_{1n}<G_n, MGn≤nM G_n\le n, and deterministic potential-outcome rows. Let p,ρ,B,cσ∈Rp,\rho,B,c_\sigma\in\mathbb R. Suppose:

  • (Envelope and fractions.) 0<ρ0<\rho, 1≤B1\le B, and the array satisfies Assumption A-1, Assumption A-2, Assumption A-3 with limiting treated-group fraction pp and limiting grouped-unit fraction ρ\rho.
  • (Johnson decomposition input.) For every row nn, there are orthogonal projections Πn,k\Pi_{n,k} onto the degree-kk Johnson harmonic spaces Hn,k\mathcal H_{n,k}, k=0,…,Mk=0,\ldots,M, whose positive-degree components give the centered orthogonal decomposition of every f∈L2(Ωn,M)f\in L^2(\Omega_{n,M}): ∑k=1MΠn,kf=f−Enf,⟨Πn,kf,Πn,ℓg⟩n=0for k≠ℓ. \sum_{k=1}^{M}\Pi_{n,k}f = f-\mathbb E_n f, \qquad \langle \Pi_{n,k}f,\Pi_{n,\ell}g\rangle_n=0 \quad\text{for }k\ne \ell .
  • (Kneser spectrum input.) For every row nn with 2M≤n2M\le n, the Kneser adjacency operator acts on f∈Hn,kf\in\mathcal H_{n,k} by the eigenvalue (−1)k( n−M−k  M−k ),k=0,…,M. (-1)^k {\,n-M-k\,\choose\, M-k\,}, \qquad k=0,\ldots,M .
  • (Variance lower bound.) With dsame=1Mp(1−p),dind=1Mp(1−p)−2ρM, d_{\mathrm{same}}=\frac{1}{M p(1-p)}, \qquad d_{\mathrm{ind}}=\frac{1}{M p(1-p)}-\frac{2\rho}{M}, the constant cσc_\sigma satisfies 0<cσ<dind. 0<c_\sigma<d_{\mathrm{ind}} .

Then there exist support sets Γnsame\Gamma_n^{\mathrm{same}} for the common-arm Rademacher prior Hnsame\mathbb H_n^{\mathrm{same}} and Γnind\Gamma_n^{\mathrm{ind}} for the independent-arm Rademacher prior Hnind\mathbb H_n^{\mathrm{ind}} such that both prior probabilities tend to one, every diagonal selection from either support induces an array in Cdense\mathcal C_{\mathrm{dense}} with parameters (p,ρ,B,cσ)(p,\rho,B,c_\sigma), the conditioned one-realization laws satisfy TV⁡ ⁣(Hnsame(On∈⋅∣Γnsame),Hnind(On∈⋅∣Γnind))→0, \operatorname{TV}\!\left( \mathbb H_n^{\mathrm{same}}(\mathcal O_n\in\cdot\mid \Gamma_n^{\mathrm{same}}), \mathbb H_n^{\mathrm{ind}}(\mathcal O_n\in\cdot\mid \Gamma_n^{\mathrm{ind}}) \right)\to 0, and the scaled exact variances converge uniformly on the respective supports: sup⁡u∈Γnsame∣Gnσn2(u)−dsame∣→0,sup⁡u∈Γnind∣Gnσn2(u)−dind∣→0. \sup_{u\in\Gamma_n^{\mathrm{same}}} \left|G_n\sigma_n^2(u)-d_{\mathrm{same}}\right|\to 0, \qquad \sup_{u\in\Gamma_n^{\mathrm{ind}}} \left|G_n\sigma_n^2(u)-d_{\mathrm{ind}}\right|\to 0 . Moreover, there is an ε>0\varepsilon>0 such that every measurable one-realization variance statistic S^n(On)\widehat S_n(\mathcal O_n) satisfies 12≤lim inf⁡n→∞sup⁡Y∈CdensePr⁡Y ⁣(∣S^n(On)σn2−1∣>ε). \frac12 \le \liminf_{n\to\infty} \sup_{Y\in\mathcal C_{\mathrm{dense}}} \Pr_Y\!\left( \left| \frac{\widehat S_n(\mathcal O_n)}{\sigma_n^2}-1 \right|>\varepsilon \right).