The Sample Mean and Sample Variance

Suppose a factory produces bolts whose true diameter has some unknown mean μ\mu and unknown variance σ2\sigma^2. You cannot measure every bolt ever made. Instead, you measure a sample of nn of them and compute two numbers. These are their average, and how spread out they are around that average. These two numbers — the sample mean and sample variance — are the workhorses of statistical inference. Almost every downstream method (confidence intervals, hypothesis tests, regression diagnostics) is built by asking how these two quantities behave as random variables in their own right. The central subtlety is this: the sample mean and sample variance are not fixed numbers waiting to be discovered. They are functions of a random sample. Therefore they are themselves random variables with their own distributions, expectations, and variances. Understanding how they fluctuate from sample to sample — not just what they equal for one particular dataset — is the entire content of statistical inference. This article answers the question precisely: what are E[Xˉ]\mathbb{E}[\bar X], Var⁡(Xˉ)\operatorname{Var}(\bar X), E[S2]\mathbb{E}[S^2], and (for normal populations) Var⁡(S2)\operatorname{Var}(S^2)? The big picture is a bridge between two worlds. On one side sits the population, described by an unknown distribution with parameters μ\mu and σ2\sigma^2. On the other side sits data, described by empirical summaries Xˉ\bar X and S2S^2. The theorems here are the precise dictionary translating properties of the population into properties of these summaries. They explain a famous fact that surprises many students on first sight. Dividing by n−1n-1, rather than nn, in the sample variance is not an arbitrary convention. It is a mathematically forced correction. This article gives rigorous definitions. It proves the key expectation and variance identities without any distributional assumption beyond independence. It then specializes to the normal population case to compute Var⁡(S2)\operatorname{Var}(S^2) exactly. It closes the loop toward the machinery — tt, χ2\chi^2, and FF distributions — that make these facts usable for confidence intervals and tests. It also points toward the general theory of Point Estimation and Estimators.

Key takeaways
  • The sample mean Xˉ\bar X and sample variance S2S^2 are statistics: functions of a random sample, hence random variables.
  • For any i.i.d. sample with finite mean μ\mu and variance σ2\sigma^2: E[Xˉ]=μ\mathbb{E}[\bar X]=\mu and Var⁡(Xˉ)=σ2/n\operatorname{Var}(\bar X)=\sigma^2/n.
  • Dividing by n−1n-1 instead of nn in S2S^2 is exactly what makes E[S2]=σ2\mathbb{E}[S^2]=\sigma^2 — this is Bessel's correction.
  • These two facts hold for any population distribution with two finite moments; no normality is needed.
  • Under normality, Xˉ\bar X and S2S^2 are independent, and (n−1)S2/σ2∼χn−12(n-1)S^2/\sigma^2 \sim \chi^2_{n-1}, giving Var⁡(S2)=2σ4/(n−1)\operatorname{Var}(S^2)=2\sigma^4/(n-1).
  • Key idea: the sample mean and sample variance are random variables whose own mean and variance can be computed exactly from those of the parent population — this computation is the foundation of statistical inference.

Where this lives today

The sample mean and sample variance are the entry point to essentially all of applied statistics and much of applied mathematics beyond it. In statistical quality control, control charts (like the classical Xˉ\bar X-chart and SS-chart used on factory floors) are built directly from the sampling distributions derived here, flagging processes whose observed mean or variance drifts beyond the natural fluctuation predicted by σ2/n\sigma^2/n and 2σ4/(n−1)2\sigma^4/(n-1). In experimental physics, reporting a measurement as "xˉ±SE\bar x \pm \text{SE}" is a direct application of Var⁡(Xˉ)=σ2/n\operatorname{Var}(\bar X)=\sigma^2/n, quantifying the precision gained by repeated trials. In machine learning, mini-batch statistics (batch normalization layers in neural networks) compute running sample means and variances whose bias and variance properties determine training stability. In finance, estimating volatility (variance of returns) from historical price data uses exactly S2S^2, and the Var⁡(S2)\operatorname{Var}(S^2) formula quantifies how much estimation error to expect in a volatility estimate from a finite historical window. In genomics and clinical trials, sample-size calculations for detecting a treatment effect are built by combining Var⁡(Xˉ)=σ2/n\operatorname{Var}(\bar X)=\sigma^2/n with hypothesis-testing theory to decide how many subjects are needed. And in pure probability, this article's identities are the seed from which the t, Chi-Squared, and F Distributions grow — the tt-distribution arises precisely from studentizing Xˉ\bar X by S/nS/\sqrt n using the independence and chi-squared results proved here, and the FF-distribution compares two independent sample variances built the same way, both central to the general theory of Point Estimation and Estimators and to confidence-interval construction built on Sampling Distributions.

Ask the tutor: How does the independence of Xˉ\bar X and S2S^2 under normality get used to derive the Student tt-distribution?

DefinitionSample mean and sample variance

Let X1,X2,…,XnX_1, X_2, \dots, X_n be a random sample: independent and identically distributed (i.i.d.) random variables drawn from a population (a distribution) with finite mean μ=E[Xi]\mu = \mathbb{E}[X_i] and finite variance σ2=Var⁡(Xi)<∞\sigma^2 = \operatorname{Var}(X_i) < \infty. The sample mean is the statistic

Xˉ  =  1n∑i=1nXi.\bar X \;=\; \frac{1}{n}\sum_{i=1}^n X_i .

The sample variance is the statistic

S2  =  1n−1∑i=1n(Xi−Xˉ)2,S^2 \;=\; \frac{1}{n-1}\sum_{i=1}^n \bigl(X_i - \bar X\bigr)^2 ,

defined for n≥2n \ge 2. The quantity S=S2S = \sqrt{S^2} is called the sample standard deviation. A statistic is any function of the sample X1,…,XnX_1,\dots,X_n that does not depend on unknown population parameters; since Xˉ\bar X and S2S^2 are computable from data alone, they are statistics, and being functions of random variables, they are themselves random variables with their own probability distributions — called sampling distributions.

Intuition

Picture the population as an urn with an unknown but fixed "chemical composition" — a mean μ\mu around which values cluster, and a spread σ2\sigma^2 describing how loosely they cluster. Each time you draw a sample of size nn, you get a slightly different snapshot: a different collection of nn numbers, hence a different Xˉ\bar X and a different S2S^2. If you repeated the whole experiment many times — drawing sample after sample of size nn — the resulting sequence of Xˉ\bar X values would itself trace out a distribution, and likewise for S2S^2. The theorem below identifies the center and spread of that distribution, in terms of the population's μ\mu and σ2\sigma^2. The key geometric fact behind the n−1n-1 divisor is that the sample mean Xˉ\bar X is itself estimated from the data, so the deviations Xi−XˉX_i - \bar X are not free to vary independently: they are constrained to sum to zero. This costs exactly one degree of freedom, which is why n−1n-1 rather than nn appears in the denominator of S2S^2 — using nn would systematically underestimate σ2\sigma^2.

Figure
Repeated sampling: each sample of size n gives a different (x̄, s²) pair, scattering around the true (μ, σ²)
x̄ s² (μ, σ²) Each blue dot = (x̄, s²) from one sample of size n Var(x̄) = σ²/n shrinks the spread of x̄ as n grows

Central results

TheoremExpectation and variance of the sample mean and expectation of the sample variance

Let X1,…,XnX_1,\dots,X_n be i.i.d. with E[Xi]=μ\mathbb{E}[X_i]=\mu and Var⁡(Xi)=σ2<∞\operatorname{Var}(X_i)=\sigma^2 < \infty, and let Xˉ\bar X and S2S^2 be as in the Sample mean and sample variance definition, with n≥2n \ge 2. Then: 1. E[Xˉ]=μ\mathbb{E}[\bar X] = \mu. 2. Var⁡(Xˉ)=σ2n\operatorname{Var}(\bar X) = \dfrac{\sigma^2}{n}. 3. E[S2]=σ2\mathbb{E}[S^2] = \sigma^2. No assumption beyond i.i.d.-ness and finiteness of the first two moments is required; in particular normality of the XiX_i is not needed for these three identities.

Proof

We prove each part in turn, using only linearity of expectation, the definition of variance, and independence.

Part 1. By linearity of expectation,

E[Xˉ]=E ⁣[1n∑i=1nXi]=1n∑i=1nE[Xi]=1n∑i=1nμ=1n⋅nμ=μ.\mathbb{E}[\bar X] = \mathbb{E}\!\left[\frac{1}{n}\sum_{i=1}^n X_i\right] = \frac{1}{n}\sum_{i=1}^n \mathbb{E}[X_i] = \frac{1}{n}\sum_{i=1}^n \mu = \frac{1}{n}\cdot n\mu = \mu.

Linearity of expectation requires no independence assumption at all; it holds for any finite collection of random variables with finite means, so this step is fully general.

Part 2. Since the XiX_i are independent, the variance of a sum of independent random variables equals the sum of the variances (a standard fact: for independent Y,ZY,Z, Var⁡(Y+Z)=Var⁡(Y)+Var⁡(Z)\operatorname{Var}(Y+Z) = \operatorname{Var}(Y)+\operatorname{Var}(Z), because Cov⁡(Y,Z)=0\operatorname{Cov}(Y,Z)=0). Applying this to ∑iXi\sum_i X_i, and using Var⁡(cY)=c2Var⁡(Y)\operatorname{Var}(cY) = c^2\operatorname{Var}(Y) for a constant cc,

Var⁡(Xˉ)=Var⁡ ⁣(1n∑i=1nXi)=1n2Var⁡ ⁣(∑i=1nXi)=1n2∑i=1nVar⁡(Xi)=1n2⋅nσ2=σ2n.\operatorname{Var}(\bar X) = \operatorname{Var}\!\left(\frac{1}{n}\sum_{i=1}^n X_i\right) = \frac{1}{n^2}\operatorname{Var}\!\left(\sum_{i=1}^n X_i\right) = \frac{1}{n^2}\sum_{i=1}^n \operatorname{Var}(X_i) = \frac{1}{n^2}\cdot n\sigma^2 = \frac{\sigma^2}{n}.

This step uses independence essentially: without it, cross-covariance terms 2∑i<jCov⁡(Xi,Xj)2\sum_{i<j}\operatorname{Cov}(X_i,X_j) would remain and the clean formula would fail (see the counterexample below).

Part 3. We first establish the algebraic identity

∑i=1n(Xi−Xˉ)2=∑i=1nXi2−nXˉ2,\sum_{i=1}^n (X_i - \bar X)^2 = \sum_{i=1}^n X_i^2 - n\bar X^2,

which follows by expanding: ∑i(Xi−Xˉ)2=∑iXi2−2Xˉ∑iXi+nXˉ2=∑iXi2−2Xˉ(nXˉ)+nXˉ2=∑iXi2−nXˉ2\sum_i (X_i-\bar X)^2 = \sum_i X_i^2 - 2\bar X\sum_i X_i + n\bar X^2 = \sum_i X_i^2 - 2\bar X (n\bar X) + n\bar X^2 = \sum_i X_i^2 - n\bar X^2, using ∑iXi=nXˉ\sum_i X_i = n\bar X by definition of Xˉ\bar X. Now take expectations of both sides. For each ii, the identity Var⁡(Xi)=E[Xi2]−(E[Xi])2\operatorname{Var}(X_i) = \mathbb{E}[X_i^2] - (\mathbb{E}[X_i])^2 gives E[Xi2]=σ2+μ2\mathbb{E}[X_i^2] = \sigma^2 + \mu^2, so

E ⁣[∑i=1nXi2]=n(σ2+μ2).\mathbb{E}\!\left[\sum_{i=1}^n X_i^2\right] = n(\sigma^2+\mu^2).

Similarly, applying the same identity to Xˉ\bar X itself (which has mean μ\mu by Part 1 and variance σ2/n\sigma^2/n by Part 2),

E[Xˉ2]=Var⁡(Xˉ)+(E[Xˉ])2=σ2n+μ2,\mathbb{E}[\bar X^2] = \operatorname{Var}(\bar X) + (\mathbb{E}[\bar X])^2 = \frac{\sigma^2}{n} + \mu^2,

so

E[nXˉ2]=n(σ2n+μ2)=σ2+nμ2.\mathbb{E}[n\bar X^2] = n\left(\frac{\sigma^2}{n}+\mu^2\right) = \sigma^2 + n\mu^2.

Subtracting,

E ⁣[∑i=1n(Xi−Xˉ)2]=n(σ2+μ2)−(σ2+nμ2)=nσ2−σ2=(n−1)σ2.\mathbb{E}\!\left[\sum_{i=1}^n (X_i-\bar X)^2\right] = n(\sigma^2+\mu^2) - (\sigma^2+n\mu^2) = n\sigma^2 - \sigma^2 = (n-1)\sigma^2.

Dividing both sides by n−1n-1 gives

E[S2]=E ⁣[1n−1∑i=1n(Xi−Xˉ)2]=(n−1)σ2n−1=σ2,\mathbb{E}[S^2] = \mathbb{E}\!\left[\frac{1}{n-1}\sum_{i=1}^n (X_i-\bar X)^2\right] = \frac{(n-1)\sigma^2}{n-1} = \sigma^2,

as claimed. This computation used only linearity of expectation, the variance-decomposition identity Var⁡(Y)=E[Y2]−(EY)2\operatorname{Var}(Y)=\mathbb{E}[Y^2]-(\mathbb{E}Y)^2 applied to each XiX_i and to Xˉ\bar X, and Parts 1–2 already proved (no circularity, since Parts 1–2 do not depend on Part 3). ■\blacksquare

∎
CorollaryWhy the divisor is n−1n-1

Define the "naive" (uncorrected) estimator S~2=1n∑i(Xi−Xˉ)2\tilde S^2 = \frac{1}{n}\sum_i (X_i-\bar X)^2. From the proof above, E[S~2]=n−1nσ2<σ2\mathbb{E}[\tilde S^2] = \frac{n-1}{n}\sigma^2 < \sigma^2 for every finite nn. Thus S~2\tilde S^2 is a biased estimator of σ2\sigma^2 that systematically underestimates it, while S2=nn−1S~2S^2 = \frac{n}{n-1}\tilde S^2 is unbiased: E[S2]=σ2\mathbb{E}[S^2]=\sigma^2 exactly, for every n≥2n \ge 2. The correction factor n/(n−1)n/(n-1) is known as Bessel's correction.

LemmaCochran-type decomposition for the normal case

Let X1,…,XnX_1,\dots,X_n be i.i.d. N(μ,σ2)N(\mu,\sigma^2), n≥2n\ge 2. Then: (a) Xˉ\bar X and S2S^2 are independent random variables. (b) (n−1)S2σ2∼χn−12\dfrac{(n-1)S^2}{\sigma^2} \sim \chi^2_{n-1}, a chi-squared distribution with n−1n-1 degrees of freedom.

Proof

(Sketch of a standard argument, stated in full but relying on one linear-algebra fact about the multivariate normal, proved separately in the theory of <a class="wiki-link" href="/wiki/math-probstat-t-chisq-f-distributions" data-track="wiki_article.body.wiki_link">The t, Chi-Squared, and F Distributions</a>.) Write X=(X1,…,Xn)⊤\mathbf X = (X_1,\dots,X_n)^\top. Since the XiX_i are i.i.d. N(μ,σ2)N(\mu,\sigma^2), the vector X\mathbf X is jointly Gaussian with mean μ1\mu \mathbf 1 and covariance matrix σ2In\sigma^2 I_n, where 1=(1,…,1)⊤\mathbf 1=(1,\dots,1)^\top. Let P=1n11⊤P = \frac{1}{n}\mathbf 1 \mathbf 1^\top be the orthogonal projection onto the one-dimensional subspace spanned by 1\mathbf 1 (so PX=Xˉ1P\mathbf X = \bar X \mathbf 1), and let Q=In−PQ = I_n - P be the projection onto the orthogonal complement, the (n−1)(n-1)-dimensional subspace of vectors summing to zero. Note QXQ\mathbf X is exactly the vector of centered observations (X1−Xˉ,…,Xn−Xˉ)⊤(X_1-\bar X,\dots,X_n-\bar X)^\top, and

∑i=1n(Xi−Xˉ)2=∥QX∥2=(n−1)S2.\sum_{i=1}^n (X_i-\bar X)^2 = \|Q\mathbf X\|^2 = (n-1)S^2.

Because X\mathbf X is Gaussian with covariance σ2In\sigma^2 I_n (a scalar multiple of the identity, hence isotropic), and P,QP,Q are orthogonal projections onto orthogonal complementary subspaces, the random vectors PXP\mathbf X and QXQ\mathbf X are jointly Gaussian and uncorrelated:

Cov⁡(PX,QX)=σ2PQ=σ2P(I−P)=σ2(P−P2)=0,\operatorname{Cov}(P\mathbf X, Q\mathbf X) = \sigma^2 PQ = \sigma^2 P(I-P) = \sigma^2(P - P^2) = 0,

using P2=PP^2=P since PP is a projection. For jointly Gaussian vectors, zero covariance implies independence (a standard property of the multivariate normal distribution). Hence PX=Xˉ1P\mathbf X = \bar X\mathbf 1 is independent of QXQ\mathbf X, and since S2S^2 is a function of QXQ\mathbf X alone while Xˉ\bar X is a function of PXP\mathbf X alone, Xˉ\bar X and S2S^2 are independent. This proves (a). For (b): QXQ\mathbf X is the projection of a mean-μ1\mu\mathbf 1, covariance-σ2I\sigma^2 I Gaussian vector onto an (n−1)(n-1)-dimensional subspace orthogonal to 1\mathbf 1; since μ1∈ker⁡Q⊥\mu \mathbf 1 \in \ker Q^\perp... more precisely Q(μ1)=0Q(\mu\mathbf 1)=0 because μ1\mu\mathbf 1 lies in the span of 1\mathbf 1, which QQ annihilates. So QX=Q(X−μ1)Q\mathbf X = Q(\mathbf X - \mu\mathbf 1) has mean zero and, after an orthonormal change of basis for the range of QQ, its coordinates are n−1n-1 i.i.d. N(0,σ2)N(0,\sigma^2) variables. Therefore

∥QX∥2σ2=(n−1)S2σ2\frac{\|Q\mathbf X\|^2}{\sigma^2} = \frac{(n-1)S^2}{\sigma^2}

is a sum of n−1n-1 independent squared standard normals, which is by definition χn−12\chi^2_{n-1}. ■\blacksquare

∎
TheoremVariance of the sample variance, normal population

Let X1,…,XnX_1,\dots,X_n be i.i.d. N(μ,σ2)N(\mu,\sigma^2), n≥2n\ge 2. Then

Var⁡(S2)=2σ4n−1.\operatorname{Var}(S^2) = \frac{2\sigma^4}{n-1}.
Proof

By the preceding lemma, W:=(n−1)S2/σ2∼χn−12W := (n-1)S^2/\sigma^2 \sim \chi^2_{n-1}. A chi-squared distribution with kk degrees of freedom has E[W]=k\mathbb{E}[W]=k and Var⁡(W)=2k\operatorname{Var}(W) = 2k — this is a standard, directly verifiable fact from the moment generating function of the χk2\chi^2_k distribution, MW(t)=(1−2t)−k/2M_W(t) = (1-2t)^{-k/2} for t<1/2t<1/2, whose first two derivatives at t=0t=0 give E[W]=k\mathbb{E}[W]=k and E[W2]=k(k+2)\mathbb{E}[W^2] = k(k+2), hence Var⁡(W)=k(k+2)−k2=2k\operatorname{Var}(W) = k(k+2)-k^2 = 2k. Here k=n−1k = n-1, so Var⁡(W)=2(n−1)\operatorname{Var}(W) = 2(n-1). Since S2=σ2n−1WS^2 = \dfrac{\sigma^2}{n-1}W,

Var⁡(S2)=(σ2n−1)2Var⁡(W)=σ4(n−1)2⋅2(n−1)=2σ4n−1.\operatorname{Var}(S^2) = \left(\frac{\sigma^2}{n-1}\right)^2 \operatorname{Var}(W) = \frac{\sigma^4}{(n-1)^2}\cdot 2(n-1) = \frac{2\sigma^4}{n-1}.

This uses only the scaling property Var⁡(cW)=c2Var⁡(W)\operatorname{Var}(cW)=c^2\operatorname{Var}(W) and the previously established distributional fact W∼χn−12W\sim\chi^2_{n-1}, with no circularity. ■\blacksquare

∎

Worked examples

Example 1 (asymmetric numeric sample; illustrating Xˉ\bar X, S2S^2, and the bias correction directly). Consider the sample of n=5n=5 measurements (in some unit), deliberately asymmetric and non-round:

x1=2.1,x2=5.4,x3=3.0,x4=9.7,x5=4.8.x_1=2.1,\quad x_2=5.4,\quad x_3=3.0,\quad x_4=9.7,\quad x_5=4.8.

Step 1: sample mean.

xˉ=2.1+5.4+3.0+9.7+4.85=25.05=5.0.\bar x = \frac{2.1+5.4+3.0+9.7+4.8}{5} = \frac{25.0}{5} = 5.0.

Step 2: deviations and squared deviations.

xix_ixi−xˉx_i - \bar x(xi−xˉ)2(x_i-\bar x)^2
2.1−2.9-2.98.418.41
5.40.40.40.160.16
3.0−2.0-2.04.004.00
9.74.74.722.0922.09
4.8−0.2-0.20.040.04

Sum of squared deviations: 8.41+0.16+4.00+22.09+0.04=34.708.41+0.16+4.00+22.09+0.04 = 34.70. (Check: the deviations sum to −2.9+0.4−2.0+4.7−0.2=0.0-2.9+0.4-2.0+4.7-0.2 = 0.0, confirming ∑(xi−xˉ)=0\sum (x_i-\bar x)=0 as required by the algebra in the proof.) Step 3: sample variance with n−1=4n-1=4.

s2=34.704=8.675.s^2 = \frac{34.70}{4} = 8.675.

Step 4: compare to the naive divide-by-nn estimate.

s~2=34.705=6.94.\tilde s^2 = \frac{34.70}{5} = 6.94.

Indeed s~2=n−1ns2=45(8.675)=6.94\tilde s^2 = \frac{n-1}{n}s^2 = \frac{4}{5}(8.675) = 6.94, matching the theorem's bias factor n−1n\frac{n-1}{n} exactly. This single sample cannot show unbiasedness (that is a statement about the average over repeated sampling, not about one dataset) — but it verifies the algebraic relationship between S2S^2 and S~2\tilde S^2 predicted by the corollary. Step 5: standard deviation and standard error of the mean. s=8.675≈2.945s = \sqrt{8.675} \approx 2.945. If this population had a known variance σ2=8.675\sigma^2 = 8.675 (treating the sample value as if it were the truth, purely for illustration of the formula), the theorem gives

Var⁡(Xˉ)=σ2n=8.6755=1.735,so Var⁡(Xˉ)≈1.317.\operatorname{Var}(\bar X) = \frac{\sigma^2}{n} = \frac{8.675}{5} = 1.735, \qquad \text{so } \sqrt{\operatorname{Var}(\bar X)} \approx 1.317.

This quantity, the standard deviation of Xˉ\bar X, is called the standard error of the mean and shrinks like 1/n1/\sqrt n as sample size grows — the quantitative content of Part 2 of the theorem.

Example 2 (using the theorems to predict sampling behavior before collecting data — normal population). A quality-control engineer knows from decades of production data that bolt diameters (in mm) are very well modeled as N(μ,σ2)N(\mu, \sigma^2) with σ2=0.09\sigma^2 = 0.09 (so σ=0.3\sigma = 0.3 mm), though μ\mu itself is unknown and will be estimated from a fresh sample of n=10n = 10 bolts. Question A: What is the standard error of Xˉ\bar X for this sample size? By Part 2 of the theorem,

Var⁡(Xˉ)=σ2n=0.0910=0.009,SE(Xˉ)=0.009≈0.0949 mm.\operatorname{Var}(\bar X) = \frac{\sigma^2}{n} = \frac{0.09}{10} = 0.009, \qquad \text{SE}(\bar X) = \sqrt{0.009} \approx 0.0949 \text{ mm}.

So even though individual bolts vary with standard deviation 0.30.3 mm, the average of 10 bolts varies with standard deviation only about 0.0950.095 mm — roughly 10≈3.16\sqrt{10}\approx 3.16 times tighter, exactly as σ/n\sigma/\sqrt n predicts. Question B: What is E[S2]\mathbb{E}[S^2] for the sample variance the engineer will compute? By Part 3, regardless of what particular 1010 bolts are drawn,

E[S2]=σ2=0.09,\mathbb{E}[S^2] = \sigma^2 = 0.09,

so on average, across many hypothetical batches of 10 bolts, the computed S2S^2 centers exactly on the true variance 0.090.09 — this is the precise sense in which S2S^2 is the "right" estimator, not the naive S~2\tilde S^2 (which would average to 910(0.09)=0.081\frac{9}{10}(0.09)=0.081, a 10%10\% downward bias). Question C: How much does S2S^2 itself fluctuate from batch to batch? Using the normal-population theorem with n−1=9n-1=9,

Var⁡(S2)=2σ4n−1=2(0.09)29=2(0.0081)9=0.01629=0.0018.\operatorname{Var}(S^2) = \frac{2\sigma^4}{n-1} = \frac{2(0.09)^2}{9} = \frac{2(0.0081)}{9} = \frac{0.0162}{9} = 0.0018.

So the standard deviation of S2S^2 itself is 0.0018≈0.0424\sqrt{0.0018} \approx 0.0424, meaning a single computed S2S^2 can quite plausibly land anywhere in roughly 0.09±0.080.09 \pm 0.08 (two standard deviations) purely from sampling noise with only n=10n=10 — a concrete illustration of why S2S^2 from small samples is a noisy estimate of σ2\sigma^2, even though it is unbiased. Increasing nn to 100100 would shrink Var⁡(S2)\operatorname{Var}(S^2) to 2(0.0081)/99≈0.0001642(0.0081)/99 \approx 0.000164, an order of magnitude tighter, illustrating the 1/(n−1)1/(n-1) rate of concentration.

CounterexampleDropping independence breaks Var(X̄) = σ²/n

The hypothesis of independence in Part 2 of the theorem is essential — dropping it (while keeping identical marginal distributions and finite variance) can make Var⁡(Xˉ)\operatorname{Var}(\bar X) arbitrarily far from σ2/n\sigma^2/n, even exceed σ2\sigma^2 itself. Construct a degenerate example: let Z∼N(0,σ2)Z \sim N(0,\sigma^2) be a single random variable, and define X1=X2=⋯=Xn=ZX_1 = X_2 = \cdots = X_n = Z (every "sample point" is a copy of the same draw — perfectly correlated, not independent). Each XiX_i individually still has mean 00 and variance σ2\sigma^2, satisfying the marginal-moment hypotheses of the theorem. But

Xˉ=1n∑i=1nXi=1n(nZ)=Z,\bar X = \frac{1}{n}\sum_{i=1}^n X_i = \frac{1}{n}(nZ) = Z,

so

Var⁡(Xˉ)=Var⁡(Z)=σ2,\operatorname{Var}(\bar X) = \operatorname{Var}(Z) = \sigma^2,

not σ2/n\sigma^2/n. Averaging did nothing to reduce variability, because there was no new independent information in each additional "observation" — they were all copies of one underlying random draw. More generally, for a sample with common pairwise correlation ρ∈(0,1]\rho \in (0,1] (an equicorrelated structure, as arises e.g. from a shared random effect), the exact formula is

Var⁡(Xˉ)=σ2n+n−1nρσ2,\operatorname{Var}(\bar X) = \frac{\sigma^2}{n} + \frac{n-1}{n}\rho\sigma^2,

which converges to ρσ2>0\rho\sigma^2 > 0 as n→∞n\to\infty rather than to 00. This shows precisely how independence is used in the proof (to kill the cross-covariance terms 2∑i<jCov⁡(Xi,Xj)2\sum_{i<j}\operatorname{Cov}(X_i,X_j)) and what fails without it: with dependent data, more observations do not guarantee a shrinking standard error, a fact of central importance in time series and clustered-data analysis.

Scope, edge cases & common traps

SituationWhat holdsWhat can fail
I.i.d. sample, any distribution with finite μ,σ2\mu,\sigma^2E[Xˉ]=μ\mathbb E[\bar X]=\mu, Var⁡(Xˉ)=σ2/n\operatorname{Var}(\bar X)=\sigma^2/n, E[S2]=σ2\mathbb E[S^2]=\sigma^2Nothing — these three hold universally under the stated hypotheses
I.i.d. normal sampleAdditionally: Xˉ⊥S2\bar X \perp S^2; (n−1)S2/σ2∼χn−12(n-1)S^2/\sigma^2\sim\chi^2_{n-1}; Var⁡(S2)=2σ4/(n−1)\operatorname{Var}(S^2)=2\sigma^4/(n-1)The exact independence of Xˉ\bar X and S2S^2 is special to normal populations — it can fail for other distributions
Non-independent sample (e.g. time series, clustered data)E[Xˉ]=μ\mathbb{E}[\bar X]=\mu still holds by linearityVar⁡(Xˉ)=σ2/n\operatorname{Var}(\bar X)=\sigma^2/n generally fails; extra covariance terms appear
Infinite variance population (e.g. Cauchy, or heavy-tailed with σ2=∞\sigma^2=\infty)Xˉ\bar X may still be defined as a statisticVar⁡(Xˉ)=σ2/n\operatorname{Var}(\bar X)=\sigma^2/n is meaningless/undefined since σ2=∞\sigma^2=\infty; Xˉ\bar X need not even concentrate as n→∞n\to\infty
n=1n=1Xˉ=X1\bar X = X_1, so Var⁡(Xˉ)=σ2\operatorname{Var}(\bar X)=\sigma^2 triviallyS2S^2 is undefined (n−1=0n-1=0 in the denominator); at least n=2n=2 observations are needed to estimate spread

The mathematician behind it

Origins · 1 minFriedrich Wilhelm Bessel and how this was discovered
FW
Friedrich Wilhelm Bessel
1784–1846 · Astronomy and error theory, Prussia

Bessel was a self-taught astronomer and mathematician who became director of the Königsberg Observatory. Though best known for Bessel functions (arising from his work on planetary perturbations) and for the first reliable measurement of stellar parallax (61 Cygni, 1838), his name is permanently attached to the "Bessel correction" — the n/(n−1)n/(n-1) factor that converts a biased mean-squared-deviation into an unbiased estimator of variance. His work sat at the intersection of practical observational astronomy, where instruments produced noisy repeated measurements, and the emerging theory of errors developed alongside Gauss and Laplace; the drive to correctly combine and summarize many imperfect telescope readings is precisely the setting in which the distinction between a population variance and its unbiased sample estimate first became practically indispensable.

History
- 1809 — Gauss develops the theory of errors and the normal distribution in the context of astronomical observation, laying groundwork for treating repeated measurements probabilistically.
- 1823 — Gauss formulates the Gauss–Markov framework for least-squares estimation, implicitly using sums of squared deviations.
- 1830s — Bessel, working on precision astronomical measurement, identifies and popularizes the n−1n-1 correction for estimating variance from a finite sample of observations.
- 1900s — Karl Pearson and R.A. Fisher formalize the modern vocabulary of "statistic," "sampling distribution," and "degrees of freedom," giving the n−1n-1 correction its rigorous justification via the chi-squared distribution.
- 1925 — Fisher's Statistical Methods for Research Workers cements S2S^2 with divisor n−1n-1 as the standard unbiased estimator of variance in applied statistics.
Why isn't the sample variance just defined with divisor n, like a plain average of squared deviations?

Dividing by nn gives S~2=1n∑i(Xi−Xˉ)2\tilde S^2 = \frac1n\sum_i(X_i-\bar X)^2, whose expectation is n−1nσ2\frac{n-1}{n}\sigma^2, strictly less than σ2\sigma^2 for every finite nn. The reason is that Xˉ\bar X is itself estimated from the same data, so the deviations Xi−XˉX_i - \bar X are constrained (they must sum to zero), giving effectively only n−1n-1 "free" pieces of information about spread rather than nn. Dividing by n−1n-1 exactly compensates for this constraint, yielding an unbiased estimator E[S2]=σ2\mathbb{E}[S^2]=\sigma^2. This is Bessel's correction, and it is a mathematical necessity for unbiasedness, not a stylistic choice.

Does Var(X̄) = σ²/n require the population to be normally distributed?

No. The identities E[Xˉ]=μ\mathbb{E}[\bar X]=\mu, Var⁡(Xˉ)=σ2/n\operatorname{Var}(\bar X)=\sigma^2/n, and E[S2]=σ2\mathbb{E}[S^2]=\sigma^2 hold for any i.i.d. sample from any population with finite mean and variance — Bernoulli, exponential, uniform, or otherwise. Normality is only needed for the stronger results: that Xˉ\bar X and S2S^2 are exactly independent, that (n−1)S2/σ2(n-1)S^2/\sigma^2 is exactly chi-squared, and hence that Var⁡(S2)=2σ4/(n−1)\operatorname{Var}(S^2)=2\sigma^4/(n-1) exactly. For non-normal populations these last facts generally fail or hold only approximately for large nn.

Is S² the only reasonable estimator of σ², or just the unbiased one?

S2S^2 is the standard unbiased estimator, but it is not the only reasonable one and not always the "best" by every criterion. For instance, under normality, the maximum likelihood estimator of σ2\sigma^2 is exactly S~2=n−1nS2\tilde S^2 = \frac{n-1}{n}S^2 (the divide-by-nn version), which is biased but has smaller variance and in fact smaller mean-squared error than S2S^2 for finite nn. Choosing between estimators involves trading off bias and variance, a theme developed fully in Point Estimation and Estimators; unbiasedness is a desirable property but not the sole criterion for a "good" estimator.

Why does Var(S²) matter if S² is already unbiased?

Unbiasedness only guarantees that S2S^2 is correct on average across hypothetical repeated sampling; it says nothing about how far a single computed S2S^2 might land from σ2\sigma^2 in any particular dataset. Var⁡(S2)=2σ4/(n−1)\operatorname{Var}(S^2)=2\sigma^4/(n-1) quantifies exactly that spread for normal populations, showing it shrinks like 1/(n−1)1/(n-1) — so small samples give noisy variance estimates even though they are unbiased. This variance is exactly what feeds into building valid confidence intervals for σ2\sigma^2 using the chi-squared distribution, and into deriving the tt-distribution for confidence intervals on μ\mu when σ\sigma is unknown.

What happens to these formulas when n = 1?

With n=1n=1, Xˉ=X1\bar X = X_1 exactly, so E[Xˉ]=μ\mathbb{E}[\bar X]=\mu and Var⁡(Xˉ)=σ2\operatorname{Var}(\bar X)=\sigma^2 still hold trivially (consistent with σ2/n=σ2/1\sigma^2/n = \sigma^2/1). But S2S^2 is undefined, since its denominator n−1=0n-1=0: with only one observation there is no way to estimate spread around an unknown mean, because a single point offers zero information about variability. At least two observations are the minimum requirement for the sample variance to exist.

Can the sample mean and sample variance be dependent for non-normal populations?

Yes, and in general they typically are. The proof that Xˉ⊥S2\bar X \perp S^2 relies specifically on properties of the multivariate normal distribution (that zero covariance implies independence for jointly Gaussian vectors, and that projections of an isotropic Gaussian onto orthogonal subspaces are independent). For a non-normal population — say, exponential or uniform — Xˉ\bar X and S2S^2 are generally correlated, sometimes strongly so, and no analogous clean chi-squared result for (n−1)S2/σ2(n-1)S^2/\sigma^2 holds exactly (only asymptotically, via the Central Limit Theorem-type approximations)

How do these results connect to hypothesis testing and confidence intervals?

The confidence interval for μ\mu when σ\sigma is unknown is built from the statistic T=Xˉ−μS/nT = \dfrac{\bar X - \mu}{S/\sqrt n}, whose distribution is derived precisely from the facts proved here: numerator behavior from Var⁡(Xˉ)=σ2/n\operatorname{Var}(\bar X)=\sigma^2/n, and denominator behavior from (n−1)S2/σ2∼χn−12(n-1)S^2/\sigma^2 \sim \chi^2_{n-1} together with the independence of Xˉ\bar X and S2S^2. Combining an N(0,1)N(0,1) numerator with an independent χn−12\chi^2_{n-1} denominator (suitably scaled) is exactly the construction of the tt-distribution with n−1n-1 degrees of freedom, covered in The t, Chi-Squared, and F Distributions. Every tt-test and tt-confidence-interval formula ultimately traces back to the identities proved in this article.

Before this

Where this leads