The recurrence relation at gives . Consequently
By variance additivity for independent random variables, the variance of their sample mean is
Substitute the linear regression model into the estimators and use the centring and orthogonality conditions:
A linear combination of independent normal random variables is normal. Their means are and , while variance additivity for independent random variables gives
Consequently
The centered design gives . By independence of the errors, their off-diagonal covariances vanish. Thus variance additivity for independent random variables gives
A larger spread of predictor values decreases the slope variance for fixed error variance.
Use the deterministic weights . Their squared sum and maximum are
To apply the quadratic expansion of a cumulant-generating function rigorously, write , with . Fix and let
All arguments lie in this shrinking interval. Consequently
Taking logs of the moment-generating function and using independence of random variables now gives
The case is immediate. Since is the moment-generating function of a normal distribution of variance , the convergence theorem for moment-generating functions gives
This is a weighted central limit theorem with negligible maximum weight. Its limit variance also agrees with the exact value from variance additivity for independent random variables.
Let be a centered scalar beam-deviation coordinate in a deliberately controlled toy model. Let the readout be , where the centered measurement noise has variance and is independent of and of earlier noise. Stipulate a correctly timed correction of strength : . This scalar observation is a teaching surrogate, not a claim that real cooling measures each particle. From variance additivity for independent random variables,
For fixed current and , differentiate the next-step variance with respect to feedback gain:
The unique one-step minimizing feedback gain and resulting variance are
The noisier the readout relative to the current spread, the smaller the useful correction. The exact one-step cooling condition follows by subtraction:
Thus excessive positive feedback gain heats this model. The threshold depends on the current variance: a gain that initially cools can later heat if the beam has become narrower or the noise has grown.
For chosen dimensionless and , gives . Taking instead gives , larger than the initial spread. Holding fixed gives
so the variance approaches the nonzero noise floor . More generally, for the fixed-gain limit is . This long-run stability condition differs from the condition for cooling the current beam on the very next step.
If the toy feedback gain is recomputed after every step and , the reciprocal recurrence is even simpler:
With the chosen inputs, . This ideal model has no additional diffusion, finite observation time or lost correlation; its indefinitely falling spread is not a prediction for an operating storage ring.
To expose the missing physics mathematically, replace by an arbitrary centered sample signal . Defining and gives
Unwanted contributions from other particles or electronics can enlarge without increasing useful ; poor timing or lost correlation can reduce or even reverse its sign. This is why real stochastic cooling needs measured beam fluctuations, appropriate beam mixing and correctly phased feedback control, rather than an imagined catalogue of individual particle positions.
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.