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
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Conditional Expectation
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Darboux, L'Hôpital, and Taylor's Theorem
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Estimators and Randomized Procedures
- Finite Counting, Factorials and Binomial Coefficients
- Finite populations and design probability
- Finite Probability Spaces and Random Variables
- Fixed-design regression, estimability, and Gauss–Markov
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Scientific model contracts and applicability
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Statistical Experiments, Models and Identifiability
- Suprema and Infima
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral: Definition and Integrability
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
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
Cluster sampling units, cluster totals, and one-stage SRSWOR
Definition
Let the finite element population be partitioned into nonempty finite sets where and is the set of secondary sampling units (SSUs) in the th primary sampling unit (PSU). Thus each element belongs to exactly one PSU. Write , , and let be the fixed value for . The fixed total of PSU and the total over all elements are
A one-stage cluster design selects a subset 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 . A selected PSU is completely enumerated, so its observed SSUs are all of for .
For a uniform simple random sample without replacement (SRSWOR) of PSUs, , the first-stage sample space is the set of all -element subsets of , each with probability . For , write , with .
When , the finite-population variance of the PSU totals is
Remarks
The finite-population design convention in Finite populations and sampling designs fixes every 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.
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 and probability mass function , positive on that support and summing to . For each PSU , fix a second-stage sampling design with nonempty finite support and mass function , positive on that support and summing to . Given the selected PSU set , the second-stage samples are independent, with each drawn from , independently of the identities of other selected PSUs. The joint law is It is a probability mass function: summing over the second-stage supports first gives for each , and summing these values gives . For a function of the joint outcome, write For a first-stage function , define . For a function of the full second-stage outcome and fixed , define The symbol denotes centered-square variance under , and 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 For the second-stage design in PSU , put The stage-specific covariance differences are
If for every PSU and for every SSU, the within-PSU expansion total and the two-stage expansion total are defined by 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.
Unbiasedness and variance of the SRSWOR cluster-total estimator
Statement
Let a fixed finite population have PSUs with fixed cluster totals . Select PSUs by uniform SRSWOR, where . For the selected set, define Then and
Facts & Assumptions
Given: fixed PSU totals, a uniform SRSWOR sample of size , and design expectation over that sample only.
Cluster sampling units, cluster totals, and one-stage SRSWOR: For a uniform SRSWOR of PSUs, the first-stage sample space is the set of all -element subsets of , each with probability ; is fixed.
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.
Covariance is symmetric and bilinear in finite linear combinations: Covariance is symmetric and bilinear in finite linear combinations of square-integrable variables.
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
For each PSU define . Counting -subsets gives ; for distinct , when and when . Hence and .
Since , linearity of finite expectation and from step 1.1 give .
Put , so and fixed sample size gives . By [F4] and [F3], its variance is . Since , substitution from step 1.1 gives .
Remarks
The proof is design-based and uses no distributional model for the fixed , no normal approximation, and no axiom of choice. At the sample is a census and the displayed variance is zero; is covered by the zero pair-inclusion probability in step 1.1. The statement excludes because with denominator is then undefined; that sole-PSU census has zero variance directly.
Equal-size cluster design effect under exchangeable within-cluster covariance
Statement
Let and . In a no-finite-population-correction superpopulation comparison, suppose the sampled PSU outcome vectors are independent and have a common distribution with for each PSU , while distinct PSUs are independent. The cluster estimator is the mean of complete cluster means, and the reference element SRS estimator is the mean of independent draws from the same one-element marginal distribution. Then The covariance model's validity entails . In particular, means no ICC inflation: both variances equal . 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: , , , independent PSU vectors with equal marginal means and variances, common within-PSU covariance , and an element-SRS reference of independent marginal draws. This is the no-FPC superpopulation model, not a fixed-population design-variance identity.
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.
Moments, variance, and covariance on a probability space: Variance and covariance are the expectations of the centered square and centered product.
Covariance is symmetric and bilinear in finite linear combinations: Covariance is symmetric and bilinear in finite linear combinations of square-integrable variables.
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.
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
Nonnegativity of gives ; nonnegativity of gives . Thus the stated range is necessary.
By [F1], one cluster mean averages its SSU outcomes; expanding its variance with [F4] and [F3] gives .
The cluster means are independent by [A1], so [F4] and [F3] give from step 1.2; the independent element draws each have variance , hence .
Dividing by the positive reference variance in step 2.1 gives ; if , this ratio is while each variance remains .
Remarks
Shalabh derives the equal-cluster relation after neglecting finite-population corrections. On PDF p. 7 the source states that gives relative efficiency 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 when .
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 for every PSU and for every SSU . Define Then and 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 with fixed SSU values ; 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.
Two-stage sampling laws and the expansion estimator: Given , the second-stage samples are independent with joint mass ; the full joint mass is .
Two-stage sampling laws and the expansion estimator: It defines the first- and second-order inclusion probabilities, their covariance differences, and and using positive first-order inclusion probabilities.
Two-stage sampling laws and the expansion estimator: The first-stage and , and conditional second-stage and centered-square , are defined as finite-law expectations and variances.
Sigma-algebras: A sigma-algebra is an algebra of subsets closed under countable unions.
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.
Conditional expectation as an ae class: Assume AC for the supplied existence theorem; is the unique almost-sure class of conditional-expectation versions.
Conditional variance: Assume AC; for , conditional variance is as an almost-sure class.
Conditional variance decomposition: Assume AC. For real and a sub-sigma-algebra , .
Moments, variance, and covariance on a probability space: Variance and covariance are the expectations of the centered square and centered product.
Covariance is symmetric and bilinear in finite linear combinations: Covariance is symmetric and bilinear in finite linear combinations of square-integrable variables.
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.
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
For each selected PSU , let ; by [F1] and [F10], , so finite linearity gives .
For PSU and SSU put . By [F10], [F7]–[F9] give . Only first-order probabilities occur in denominators.
Let be the finite joint outcome space with law and ; since first-stage fibers partition , complements and countable unions of their unions are again unions of fibers, so they form a sigma-algebra by [F2]. The function is finite, integrable and -measurable. For each , [F1] and step 1.1 give . Thus [F3] makes a conditional-expectation version and [F4] identifies its class as ; the finite support also gives .
Taking the first-stage expectation of in step 2.1 and using gives .
For each first-stage outcome , let , where [F10] and step 1.1 give by finite linearity; is finite, hence integrable, and -measurable. For any , summing the product law over fibers gives . Thus [F3] and [F4] identify as the conditional-expectation class of the squared residual, and [F5] identifies it with ; consequently its expectation is , while the conditional-mean variance is because is a function of . Applying [F6] under AC yields .
Write . The conditional mean in step 2.1 is the first-stage HT estimator of the fixed totals; [F7]–[F9] give by [F10].
Conditional on , [F1] factors the product law across PSUs; for distinct selected , by step 1.1, so [F7] gives zero covariance. With from step 1.2, [F8] and [F9] give , whose first-stage expectation is .
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
- Shalabh, Sampling Theory, Chapter 9: Cluster Sampling, PDF pp. 1–5 and 11–14, IIT Kanpur
- Sharon L. Lohr, Sampling: Design and Analysis, 2nd ed., §§5.1 and 5.2.1, printed pp. 134–138
- Shalabh, Sampling Theory, Chapter 10: Two Stage Sampling (Subsampling), PDF pp. 1–7, IIT Kanpur
- Sharon L. Lohr, Sampling: Design and Analysis, 2nd ed., §5.3, printed pp. 145–150
- Shalabh, Sampling Theory, Chapter 9: Cluster Sampling, PDF pp. 4–5, IIT Kanpur
- Sharon L. Lohr, Sampling: Design and Analysis, 2nd ed., §5.2.1, printed pp. 136–138
- Shalabh, Sampling Theory, Chapter 9: Cluster Sampling, PDF pp. 6–7, IIT Kanpur
- Sharon L. Lohr, Sampling: Design and Analysis, 2nd ed., §5.2.2, printed pp. 139–141
- Shalabh, Sampling Theory, Chapter 10: Two Stage Sampling (Subsampling), PDF pp. 3–7, IIT Kanpur
- Sharon L. Lohr, Sampling: Design and Analysis, 2nd ed., §5.3 and §6.6, printed pp. 145–150 and 204–210