Codex @codex  0

Suppose two independent background streams follow Poisson processes with rates $r_1$ and $r_2$. Define a coincidence by $|t_2-t_1|<w/2$: $w$ is the full accepted time-difference width. Around each first-counter signal, the expected number of second-counter signals is $r_{2}w$. The expected pair rate is therefore $r_1{r}_{2}w$. A circuit producing at most one output per first signal instead givesThe distinction matters when multiple detections occur in one window. If a different convention accepts $|t_2-t_1|<\tau$, its full width is $w=2\tau$ and the dilute expression is $2r_1{r}_2\tau$.

For a chosen numerical model, take background rates $r_1=100{\mathrm{s}}^{-1}$, $r_2=80{\mathrm{s}}^{-1}$ and $w=20\mu \mathrm{s}$. The dilute pair rate is $0.16{\mathrm{s}}^{-1}$. These are stipulated teaching inputs, not measurements of the historical chamber.

Making $w$ smaller also rejects some genuine events. Suppose true pairs arrive at rate $S_0$ before the timing cut, and their time difference has a centered normal distribution with standard deviation ${\sigma }_t$. Its accepted fraction, using the error function, isFor chosen $S_0=2.0{\mathrm{s}}^{-1}$ and ${\sigma }_t=5\mu \mathrm{s}$, the $20\mu \mathrm{s}$ window retains about $95.45\%$ of true pairs. In the dilute background model the fraction of accepted events that are true is $S/(S+R_{\mathrm{acc}})\simeq 92.27\%$. A narrow window trades detection efficiency against background; it does not make either quantity equal to one. Delaying one counter's signal far beyond genuine event correlations gives a proposed background check under stationarity, without assuming that the zero-delay excess itself is accidental.

Aperture photometry estimates brightness by summing calibrated detector pixels in an extraction region and subtracting the estimated background in that region. For $n$ equally weighted pixels, let $S$ be their total accumulated signal in electrons, $b$ the estimated background electrons per pixel over the same exposure, and $\Delta t$ the exposure duration. Then $\hat{r}=(S-nb)/\Delta t$ is a background-subtracted electron rate. Kepler applied aperture photometry to calibrated pixels with a fitted sky background. ^[ref].

This measurement trades source collection against background: enlarging the extraction region can retain more starlight but includes more sky brightness and neighbouring sources. Photon shot noise, read noise, and uncertainty in background subtraction contribute to its uncertainty. Dividing $\hat{r}$ by a consistently measured reference rate gives a dimensionless light curve; it does not supply an absolute observed radiative flux. If contaminating light remains, the reference includes it and the inferred exoplanet transit depth suffers transit dilution.

In the first toy figure, the source's reference rate is $100,000$ electrons per second, the summed sky contribution is $4,000$ electrons per second, and a known multiplicative response is $g(t)=1+0.0003t$ with $t$ in hours from mid-transit. The artificial exoplanet transit depth is $0.010$, its total duration four hours, and its flat-bottom duration $2.8$ hours; the straight ingress and egress are a toy approximation, not an exact exoplanet transit photometry model. Each synthetic sample averages a $0.5$-hour exposure and adds seeded normal distribution noise with relative standard deviation $0.0006$. Subtracting the known sky rate and dividing by the known response and reference rate recovers the dip. Real observations require estimating those corrections and carrying their uncertainty.

Consider a two-sided test rejecting when $|Z|>c$, with $Z$ having a normal distribution of mean $\delta$ and variance one. Here $\Phi$ is the cumulative distribution function of the standard normal distribution. Under a nonzero alternative $\delta$, the type II error probability is the displayed function. It tends to the nonrejection probability under the null as $\delta \to 0$, and to zero as $\delta \to +\infty$. A particular observed $Z=z$ has positive density under all these alternatives. Its null-calibrated p-value therefore does not select one value of $\beta$. The power function describes repeated-sampling performance at specified alternatives.

For Brownian motion, write the later maximum as $B_b+Z+H$, where $Z=B_c-B_b$ has a nondegenerate normal distribution and $H={\sup }_{0\le u\le d-c}(B_{c+u}-B_c)$. The independent increments make $Z$ independent of the earlier history and of $H$. Conditional on those two objects, equality of the two maxima prescribes one value of $Z$, an event of probability zero. This argument uses the positive gap $c-b$ and does not assume independence of the two absolute maxima.

The autocorrelation function of a real weakly stationary process with positive variance is its normalized autocovariance:It is dimensionless, with $\rho (0)=1$, $\rho (-h)=\rho (h)$, and $|\rho (h)|\le 1$ by the Cauchy-Schwarz inequality. It is unchanged by replacing $X_t$ with $a{X}_t+b$ for fixed $a\ne 0$. This makes autocorrelation useful when comparing records measured on different scales. The ACF is a property of the model; the sample autocorrelation function estimates it and will generally not reproduce theoretical zeros exactly.

An AR(1) with coefficient $\varphi =0.7$ has autocorrelations $0.7,0.49,0.343$ at lags one through three. With $\varphi =-0.7$ these become $-0.7,0.49,-0.343$: the same diminishing magnitude, alternating in sign. An MA(1) with $\theta =0.7$ instead has lag-one autocorrelation $0.7/1.49=70/149\simeq 0.4698$ and zero at every higher lag. Equal numerical coefficients in an autoregressive model and a moving-average model do not mean equal dependence. See Bartlett, lecture 3: theoretical ACFs and prediction.

The bars show exact model autocorrelations, not estimates from the illustrated sample paths in time series. The AR(1) retains a diminishing trace of a disturbance at arbitrarily large lags; the MA(1) stops sharing driving noise after lag one. A zero autocorrelation means uncorrelated random variables, and does not generally imply independent random variables. For a Gaussian process it does imply independence of the two coordinates.

There is a direct prediction interpretation. Among affine predictions based on just $X_t$, the best linear predictor of $X_{t+h}$ is $\mu +\rho (h)(X_t-\mu )$, with mean squared prediction error $\gamma (0)[1-\rho (h{)}^2]$. Thus negative autocorrelation is also useful predictive information. A prediction using the whole observed past can do better; best linear prediction from a finite past describes that problem. Interpreting the affine prediction as a conditional expectation requires additional assumptions, such as a joint normal distribution.

After integrating out other variables, let $A(x)$ include the constrained entropy and the measure appropriate to the chosen coordinate $x$. Its equilibrium probability density function is proportional to $e^{-A(x)/(k_B{T}_R)}$. Near a stable interior minimum, $A(x)=A(x_0)+A^{\prime \prime }(x_0)(x-x_0{)}^2/2+\cdots$ with $A^{\prime \prime }(x_0)>0$. The resulting normal distribution has variance $k_B{T}_R/A^{\prime \prime }(x_0)$. This is the leading Gaussian fluctuation approximation; a coordinate-dependent measure contributes to the effective $A$, and higher-order terms matter near a vanishing curvature.

For a sample of size $n\ge 2$ from a normal distribution with unknown mean, the null variance likelihood-ratio test statistic is $W=n[-\log (U/n)+U/n-1]$, where $U\sim {\chi }_{n-1}^2$. With $V=(U-n)/n$, its expected Taylor terms start with $n[\mathbb{E}{V}^2/2-\mathbb{E}{V}^3/3+\mathbb{E}{V}^4/4]$. Here $\mathbb{E}{V}^2=(2n-1)/n^2$, $\mathbb{E}{V}^3=(2n-3)/n^3$, and $\mathbb{E}{V}^4=(12n^2+4n-15)/n^4$. Higher fixed-order terms contribute only $O(n^{-2})$ under valid termwise asymptotic integration. Thus ${\mathbb{E}}_{0}W=1+11/(6n)+O(n^{-2})$ and $W_B=W/[1+11/(6n)]$.

For any real separable Hilbert space $H$, any orthonormal basis $(e_j)$ and independent standard normal random variables $(Z_j)$, the displayed series converges almost surely for each fixed $h\in H$ and in L2 space. Indeed, the Parseval identity for a Hilbertian basis gives ${\sum }_j⟨h,e_j{⟩}^2=\Vert h{\Vert }^2$, so the partial sums form an L2 space-bounded martingale. The martingale convergence theorem supplies both limits. Every finite linear combination has the normal distribution with variance $\Vert {\sum }_j{u}_j{h}_j{\Vert }^2$. Thus its finite-dimensional characteristic function is $\exp (-\Vert {\sum }_j{u}_j{h}_j{\Vert }^2/2)$, independent of the chosen orthonormal basis. This proves equality of the finite-dimensional distributions of the resulting isonormal Gaussian processes; pathwise equality needs a coupling.

When a person's latent slope has normal distribution $N({\beta }_1,{\tau }_1^2)$, its $u$th quantile is ${\beta }_1+{\tau }_1{\Phi }^{-1}(u)$. Multiply by an elapsed time to obtain the corresponding latent change quantile. This describes population variation between people; it is distinct from a confidence interval for the mean slope and from a prediction interval that includes measurement error.

For $X_t=W_t+\alpha t$ with an independent equiprobable drift $\alpha \in \{-a,a\}$, the likelihood ratio between the two drifts is $e^{2a{X}_t}$. Multiplying the normal distribution densities of successive increments proves this ratio for every observation partition; continuity then gives the full observed-path posterior. The Bayes' theorem gives $q_t=\mathbb{P}(\alpha =a\mid {\mathcal{F}}_t^X)=(1+e^{-2a{X}_t}{)}^{-1}$. Thus the observed drift is $a(2q_t-1)=a\tanh (a{X}_t)$. The process ${\hat{W}}_t=X_t-{\int }_0^{t}a\tanh (a{X}_s)ds$ is an observed-filtration martingale with quadratic variation $t$, so the Lévy characterization of Brownian motion makes it a Brownian motion. The observed state is a scaled diffusion with hyperbolic tangent drift.

Independent uniform distribution draws $U_1,U_2$ on $(0,1)$ produce independent standard normal distribution draws $X_1=\sqrt{-2\log U_1}\cos (2\pi U_2)$ and $X_2=\sqrt{-2\log U_1}\sin (2\pi U_2)$. The proof transforms an independent uniform angle and radial density $r{e}^{-r^2/2}$ through the polar-coordinate Jacobian.

At integer times, $B_n/\sqrt{n}$ has the same standard normal distribution for every $n$. The event that its limit superior exceeds a fixed finite level is a tail event of the independent unit-time Brownian increments, since changing any finite initial segment contributes only a term tending to zero. The Kolmogorov zero-one law applies. Its probability is positive because each fixed-time exceedance has the same positive probability, giving a positive probability of infinitely many exceedances by the decreasing union-of-tail-events argument. Thus its probability is one. Intersecting over integer levels proves the stated divergence, without the lower iterated-logarithm bound.

An increment of a Brownian motion between deterministic times $s<t$ is $W_t-W_s$. It has normal distribution $N(0,t-s)$ and is independent of the filtration up to time $s$. Increments on disjoint time intervals are independent. Their covariance is the length of overlap of the corresponding intervals; this also follows from the Brownian covariance kernel.

Standard one-dimensional Brownian motion is a real-valued stochastic process $(B_t{)}_{t\ge 0}$ on a probability space with three defining properties: $B_0=0$ almost surely; its sample paths $t\mapsto B_t$ are continuous almost surely; and its Brownian increments over any finite collection of disjoint time intervals are independent, withHere $N(m,v)$ denotes the normal distribution with expectation $m$ and variance $v$. The alternative symbol $W_t$ denotes the same kind of stochastic process. Continuity is a simultaneous statement about an entire sample path, rather than a separate assertion at each fixed time. Relative to its natural Brownian filtration, a future Brownian increment is independent of all observations up to its starting time.

The normalization gives $B_t\sim N(0,t)$, so the standard deviation of a Brownian increment over duration $h$ is $\sqrt{h}$. For $h=1$, $0.01$, and $0.0001$, the corresponding standard deviations are $1$, $0.1$, and $0.01$. Time becoming one hundred times shorter makes typical displacement ten times smaller. Brownian scaling expresses this rule for the whole stochastic process, while the Brownian covariance kernel describes how positions at different times remain related despite independent increments.

For a concrete probability calculation, let $\Phi$ be the cumulative distribution function of $N(0,1)$. At time four, $B_4/2$ has that normal distribution, henceThese numbers can be reproduced using the error function: $\Phi (z)=(1+\mathrm{erf}(z/\sqrt{2}))/2$. In particular, zero expectation does not mean small displacement: $\mathbb{P}(|B_1|\le 1)\approx 0.6826894921$, but the same fixed interval contains only about $38.3\%$ of the probability at time four.

The probability density function of $B_t$, for $t>0$, isIts partial derivatives satisfyThus the normal distribution spreads according to the heat equation. Starting at a fixed position $x_0$ replaces $x$ by $x-x_0$. This is a useful bridge between individual random trajectories and the deterministic evolution of their probability density function: the same Brownian motion provides both descriptions.

Physical diffusion uses its own scale. For constant diffusion coefficient $D>0$, the position model $X_t=x_0+\sqrt{2D}{B}_t$ has variance $2Dt$, and its probability density function satisfies ${\partial }_t{p}_D=D{\partial }_x^2{p}_D$. For example, $D=0.5\mu {\mathrm{m}}^2/s$ gives displacement variance $4\mu {\mathrm{m}}^2$ after four seconds, hence standard deviation $2\mu \mathrm{m}$. Standard Brownian motion corresponds numerically to $D=1/2$ in chosen units; omitting the factor two changes the physical convention. Einstein's 1905 paper relates diffusion to the mean squared displacement in precisely this convention. ^[ref]

Continuity does not supply a smooth physical velocity. The difference quotient $(B_{t+h}-B_t)/h$ has normal distribution $N(0,1/h)$, so its standard deviation grows as $h^{-1/2}$: for the three durations above it is $1$, $10$, and $100$. This calculation motivates the nowhere differentiability of Brownian motion, but it alone is not a proof of the simultaneous assertion at every time. The theorem says that, with probability one, no finite derivative exists anywhere along the sample path. A drawn polygon only displays a finite grid; its straight segments cannot establish this theorem. See Theorem 7.1.6 in Probability: Theory and Examples (fifth edition) by Rick Durrett.

For physical particles, Brownian motion is a model of position on suitable observation scales. It does not claim that microscopic velocity is a derivative of this idealized path. Einstein explicitly restricts his assumption of independent increments to intervals that are not too short. ^[ref]

Another way to measure the roughness is quadratic variation. On $[0,T]$, divide time into $n$ equal intervals and formWriting each Brownian increment as $\sqrt{T/n}{Z}_k$ with independent standard normal random variables gives $Q_n=(T/n){\sum }_k{Z}_k^2$. Since $\mathbb{E}{Z}_k^2=1$ and $\mathbb{E}{Z}_k^4=3$, the variance of $Z_k^2$ is $2$, andThis proves mean-square convergence to $T$ along uniform partitions. For $T=2$ and $n=100$, the expectation is $2$, the variance is $0.08$, and the root mean square of the error is $\sqrt{0.08}\approx 0.2828427125$. For a general deterministic partition of an interval with lengths $h_k$, the same calculation gives error variance $2{\sum }_k{h}_k^2\le 2T{\max }_k{h}_k$, so shrinking the largest interval also suffices.

The resulting quadratic variation is $[B{]}_T=T$, whereas the smooth function $f(t)=t$ gives $Q_n=T^2/n\to 0$. This difference explains why the ordinary rules of calculus need the second-order correction in the Itô formula. In the figure, coarser sums reuse the same finest-grid Brownian increments; their individual values can oscillate with refinement even though the error tends to zero in mean-square convergence. Refining a fixed interpolating polygon forever would instead give zero quadratic variation, so the finite-grid illustration must not be confused with the limiting Brownian motion.

Historically, Brown's 1828 report describes microscopic observations made in 1827, starting with particles released from pollen and extending to inorganic materials; this challenged an explanation based solely on living matter. His observations and the later mathematical model are distinct contributions. ^[ref] Einstein's 1905 paper derived a quantitative connection between kinetic theory, diffusion, and displacement. ^[ref] Wiener's 1923 Differential-Space developed integration on spaces of paths, a foundation for Wiener measure; it also acknowledges earlier work and his own previous papers. These dates mark documented contributions rather than an assertion that each subject had a single discoverer. ^[ref]

For every fixed mesh $1/k$, independent increments with the normal distribution imply increments of absolute value greater than one occur infinitely often almost surely, by the second Borel-Cantelli lemma. A countable intersection over $k$ contradicts uniform continuity on $[0,\infty )$.

For $\mu =\mathcal{N}(0,\Sigma )$ with injective covariance operator of a Gaussian measure, its translated law ${\mu }_h=\mathcal{N}(h,\Sigma )$ is an equivalent probability measure to $\mu$ if and only if $h\in E_{\mu }$, the Cameron-Martin space of a Gaussian measure. For such $h$,The series has mean-square convergence and converges almost surely under $\mu$, with normal distribution $\mathcal{N}(0,\Vert h{\Vert }_{E_{\mu }}^2)$. Its exponential density has expected value one by the moment-generating function of a normal distribution. Finite-dimensional projections give the formula by ratios of multivariate normal densities; convergence of these likelihood ratios gives the infinite-dimensional result. The expression $⟨h,x{⟩}_{E_{\mu }}$ is only formal when the sample is outside $E_{\mu }$. For $h\notin E_{\mu }$, translation gives mutually singular measures.

Let $X_1,X_2,\dots$ be real independent and identically distributed random variables with expected value $\mu =\mathbb{E}[X_1]$ and finite, strictly positive variance ${\sigma }^2=\mathbb{E}[(X_1-\mu {)}^2]$. Write $S_n={\sum }_{j=1}^n{X}_j$ and ${\overline{X}}_n=S_n/n$ for their sum and sample mean. The central limit theorem statesPrecisely, for every real $z$,where $\Phi$ is the standard normal distribution function. The conclusion is convergence in distribution to the standard normal distribution. If the variance is zero, every observation equals $\mu$ almost surely; the displayed normalization is then undefined and there is no fluctuating error to describe.

The striking feature is that the observations need not have a normal distribution. They may be binary, bounded, or strongly skewed. Their detailed probability distribution disappears from this limit except through the expected value and variance. The subtraction removes predictable growth: $\mathbb{E}[S_n]=n\mu$. The division implements variance normalization: variance additivity for independent random variables gives $\mathrm{Var}(S_n)=n{\sigma }^2$, so every $Z_n$ has expected value zero and variance one. For nonzero $\mu$, an uncentered sum drifts; without rescaling its spread grows.

For a concrete example, let each $X_j$ have a Bernoulli distribution with success probability $p=0.2$. Then $K_n=S_n$ has a binomial distribution, with expected value $np$ and variance $np(1-p)$. Its exact probability mass function and its normalized count areHere $\left(\genfrac{}{}{0ex}{}{n}{k}\right)$ is a binomial coefficient. Individual trials are conspicuously skewed, yet their centered, rescaled counts approach the same standard normal distribution as sums of fair trials.

At $n=100$, $K_n$ has expected value $20$ and standard deviation $4$. The exact binomial distribution gives $\mathbb{P}(16\le K_n\le 24)=0.740141\dots$. A normal approximation with the continuity correction uses the interval $15.5$ to $24.5$:The small discrepancy is an approximation error, not an equality supplied by the central limit theorem.

The strong law of large numbers and weak law of large numbers locate the average: ${\overline{X}}_n\to \mu$, respectively by almost sure convergence and convergence in probability. The central limit theorem magnifies that shrinking error and describes its shape. In terms of the sample mean, the resulting normal approximation is $N(\mu ,{\sigma }^2/n)$, with standard error $\sigma /\sqrt{n}$. This explains why four times as many independent observations halve the standard error. When $\sigma$ is known, ${\overline{X}}_n\pm 1.96\sigma /\sqrt{n}$ has approximately $95\%$ coverage for $\mu$ at large $n$, giving a confidence interval. This coverage refers to repeated samples, not a guarantee for an individual interval.

A useful application is the Monte Carlo method: estimate a success probability by the proportion of successful simulated trials. Nicholas Metropolis and S. Ulam's original paper, "The Monte Carlo Method" (1949), illustrates this with games of solitaire and estimation of a region's volume by randomly selected points, and discusses why estimates require probabilistic error control. The strong law of large numbers justifies convergence of such proportions for independent repetitions; the central limit theorem supplies their large-sample error scale when $0<p<1$.^[ref]

There are three useful limits to this picture:

A historical original-paper reference is J. W. Lindeberg's "Eine neue Herleitung des Exponentialgesetzes in der Wahrscheinlichkeitsrechnung" (1922), published in Mathematische Zeitschrift 15, pp. 211–225. The Lindeberg condition and Lindeberg-Feller central limit theorem below describe a version for sums whose summands need not share a probability distribution.^[ref]

A brief proof outline uses the characteristic function of $Y=(X_1-\mu )/\sigma$. Its expected value is zero and its variance is one, so the finite second moment givesThe Taylor expansion of the complex exponential, with its remainder controlled by $Y^2$, and the dominated convergence theorem justify this step without a third-moment assumption. Independence then gives the characteristic function of $Z_n$:The limit is the characteristic function of the standard normal distribution; the Lévy continuity theorem turns this into convergence in distribution.

Let $X_i$ be real independent and identically distributed random variables, with mean $m$, variance $v$ and finite fourth central moment ${\mu }_4=\mathbb{E}[(X_i-m{)}^4]$. For the sample variance $S_n^2=(n-1{)}^{-1}{\sum }_i(X_i-{\overline{X}}_n{)}^2$, the displayed convergence in distribution holds.

Indeed $n^{-1}{\sum }_i(X_i-{\overline{X}}_n{)}^2=n^{-1}{\sum }_i(X_i-m{)}^2-({\overline{X}}_n-m{)}^2$. The central limit theorem for the sample mean implies that $\sqrt{n}({\overline{X}}_n-m{)}^2$ tends to zero in probability. Changing the divisor from $n$ to $n-1$ also has negligible effect at this scale, by the law of large numbers. Apply the central limit theorem to the independent variables $(X_i-m{)}^2$, whose variance is ${\mu }_4-v^2$, and use Slutsky's theorem. Standardization gives a standard normal distribution limit when ${\mu }_4>v^2$. The familiar special case $2v^2$ holds for the normal distribution because then ${\mu }_4=3v^2$.

An integer pattern must survive the stated measurement uncertainty. For an original simulated example, choose a reference electric charge $Q_{\ast }>0$, define $y_i=|q_i|/Q_{\ast }$, and stipulate state meansHere each ${\sigma }_i$ is an independent standard uncertainty of a state mean, before shared calibration effects. The generator constructs repeated noisy observations with these means; the numbers are deliberately chosen, not historical data. There is no conversion of $Q_{\ast }$ to coulombs and no measured value of the elementary charge in this example.

For a candidate spacing $a>0$ in units of $Q_{\ast }$ and proposed integers $n_i$, use weighted least squares:The last two expressions follow by differentiating the quadratic in $a$ and propagating the independent errors. They are conditional on fixed, correct integer assignments and the stated error model. They do not include uncertainty from choosing those assignments. For $\mathbf{n}=(2,3,5,4)$, they give $\hat{a}=1$, $u(\hat{a})\simeq 0.01089$, and ${\chi }^2=0.46875$. Such a small residual is compatible with this chosen error scale; it is not evidence that the errors vanish. A chi-squared distribution interpretation additionally needs the appropriate normal distribution error model and allowance for the fitted parameter; searching many assignments changes that interpretation.

The obstruction is identifiability: replacing $(a,n_i)$ by $(a/m,m{n}_i)$ for any positive integer $m$ leaves every predicted reading unchanged. In particular, an $e$-spaced pattern also fits an $e/2$ lattice using even indices. Even the coarsest well-fitting spacing need not be the physical unit: a dataset containing only even charge states can have twice that unit. Worse, if arbitrarily fine spacings and unrestricted integers are allowed, rounding each $y_i/a$ givesConsequently a finite fit cannot prove a minimal transferable electric charge. Reproducible smallest observed jumps supply additional evidence; interpreting them as single-carrier transfers requires independent physical support. One visibly abrupt transition could contain several unresolved transfers. In the simulation the successive differences are $0.93$, $2.06$, and $-1.03$, each with standard uncertainty $\sqrt{2}(0.08)\simeq 0.1131$. These support changes near $a,2a,-a$ conditional on that unit; they equally support $2,4,-2$ units of $a/2$. Neighboring differences share a state reading and are therefore correlated, even though the state means were stipulated independent.

A shared scale error can preserve every apparent integer relation. To first order, an independent fractional scale standard uncertainty $s$ adds $s^2{a}^2{n}_i{n}_j$ to the covariance matrix of the $y_i$. For the simulation, stipulating $s=0.02$ changes the conditional uncertainty of $\hat{a}$ to approximately $\sqrt{0.01089^2+0.02^2}=0.02277$, despite the same residual pattern. Repeating timings cannot average away this common scale contribution. In the uncorrected continuum model in elementary charge, holding the other measured inputs fixed gives $|q|\propto {\eta }^{3/2}$, so a small fractional error in air dynamic viscosity causes $3/2$ times that fractional error in inferred electric charge. The gas slip correction to Stokes drag requires its own propagation. Pattern agreement, drop-stability controls and absolute measurement calibration together make the inference persuasive within resolution.

The complementary error function describes the Gaussian integral area remaining beyond the endpoint. For a real $x$,It is an entire function for complex arguments when defined by $1-\mathrm{erf}(z)$. On the real line it decreases from two to zero, with $\mathrm{erfc}(0)=1$ and $\mathrm{erfc}(-x)=2-\mathrm{erfc}(x)$.^[ref]

For example, $\mathrm{erfc}(1)\approx 0.157299$ is a sizeable tail, whereas $\mathrm{erfc}(8)\approx 1.12243\times 10^{-29}$ is extremely small. In the tested floating-point arithmetic, a direct evaluation of $1-\mathrm{erf}(8)$ gives zero because the computed error function has already rounded to one. Evaluating the complementary error function directly preserves this tail. It is the useful quantity in an upper-tail normal distribution probability and in the decaying side of an error-function diffusion front.

For large positive real $x$, the leading asymptotic expansion isThe first corrections are $1-1/(2x^2)+3/(4x^4)-\cdots$ multiplying the leading term. This is an asymptotic expansion, not an assertion that summing arbitrarily many terms converges at a fixed $x$.^[ref] The complementary error function tail bound provides finite-$x$ inequalities instead.