Anderson–Darling test Created 2026-10-14 Updated 2026-10-18
The test rejects for large values of this tail-weighted empirical discrepancy. For a specified continuous null, its standard limiting statistic is , using a Brownian bridge. The reciprocal variance weight gives tail deviations more influence than the Cramér–von Mises criterion. If null parameters are estimated, fitting must be included when computing or simulating its reference law.
The covariance kernel of a standard Brownian bridge on is . Its integral operator has eigenfunctions and eigenvalues for .
Brownian bridge independence from its endpoint Created 2026-10-05 Updated 2026-10-14
For standard Brownian motion, the Brownian bridge , , is independent of . Every finite vector of bridge coordinates is jointly multivariate normal with , and its cross-covariances with vanish. The independence of uncorrelated jointly normal variables and independence extended from generating pi-systems prove independence of the whole stochastic process.
For and fixed , subtracting leaves the Brownian bridge . It is independent of , since it is independent of and has zero covariance with in their jointly Gaussian law. The observed path is determined by this bridge and its endpoint, so the bridge gives no further information about . Hence conditioning on the full observation filtration at gives the same posterior as conditioning on alone.
Confidence band 2026-10-14
A confidence band provides simultaneous bounds on an unknown function over its entire index set. Its coverage event is the intersection over all indices, unlike separate pointwise confidence intervals. For a continuous cumulative distribution function, the Kolmogorov-Smirnov theorem gives an asymptotic band , clipped to , where is a -quantile of the absolute Brownian bridge maximum. The simultaneous event equals , so convergence in distribution at this continuity point proves coverage tending to .
This goodness-of-fit criterion integrates the squared difference between the empirical distribution function and a specified continuous null distribution. Under a fully specified null, the probability integral transform makes its law distribution-free; its limiting law is for a Brownian bridge. Parameter fitting changes that calibration.
F-Brownian bridge 2026-10-14
For a cumulative distribution function and a standard Brownian bridge , the F-Brownian bridge is the centred Gaussian process . Its covariance is , by substituting into the bridge covariance. It can jump when jumps. Its law is tight in the supremum norm, since composition with is a continuous map from the separable space of continuous bridge paths.
For fixed , the vector converges in distribution to , where is a standard Brownian bridge. To prove it, write the vector as times the sum of independent centred bounded indicator vectors. Their covariance matrix is . The multivariate central limit theorem gives a centred multivariate normal distribution with this covariance, exactly the bridge vector. Singular covariance matrices, including endpoint times or repeated values of , cause no problem. This is a finite-dimensional assertion; a full function-space limit additionally requires tightness.
Kolmogorov-Smirnov theorem Created 2026-09-24 Updated 2026-10-18
For an empirical distribution function based on an independent sample from a continuous distribution ,
where is a Brownian bridge.
This limit calibrates the Kolmogorov-Smirnov test; the test compares an empirical distribution with its null distribution using the supremum discrepancy.
The Lévy construction builds Brownian motion on by successive independent midpoint displacements on dyadic intervals. Start with and , where has the standard normal distribution. On each dyadic interval , choose a fresh independent standard normal random variable and use the displayed midpoint rule. Conditional on the endpoints, this is the correct Brownian bridge midpoint law.
To verify the increment law, if with , the new increments are . They are Jointly Gaussian, each has variance , and their covariance is zero, hence they are independent. Induction gives all dyadic Brownian increments. The change between consecutive linear interpolants has uniform norm . The Gaussian tail bound and union bound bound the chance that this maximum exceeds by . The First Borel-Cantelli lemma and prove uniform convergence almost surely. The continuous limit has the required Brownian increments at arbitrary times by dyadic approximation.
The Brownian motion displacement has a normal distribution with variance . Its transition probability density function is therefore
Comparison with the free particle heat kernel obtained in part (c) gives the required matching:
This matches whole path distributions after a linear reparametrization, not merely endpoint variances. To see this, divide the Brownian duration into slices of size . The independent increments have normal distributions with variance , so their joint density contributes
For the Euclidean path integral, the corresponding expression is
The matching condition makes , so both the exponents and all normalization factors coincide. In particular, identifying Brownian time with imaginary time, , requires , or diffusion coefficient .
With both endpoints fixed, the normalized path law is a Brownian bridge. The Euclidean path integral itself is the endpoint density times that conditional path law. In the normalized time coordinate , its expected value and covariance are
The classical path is therefore the bridge's expected value, while individual Brownian bridge paths fluctuate about it. Typical Brownian motion paths are continuous but nowhere differentiable: the kinetic Euclidean action is interpreted through the time-sliced diffusion path integral, rather than by assuming that a typical path has an ordinary velocity.
For times and real coefficients , the linear combination of coordinates is
The Gaussianity of deterministic Brownian stochastic integrals makes this a centered normal random variable. Indeed step-function approximations give linear combinations of independent normal increments, and the Itô isometry gives convergence in ; their characteristic functions converge to that of a normal variable with the limiting variance. Since every linear combination is normal, the coordinate vector is a Gaussian random vector. Appending the deterministic coordinate preserves that property, so is a centered Gaussian process on .
For , the covariance version of the Itô isometry gives
At the covariance is zero because , agreeing with the formula. Thus the Brownian bridge covariance kernel is
Its finite-dimensional distributions identify it as a Brownian bridge; continuity at the terminal endpoint is established next.
For a fully specified continuous null distribution , compare the empirical distribution function with . The probability integral transform makes iid uniform under the null, giving distribution-free calibration. Three common discrepancies are
These define the Kolmogorov-Smirnov test, Cramér–von Mises criterion and Anderson–Darling test, respectively. Reject for large values. The supremum detects the largest discrepancy, the unweighted integral combines discrepancies throughout the distribution, and the reciprocal weight emphasizes the tails.
The Donsker theorem for empirical distribution functions gives for a Brownian bridge , with covariance . Consequently the standard continuous-null limits are , , and for , respectively; the weighted last limit also requires control near the endpoints. Exact finite-sample or asymptotic null quantiles provide critical values.
If parameters in are estimated from the same observations, these fully specified-null critical values generally fail. A first-order expansion is
so the estimated parameter changes the limiting process. One must use the fitted-model null law, adjusted asymptotic theory, or a parametric bootstrap that re-estimates the parameters in each replicate.
In statistical decision theory, the statistical invariance principle says that a procedure should respect transformations that leave the inferential problem unchanged. If a group action preserves the model and carries each of the null and alternative parameter sets into itself, an invariant test has rejection probability function . A maximal invariant identifies its orbits, so every invariant test factors through that statistic: define its value at an orbit using any representative; invariance makes the definition independent of the representative. If the group is transitive on the null parameter set, the null law of any invariant statistic is free of that nuisance parameter.
For example, testing a normal mean with unknown scale, positive transformations preserve a one-sided mean alternative. The statistic , with the usual unbiased sample-variance scale , is invariant and has the Student t-distribution with degrees of freedom under the null. For estimation the corresponding requirement is an equivariant estimator, together with a loss function invariant under simultaneous transformation of decision and parameter. Invariance alone does not prove unrestricted optimality or supply a unique best procedure.
There is a distinct probabilistic use of the term: the Donsker invariance principle states that centred iid partial sums, normalized by , converge as processes on to Brownian motion. Its empirical-process version gives a Brownian bridge, used by goodness-of-fit tests in the next note. These functional limit theorems should be distinguished from the group-based inferential principle.
Assume, as in the Bayesian model, that the unknown drift is independent of the driving Brownian motion, with known positive prior precision . Recover the observed signal from the positive stock price:
For a fixed time , the centered observed path is a Brownian bridge independent of : it is independent of the prior and has zero covariance with in their joint Gaussian law. Thus the whole observed history has the same posterior information about as its endpoint. This proves Brownian endpoint sufficiency for a constant drift rather than assuming it.
The likelihood of that endpoint, as a function of , is proportional to . Multiplying by the normal distribution prior and completing the square gives the Gaussian Brownian drift filter
Define the observed innovation process . It is a continuous observed-filtration martingale: for , independence of future noise and the tower property of conditional expectation give , so the conditional mean of its increment vanishes. Its quadratic variation is , since subtracting the finite-variation drift from does not change quadratic variation. The Lévy characterization of Brownian motion makes an observed-filtration Brownian motion. Differentiating the posterior mean gives
Conversely, the last equation determines from with deterministic coefficients and known initial value, and . Thus the observed and innovation filtrations coincide, supplying the natural Brownian information needed for replication. Consequently the observed stock dynamics are . Its observed market price of risk is , and its normalized state-price density solves
The posterior mean is unbounded, so bounded-coefficient Novikov condition reasoning from Question 2 is not available automatically. A direct finite-horizon argument supplies true pricing. Relative to driftless Wiener measure for , the Bayesian mixture has observation density
A law with observation drift instead has density . Therefore
This is the finite-horizon pricing density for Gaussian drift learning. The ratio changes the physical observed law into a genuine probability law, hence has mean one. Indeed, differentiation of the explicit likelihood, using , gives
The Itô formula therefore gives , agreeing with the stochastic exponential above. Under this pricing law the stock drift is .
For logarithmic utility, terminal marginal utility is . The state-price budget constraint and the marginal condition imply and . Since is constant, its conditional-expectation pricing process is constant as well. Thus the entire optimal wealth process is
Indeed, for any other nonnegative admissible terminal wealth , the elementary inequality gives
This directly verifies optimality. Expected candidate log wealth is finite because and its time integral is finite on every fixed horizon. Applying the Itô formula to gives
The observed self-financing portfolio with risky dollar fraction has diffusion coefficient . Matching the coefficients proves the log-optimal investment with Gaussian drift learning rule
The remaining dollars are held in the bank account; the fraction may be negative or exceed one because the question imposes neither short-sale nor borrowing restrictions.
Fix and a standard -dimensional Brownian motion starting at zero. Let be deterministic nested finite partitions of with mesh tending to zero; dyadic partitions are the basic example. Let be the polygonal interpolation through the partition values and put . The limit is enhanced Brownian motion, with increments
Here the integral is a Stratonovich integral. In terms of Itô integrals,
Its symmetric part is , while its antisymmetric part is Lévy area,
These identities and splitting the integral at an intermediate time give the Chen identity, so has values in .
A precise nested polygonal approximation of Brownian rough paths statement is: for every ,
where the rough path metric used here is
In particular, for each , choosing gives convergence in the inhomogeneous -variation rough path metric. The limiting signed area is the Lévy area, and the limiting full second level is Stratonovich, not Itô. This distinction is necessary: a polygonal lift has the prescribed symmetric second level, whereas an Itô lift would lack half the quadratic-variation correction.
Here is a proof sketch emphasizing the nested martingale structure. Set
A Brownian bridge between two prescribed endpoints has the affine interpolation as conditional mean. Consequently
For the coordinate processes remain independent when their respective partition values are conditioned on. Approximating the Itô integral by its left sums, conditioning each product, and then taking its limit gives
Indeed each conditioned factor is its polygonal interpolation, and their sums converge to the ordinary integral of those piecewise linear functions. For a fixed pair , the right side is therefore a martingale in the refinement index . It is not being asserted to be a martingale in physical time; polygonal interpolation uses the right endpoint of its current cell.
The union of the partitions is dense. Continuity of implies that contains the full Brownian path and its stochastic integrals, up to completion. The martingale convergence theorem for conditional expectations therefore yields convergence of and all off-diagonal at every fixed pair, almost surely and in for finite . Simultaneously it holds for a countable dense collection of pairs. The diagonal terms must be handled separately:
They are not conditional expectations of the diagonal Brownian second level: the latter would also contain a conditional variance.
Pointwise convergence alone is insufficient for the rough path metric. The Burkholder-Davis-Gundy inequalities, Brownian scaling and Gaussian increment moments give, for arbitrarily large ,
Equivalently, using the homogeneous norm on , the -th moment of the Carnot-Carathéodory distance of an increment is bounded by . The metric form of the Kolmogorov continuity theorem, with chosen large, gives for every a random having all finite moments such that
Conditioning these bounds gives
The diagonal bounds follow by squaring the first bound. The two conditional-expectation processes are nonnegative martingales; the Doob Lp maximal inequality makes their suprema over finite almost surely, with all needed moments. Thus all the polygonal lifts have a common random bound at exponent .
These bounds and the Chen identity give joint equicontinuity of the increments as functions of . Convergence on the dense collection of pairs consequently gives uniform convergence of both levels on the time triangle. Take . For either level , with a common bound and its uniform difference, interpolation gives
This proves the stated Hölder rough path metric convergence. Finally, for a partition , the -th level difference satisfies
because . Taking the appropriate powers and suprema proves -variation convergence too. Nesting is what permits the conditional-expectation martingale proof; without nesting one instead needs direct approximation estimates.
Work on a finite interval with a fixed initial point . To give a clean global statement, assume are bounded vector fields with bounded continuous derivatives through order three. Consider the Stratonovich integral form of the stochastic differential equation
For a control in the Cameron-Martin space of Wiener measure,
let solve the controlled ordinary differential equation
The Stroock-Varadhan support theorem says, in the uniform metric on continuous paths,
Thus a path is in the support of a measure of the diffusion precisely when it can be approximated by these deterministic controlled trajectories. There is no ellipticity assumption: the allowed controls and vector fields already encode any restrictions on reachability.
The central point of the rough-path proof is that ordinary uniform approximation of the driver does not make the solution map continuous. Small planar loops can have small amplitude but accumulated area of fixed size, and vector fields with a nonzero Lie bracket detect that area. The correct driver is enhanced Brownian motion , including Lévy area. Fix . The universal limit theorem gives a continuous map
from the geometric -variation rough-path space to solution paths. It agrees with the controlled ordinary differential equation when . Adding the time coordinate, with its mixed integrals defined by integration against and integration by parts, incorporates without changing the continuity argument. This is the role of the universal limit theorem: it turns a support problem for all these nonlinear diffusions into a support problem for one enhanced driving process.
For , the rough differential equation is the stated Stratonovich equation. Its second-order increment includes
Replacing the Stratonovich integral in the second level by its Itô integral expression contributes , which is exactly the Stratonovich-to-Itô correction. Polygonal convergence from Question 3 and the universal limit theorem therefore give the Wong-Zakai approximation: the ordinary equations driven by converge to this Stratonovich diffusion.
It remains to establish the support of enhanced Brownian motion:
One inclusion follows immediately from Question 3. Every polygonal belongs to , and almost surely in the rough path metric. Since is closed, almost surely, whence its support is contained in . This alone does not prove the reverse inclusion: convergence of random approximations does not automatically give positive mass near every control.
For that inclusion, take dyadic mesh and write
On each grid interval is a pinned Brownian bridge. The bridges are mutually independent and independent of the grid values defining , by the Gaussian projection formula. Their canonical Stratonovich enhancement is therefore independent of . It is important to enhance the bridge residual itself, including its area, rather than infer area smallness from its uniform size.
The bridge enhancement tends to the zero rough path in probability. Here are the estimates behind this assertion. A bridge on an interval of length scales as times a unit bridge; its full antisymmetric area has mean zero, moments of order , and second moment of order . Since its endpoint displacement is zero, at grid points the cumulative second level is just the sum of the independent bridge areas. The Doob L2 maximal inequality gives
Partial intervals at the two ends contribute bridge increments and at most two local areas. Bridge scaling, Gaussian moment bounds and the corresponding iterated-integral estimates yield, uniformly in and for arbitrarily large ,
For an interval crossing several grid cells, the full-cell second levels are independent centered areas, whose sum has moments bounded by ; the two boundary pieces and their cross product satisfy the displayed bound as well. For an interval inside one cell these are the usual scaled bridge increment and area bounds. At each fixed pair both levels converge to zero in probability: the first-level variance is , and the second-level second moment is for sufficiently fine grids. The Kolmogorov continuity theorem gives uniformly bounded moments of a Hölder rough-path norm at any exponent . Tightness, convergence on a dense set of pairs and interpolation to now give in probability. Taking gives in probability.
Fix . Its polygonal interpolations converge to in the total-variation norm: their derivatives are the cell averages of , which converge in , hence in . Moreover . Thus in the rough path metric.
The rough path translation operation satisfies
For a bounded variation path , translation adds at level one and, at level two, the mixed terms
The second mixed term is defined by integration by parts. Their variation bounds show that translation is continuous, uniformly when is bounded, near the zero rough path. More explicitly the mixed second-level norms are bounded by a constant times ; the other new second-level term is the path signature of .
Given a ball of radius around , choose a sufficiently large so that is close and
for the small supplied by translation continuity. The relevant variation bounds can be chosen uniformly in , since the variations of the are uniformly bounded. For this fixed , the event has positive probability: the finite vector of Brownian increments has an everywhere positive Gaussian density, and sufficiently small deviations of its vertices imply this variation bound. These two events are independent. On their intersection, translation continuity gives . Every ball around therefore has positive probability. This proves lies in the support, and taking closures gives .
Finally, a continuous map between the separable path spaces in use satisfies
For one direction the measure is concentrated on its support. For the other, an open neighborhood of pulls back to an open neighborhood of a support point , which has positive measure. Using continuity of and the identity proves the boxed Stroock-Varadhan support theorem. This separates the two ingredients: the probabilistic support calculation for Brownian motion and area, and the deterministic continuity supplied by the universal limit theorem.
If the diffusion is instead presented as an Itô integral equation with drift , the controlled equation must use
Using unchanged in the controlled equation would generally give the wrong support description. The result above states explicit sufficient smoothness and nonexplosion assumptions; extensions to more general coefficients require the usual localization, not an unqualified assertion for arbitrary vector fields.
Fix . For , the residual observed path is
This Brownian bridge is independent of . Indeed it is independent of , while its covariance with is ; zero covariance implies independence in the joint Gaussian law. The same argument for every finite collection of bridge times, followed by continuity and generation from rational times, gives independence of the entire bridge. Since the full observed path is determined by its endpoint and this independent bridge, Brownian endpoint sufficiency for a constant drift gives
First suppose the prior covariance matrix is positive definite. The Bayes' theorem multiplies the prior Gaussian density by the conditional observation density, whose dependence on is . Thus the posterior exponent, up to terms not depending on , is
Completing the square gives the Gaussian Brownian drift filter:
For invertible these are equivalently and . At they reduce to the prior parameters.
The boxed formulas remain valid for a singular positive semidefinite matrix . To see this directly without inverse prior matrices, the joint Gaussian random vector has
The latter matrix is invertible for . The conditional multivariate normal distribution therefore has mean
and covariance matrix
Alternatively, subtract this mean from ; the resulting Gaussian random vector has zero covariance with and is therefore independent of it, which proves these conditional parameters.
Write the proposed innovation process in the observable form
It is adapted to the observation filtration and continuous. To prove the martingale property, take . Future increments of are independent of the joint information generated by and the past of , so
Also the tower property of conditional expectation gives for . Conditional integration is legitimate because . Subtracting the integral proves . Removing a continuous finite variation process does not change quadratic covariation, hence
The Lévy characterization of multidimensional Brownian motion now applies: a continuous zero-start martingale with this bracket matrix is a standard -dimensional Brownian motion relative to its given filtration. The observable innovation is a Wiener process in the observation filtration.
Differentiating the posterior formulas yields and
For the final expression, the printed inverse matrices require the extra assumption that is positive definite. Under that assumption put . The Itô formula gives
since and . On the other hand,
The trace terms cancel in the innovation exponential for Gaussian drift filtering, leaving
Thus and is a positive stochastic exponential, hence a nonnegative local martingale. To obtain the requested supermartingale conclusion explicitly, choose localizing stopping times for which is a true martingale. The Conditional Fatou lemma gives
The same argument at gives , supplying integrability. The process is a supermartingale in the observation filtration. No unproved exponential-integrability condition on the random drift is required.
For a singular prior the literal inverse-matrix expression in the PDF is undefined, but there is a natural extension with the same conclusion. Define, for fixed ,
For positive definite , a Gaussian integral shows this reciprocal is exactly the printed expression. For any positive semidefinite , the integral is positive and finite, , and , by the same posterior weighting. The Itô formula consequently gives . Its reciprocal satisfies the boxed stochastic differential equation and the same supermartingale proof. This completes the singular-covariance extension while explicitly separating it from the undefined printed formula.
Fix times , and set
These are iid bounded centred random vectors, and
Their covariance matrix is
We prove the required central limit theorem calculation explicitly. For , the scalar is bounded, has mean zero and second moment . The Taylor expansion of the exponential, with its uniformly bounded cubic remainder, gives
Independence implies that the characteristic function of the sum vector is the th power of this expression, so it tends to . This is the characteristic function of a centred multivariate normal distribution with covariance . The Lévy continuity theorem states that convergence of characteristic functions to a characteristic function continuous at zero gives convergence in distribution; apply it here.
By part (ii), the corresponding Brownian bridge vector has exactly this covariance and mean. Therefore
Repeated times or the endpoint times may make singular; the characteristic-function argument still applies. This proves every finite-dimensional distribution convergence requested, the uniform case of the Finite-dimensional Brownian bridge limit of an empirical distribution process.
Let be standard Brownian motion with its continuous version, and define
Every finite vector is a linear transform of a Gaussian Brownian vector, so is a centred Gaussian process. Using ,
For , this is , the prescribed Brownian bridge covariance kernel. Its paths are continuous on the probability-one event of Brownian continuity, because is continuous on every sample. The construction also gives . Thus it realizes a Brownian bridge with almost surely continuous paths, and part (i) identifies its process law.