Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Equal-size cluster design effect under exchangeable within-cluster covariance

Statement

Let mc≥2 and k≥1. In a no-finite-population-correction superpopulation comparison, suppose the sampled PSU outcome vectors are independent and have a common distribution with E[Yij]=μ,Var⁡(Yij)=σ2>0,Cov⁡(Yij,Yiℓ)=ρσ2(j≠ℓ), for each PSU i, while distinct PSUs are independent. The cluster estimator is the mean of k complete cluster means, YˉC=1kmc∑i=1k∑j=1mcYij, and the reference element SRS estimator is the mean of kmc independent draws from the same one-element marginal distribution. Then DEFF⁡:=Var⁡(YˉC)Var⁡(YˉE)=1+(mc−1)ρ. The covariance model's validity entails −1/(mc−1)≤ρ≤1. In particular, ρ=0 means no ICC inflation: both variances equal σ2/(kmc)>0. This formula makes no claim for unequal cluster sizes or weights, nonexchangeable within-cluster covariance, dependent PSUs, or non-negligible finite-population corrections.

Facts & Assumptions

Given: mc≥2, k≥1, σ2>0, independent PSU vectors with equal marginal means and variances, common within-PSU covariance ρσ2, and an element-SRS reference of kmc independent marginal draws. This is the no-FPC superpopulation model, not a fixed-population design-variance identity.

[F1]

Cluster sampling units, cluster totals, and one-stage SRSWOR: A PSU is a cluster of SSUs; one-stage cluster sampling selects PSUs and observes every SSU in each selected PSU.

[F2]

Moments, variance, and covariance on a probability space: Variance and covariance are the expectations of the centered square and centered product.

[F3]

Covariance is symmetric and bilinear in finite linear combinations: Covariance is symmetric and bilinear in finite linear combinations of square-integrable variables.

[F4]

Variance of a finite sum as the sum of all variances and covariances: The variance of a finite sum of square-integrable real random variables is the sum of all pairwise covariances.

[A1]

Independent PSU outcome vectors share the stated exchangeable within-PSU covariance, and the element-SRS reference uses the same marginal law with its finite-population correction neglected.

Proof

1.1givenF2algebra

Nonnegativity of Var⁡(Yi1−Yi2)=2σ2(1−ρ) gives ρ≤1; nonnegativity of Var⁡(∑j=1mc(Yij−μ))=mcσ2[1+(mc−1)ρ] gives ρ≥−1/(mc−1). Thus the stated range is necessary.

1.2givenF1F2F3F4A1algebra

By [F1], one cluster mean averages its mc SSU outcomes; expanding its variance with [F4] and [F3] gives Var⁡(mc−1∑j=1mcYij)=(mcσ2+mc(mc−1)ρσ2)/mc2=(σ2/mc)[1+(mc−1)ρ].

2.1givenF2F3F4A1step 1.2algebra

The k cluster means are independent by [A1], so [F4] and [F3] give Var⁡(YˉC)=σ2[1+(mc−1)ρ]/(kmc) from step 1.2; the kmc independent element draws each have variance σ2, hence Var⁡(YˉE)=σ2/(kmc).

3.1step 2.1algebra∎

Dividing by the positive reference variance in step 2.1 gives DEFF⁡=1+(mc−1)ρ; if ρ=0, this ratio is 1 while each variance remains σ2/(kmc)>0.

Remarks

Shalabh derives the equal-cluster relation after neglecting finite-population corrections. On PDF p. 7 the source states that ρ=0 gives relative efficiency E=1 and describes this as “there is no error.” In context this means there is no efficiency loss relative to element SRS due to clustering, not zero sampling variance: both variances remain σ2/(kmc)>0 when σ2>0.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

8 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources