Alphabeta Math
Pipeline-generated
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.

Cluster and two-stage sampling

1 · Prerequisites

2 · Summary

Cluster sampling selects whole primary sampling units (PSUs) and observes their secondary sampling units (SSUs). The page fixes the finite-population convention and the exact one-stage and two-stage sample laws before deriving the expansion estimators' design properties. For two-stage sampling, the variance separates between-PSU variation in the true cluster totals from the expected within-PSU sampling variance. The general conditional-variance proof states its inherited Axiom of Choice assumption. A separate superpopulation calculation omitting the finite-population correction derives the equal-size within-cluster-correlation design effect under independent PSUs and common within-cluster covariance; it does not extend to unequal sizes, weights, or nonexchangeable covariance.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Cluster sampling units, cluster totals, and one-stage SRSWOR

Definition

Let the finite element population be partitioned into nonempty finite sets U=⨆i=1MUi, where M≥1 and Ui is the set of secondary sampling units (SSUs) in the ith primary sampling unit (PSU). Thus each element belongs to exactly one PSU. Write Ni=∣Ui∣, N=∑i=1MNi, and let yij∈R be the fixed value for j∈Ui. The fixed total of PSU i and the total over all elements are Ti=∑j∈Uiyij,T=∑i=1MTi.

A one-stage cluster design selects a subset S1⊆[M] of PSUs according to a finite sampling design in the sense of Finite populations and sampling designs. The PSU totals and all SSU values are fixed; design probability is over S1. A selected PSU is completely enumerated, so its observed SSUs are all of Ui for i∈S1.

For a uniform simple random sample without replacement (SRSWOR) of m PSUs, 1≤m≤M, the first-stage sample space is the set of all m-element subsets of [M], each with probability (Mm)−1. For i,r∈[M], write Ii=1{i∈S1}, πi(1)=Pd(Ii=1),πir(1)=Pd(Ii=Ir=1), with πii(1)=πi(1).

When M≥2, the finite-population variance of the PSU totals is ST2=1M−1∑i=1M(Ti−Tˉ)2,Tˉ=1M∑i=1MTi.

Remarks

The finite-population design convention in Finite populations and sampling designs fixes every yij and averages only over the declared PSU-sampling law. A PSU is the sampling unit in one-stage cluster sampling; its SSUs are all observed after that PSU is selected. This does not treat the SSUs as independently sampled units.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Two-stage sampling laws and the expansion estimator

Definition

Use the PSU partition and fixed values from Cluster sampling units, cluster totals, and one-stage SRSWOR. A first-stage design has a nonempty finite support S1⊆2[M] and probability mass function p1, positive on that support and summing to 1. For each PSU i, fix a second-stage sampling design with nonempty finite support S2i⊆2Ui and mass function p2i, positive on that support and summing to 1. Given the selected PSU set S1, the second-stage samples (Si)i∈S1 are independent, with each Si drawn from p2i, independently of the identities of other selected PSUs. The joint law is Pd(S1,(Si)i∈S1)=p1(S1)∏i∈S1p2i(Si). It is a probability mass function: summing over the second-stage supports first gives p1(S1) for each S1, and summing these values gives 1. For a function g of the joint outcome, write E1[h]=∑S1∈S1p1(S1)h(S1),E2[g∣S1=s]=∑(Si)i∈s(∏i∈sp2i(Si))g(s,(Si)i∈s). For a first-stage function h, define Var⁡1(h)=E1[(h−E1h)2]. For a function g of the full second-stage outcome and fixed S1=s, define Var⁡2(g∣S1=s)=E2[(g−E2[g∣S1=s])2∣S1=s]. The symbol Var⁡2i denotes centered-square variance under p2i, and Var⁡d denotes centered-square variance under the joint law. These use the variance definition in Moments, variance, and covariance on a probability space.

For the first stage, put πi(1)=Pd(i∈S1),πir(1)=Pd(i,r∈S1). For the second-stage design in PSU i, put πj∣i(2)=P2i(j∈Si),πjℓ∣i(2)=P2i(j,ℓ∈Si). The stage-specific covariance differences are Δir(1)=πir(1)−πi(1)πr(1),Δjℓ∣i(2)=πjℓ∣i(2)−πj∣i(2)πℓ∣i(2).

If πi(1)>0 for every PSU and πj∣i(2)>0 for every SSU, the within-PSU expansion total and the two-stage expansion total are defined by T^i=∑j∈Siyijπj∣i(2),T^=∑i∈S1T^iπi(1). No positivity assumption on the pair-inclusion probabilities is part of this definition.

Remarks

The product in the joint law is an explicit conditional-independence assumption across selected PSUs. A design with dependent second-stage samples across PSUs, or a second-stage law depending jointly on the first-stage set, has a different variance formula. The expansion estimator's divisions use only first-order inclusion probabilities.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Unbiasedness and variance of the SRSWOR cluster-total estimator

Statement

Let a fixed finite population have M≥2 PSUs with fixed cluster totals T1,…,TM. Select m PSUs by uniform SRSWOR, where 1≤m≤M. For S1 the selected set, define T^C=Mm∑i∈S1Ti,ST2=1M−1∑i=1M(Ti−Tˉ)2,Tˉ=1M∑i=1MTi. Then Ed[T^C]=T:=∑i=1MTi and Var⁡d(T^C)=M2(1−m/M)mST2.

Facts & Assumptions

Given: M≥2 fixed PSU totals, a uniform SRSWOR sample S1 of size 1≤m≤M, and design expectation Ed over that sample only.

[F1]

Cluster sampling units, cluster totals, and one-stage SRSWOR: For a uniform SRSWOR of m PSUs, the first-stage sample space is the set of all m-element subsets of [M], each with probability (Mm)−1; Ti is fixed.

[F2]

Moments, variance, and covariance on a probability space: For square-integrable real random variables, 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.

Proof

1.1givenF1choosealgebra

For each PSU define Ii=1{i∈S1}. Counting m-subsets gives πi=(M−1m−1)/(Mm)=m/M; for distinct i,r, πir=0 when m=1 and πir=(M−2m−2)/(Mm)=m(m−1)/(M(M−1)) when m≥2. Hence Var⁡d(Ii)=πi(1−πi)=m(M−m)/M2 and Cov⁡d(Ii,Ir)=πir−πiπr=−m(M−m)/(M2(M−1)).

2.1givenstep 1.1algebra

Since T^C=(M/m)∑iIiTi, linearity of finite expectation and Ed[Ii]=m/M from step 1.1 give Ed[T^C]=(M/m)∑i(m/M)Ti=∑iTi=T.

3.1givenF2F3F4step 1.1algebra∎

Put xi=Ti−Tˉ, so ∑ixi=0 and fixed sample size gives T^C−T=(M/m)∑iIixi. By [F4] and [F3], its variance is (M2/m2)(∑iVar⁡(Ii)xi2+∑i≠rCov⁡(Ii,Ir)xixr). Since ∑i≠rxixr=−∑ixi2, substitution from step 1.1 gives Var⁡d(T^C)=(M2/m2)(m(M−m)/M2)(1+1/(M−1))∑ixi2=M2(1−m/M)ST2/m.

Remarks

The proof is design-based and uses no distributional model for the fixed Ti, no normal approximation, and no axiom of choice. At m=M the sample is a census and the displayed variance is zero; m=1 is covered by the zero pair-inclusion probability in step 1.1. The statement excludes M=1 because ST2 with denominator M−1 is then undefined; that sole-PSU census has zero variance directly.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

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.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Unbiasedness and variance decomposition for the two-stage expansion total

Statement

Use the product two-stage design and expansion estimator from Two-stage sampling laws and the expansion estimator. Assume AC and πi(1)>0 for every PSU i and πj∣i(2)>0 for every SSU j∈Ui. Define Δir(1)=πir(1)−πi(1)πr(1),Δjℓ∣i(2)=πjℓ∣i(2)−πj∣i(2)πℓ∣i(2). Then Ed[T^]=T and Var⁡d(T^)=∑i=1M∑r=1MΔir(1)πi(1)πr(1)TiTr+∑i=1M1πi(1)∑j∈Ui∑ℓ∈UiΔjℓ∣i(2)πj∣i(2)πℓ∣i(2)yijyiℓ. The first term is the design variance of the expansion based on the true PSU totals. The second is the expected within-PSU sampling variance. Zero pair inclusion probabilities are permitted because the formula divides only by positive first-order inclusion probabilities.

Facts & Assumptions

Given: AC; a finite fixed population partitioned into PSUs Ui with fixed SSU values yij; the product two-stage sampling law; positive first-order inclusion probabilities at both stages; and the expansion estimators and stage-specific inclusion probabilities in the Statement.

[F1]

Two-stage sampling laws and the expansion estimator: Given S1, the second-stage samples are independent with joint mass ∏i∈S1p2i(Si); the full joint mass is p1(S1)∏i∈S1p2i(Si).

[F10]

Two-stage sampling laws and the expansion estimator: It defines the first- and second-order inclusion probabilities, their covariance differences, and T^i and T^ using positive first-order inclusion probabilities.

[F11]

Two-stage sampling laws and the expansion estimator: The first-stage E1 and Var⁡1, and conditional second-stage E2[⋅∣S1] and centered-square Var⁡2(⋅∣S1), are defined as finite-law expectations and variances.

[F2]

Sigma-algebras: A sigma-algebra is an algebra of subsets closed under countable unions.

[F3]

Conditional expectation given a sigma algebra: A conditional expectation version is a measurable integrable function whose integral on each conditioning event equals the integral of the input.

[F4]

Conditional expectation as an ae class: Assume AC for the supplied existence theorem; E[X∣G] is the unique almost-sure class of conditional-expectation versions.

[F5]

Conditional variance: Assume AC; for X∈L2, conditional variance is E[(X−E[X∣G])2∣G] as an almost-sure class.

[F6]

Conditional variance decomposition: Assume AC. For real X∈L2(P) and a sub-sigma-algebra G, Var⁡(X)=E[Var⁡(X∣G)]+Var⁡(E[X∣G]).

[F7]

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

[F8]

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

[F9]

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]

The Axiom of Choice: AC states that every family of nonempty sets has a choice function. It is used here only through the conditional expectation and conditional-variance supplier branch [F3]–[F5].

Proof

1.1givenF1F10algebra

For each selected PSU i∈S1, let Jij=1{j∈Si}; by [F1] and [F10], E2[Jij∣S1]=πj∣i(2), so finite linearity gives E2[T^i∣S1]=∑j∈UiE2[Jij∣S1]yij/πj∣i(2)=∑j∈Uiyij=Ti.

1.2F7F8F9F10algebra

For PSU i and SSU j put Jij=1{j∈Si}. By [F10], [F7]–[F9] give Vi=Var⁡2i(∑j∈UiJijyij/πj∣i(2))=∑j,ℓ∈UiCov⁡2i(Jij,Jiℓ)yijyiℓ/(πj∣i(2)πℓ∣i(2))=∑j,ℓ∈UiΔjℓ∣i(2)yijyiℓ/(πj∣i(2)πℓ∣i(2)). Only first-order probabilities occur in denominators.

2.1A1F1F2F3F4F10step 1.1algebra

Let Ω be the finite joint outcome space with law Pd and F=2Ω; since first-stage fibers partition Ω, complements and countable unions of their unions are again unions of fibers, so they form a sigma-algebra G⊆F by [F2]. The function H(S1)=∑i∈S1Ti/πi(1) is finite, integrable and G-measurable. For each A={S1∈BA}∈G, [F1] and step 1.1 give Ed[1AT^]=∑s1∈BAp1(s1)∑(si)(∏i∈s1p2i(si))∑i∈s1T^i/πi(1)=∑s1∈BAp1(s1)H(s1)=Ed[1AH]. Thus [F3] makes H a conditional-expectation version and [F4] identifies its class as Ed[T^∣G]; the finite support also gives T^∈L2.

3.1givenF1F10step 2.1algebra

Taking the first-stage expectation of H in step 2.1 and using E1[1{i∈S1}]=πi(1) gives Ed[T^]=E1[∑i∈S1Ti/πi(1)]=∑i=1MTi=T.

3.2A1F1F3F4F5F6F10F11step 1.1step 2.1algebra

For each first-stage outcome s, let K(s)=Var⁡2(T^∣S1=s)=E2[(T^−H(s))2∣S1=s], where [F10] and step 1.1 give E2[T^∣S1=s]=H(s) by finite linearity; K is finite, hence integrable, and G-measurable. For any A={S1∈BA}∈G, summing the product law over fibers gives Ed[1A(T^−H)2]=∑s∈BAp1(s)K(s)=Ed[1AK]. Thus [F3] and [F4] identify K as the conditional-expectation class of the squared residual, and [F5] identifies it with Var⁡(T^∣G); consequently its expectation is E1[Var⁡2(T^∣S1)], while the conditional-mean variance is Var⁡1(H) because H is a function of S1∼p1. Applying [F6] under AC yields Var⁡d(T^)=Var⁡1(∑i∈S1Ti/πi(1))+E1[Var⁡2(T^∣S1)].

3.3F7F8F9F10F11step 2.1algebra

Write Ii(1)=1{i∈S1}. The conditional mean in step 2.1 is the first-stage HT estimator of the fixed totals; [F7]–[F9] give Var⁡1(∑i∈S1Ti/πi(1))=∑i,rCov⁡1(Ii(1),Ir(1))TiTr/(πi(1)πr(1))=∑i,rΔir(1)TiTr/(πi(1)πr(1)) by [F10].

4.1F1F7F8F9F10F11step 1.1step 1.2step 3.2algebra

Conditional on S1, [F1] factors the product law across PSUs; for distinct selected i,r, E2[(T^i−Ti)(T^r−Tr)∣S1]=E2[T^i−Ti∣S1]E2[T^r−Tr∣S1]=0 by step 1.1, so [F7] gives zero covariance. With Vi from step 1.2, [F8] and [F9] give Var⁡2(T^∣S1)=∑i∈S1Vi/(πi(1))2, whose first-stage expectation is ∑iπi(1)Vi/(πi(1))2=∑iVi/πi(1).

5.1step 1.2step 3.1step 3.2step 3.3step 4.1algebra∎

Substituting the within-stage expression from step 1.2 and step 4.1 and the between-stage expression from step 3.3 into the decomposition in step 3.2 gives the stated variance, while step 3.1 gives unbiasedness.

Remarks

The AC hypothesis is carried from the published conditional-expectation and conditional-variance suppliers used in step 2.1; it is not used in the one-stage theorem or the direct finite enumeration on the B page. The stage-2 independence assumption is essential: dependent second-stage samples across PSUs add conditional covariance terms.

5 · Examples, counterexamples and false statements

None yet.

Sources