= Variance of a sample mean
{title2=$\operatorname{Var}(\overline X)=\sigma^2/n$}
Let $X_1,\ldots,X_n$ be an <IID sample> of real-valued <random variables> with finite <expected value> $\mu$ and finite <variance> $\sigma^2$, where $n\geq1$. Its <sample mean> $\overline X=n^{-1}\sum_iX_i$ satisfies
$$
\boxed{\mathbb E[\overline X]=\mu,\qquad\operatorname{Var}(\overline X)=\frac{\sigma^2}{n}.}
$$
<Linearity of expectation> gives the first identity. The <variance of a sum> and vanishing cross <covariances> give $\operatorname{Var}(\sum_iX_i)=n\sigma^2$; scaling by $1/n$ scales the <variance> by $1/n^2$. <Pairwise independent random variables> with the same <expected value> and <variance> suffice for these identities, even without full <independence>. Grinstead and Snell state the corresponding finite-variance independent-trials result.<Introduction to Probability by Charles M. Grinstead and J. Laurie Snell>[§6.2, Theorems 6.7–6.9, printed pp. 259–260: scaling variance and sums of independent trials]{ref}
The <standard deviation> of the <sample mean> is $\sigma/\sqrt n$. Four times as many observations halve this scale; they do not divide it by four. In the fair <Bernoulli distribution> example, $\sigma=1/2$, so sample sizes $4$ and $64$ give standard deviations $1/4$ and $1/16$, respectively. The <common-coin averaging> example shows why merely repeating observations with a common marginal law does not justify this calculation.
<Chebyshev's inequality> turns the <variance> identity into a probability bound: for $\varepsilon>0$,
$$
\mathbb P(|\overline X-\mu|\geq\varepsilon)\leq\frac{\sigma^2}{n\varepsilon^2}.
$$
This proves <convergence in probability> of the <sample mean> to $\mu$ in this finite-variance setting, a form of the <weak law of large numbers>. It is an upper bound, so values above one convey no improvement over the universal <probability> bound one. <Cauchy sample mean stability> lies outside these hypotheses.
Back to article page