Tutorials › Statistical Theory I - Probability and Distribution Theory › The Design Expectation of the Finite-Population Sample Variance

Exact Sampling Distributions · Tutorial 794 of 994

The Design Expectation of the Finite-Population Sample Variance

See why the usual sample variance estimates the finite-population variance without bias when every sample of a fixed size is equally likely.

Advanced 9 min read

What You'll Learn

  • Define the finite-population variance using the denominator \(N-1\).
  • Express sample variance through pairwise squared differences.
  • Prove design-unbiasedness under simple random sampling without replacement.
  • Calculate design expectations for small finite populations.
  • Identify the effect of using a denominator of \(N\) instead of \(N-1\).

Why the Sampling Design Matters

A sample variance is calculated from the observations selected, so it changes from sample to sample. To ask whether it estimates a population variance without bias, we must specify what is random: in this tutorial, the population values are fixed and the randomness comes entirely from the sampling design. Under simple random sampling without replacement, every subset of the population of the specified size has the same chance of selection.

With the usual finite-population convention, both the population variance and the sample variance use a degrees-of-freedom denominator: \(N-1\) for the population and \(n-1\) for the sample. The central result is that the sample variance is unbiased for the finite-population variance under this design. The proof rests on expressing each variance as an average of squared pairwise differences.

Population and Sample Variances

Definition: Let a finite population consist of fixed values \(Y_1,\ldots,Y_N\), where \(N\geq 2\). Its mean and finite-population variance are
$$ \bar Y_U=\frac{1}{N}\sum_{i=1}^N Y_i, \qquad S_U^2=\frac{1}{N-1}\sum_{i=1}^N (Y_i-\bar Y_U)^2. $$
A simple random sample without replacement (SRSWOR) of size \(n\) is a subset chosen uniformly from the \(\binom{N}{n}\) possible subsets. For \(2\leq n\leq N\), write its observed values as \(Y_{i_1},\ldots,Y_{i_n}\), its mean as \(\bar Y_s\), and its usual sample variance as
$$ s_s^2=\frac{1}{n-1}\sum_{j=1}^n (Y_{i_j}-\bar Y_s)^2. $$
The design expectation \(E_d[\cdot]\) is expectation over the random selection of the sample, holding all population values fixed.

The restriction \(n\geq 2\) is necessary because the usual sample variance has denominator \(n-1\). When \(n=N\), the sample is the entire population, so \(s_s^2=S_U^2\) for every possible selection (there is only one).

A Pairwise-Difference Identity

The key algebraic fact is that centered sums of squares can be written using all pairs of values. It applies to any fixed list, whether that list is a sample or the whole population.

Lemma: For any real numbers \(x_1,\ldots,x_m\), with mean \(\bar x=m^{-1}\sum_{i=1}^m x_i\),
$$ \sum_{1\leq i<j\leq m}(x_i-x_j)^2 = m\sum_{i=1}^m(x_i-\bar x)^2. $$

Proof. Expand each squared difference. Each \(x_i^2\) appears in exactly \(m-1\) pairs, and the cross-products together give \(-2\sum_{i<j}x_ix_j\). Thus

$$ \begin{aligned} \sum_{i<j}(x_i-x_j)^2 &=(m-1)\sum_{i=1}^m x_i^2-2\sum_{i<j}x_ix_j\\ &=m\sum_{i=1}^m x_i^2-\left(\sum_{i=1}^m x_i\right)^2\\ &=m\left(\sum_{i=1}^m x_i^2-m\bar x^2\right)\\ &=m\sum_{i=1}^m(x_i-\bar x)^2. \end{aligned} $$

The second equality uses \((\sum_i x_i)^2=\sum_i x_i^2+2\sum_{i<j}x_ix_j\). For the last equality, expanding the centered sum gives \(\sum_i x_i^2-2\bar x\sum_i x_i+m\bar x^2=\sum_i x_i^2-m\bar x^2\). This proves the identity. \(\square\)

Dividing the identity by the appropriate factors gives two useful representations:

$$ s_s^2=\frac{1}{n(n-1)} \sum_{\substack{i<j\\i,j\text{ in the sample}}}(Y_i-Y_j)^2, \qquad S_U^2=\frac{1}{N(N-1)} \sum_{1\leq i<j\leq N}(Y_i-Y_j)^2. $$

For example, in the sample representation, the lemma says that the pairwise sum is \(n\sum_{j=1}^n(Y_{i_j}-\bar Y_s)^2\). Dividing by \(n(n-1)\) therefore gives exactly the usual sample variance. The population representation follows by applying the same identity to all \(N\) values.

The Design-Unbiasedness Theorem

Theorem: For a fixed finite population \(Y_1,\ldots,Y_N\), with \(N\geq 2\), if a sample of size \(n\) is selected by SRSWOR, where \(2\leq n\leq N\), then
$$ E_d[s_s^2]=S_U^2. $$

Proof. For each population pair \(i<j\), let \(I_{ij}\) equal 1 if both units \(i\) and \(j\) are included in the sample and 0 otherwise. The sample pairwise representation can be written as

$$ s_s^2=\frac{1}{n(n-1)}\sum_{i<j}I_{ij}(Y_i-Y_j)^2. $$

All population values are fixed. Under SRSWOR, the probability that a particular pair is included is the fraction of size-\(n\) subsets containing both units:

$$ E_d[I_{ij}]=P_d(I_{ij}=1) =\frac{\binom{N-2}{n-2}}{\binom{N}{n}} =\frac{n(n-1)}{N(N-1)}. $$

The last equality follows by expanding the binomial coefficients. Taking expectation of the finite sum and substituting this same inclusion probability for every pair gives

$$ \begin{aligned} E_d[s_s^2] &=\frac{1}{n(n-1)}\sum_{i<j}E_d[I_{ij}](Y_i-Y_j)^2\\ &=\frac{1}{n(n-1)} \frac{n(n-1)}{N(N-1)} \sum_{i<j}(Y_i-Y_j)^2\\ &=\frac{1}{N(N-1)}\sum_{i<j}(Y_i-Y_j)^2\\ &=S_U^2. \end{aligned} $$

The final equality is the population pairwise-difference representation. This proves the theorem. \(\square\)

The argument is finite: expectation is interchanged with a finite sum, so no limit or integrability condition is needed. The essential design property is the common probability that any particular pair is included.

Worked Calculations

Worked Example: Enumerating Every Sample of Size Two

Take the population \(2,4,7,11\), with \(N=4\), and draw an SRSWOR of size \(n=2\). First calculate the population mean and variance:

$$ \bar Y_U=\frac{2+4+7+11}{4}=6, \qquad S_U^2=\frac{(2-6)^2+(4-6)^2+(7-6)^2+(11-6)^2}{3} =\frac{46}{3}. $$

There are \(\binom{4}{2}=6\) equally likely samples. For a sample of two values \(a,b\), its sample variance is \((a-b)^2/2\). The six squared differences are

$$ (2-4)^2=4,\quad(2-7)^2=25,\quad(2-11)^2=81,\quad (4-7)^2=9,\quad(4-11)^2=49,\quad(7-11)^2=16. $$

Their sum is \(4+25+81+9+49+16=184\). Therefore the average of the six sample variances is

$$ E_d[s_s^2]=\frac{1}{6}\left(\frac{4}{2}+\frac{25}{2}+\frac{81}{2} +\frac{9}{2}+\frac{49}{2}+\frac{16}{2}\right) =\frac{184}{12}=\frac{46}{3}. $$

This enumeration agrees exactly with the population variance. It also checks the pairwise identity numerically: the population pairwise sum is \(184=4\cdot46\).

Worked Example: Using Pair-Inclusion Probabilities

Let the five fixed population values be \(1,2,4,4,9\), and take an SRSWOR of size \(n=3\). The population mean is \(20/5=4\), so

$$ S_U^2=\frac{(1-4)^2+(2-4)^2+(4-4)^2+(4-4)^2+(9-4)^2}{4} =\frac{38}{4}=\frac{19}{2}. $$

Each particular pair is included with probability

$$ P_d(I_{ij}=1)=\frac{3\cdot2}{5\cdot4}=\frac{3}{10}. $$

The sum of squared differences across all population pairs is \(N\sum_i(Y_i-\bar Y_U)^2=5\cdot38=190\), by the pairwise identity. Hence

$$ E_d[s_s^2] =\frac{1}{3\cdot2}\cdot\frac{3}{10}\cdot190 =\frac{19}{2}=S_U^2. $$

As a direct check on the scale of an individual estimate, the possible sample with values \(1,4,9\) has squared pair differences \(9,64,25\). Its sample variance is \((9+64+25)/6=49/3\). One sample variance need not equal the population variance; unbiasedness concerns the average over the sampling design.

Worked Example: A Sample Variance Can Be Zero

Consider the population \(0,0,0,6\), and draw two units without replacement. The population mean is \(6/4=3/2\), and

$$ S_U^2= \frac{3(0-3/2)^2+(6-3/2)^2}{3} =\frac{3(9/4)+81/4}{3} =\frac{27}{3}=9. $$

Of the six equally likely pairs, three contain two zeros. Each such sample has variance 0. The other three pairs contain a zero and a 6; each has sample variance \((0-6)^2/2=18\). Thus

$$ E_d[s_s^2]=\frac{3(0)+3(18)}{6}=9=S_U^2. $$

This example makes clear that design-unbiasedness does not mean every realized sample gives an accurate value. It means the estimator's expectation under the specified selection procedure is the target.

What the Denominator Means

Some disciplines define a finite-population variance with denominator \(N\), rather than \(N-1\). If that convention is used, write

$$ V_U=\frac{1}{N}\sum_{i=1}^N(Y_i-\bar Y_U)^2. $$

Because \(S_U^2=\frac{N}{N-1}V_U\), the theorem implies \(E_d[s_s^2]=\frac{N}{N-1}V_U\), not \(V_U\). The usual sample variance is unbiased for the \(N-1\) convention. Stating the denominator is therefore part of stating the estimand; the word “variance” alone does not settle which finite-population quantity is intended.

A related derived result describes the numerator of the sample variance. Since \(s_s^2\) is the sample centered sum of squares divided by \(n-1\), multiplying the theorem by \(n-1\) gives

Corollary: Under the conditions of the theorem,
$$ E_d\left[\sum_{j=1}^n(Y_{i_j}-\bar Y_s)^2\right]=(n-1)S_U^2. $$
Derivation: For every selected sample, the centered sum is exactly \((n-1)s_s^2\). Taking design expectations and using \(E_d[s_s^2]=S_U^2\) yields the stated equality. \(\square\)

The result concerns a fixed finite population and a random sample design. It does not require a probability model for how the population values were generated.

Common Pitfall

  • Wrong reasoning: “The sample variance divides by \(n-1\), so it must be unbiased for any population variance, regardless of its definition or sampling method.”
  • Correction: The target here is specifically \(S_U^2\), with denominator \(N-1\), and the proof uses the equal pair-inclusion probability under SRSWOR. If the target instead uses denominator \(N\), the expectation differs by the factor \(N/(N-1)\). If the selection design changes, the pair-inclusion probabilities must be reconsidered rather than assumed to give the same result.

The practical lesson is to name both the target and the design before claiming unbiasedness. For SRSWOR, writing the sample variance as a pairwise sum exposes exactly why its design expectation matches the \(N-1\) finite-population variance.

Check Your Understanding

Answer each question using the fixed-population, SRSWOR framework.

  1. Why is the usual sample variance undefined when \(n=1\), and what is the smallest allowed sample size in the theorem?
  2. For \(N=6\) and \(n=3\), what is the probability that a specified pair of population units is included? Show the formula.
  3. Explain why the pairwise-difference identity has denominator \(n(n-1)\) when it is written as a sample variance.
  4. If the finite-population target is defined with denominator \(N\), what is \(E_d[s_s^2]\) in terms of that target?
  5. Does design-unbiasedness require every possible sample variance to equal the population variance? Explain using the meaning of design expectation.