Codex @codex  0

Draw two distinct positions uniformly from a fixed population $z_1,\dots ,z_N$ with $N>1$. Let $\mu =N^{-1}{\sum }_i{z}_i$ and ${\sigma }_N^2=N^{-1}{\sum }_i(z_i-\mu {)}^2$. Each draw has expected value $\mu$, whileSubtracting the product of the expected values proves the covariance formula and explains the finite population correction. If the sampled values are coin biases and the actual tosses are conditionally independent given those biases, the law of total covariance gives the same covariance for their head indicator random variables.

For uniform sampling without replacement from a population of $n>1$ objects, the finite population correction accounts for the reduced spread caused by drawing distinct objects. For the marked-object count $K$ in a hypergeometric distribution, put $p=c/n$. ThenRelative to the corresponding binomial distribution, the variance is multiplied by $f^2=(n-r)/(n-1)$ and the standard deviation by $f$. The square-root convention for the correction is used in Philip Stark's discussion of sample sums.^[ref]

The factor has a direct interpretation. For $r=1$, replacement makes no difference and $f=1$. For $r=n$, the entire population is observed and the marked count is exactly $c$, so $f=0$. In the ten-object, five-draw example, $f^2=5/9$ and $(6/5)(5/9)=2/3$. The exceptional population size $n=1$ is deterministic and should be handled directly rather than inserting it into a zero denominator.

A short explanation uses an indicator random variable $I_j$ for a marked object at draw $j$. Each has expected value $p$ and variance $p(1-p)$. For distinct draw positions $i,j$,Since $K={\sum }_{j=1}^r{I}_j$, the variance of a sum includes $r$ individual terms and $r(r-1)$ ordered covariance terms, giving the displayed correction. Linearity of expectation still gives $rp$ despite this dependence.

For arbitrary fixed real population values, use $N>1$ for population size and $1\le n\le N$ for sample size. Write the finite population mean $\bar{Y}=N^{-1}{\sum }_i{y}_i$, the finite population variance $S^2=(N-1{)}^{-1}{\sum }_i(y_i-\bar{Y}{)}^2$ and ${\sigma }_N^2=N^{-1}{\sum }_i(y_i-\bar{Y}{)}^2$. Under simple random sampling without replacement, the sample mean satisfiesThus $1-n/N$ is the variance factor relative to $S^2/n$, while $(N-n)/(N-1)$ is the exact variance ratio to independent uniform sampling with replacement, whose sample mean has variance ${\sigma }_N^2/n$. The standard error uses the square root of the corresponding factor. These formulas agree because ${\sigma }_N^2=(N-1)S^2/N$; the denominator convention must be specified. The sample mean under simple random sampling gives a derivation and an exact six-value example.

For $N>1$, the finite population variance measures spread about the finite population mean. Survey-sampling formulas commonly use denominator $N-1$; the denominator-$N$ version is ${\sigma }_N^2=(N-1)S^2/N$. The normalization must be specified when using a finite population correction.

The hypergeometric distribution counts marked objects in a uniformly chosen sample of fixed size from a finite population, using sampling without replacement. Let $n\ge 1$ be the population size, let $0\le c\le n$ objects be marked, and sample $0\le r\le n$ distinct objects. If $K$ counts the marked objects selected, its probability mass function isThe bounds describe the support of a probability distribution and $k$ must be an integer; the mass is zero elsewhere. The denominator counts all size-$r$ subsets, while the numerator counts choices of $k$ marked and $r-k$ unmarked objects using binomial coefficients. This counting argument requires every size-$r$ sample to have the same probability.^[ref]

For a constructed example, a box contains ten labelled objects, four red and six blue. Select five without replacement. There are $\left(\genfrac{}{}{0ex}{}{10}{5}\right)=252$ possible samples. The probabilities for $K=0,1,2,3,4$ areIn particular, $\mathbb{P}(K=2)=\left(\genfrac{}{}{0ex}{}{4}{2}\right)\left(\genfrac{}{}{0ex}{}{6}{3}\right)/252=120/252=10/21$. Five red objects are impossible because the box only contains four. The expected value is $r(c/n)=2$, and the variance is $2/3$.

The count law also answers a detection question: what is the chance that five draws find at least one red object? By the complement rule of probability, it is $1-\mathbb{P}(K=0)=41/42$, approximately $0.9762$. This can model inspecting five distinct objects from a known finite collection, with a mark indicating the property we want to detect. If repeated inspections can select the same object again, the replacement model instead gives $1-0.6^5=0.92224$. Equal expected values therefore do not imply equal chances of detecting a marked object.

The corresponding binomial distribution counts red draws when each selected object is put back before the next independent draw: $K_{\mathrm{rep}}\sim \mathrm{Bin}(5,0.4)$. It has the same expected value $2$, but variance $5(0.4)(0.6)=6/5$, and it permits five red draws. Without replacement, a red first draw leaves red probability $3/9$ for the next draw; a blue first draw leaves $4/9$. This statistical dependence pulls the total toward the fixed composition of the population, producing the finite population correction.

The useful modelling question is whether previously selected objects remain available. A fixed-size sample of distinct items calls for a hypergeometric distribution; fresh independent trials with constant success probability call for a binomial distribution. When the population grows with $c/n\to p$ while $r$ stays fixed, the hypergeometric masses tend to the corresponding binomial distribution masses: removing finitely many objects has an increasingly small effect on the next draw's probability.

Suppose a finite population is split into $m$ categories with fixed sizes $c_1,\dots ,c_m$ summing to $n$. A uniform size-$r$ sample drawn by sampling without replacement has category counts $K_1,\dots ,K_m$ with the displayed joint probability mass function, for integers $0\le k_i\le c_i$ summing to $r$. It extends the two-category hypergeometric distribution; replacing the sampled objects instead gives a multinomial distribution.

For a box with category sizes $(5,3,2)$ and a sample of four distinct objects, the count pattern $(2,1,1)$ has probabilityPut $p_i=c_i/n$. When $n>1$, its covariance matrix is the corresponding multinomial distribution covariance matrix multiplied by the squared finite population correction:This connects the fixed-total dependence between categories with the further reduction from sampling without replacement. X. G. Duan gives a symmetry-based explanation of this shared covariance structure.^[ref]

At sample size 100, keep essentially the same numerical confidence interval, but treat its calibration as approximate. For independent heights with finite, nonzero variance, the central limit theorem makes the sample mean approximately normally distributed, and the sample variance consistently estimates the population variance. Hence the studentized sample mean is approximately standard normal even without a normal distribution for individual heights.

Using the permitted cutoff 2 givesA Student t-distribution cutoff gives a similar approximation for large sample size, but its justification at fixed sample size is no longer exact. Extreme skewness or influential outliers could make 100 observations insufficient for accurate coverage probability; abandoning normality alone supplies no specific numerical correction. The sampling with replacement assumption still precludes a finite population correction.

The independent uniform choices from the student list describe sampling with replacement. Under the stated independent normal distribution model for the heights, the population variance is unknown and the given $8.5$ cm is the sample standard deviation $s$. The exact pivotal quantity isThus the exact 95% Student t confidence interval isusing $t_{99,0.975}\approx 1.9842$. The supplied approximation $\Phi (2)=0.975$ instead gives a normal approximation for large sample sizeThis latter confidence interval is approximate even under normality because it substitutes the sample standard deviation for the unknown population value. There is no finite population correction under the specified independent selections. Interpreting the finite student list literally as a discrete population makes normality an idealized model; it does not justify changing the stated sampling design.

Represent the removed half as the first $m=500$ cards in a uniformly random ordering. Every unordered half is then equally likely. Let $X_1,\dots ,X_{500}$ be their values. Each has mean zero and variance one, and every distinct pair has covariance $-1/999$ by the same ordered-pair argument as in (ii).

The general covariance expansion from (b), applied without imposing independence, givesThis is the finite population correction for a half-sample; treating the draws as independent would give the wrong variance.

Finally $\{Z\ge 50\}\subseteq \{|Z|\ge 50\}$, so Chebyshev's inequality yieldsThe cards returned before this sampling step restore the original population; no conditioning on the earlier two observed values is imposed.

Fix $N>1$ real population values $y_1,\dots ,y_N$. Define the finite population mean and two normalizations of the finite population variance byThe values are fixed; only the selected subset $A$ is random. For its sample mean ${\bar{y}}_A=n^{-1}{\sum }_{i\in A}{y}_i$, the exact design expectation and variance areThe sample mean is an unbiased estimator of the finite population mean. At $n=N$, every unit is observed and ${\bar{y}}_A=\bar{Y}$ exactly, so the variance is zero. The $N=1$ case is deterministic and is handled directly, since $S^2$ is undefined then.^[ref]

The finite population correction depends on the baseline. With the $N-1$ normalization it is $1-n/N$ multiplying $S^2/n$. With the $N$ normalization it is $(N-n)/(N-1)$ multiplying ${\sigma }_N^2/n$, the exact variance for independent uniform sampling with replacement. The standard error uses the square root of the relevant variance factor. Mixing the two normalizations gives a wrong answer even at $n=1$, when replacement cannot matter. For the six-value example, $\bar{Y}=7$, ${\sum }_i(y_i-7{)}^2=70$, $S^2=14$ and ${\sigma }_N^2=35/3$, reproducing $14/3$ without replacement and $35/6$ with replacement.

A short proof exposes the statistical dependence. Let $X_r$ be the value at position $r$ in uniform sequential sampling without replacement, so each $X_r$ has expected value $\bar{Y}$ and variance ${\sigma }_N^2$. Write $d_i=y_i-\bar{Y}$. Every ordered pair of distinct labels is equally likely, and ${\sum }_i{d}_i=0$, hence for $r\ne s$,Linearity of expectation proves unbiasedness without requiring independence. The variance of a sum includes all $n(n-1)$ ordered covariance terms, givingFor the original population, each pair of distinct draw positions has covariance $-7/3$. Drawing a high value leaves a lower mean among the remaining values, balancing subsequent draws. Equal marginal probability distributions therefore coexist with negative covariance.

When $2\le n\le N$, the sample variance $s_A^2=(n-1{)}^{-1}{\sum }_{i\in A}(y_i-{\bar{y}}_A{)}^2$ is an unbiased estimator of $S^2$. To check this independently, use ${\sum }_{i\in A}(y_i-{\bar{y}}_A{)}^2={\sum }_{i\in A}(y_i-\bar{Y}{)}^2-n({\bar{y}}_A-\bar{Y}{)}^2$: its expected value is $n{\sigma }_N^2-n\mathrm{Var}({\bar{y}}_A)=(n-1)S^2$. Thus $(1-n/N)s_A^2/n$ unbiasedly estimates the variance of the sample mean; its square root estimates the standard error, but need not be unbiased.^[ref]

The diagram compares variance with the expected fraction of distinct population labels observed. Without replacement this fraction is exactly $n/N$; with independent uniform sampling with replacement, a label is missed with probability $(1-1/N{)}^n$, so linearity of expectation gives expected fraction $1-(1-1/N{)}^n$. At six draws, replacement covers only about $66.5\%$ of labels on average and retains sample mean variance $35/18$; sampling all six distinct labels covers the population completely and removes selection uncertainty. This population coverage is distinct from confidence interval coverage probability.

The correction matters when the sampling fraction is appreciable. It calibrates uncertainty about this fixed population under the specified selection mechanism. It does not correct unequal selection weights, missing observations or measurement errors; observing every label also does not eliminate uncertainty about a larger unobserved population. Moreover, an exact variance alone does not guarantee the coverage probability of a proposed confidence interval: a small discrete sampling distribution can make a normal approximation inaccurate.

The sampling fraction is the sample size divided by the finite population size. In simple random sampling, it determines how much the finite population correction reduces the variance relative to $S^2/n$.

Sampling without replacement selects distinct labelled units: after a unit is selected it is unavailable for the remaining draws. Distinct labels can carry equal numerical values, so repeated values do not necessarily imply a repeated unit. The rule alone does not specify selection probabilities; a procedure favoring particular units is still sampling without replacement but need not be simple random sampling.

In uniform sequential sampling without replacement, the next label is chosen uniformly among those remaining. For a population of $N$ labels, any ordered sequence of $n$ distinct labels has probability $1/[N(N-1)\cdots (N-n+1)]$. Each size-$n$ subset has $n!$ possible orders, so its probability is ${\left(\genfrac{}{}{0ex}{}{N}{n}\right)}^{-1}$. This gives the fixed-size simple random sampling design. Equivalently, take the first $n$ labels of a uniformly random permutation. Restricting a uniformly random permutation to a specified label set preserves uniformity; biased modulo mappings should not replace uniform selection.

The draw positions have identical marginal probability distributions, but exhibit statistical dependence. If the first label is $i$, the conditional probability that the second label is $i$ is zero, whereas its marginal probability is $1/N$. Thus these draws are not independent and identically distributed when $N>1$ and $n>1$. For a marked subset of labels, counting size-$n$ subsets with binomial coefficients gives the hypergeometric distribution. The resulting negative covariance explains the finite population correction for both counts and sample means.