Variance of a sample mean Created 2026-09-24 Updated 2026-10-14
Let be an IID sample of real-valued random variables with finite expected value and finite variance , where . Its sample mean satisfies
Linearity of expectation gives the first identity. The variance of a sum and vanishing cross covariances give ; scaling by scales the variance by . 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 . Four times as many observations halve this scale; they do not divide it by four. In the fair Bernoulli distribution example, , so sample sizes and give standard deviations and , 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 ,
This proves convergence in probability of the sample mean to 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.
Variational characterization of trace distance Created 2026-09-28 Updated 2026-10-14
The variational characterization of trace distance turns a matrix distance into the best possible binary experiment. For density operators on the same finite-dimensional vector space,
An operator with is an effect of a POVM: both and are positive operators. The Born rule assigns the first outcome probabilities and . Their signed gap is , where . Since , replacing by reverses this gap, explaining the equality with the absolute-value maximum.
One optimal is the spectral projector onto the positive eigenspaces of . In the spectral decomposition of , this choice includes all positive eigenvalues and excludes all negative eigenvalues. Their positive sum equals the trace distance by the spectral-parts formula for trace distance. Any zero eigenspace can be assigned to either outcome without changing the gap. This is the effect selected by the equal-prior Holevo–Helstrom theorem. [ref]
The same optimum has a classical description. For any finite-outcome POVM , let and . Then
The expression is the total variation distance of the entire outcome probability distributions; the expression for is the gap for one event. Grouping outcomes in gives the single effect . Conversely, an effect gives the binary POVM , whose two probability gaps are opposites, so their total variation distance is . Thus the optimum over all POVMs is already attained by one binary projective measurement. [ref]
For quantum state discrimination with equal prior probabilities, declare on outcome and on outcome . Directly averaging the two conditional success probabilities gives
Optimizing this expression gives . For the diagonal example in trace distance, gives a gap . For zero versus plus, that same effect gives only , while the effect in Helstrom measurement for the zero and plus states gives the larger gap . The trace-distance-preserving binary measurement depends on the pair of preparations; a fixed measurement basis does not generally attain the trace distance for every pair.
Let each drive region have length and the drive-free gap have length , measured edge to edge. A particle of constant speed experiences and . For a normalized detected-beam speed probability density function , sum the transition probabilities, not the probability amplitudes of different particles:
The displayed is an ideal effusion flux distribution, with speed scale , uniform transmission and speed-independent detection efficiency. It is not a claim about any particular clock's selected beam. The substitution gives , proving normalization. Actual apertures, state selection and readout can change the effective weights.
For an original example choose , , and . The reference particle has , and resonant pulses. The instantaneous-pulse width would be . The exact finite-pulse width for that single speed is about ; the chosen distribution also reduces the on-resonance average to approximately because not every particle receives a pulse.
Figure 1.
Finite transit times shape the Ramsey line
. Original calculation of the finite-pulse Ramsey transition probability and velocity-averaged Ramsey line for the chosen parameters above. The central panel also shows the instantaneous-pulse limit at . All curves are model predictions; none reproduce experimental points. Details.
Different velocities smear side fringes because varies across the beam. Nevertheless every term is even in , so this symmetric ideal-model average has no odd line asymmetry that could displace the central lock point. Reduced contrast or altered width alone is not evidence of a shifted line center. A speed-dependent transition shift or unequal drive quantum phases changes that conclusion; atomic clock frequency shifts explains why these distinctions matter experimentally.
A pure strategy is very weakly dominated by another strategy when its payoff is no greater against every opposing pure strategy profile, with no strict advantage required anywhere. The definition permits payoff-equivalent strategies and even domination by the original strategy itself. A weakly dominated strategy instead has a strict inequality for at least one opposing strategy profile.
In a binary game, suppose very weakly dominates and assigns positive probability to a different pure action. At every opposing strategy profile where pays one, all actions in the support of a mixed strategy must also pay one. Where pays zero, their payoffs are automatically no smaller. Therefore every distinct supported action very weakly dominates . If the mixed domination is weak with a strict improvement somewhere, choose a supported action paying one at a profile where pays zero; that action also supplies a strict improvement. The requirement of nontrivial support is indispensable for the very-weak version.
Violation of charge conjugation Created 2026-10-05 Updated 2026-11-05
A theory violates charge conjugation when conjugating particles to antiparticles changes a physical interaction or its transition probabilities. This is different from CP violation: an interaction can violate charge conjugation and parity symmetry in quantum field theory separately while preserving their combination.
Virial pressure from pair correlations Created 2026-10-18 Updated 2026-11-05
For a differentiable central pair potential in a classical homogeneous three-dimensional fluid, the mechanical virial theorem gives the displayed pressure. The radial distribution function accounts for the probability of each pair separation. In the dilute limit, , and integration by parts yields . Thus the second virial coefficient controls . A few virial terms are a low-density approximation, not generally a converged description of a dense liquid. A discontinuous hard core needs its contact form or a limiting argument.
For drops with intensity , impact time and nonnegative volume , let their radius at time be . The dry probability at is
The exponent is the intensity of drops whose patch covers the point by that time. An infinite exponent means zero dry probability. No spatial-homogeneity assumption is needed.
Void probability functional Created 2026-10-14 Updated 2026-11-05
The void probability functional assigns to a measurable set the probability that it contains no atom of a random point measure. For a Poisson random measure of intensity , it is . The exponential void probabilities characterize a Poisson random measure result uses simplicity; doubling every atom of a Poisson measure preserves void probabilities but changes count distributions.
Volume fraction Created 2026-10-14 Updated 2026-11-05
The volume fraction of a constituent is its occupied volume divided by total sample volume. Fractions sum to one for a partition into phases. In a statistically homogeneous medium the phase fraction also equals the probability that a typical point lies in that phase, under the appropriate spatial or ensemble averaging assumptions.
For a finite outcome space, complete lottery preferences, a transitive relation, continuity of lottery preferences and the independence axiom for lottery preferences are equivalent to an expected utility representation of the displayed form. The representing outcome utility function is unique up to a positive affine function. The theorem is associated with John von Neumann and Oskar Morgenstern.
A useful proof construction selects a best outcome and a worst outcome . If all outcomes are indifferent, a constant utility function suffices. Otherwise assign , . Continuity of lottery preferences makes each outcome indifferent to a mixture , and mixture monotonicity makes the coefficient unique. Substitution of indifferent lotteries and reduction of compound lotteries turn any lottery into a best–worst mixture with best-outcome probability . Mixture monotonicity then ranks all such mixtures. The reverse direction follows by taking expected values; positive affine functions preserve every comparison.[ref]
Voter-model duality Created 2026-10-14 Updated 2026-11-05
independent Poisson process copying arrows construct the voter model. A backward ancestral line from a site follows a continuous-time random walk; lines that meet then coincide. Thus a finite collection of Ising spins at time equals initial Ising spins at the positions of coalescing random walks. In particular , and the probability of disagreement at two sites is bounded by the probability their ancestral walks have not yet coalesced.
Waiting time for two consecutive successes Created 2026-10-07 Updated 2026-10-14
For independent trials of success probability , let be the first index completing two consecutive successes. If are the mean remaining times with no trailing success and with one trailing success, conditioning gives and . Solving yields , so fair trials have mean waiting time six. Disjoint pairs give a geometric tail bound and justify finiteness before solving the equations. Overlapping pairs are not independent trials.
Waiting time to observe both Bernoulli outcomes Created 2026-10-14 Updated 2026-11-05
In independent trials with two outcomes of probabilities and , let include the first trial and the trial that first completes the pair. Conditional on the first outcome, has a geometric distribution of parameter or , with mixture weights . The law of total expectation and law of total variance give
The final term in the unsimplified variance is the variance of the two conditional means; omitting it is incorrect unless . Both outcomes must have positive probability for these finite formulas.
Wald and likelihood-ratio asymptotic equivalence Created 2026-09-24 Updated 2026-11-05
In a regular scalar model under the null, Taylor expansion about the MLE gives
A uniform law of large numbers for the observed information makes
and the Fisher information used in the Wald statistic converge to the same positive limit. Their ratio therefore converges in probability to one.
Wassily Hoeffding Created 2026-10-13 Updated 2026-11-05
Author of probability inequalities for sums of bounded independent random variables. The resulting Hoeffding inequality bounds tail probabilities without requiring an exact distribution for the sum, making it useful in concentration of measure.[ref]
Wave-particle duality Created 2026-10-18 Updated 2026-11-05
Wave-particle duality names the coexistence of localized detection events and wave-like interference in quantum mechanics. A photon or electron is detected as an individual event, yet the distribution of many events depends on probability amplitudes from alternative paths. If the alternatives remain coherent, adding the probability amplitudes before applying the Born rule gives an interference term; simply adding the separate path probabilities does not.
In the single-electron experiment of Akira Tonomura and collaborators, an electrostatic biprism divided and overlapped the electron wave, and a position-sensitive detector recorded individual arrivals. Successive accumulated records developed interference fringes. This makes the apparent tension concrete: localization describes the detector events, while matter-wave interference describes their statistical distribution.[ref]
Weak large deviation principle Created 2026-10-14 Updated 2026-11-05
A weak large deviation principle has the usual lower bound on every open set, but requires the upper bound only on compact sets. It does not by itself control probabilities escaping every compact set. Exponential tightness provides that missing control.
Weak law forces a characteristic-function derivative Created 2026-10-14 Updated 2026-11-05
For independent and identically distributed random variables with characteristic function , suppose their sample mean converges in Probability to a finite constant . Bounded exponential tests give uniformly on bounded intervals: the error is at most on . Taking the continuous complex logarithm vanishing at zero shows uniformly; an integer-valued branch difference is continuous and therefore zero. For arbitrary , put and , so . Dividing the uniform limit by proves , and thus . No absolute first moment is assumed.
Weak law of large numbers Created 2026-09-24 Updated 2026-10-14
Let be real independent and identically distributed random variables with and expected value . The weak law of large numbers states that their sample mean has convergence in probability to : for every fixed ,
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 is finite, variance additivity for independent random variables gives . The Chebyshev inequality immediately supplies a useful quantitative form and a brief proof:
For independent trials with a Bernoulli distribution of parameter , the expected value is and the variance is . At , the chance of an error of at least is therefore at most . 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 . The central limit theorem instead resolves errors on the shrinking scale 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 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.
Weak law without an absolute first moment Created 2026-10-14 Updated 2026-11-05
Let have a symmetric probability distribution with for , mass at zero, and no mass with . Then , but independent copies satisfy the weak law of large numbers with limit zero. Indeed . Their symmetric truncations have mean zero and second moment , so Chebyshev's inequality gives in Probability. A union bound shows that the original and truncated sums differ with Probability tending to zero. This also gives a differentiable characteristic function at zero whose derivative cannot be interpreted as an absolutely convergent expectation.