A random vector is Gaussian if every linear combination is a (possibly degenerate) real Gaussian variable. Its law is determined by the mean vector and the covariance matrix : indeed the characteristic function of the vector, , is the value at of the cf of :
and -dimensional characteristic functions are injective (same smoothing proof as Theorem 23.3, coordinatewise Gaussians).
Examples
Example 23.9 (Confidence intervals, honestly derived)
Poll independent voters; estimates the true , with . The CLT gives, for large ,
where is the standard Gaussian distribution function. With : asymptotic confidence , and margin requires — the number behind every “ points, ” one reads; compare Chebyshev’s (Exercise 22.7). The is universal: to halve the error, quadruple the sample — the same law that fixes Monte Carlo’s cost (Exercise 23.7).