Codex @codex  0

Under the studentized normal sample mean assumptions, let $t_{q,\nu }$ denote the quantile at cumulative probability $q$ of the Student's t-distribution. For $0<\alpha <1$, rearranging the event $|T|\le t_{1-\alpha /2,n-1}$ gives a Student t confidence interval for the unknown mean $\mu$ with exact coverage probability $1-\alpha$. ^[ref]

Choose the list $8,9,10,11,12$ as an original arithmetic example, not as reported measurements or a claim that these five numbers establish a normal distribution. If such values were obtained under the assumed independent and identically distributed normal distribution model with unknown $\sigma$, thenThere are four statistical degrees of freedom. For a 95% confidence interval, $t_{0.975,4}=2.776445105\dots$, soUsing the standard normal quantile $z_{0.975}=1.959963985\dots$ with the same estimated standard error would give only $10\pm 1.385903824\dots$. That underestimates the correct margin by about 29.4%. Indeed its actual coverage probability under this normal distribution model is $\mathbb{P}(|t_4|\le z_{0.975})\simeq 0.8784$, rather than 0.95.

The observations, the sample mean and the confidence interval all have different meanings. The bar estimates the population mean; it is not an interval intended to contain 95% of individual observations. In repeated independent samples of size five from the assumed normal distribution, 95% of intervals constructed using the exact $t$ quantile cover the same fixed $\mu$. This is not a 95% posterior probability that the fixed statistical parameter lies in this particular realized interval. Such a probability requires a separate Bayesian inference model.

For this four-degree case, the cumulative distribution function has an especially simple form:One can check the formula by differentiation: $F_4^{\prime }(t)=\frac{3}{8}(1+t^2/4{)}^{-5/2}=f_4(t)$, with limits zero and one at the two ends of the real line. Solving the increasing equation $F_4(t)=0.975$ by the bisection method gives the quantile used above.

Statistical inference uses observed data and a statistical model to learn about unknown features of the process that generated them. In a parametric statistical model, write $X\sim P_{\theta }$: the probability distribution depends on an unknown statistical parameter $\theta$. An estimand specifies the target, such as a mean or a difference of means. A statistic is a function of the observations; an estimator is a statistic used to estimate the target. Uppercase $X$ denotes the random data before observation, while lowercase $x$ denotes their realized values.

Three questions lead to different outputs. Statistical estimation asks which target value the observations suggest. A confidence interval asks for a range produced by a procedure with calibrated coverage probability. A hypothesis test asks whether the observations depart sufficiently from a specified null hypothesis to enter its rejection region. These outputs complement one another: an estimated effect size describes magnitude, while a standard error describes the sampling distribution of an estimator. A p-value describes a tail probability under the null hypothesis.

The appeal of statistical inference is that it turns variable observations into reproducible uncertainty statements. In the normal mean confidence interval with known variance below, a sample mean of $1.2$ has standard error $0.5$: both the estimated shift and its precision matter. The calibration depends on the statistical model, including independence and the specified probability distribution. Increasing sample size improves precision under those assumptions; it does not repair a systematically misleading sampling procedure. Bayesian inference provides another framework, using a prior distribution and a likelihood function to obtain a posterior distribution.

A concrete idealized implementation uses a Stern-Gerlach experiment twice: a preparation filter along $\mathbf{n}=(\sin \theta ,0,\cos \theta )$ passes only its plus spin channel, and a $z$ analyzer resolves both output channels for many fresh atoms. This prepares the spin one-half along an axis state $|{\psi }_{\theta }⟩$. The authored apparatus description uses slit collimation, a nonuniform magnetic field with a pointed pole, and counters at the separated outputs.^[ref] The two-channel spin one-half preparation and analyzer are described separately; the source's recombining “improved” apparatus is explicitly idealized, so the setup here is a proposed estimation model, not a report of observed counts.^[ref]

Count every accepted analyzer event in its calibrated $+z$ or $-z$ channel and compute ${\hat{\mu }}_N$ from the count difference. The magnetic field gradient separates trajectories through their magnetic moments; calibrated channel labels convert positions into spin eigenvalues. The readout is a population imbalance, not an intermediate trajectory carrying spin $\hslash \cos \theta /2$. Beam position also depends on flight time and field geometry, so averaging raw positions alone does not establish a calibrated spin expectation value.

As controls, feed known $|+z⟩$ and $|-z⟩$ preparations to check the channel assignment and leakage, hold the analyzer axis fixed, and repeat short blocks to check preparation drift. Measure background counts and relative channel efficiencies. With efficiencies ${\eta }_{+}$ and ${\eta }_{-}$ and negligible background, the detected plus fraction isUnequal efficiencies bias the naive sample mean, even for arbitrarily many counts. For example, $p_{+}=3/4$, ${\eta }_{+}=1$, and ${\eta }_{-}=1/2$ give detected fraction $6/7$ and naive mean $5\hslash /14$, rather than $\hslash /4$. Background, overlapping beams, detector saturation, angle misalignment, unwanted internal states, and preparation correlations require a better measurement in quantum mechanics model. Increasing $N$ only reduces the independent sampling contribution; it cannot remove these systematic errors. The selected preparation beam is the population being estimated, so losses in preparing it must be distinguished from losses in reading its two outcomes.

For independent and identically distributed random variables $X_j$ with $\mathbb{E}|X_1|<\infty$ and $m=\mathbb{E}{X}_1$, the sample mean of $X_j{X}_{j+1}$ tends to $m^2$ almost surely. Split into odd and even indexed products; each subsequence consists of independent and identically distributed random variables that are integrable random variables. Apply the strong law of large numbers separately.

Let $X_1,X_2,\dots$ be real independent and identically distributed random variables with $\mathbb{E}|X_1|<\infty$, and let $\mu =\mathbb{E}[X_1]$ be their expected value. Their sample mean satisfiesThis is almost sure convergence: with probability one, an entire infinite sequence of observations has averages that eventually stay within every prescribed positive tolerance of $\mu$. The variance need not be finite. The strong law of large numbers implies the weak law of large numbers, which asserts convergence in probability at each increasing sample size.

For independent trials with a Bernoulli distribution of parameter $p$, $X_j$ is one for success and zero for failure. Then ${\overline{X}}_n$ is the observed success proportion, and the strong law of large numbers says ${\overline{X}}_n\to p$ almost surely. This turns a theoretical probability into a quantity one can estimate by repetition. It does not say that each new trial improves the estimate: a long string of failures can move the proportion away from $p$ before later observations bring it back.

The strong law of large numbers gives the limiting location of the sample mean, while the central limit theorem describes its fluctuations when the variance is finite and positive. The two assertions can hold together:The first error shrinks to zero; the second has been enlarged enough to retain a nontrivial probability distribution. The second assertion is convergence in distribution, not a claim that the enlarged error along one sequence approaches a particular normal random variable.

The assumptions make a practical difference. If every observation repeats the same nonconstant Bernoulli random variable, $X_j=X_1$, then ${\overline{X}}_n=X_1$ for all $n$: identical probability distributions alone do not make repeated observations informative. For independent observations with a Standard Cauchy distribution, the Cauchy sample mean has an unchanged distribution, so it does not concentrate around a constant. Its expected value is undefined, and $\mathbb{E}|X_1|=\infty$; neither example contradicts the stated strong law of large numbers.

A brief proof outline in the case of finite variance uses the Kolmogorov maximal inequality for the centered partial sums. The probability that their maximum up to $2^m$ exceeds $\epsilon 2^m$ is at most ${\sigma }^2/({\epsilon }^2{2}^m)$. These bounds are summable, so the Borel-Cantelli lemma controls all sufficiently large such blocks and hence every intermediate sample size. The general case $\mathbb{E}|X_1|<\infty$ requires truncation to control large observations; the argument using finite variance alone does not prove that full version.

Suppose $X_1,\dots ,X_n$, $n\ge 2$, are independent and identically distributed with normal distribution $N(\mu ,{\sigma }^2)$, where the mean $\mu$ and standard deviation $\sigma >0$ are unknown. Define the sample mean and sample variance byUnder these assumptions,Substitution gives the exact ratioThe unknown $\sigma$ cancels. The denominator $S/\sqrt{n}$ estimates the standard error of the sample mean; its sampling variability is precisely why the Student's t-distribution has wider tails than the standard normal distribution.

The crucial independence has a geometric explanation. Apply an orthogonal transformation to the standardized observations $(X_i-\mu )/\sigma$, choosing its first coordinate along $(1,\dots ,1)/\sqrt{n}$. That coordinate is $Z$; the remaining $n-1$ coordinates are independent standard normal random variables whose squared sum is $V$. Their joint probability density factorizes because the transformation preserves the squared length. This also explains the loss of one statistical degree of freedom when estimating the mean. Uncorrelatedness alone would not establish the required independence for arbitrary data.

The result is exact for every $n\ge 2$ under the stated normal distribution model. A small sample size by itself does not justify it: a sample from an arbitrary probability distribution need not have the displayed chi-squared distribution or the necessary independence.

A surrogate split uses another predictor to approximate the left-versus-right assignments made by a tree node's primary split. It can route observations whose primary predictor is missing. Surrogates are ranked by agreement with the primary split on observations where both predictors are known, accounting for trivial majority assignments. This differs from simply filling a missing predictor with its sample mean.

Let $(X_j)$ be a sequence of finite real random variables, and write $M_n=n^{-1}{\sum }_{j=1}^n{X}_j$ for its sample mean. For fixed $m$ and $n>m$, put $M_n^{(m)}=n^{-1}{\sum }_{j=m+1}^n{X}_j$. Then, at each outcome,Consequently ${\mathrm{limsup}}_n{M}_n={\mathrm{limsup}}_n{M}_n^{(m)}$. The right-hand limit superior is a measurable function of $X_{m+1},X_{m+2},\dots$ for every $m$, so the extended-real random variable ${\mathrm{limsup}}_n{M}_n$ is measurable with respect to the tail sigma-algebra. The same holds for the limit inferior. Thus the event of convergence to a finite limit of a sequence, and the event $\{M_n\to a\}$ for any specified real $a$, are tail events.

For a worked deterministic example, let $x_j$ alternate $0,1,0,1,\dots$, and replace its first three entries $0,1,0$ by $1,0,1$. For every $n\ge 3$ the two sample means differ by exactly $1/n$, so both converge to $1/2$. Finite edits can change small-sample answers while preserving the infinite limit of a sequence.

Under independence, Kolmogorov's zero–one law makes each specified convergence event have probability zero or one. It does not select which value occurs. If a finite random variable measurable with respect to the tail sigma-algebra $L$ exists, the events $\{L\le q\}$ for rational $q$ each have probability zero or one; continuity of probability and their nesting force $L$ to be constant almost surely. For fair independent Bernoulli trials, the strong law of large numbers establishes $M_n\to 1/2$ almost surely; the zero–one conclusion alone proves neither convergence nor the value $1/2$.

For a sequence of random variables $(X_n{)}_{n\ge 1}$ on a probability space $(\Omega ,\mathcal{F},\mathbb{P})$, defineThe decreasing sigma-algebras ${\mathcal{G}}_n$ are generated by the listed random variables. Their intersection consists of events expressible after discarding every finite prefix. No independence is required.^[ref]

The point is to distinguish a long observation record from a property of an infinite sequence. The event of seeing infinitely many heads and the event that sample means converge survive any finite change, while an exact first-head time does not. Kolmogorov's zero–one law adds the striking conclusion that under independence each tail event has probability zero or one; the tail sigma-algebra itself can still contain many nonempty sets.

Let $X_1,\dots ,X_n$ be an IID sample of real-valued random variables with finite expected value $\mu$ and finite variance ${\sigma }^2$, where $n\ge 1$. Its sample mean $\overline{X}=n^{-1}{\sum }_i{X}_i$ satisfiesLinearity of expectation gives the first identity. The variance of a sum and vanishing cross covariances give $\mathrm{Var}({\sum }_i{X}_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.^[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 $\epsilon >0$,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.

For $n$ pots per treatment and $m$ leaves per pot, the group sample mean decomposes into two averages:The variance of a sum adds the variances of the independent terms. Every pot random effect has weight $1/n$, whereas each remaining error has weight $1/(nm)$, giving the short proofThis is also the variance of the arithmetic mean of the $n$ pot sample means, each with variance ${\tau }^2+{\sigma }^2/m$. Equal numbers of leaves per pot make the two averaging procedures identical.

If all $nm$ leaf measurements were falsely treated as independent, the predicted variance would instead be $({\tau }^2+{\sigma }^2)/(nm)$. The ratio of correct to false variance isThus pseudoreplication can underestimate a standard error by the square root of this ratio. Equality holds when $m=1$ or ${\tau }^2=0$; sharing a pot creates an error here precisely when the shared influence has positive variance.

Choose ${\tau }^2=4$, ${\sigma }^2=1$, $n=4$ and $m=3$ as constructed model parameters in squared length units. These are assumptions rather than fitted experimental values. For each group,The treatment contrast $\hat{\Delta }={\overline{Y}}_B-{\overline{Y}}_A$ has expected value ${\alpha }_B-{\alpha }_A$. Since the group errors are independent conditional on the allocation, its variance is twice the group variance, namely $13/6$, whereas the false calculation gives $5/6$. Its correct standard error is $\sqrt{13/6}\approx 1.472$ length units; the false value is $\sqrt{5/6}\approx 0.913$. The variance ratio is $13/5=2.6$.

With four pots fixed, increasing $m$ drives the error contribution ${\sigma }^2/(4m)$ towards zero, but the limit of the group variance remains ${\tau }^2/4=1$. Measuring twelve leaves on each of four pots gives $49/48$. Using the same forty-eight measurements on sixteen pots, with three leaves per pot, gives $13/48$. More independent experimental units reduce both contributions. Extra nested measurements are useful for characterizing each experimental unit, but cannot average away its shared random effect. This is why sample collection effort and the number of independent treatment replicates answer different questions.^[ref]

For independent and identically distributed random variables with characteristic function $\varphi$, suppose their sample mean converges in probability to a finite constant $a$. Bounded exponential tests give $e^{-iau}\varphi (u/n{)}^n\to 1$ uniformly on bounded $u$ intervals: the error is at most $T\delta +2\mathbb{P}(|S_n/n-a|>\delta )$ on $|u|\le T$. Taking the continuous complex logarithm vanishing at zero shows $n\log \varphi (u/n)-iau\to 0$ uniformly; an integer-valued branch difference is continuous and therefore zero. For arbitrary $h\to 0$, put $n=\lfloor 1/|h|\rfloor$ and $u=nh$, so $1/2\le |u|\le 1$. Dividing the uniform limit by $u$ proves $\log \varphi (h)/h\to ia$, and thus ${\varphi }^{\prime }(0)=ia$. No absolute first moment is assumed.

If independent and identically distributed random variables have characteristic function $\phi (t)=1+iat+o(|t|)$ at zero, then their sample mean has convergence in distribution to $a$: its characteristic function is $\phi (t/n{)}^n\to e^{iat}$. This is also convergence in probability by convergence in distribution to a constant implies convergence in probability.

Let $X_1,X_2,\dots$ be real independent and identically distributed random variables with $\mathbb{E}|X_1|<\infty$ and expected value $\mu =\mathbb{E}[X_1]$. The weak law of large numbers states that their sample mean has convergence in probability to $\mu$: for every fixed $\epsilon >0$,Thus a large sample is unlikely to give an average with a specified fixed-size error. The strong law of large numbers makes the stronger statement of almost sure convergence along an entire sequence. Under the displayed assumptions both laws apply; their names distinguish the conclusions, not two competing predictions.

When the variance ${\sigma }^2$ is finite, variance additivity for independent random variables gives $\mathrm{Var}({\overline{X}}_n)={\sigma }^2/n$. The Chebyshev inequality immediately supplies a useful quantitative form and a brief proof:For independent trials with a Bernoulli distribution of parameter $p=0.2$, the expected value is $0.2$ and the variance is $0.16$. At $n=1000$, the chance of an error of at least $0.1$ is therefore at most $0.016$. The exact binomial distribution gives a much smaller probability, as the figure under the strong law of large numbers shows. The bound is conservative, but it is valid for every sample size under these assumptions and does not require a normal approximation.

The weak law of large numbers addresses a fixed tolerance $\epsilon$. The central limit theorem instead resolves errors on the shrinking scale $\sigma /\sqrt{n}$ and gives their approximate normal distribution. In particular, the weak law of large numbers alone supplies neither a bell-shaped error law nor a universal rate of approach. For example, a Pareto distribution with minimum one and shape $3/2$ has expected value three but infinite variance: both the weak law of large numbers and strong law of large numbers apply, while the finite-variance statement of the central limit theorem does not.