Put , the uniform bound on the supremum norm of the gradient. The fundamental theorem of calculus on a line segment, together with the inner product inequality , gives
Thus is Lipschitz continuous with respect to the L1 norm. The Gaussian random variables comprising and have finite exponential moments of their absolute values. More explicitly, for , Hölder's inequality gives . Consequently and every exponential expression below are finite, including when the covariance matrix is singular.
Use the convex function . Since is an independent copy of , Jensen inequality for the conditional expectation gives
For , define the Gaussian rotation of independent copies
Writing , both rotated covariance matrices are and their cross-covariance is zero. The pair has a centered multivariate normal distribution, so its components are independent and has the same probability law as . This calculation uses no inverse of and therefore also proves the assertion for degenerate multivariate normal distributions.
The path runs from to . The chain rule and the fundamental theorem of calculus give the pathwise identity
Apply Jensen inequality to the uniform probability measure on . Then use Tonelli theorem and the Gaussian rotation of independent copies to obtain
This proves the Gaussian rotation interpolation inequality in the required form:
The stated almost-sure domination now gives an exponential moment of an absolute standard normal variable bound. If , completing the square in the standard normal density yields
where is the standard normal distribution function. Hence Markov inequality gives, for every ,
The exponent is minimized at . Therefore the resulting Gaussian tail bound is
No independence of from or is needed: only the given almost-sure domination is used.