TheoremBase

Sketch: the density factorizes over coordinates, which gives the product formula for gammakgamma_k, both directions of the density criterion (by induction, via the product law of independent random vectors and Tonelli), the moments from the Gaussian integral, orthogonal invariance by the linear change of variables, orthonormal rows by completing to an orthogonal matrix, and concatenation.

Proof

Throughout, λk\lambda_{k} is Lebesgue measure on Rk\mathbb{R}^{k} under the axiom of dependent choice, cGc_{\mathrm{G}} is as in Standard Normal Distribution, and φ\varphi, γ\gamma, φk\varphi_{k}, γk\gamma_{k} are as in Standard Normal Distribution (i), Standard Normal Distribution (ii), Standard Normal Vectors and the Standard Normal Distribution on ℝᵏ (i) and Standard Normal Vectors and the Standard Normal Distribution on ℝᵏ (ii); a measure hμh\mu with a density gives a set AA the mass ∫1Ah dμ\int\mathbf{1}_{A}h\,d\mu, and integrals against it are integrals of the product with hh (Measure with a Density (i), Integrals over Measurable Subsets (i), Image Measures and Measures with a Density: Measures, Integrals and Change of Variables (vi), Image Measures and Measures with a Density: Measures, Integrals and Change of Variables (vii)); continuous and Borel functions of random vectors, their coordinates and their concatenations are random vectors, with laws the image laws (Measurable Maps: Generators, Composition, Continuous Maps, Restrictions, and Criteria for Real- and [0,∞]-Valued Maps (iv), Random Vectors: Coordinates, Functions, Pairs and Almost-Sure Equality (i), Random Vectors: Coordinates, Functions, Pairs and Almost-Sure Equality (ii), Random Vectors: Coordinates, Functions, Pairs and Almost-Sure Equality (iii), The Law of a Random Element (i)); and a finite product of elements of [0,∞)[0,\infty) is the same in R\mathbb{R} and in [0,∞][0,\infty] (Addition and Multiplication on [0,∞] (ii), Iterated Operations: Recursion, Splitting, Reordering, Termwise Combination and Homomorphisms (ii)); every probability is finite, P(A)≤P(Ω)=1P(A)\le P(\Omega)=1 (Basic Properties of a Measure (iii)).

For Borel sets B1,…,Bk⊆RB_{1},\dots,B_{k}\subseteq\mathbb{R} we write

B1×⋯×Bk={x∈Rk:xj∈Bj for every j∈[k]},B_{1}\times\dots\times B_{k}=\{x\in\mathbb{R}^{k}:x_{j}\in B_{j}\text{ for every }j\in[k]\},

and call these sets cylinders. A cylinder is the intersection of the sets πj−1(Bj)\pi_{j}^{-1}(B_{j}), which are Borel by The Borel Sets of ℝⁿ and of the Real Matrices Are Generated by the Coordinates (iii) and Closure Properties of σ-Algebras, Intersections and Traces of σ-Algebras, and the Generated σ-Algebra (iii), so, adding one coordinate at a time (Induction for Predicative Formulas, and the Order of ℕ below 1 and below n+1 (i)), it is Borel (Closure Properties of σ-Algebras, Intersections and Traces of σ-Algebras, and the Generated σ-Algebra (ix)); its indicator is x↦∏j=1k1Bj(xj)x\mapsto\prod_{j=1}^{k}\mathbf{1}_{B_{j}}(x_{j}).

Step 1 (the density is a product). Here and below, sums and products from j=1j=1 to kk are taken over the finite set [k][k] (Natural Numbers as Indices: ℕ ⊆ ℕ₀, 1 ∈ ℕ₀, and the Two Readings of an Operation from 1 to n (v)). For x∈Rkx\in\mathbb{R}^{k}, ∥x∥2=x⋅x=∑j=1kxj2\lVert x\rVert^{2}=x\cdot x=\sum_{j=1}^{k}x_{j}^{2} (The Euclidean Norm on Rn\mathbb{R}^n (i), The Dot Product on Rn\mathbb{R}^n (i)). The map u↦exp⁡(−u/2)u\mapsto\exp(-u/2) carries sums to products by Basic Properties of the Exponential Function (ii), so Iterated Operations: Recursion, Splitting, Reordering, Termwise Combination and Homomorphisms (ii) gives exp⁡(−∥x∥2/2)=∏j=1kexp⁡(−xj2/2)\exp(-\lVert x\rVert^{2}/2)=\prod_{j=1}^{k}\exp(-x_{j}^{2}/2). Writing cG−k=(cG−1)kc_{\mathrm{G}}^{-k}=(c_{\mathrm{G}}^{-1})^{k} (Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality (iv)) as the product of kk factors cG−1c_{\mathrm{G}}^{-1} and combining the two products termwise (Iterated Operations: Recursion, Splitting, Reordering, Termwise Combination and Homomorphisms (v)),

φk(x)=∏j=1kφ(xj)(x∈Rk).\varphi_{k}(x)=\prod_{j=1}^{k}\varphi(x_{j})\qquad(x\in\mathbb{R}^{k}).

Step 2 ((i), and the measure of a cylinder). By The Gaussian Integral Is Finite and Positive, and the First Two Gaussian Moments (i), x↦exp⁡(−x2/2)x\mapsto\exp(-x^{2}/2) is integrable with integral cGc_{\mathrm{G}}, so φ\varphi is integrable and, taking the constant cG−1c_{\mathrm{G}}^{-1} out of the integral (Basic Properties of the Integral of Nonnegative Measurable Maps (iv), Linearity and Monotonicity of the Lebesgue Integral, and the Integrability Criterion (vii), Linearity and Monotonicity of the Lebesgue Integral, and the Integrability Criterion (vi)),

γ(R)=∫Rφ dλ=cG−1∫Rexp⁡(−x2/2) dλ(x)=cG−1cG=1.\gamma(\mathbb{R})=\int_{\mathbb{R}}\varphi\,d\lambda=c_{\mathrm{G}}^{-1}\int_{\mathbb{R}}\exp(-x^{2}/2)\,d\lambda(x)=c_{\mathrm{G}}^{-1}c_{\mathrm{G}}=1 .

By Step 1 and The Lebesgue Integral over ℝⁿ of a Product of Functions of One Coordinate Each (i), γk(Rk)\gamma_{k}(\mathbb{R}^{k}) is then a product of ones (Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality (ii)):

γk(Rk)=∫Rk∏j=1kφ(xj) dλk(x)=∏j=1k∫Rφ dλ=1.\gamma_{k}(\mathbb{R}^{k})=\int_{\mathbb{R}^{k}}\prod_{j=1}^{k}\varphi(x_{j})\,d\lambda_{k}(x)=\prod_{j=1}^{k}\int_{\mathbb{R}}\varphi\,d\lambda=1 .

Let B1,…,Bk∈B(R)B_{1},\dots,B_{k}\in\mathcal{B}(\mathbb{R}). By Step 1, the integrand of γk(B1×⋯×Bk)=∫1B1×⋯×Bkφk dλk\gamma_{k}(B_{1}\times\dots\times B_{k})=\int\mathbf{1}_{B_{1}\times\dots\times B_{k}}\varphi_{k}\,d\lambda_{k} is x↦∏j=1k(φ1Bj)(xj)x\mapsto\prod_{j=1}^{k}(\varphi\mathbf{1}_{B_{j}})(x_{j}): on the cylinder both equal φk(x)\varphi_{k}(x), and off it both vanish, since some factor 1Bj(xj)\mathbf{1}_{B_{j}}(x_{j}) is 00 (Basic Properties of the Integral of Nonnegative Measurable Maps (ii)). So The Lebesgue Integral over ℝⁿ of a Product of Functions of One Coordinate Each (ii) and Standard Normal Distribution (ii) give

γk(B1×⋯×Bk)=∏j=1k∫Bjφ dλ=∏j=1kγ(Bj).(∗)\gamma_{k}(B_{1}\times\dots\times B_{k})=\prod_{j=1}^{k}\int_{B_{j}}\varphi\,d\lambda=\prod_{j=1}^{k}\gamma(B_{j}).\tag{$\ast$}

As γ\gamma and γk\gamma_{k} are measures (Image Measures and Measures with a Density: Measures, Integrals and Change of Variables (v)), they are probability measures. Steps 1 and 2, and Step 3 below, hold in every dimension k∈Nk\in\mathbb{N}.

Step 3 (cylinders determine a law). Let μ\mu be a probability measure on (Rk,B(Rk))(\mathbb{R}^{k},\mathcal{B}(\mathbb{R}^{k})) that agrees with γk\gamma_{k} on every cylinder. Then μ=γk\mu=\gamma_{k}. Indeed, let Ck\mathcal{C}_{k} be the set of cylinders. It is a π\pi-system, since

(B1×⋯×Bk)∩(B1′×⋯×Bk′)=(B1∩B1′)×⋯×(Bk∩Bk′).(B_{1}\times\dots\times B_{k})\cap(B_{1}'\times\dots\times B_{k}')=(B_{1}\cap B_{1}')\times\dots\times(B_{k}\cap B_{k}').

Each set πi−1(B)\pi_{i}^{-1}(B) with i∈[k]i\in[k] and B∈B(R)B\in\mathcal{B}(\mathbb{R}) is the cylinder with BB in place ii and R\mathbb{R} elsewhere, so B(Rk)⊆σ(Ck)\mathcal{B}(\mathbb{R}^{k})\subseteq\sigma(\mathcal{C}_{k}) by The Borel Sets of ℝⁿ and of the Real Matrices Are Generated by the Coordinates (iii) and Closure Properties of σ-Algebras, Intersections and Traces of σ-Algebras, and the Generated σ-Algebra (v); conversely Ck⊆B(Rk)\mathcal{C}_{k}\subseteq\mathcal{B}(\mathbb{R}^{k}), so σ(Ck)⊆B(Rk)\sigma(\mathcal{C}_{k})\subseteq\mathcal{B}(\mathbb{R}^{k}) by Closure Properties of σ-Algebras, Intersections and Traces of σ-Algebras, and the Generated σ-Algebra (iv). As μ(Rk)=1=γk(Rk)\mu(\mathbb{R}^{k})=1=\gamma_{k}(\mathbb{R}^{k}) (Step 2), Uniqueness of Measures Agreeing on a Generating π-System (i) gives μ=γk\mu=\gamma_{k}.

Step 4 ((iii), "only if"). Let ZZ be a standard normal vector: Z1,…,ZkZ_{1},\dots,Z_{k} are independent and PZj=γP_{Z_{j}}=\gamma for every jj (Standard Normal Vectors and the Standard Normal Distribution on ℝᵏ (iii), Standard Normal Distribution (iii)). For a cylinder B1×⋯×BkB_{1}\times\dots\times B_{k}, Independent Random Elements: Preimages, Functions and Blocks (i), applied to the indices 1,…,k1,\dots,k, and (∗)(\ast) give

PZ(B1×⋯×Bk)=P(Z1∈B1,…,Zk∈Bk)=∏j=1kP(Zj∈Bj)=∏j=1kγ(Bj)=γk(B1×⋯×Bk).P_{Z}(B_{1}\times\dots\times B_{k})=P(Z_{1}\in B_{1},\dots,Z_{k}\in B_{k})=\prod_{j=1}^{k}P(Z_{j}\in B_{j})=\prod_{j=1}^{k}\gamma(B_{j})=\gamma_{k}(B_{1}\times\dots\times B_{k}).

The law PZP_{Z} is a probability measure, so PZ=γkP_{Z}=\gamma_{k} by Step 3.

Step 5 ((iii), "if"). Let PZ=γkP_{Z}=\gamma_{k}. Let n∈Nn\in\mathbb{N}, let j1,…,jn∈[k]j_{1},\dots,j_{n}\in[k] be distinct and let B1,…,Bn∈B(R)B_{1},\dots,B_{n}\in\mathcal{B}(\mathbb{R}). Put Dj=BiD_{j}=B_{i} if j=jij=j_{i}, and Dj=RD_{j}=\mathbb{R} if jj is none of j1,…,jnj_{1},\dots,j_{n}. Then {Zj1∈B1,…,Zjn∈Bn}={Z∈D1×⋯×Dk}\{Z_{j_{1}}\in B_{1},\dots,Z_{j_{n}}\in B_{n}\}=\{Z\in D_{1}\times\dots\times D_{k}\}, and (∗)(\ast) gives

P(Zj1∈B1,…,Zjn∈Bn)=γk(D1×⋯×Dk)=∏j=1kγ(Dj)=∏i=1nγ(Bi),P(Z_{j_{1}}\in B_{1},\dots,Z_{j_{n}}\in B_{n})=\gamma_{k}(D_{1}\times\dots\times D_{k})=\prod_{j=1}^{k}\gamma(D_{j})=\prod_{i=1}^{n}\gamma(B_{i}),

since, with J={j1,…,jn}J=\{j_{1},\dots,j_{n}\}, the factors with j∈[k]∖Jj\in[k]\setminus J equal γ(R)=1\gamma(\mathbb{R})=1, and reindexing the product over JJ by the bijection i↦jii\mapsto j_{i} from [n][n] onto JJ, with γ(Dji)=γ(Bi)\gamma(D_{j_{i}})=\gamma(B_{i}), gives ∏i=1nγ(Bi)\prod_{i=1}^{n}\gamma(B_{i}) (Sums and Products over a Finite Set and over an Interval (iv), Iterated Operations over Finite Sets: Singletons, Disjoint Unions, Reindexing, Products of Sets, Termwise Combination, Homomorphisms and Intervals (ii), Finite Sets: the Pigeonhole Principle, Uniqueness of the Length, Subsets, Unions, Products, Images, Bounded Sets of Natural Numbers, Extreme Elements, Sets of Maps, Finite Unions and Finite Choice (iv), Finite Sets: the Pigeonhole Principle, Uniqueness of the Length, Subsets, Unions, Products, Images, Bounded Sets of Natural Numbers, Extreme Elements, Sets of Maps, Finite Unions and Finite Choice (vii), Iterated Operations over Finite Sets: Singletons, Disjoint Unions, Reindexing, Products of Sets, Termwise Combination, Homomorphisms and Intervals (iii)). With n=1n=1 this says PZj=γP_{Z_{j}}=\gamma, so every ZjZ_{j} is standard normal (Standard Normal Distribution (iii)). Hence the right-hand side is ∏i=1nP(Zji∈Bi)\prod_{i=1}^{n}P(Z_{j_{i}}\in B_{i}), and Z1,…,ZkZ_{1},\dots,Z_{k} are independent by Independent Random Elements: Preimages, Functions and Blocks (i). So ZZ is a standard normal vector (Standard Normal Vectors and the Standard Normal Distribution on ℝᵏ (iii)).

Step 6 ((ii)). The identity function of Rk\mathbb{R}^{k} on the probability space (Rk,B(Rk),γk)(\mathbb{R}^{k},\mathcal{B}(\mathbb{R}^{k}),\gamma_{k}) (Step 2) has law γk\gamma_{k}, so it is a standard normal vector by Step 5.

Step 7 (the law of a concatenation). Let UU and VV be independent random vectors in Rk\mathbb{R}^{k} and Rl\mathbb{R}^{l} with PU=γkP_{U}=\gamma_{k} and PV=γlP_{V}=\gamma_{l}. Here, and in (vii), (U,V)(U,V) in Rk+l\mathbb{R}^{k+l} means the random vector ι∘(U,V)\iota\circ(U,V), ω↦ι(U(ω),V(ω))\omega\mapsto\iota(U(\omega),V(\omega)), where ι:Rk×Rl→Rk+l\iota:\mathbb{R}^{k}\times\mathbb{R}^{l}\to\mathbb{R}^{k+l} is the concatenation map of Concatenation Identifies a Product of Euclidean Spaces with a Euclidean Space (ii) (continuous, since dE(ι(z),ι(z′))≤2 d×(z,z′)d_{E}(\iota(z),\iota(z'))\le 2\,d_{\times}(z,z') by Concatenation Identifies a Product of Euclidean Spaces with a Euclidean Space (vi)). Then P(U,V)=γk+lP_{(U,V)}=\gamma_{k+l}. Indeed, let D1,…,Dk+l∈B(R)D_{1},\dots,D_{k+l}\in\mathcal{B}(\mathbb{R}) and D=D1×⋯×Dk+lD=D_{1}\times\dots\times D_{k+l}. By Concatenation Identifies a Product of Euclidean Spaces with a Euclidean Space (i) and Concatenation Identifies a Product of Euclidean Spaces with a Euclidean Space (ii), the coordinates of ι(ξ,η)\iota(\xi,\eta) are ξj\xi_{j} in place j∈[k]j\in[k] and ηj\eta_{j} in place k+jk+j for j∈[l]j\in[l], and every place in [k+l][k+l] is of exactly one of these forms; hence

{(U,V)∈D}={U∈D1×⋯×Dk}∩{V∈Dk+1×⋯×Dk+l},\{(U,V)\in D\}=\{U\in D_{1}\times\dots\times D_{k}\}\cap\{V\in D_{k+1}\times\dots\times D_{k+l}\},

where Dk+1×⋯×Dk+l={η∈Rl:ηj∈Dk+j for every j∈[l]}D_{k+1}\times\dots\times D_{k+l}=\{\eta\in\mathbb{R}^{l}:\eta_{j}\in D_{k+j}\text{ for every }j\in[l]\}. By the independence of UU and VV (Independent Random Elements: Preimages, Functions and Blocks (ii)), (∗)(\ast) for kk and for ll, and Iterated Operations: Recursion, Splitting, Reordering, Termwise Combination and Homomorphisms (iii),

P((U,V)∈D)=γk(D1×⋯×Dk) γl(Dk+1×⋯×Dk+l)=∏j=1kγ(Dj)∏j=1lγ(Dk+j)=∏j=1k+lγ(Dj)=γk+l(D),P((U,V)\in D)=\gamma_{k}(D_{1}\times\dots\times D_{k})\,\gamma_{l}(D_{k+1}\times\dots\times D_{k+l})=\prod_{j=1}^{k}\gamma(D_{j})\prod_{j=1}^{l}\gamma(D_{k+j})=\prod_{j=1}^{k+l}\gamma(D_{j})=\gamma_{k+l}(D),

the last equality by (∗)(\ast) for k+lk+l. The law P(U,V)P_{(U,V)} is a probability measure, so P(U,V)=γk+lP_{(U,V)}=\gamma_{k+l} by Step 3 for k+lk+l.

Step 8 ((vii)). By (iii), PZ=γkP_{Z}=\gamma_{k} and PW=γlP_{W}=\gamma_{l}; by Step 7, P(Z,W)=γk+lP_{(Z,W)}=\gamma_{k+l}; by (iii) again, (Z,W)(Z,W) is a standard normal vector in Rk+l\mathbb{R}^{k+l}.

Step 9 ((iv)). Let ZZ be a standard normal vector and j∈[k]j\in[k], so that PZj=γP_{Z_{j}}=\gamma. By The Gaussian Integral Is Finite and Positive, and the First Two Gaussian Moments (ii) and Linearity and Monotonicity of the Lebesgue Integral, and the Integrability Criterion (vii) (multiplying by cG−1c_{\mathrm{G}}^{-1}), x↦xφ(x)x\mapsto x\varphi(x) and x↦x2φ(x)x\mapsto x^{2}\varphi(x) are integrable with respect to λ\lambda, with integrals 00 and 11. The map x↦xx\mapsto x is the identity of R\mathbb{R}, hence Borel (Measurable Maps: Generators, Composition, Continuous Maps, Restrictions, and Criteria for Real- and [0,∞]-Valued Maps (iii)), and x↦x2x\mapsto x^{2} is continuous, hence Borel (Measurable Maps: Generators, Composition, Continuous Maps, Restrictions, and Criteria for Real- and [0,∞]-Valued Maps (iv)); and φ\varphi is real-valued, so Image Measures and Measures with a Density: Measures, Integrals and Change of Variables (vii) shows that they are integrable with respect to γ\gamma and

∫Rx dγ(x)=0,∫Rx2 dγ(x)=1.\int_{\mathbb{R}}x\,d\gamma(x)=0,\qquad\int_{\mathbb{R}}x^{2}\,d\gamma(x)=1 .

By Expectations Computed from the Law (ii), ZjZ_{j} and Zj2Z_{j}^{2} are integrable with

EZj=0,EZj2=1.\mathbb{E}Z_{j}=0,\qquad\mathbb{E}Z_{j}^{2}=1 .

Hence Zj∈L2(P)Z_{j}\in\mathcal{L}^{2}(P) (Elementary Properties of the p-Seminorm (ii), as the power ∣Zj∣2|Z_{j}|^{2} of Power-Integrable Functions and the p-Seminorm (i) is the two-factor product ZjZj=Zj2Z_{j}Z_{j}=Z_{j}^{2}, Iterated Operations: Recursion, Splitting, Reordering, Termwise Combination and Homomorphisms (i)), so Z∈L2(P;Rk)Z\in\mathcal{L}^{2}(P;\mathbb{R}^{k}) (Square-Integrable Vector-Valued Functions: Components, Dot Products and Almost-Everywhere Equality (i)); ZZ is integrable (Integrable Vector- and Matrix-Valued Functions and Their Integrals (i)) with EZ=(EZ1,…,EZk)=0\mathbb{E}Z=(\mathbb{E}Z_{1},\dots,\mathbb{E}Z_{k})=0 (Expectation (iii)); and Var⁡Zj=EZj2−(EZj)2=1\operatorname{Var}Z_{j}=\mathbb{E}Z_{j}^{2}-(\mathbb{E}Z_{j})^{2}=1 (Rules for Expectations, Variances and Covariances (vii)). Let i,j∈[k]i,j\in[k] with i≠ji\neq j. For Borel sets B,B′⊆RB,B'\subseteq\mathbb{R}, Independent Random Elements: Preimages, Functions and Blocks (i), applied to the two indices i,ji,j, gives P(Zi∈B, Zj∈B′)=P(Zi∈B) P(Zj∈B′)P(Z_{i}\in B,\ Z_{j}\in B')=P(Z_{i}\in B)\,P(Z_{j}\in B'), so ZiZ_{i} and ZjZ_{j} are independent by Independent Random Elements: Preimages, Functions and Blocks (ii), and Cov⁡(Zi,Zj)=0\operatorname{Cov}(Z_{i},Z_{j})=0 by Expectations and Variances of Independent Random Variables (ii). Therefore Cov⁡(Z)ij=Cov⁡(Zi,Zj)=δij\operatorname{Cov}(Z)_{ij}=\operatorname{Cov}(Z_{i},Z_{j})=\delta_{ij} for all i,j∈[k]i,j\in[k] (Variance and Covariance (iv), Variance and Covariance (ii)), that is, Cov⁡(Z)=Ik\operatorname{Cov}(Z)=I_{k}.

Step 10 ((v)). Let ZZ be a standard normal vector, Q∈O(k)Q\in\mathrm{O}(k) and B∈B(Rk)B\in\mathcal{B}(\mathbb{R}^{k}). The matrix QQ is invertible with ∣det⁡Q∣=1|\det Q|=1 (Rules for Orthogonal Matrices: Inverse, Products, Isometry, Columns, Determinant, Orthonormal Extension and Expansion (i), Rules for Orthogonal Matrices: Inverse, Products, Isometry, Columns, Determinant, Orthonormal Extension and Expansion (vi)), and ∥Qx∥=∥x∥\lVert Qx\rVert=\lVert x\rVert, so φk(Qx)=φk(x)\varphi_{k}(Qx)=\varphi_{k}(x) for every x∈Rkx\in\mathbb{R}^{k} (Rules for Orthogonal Matrices: Inverse, Products, Isometry, Columns, Determinant, Orthonormal Extension and Expansion (iii)). The map T(x)=QxT(x)=Qx is continuous and Borel (Measurable Maps: Generators, Composition, Continuous Maps, Restrictions, and Criteria for Real- and [0,∞]-Valued Maps (iv), Linear Change of Variables for Lebesgue Measure on ℝⁿ (ii)), so QZ=T∘ZQZ=T\circ Z has the image law PQZ=PZ∘T−1P_{QZ}=P_{Z}\circ T^{-1} (Image Measures and Measures with a Density: Measures, Integrals and Change of Variables (i)), and PZ=γkP_{Z}=\gamma_{k} by (iii). The change of variables for nonnegative functions (Linear Change of Variables for Lebesgue Measure on ℝⁿ (iii)), applied to 1Bφk∈M+\mathbf{1}_{B}\varphi_{k}\in\mathcal{M}^{+} (Image Measures and Measures with a Density: Measures, Integrals and Change of Variables (vi)), together with 1T−1(B)=1B∘T\mathbf{1}_{T^{-1}(B)}=\mathbf{1}_{B}\circ T and φk∘T=φk\varphi_{k}\circ T=\varphi_{k}, therefore gives

P(QZ∈B)=γk(T−1(B))=∫1B(Qx) φk(Qx) dλk(x)=∣det⁡Q∣−1∫1B φk dλk=γk(B).P(QZ\in B)=\gamma_{k}(T^{-1}(B))=\int\mathbf{1}_{B}(Qx)\,\varphi_{k}(Qx)\,d\lambda_{k}(x)=|\det Q|^{-1}\int\mathbf{1}_{B}\,\varphi_{k}\,d\lambda_{k}=\gamma_{k}(B).

So PQZ=γkP_{QZ}=\gamma_{k}, and QZQZ is a standard normal vector by (iii).

Step 11 ((vi)). The rows ci=C⊤ei∈Rkc_{i}=C^{\top}e_{i}\in\mathbb{R}^{k} (i∈[r]i\in[r]) of CC have coordinates (ci)j=Cij(c_{i})_{j}=C_{ij} (Algebraic Rules for Matrix Products, Matrix-Vector Products and Transposes (vi)), so (CZ)i=ci⋅Z(CZ)_{i}=c_{i}\cdot Z (Matrix-Vector Product (i)), and they satisfy ci⋅cj=(CC⊤)ij=δijc_{i}\cdot c_{j}=(CC^{\top})_{ij}=\delta_{ij} (Product of Real Matrices (i), Transpose of a Real Matrix (i)).

First we extend them to kk pairwise orthogonal vectors of norm 11. By induction on m∈[k]m\in[k] (Induction for Predicative Formulas, and the Order of ℕ below 1 and below n+1 (i); the induction formula is predicative by The Graph Reading of a Formula Tree Is Predicative and Agrees with Its Reading, So the Reading Is Predicative (iii)) there are u1,…,um∈Rku_{1},\dots,u_{m}\in\mathbb{R}^{k} with ui⋅uj=δiju_{i}\cdot u_{j}=\delta_{ij} for all i,j≤mi,j\le m and ui=ciu_{i}=c_{i} for i≤min⁡(r,m)i\le\min(r,m): start with u1=c1u_{1}=c_{1}, and, given u1,…,umu_{1},\dots,u_{m} with m<km<k, put um+1=cm+1u_{m+1}=c_{m+1} if m+1≤rm+1\le r (as cm+1⋅cm+1=1c_{m+1}\cdot c_{m+1}=1 and cm+1⋅ui=cm+1⋅ci=0c_{m+1}\cdot u_{i}=c_{m+1}\cdot c_{i}=0 for i≤mi\le m), and otherwise extend by Rules for Orthogonal Matrices: Inverse, Products, Isometry, Columns, Determinant, Orthonormal Extension and Expansion (vii). This gives orthonormal u1,…,uku_{1},\dots,u_{k} with ui=ciu_{i}=c_{i} for i≤min⁡(r,k)i\le\min(r,k). The matrix RR with columns u1,…,uku_{1},\dots,u_{k} lies in O(k)\mathrm{O}(k) (Rules for Orthogonal Matrices: Inverse, Products, Isometry, Columns, Determinant, Orthonormal Extension and Expansion (v)), hence so does Q=R⊤Q=R^{\top} (Rules for Orthogonal Matrices: Inverse, Products, Isometry, Columns, Determinant, Orthonormal Extension and Expansion (i)); its entries are Qij=(ui)jQ_{ij}=(u_{i})_{j} (Transpose of a Real Matrix (i)), so (Qx)i=ui⋅x(Qx)_{i}=u_{i}\cdot x for x∈Rkx\in\mathbb{R}^{k} and i∈[k]i\in[k] (Matrix-Vector Product (i)).

Next, r≤kr\le k. Otherwise Qck+1Qc_{k+1} has the coordinates ui⋅ck+1=ci⋅ck+1=0u_{i}\cdot c_{k+1}=c_{i}\cdot c_{k+1}=0 (i∈[k]i\in[k]), so Qck+1=0Qc_{k+1}=0, and since QQ is an isometry (Rules for Orthogonal Matrices: Inverse, Products, Isometry, Columns, Determinant, Orthonormal Extension and Expansion (iii), The Dot Product on Rn\mathbb{R}^n Is Symmetric, Bilinear and Positive Definite (vi))

ck+1⋅ck+1=(Qck+1)⋅(Qck+1)=0,c_{k+1}\cdot c_{k+1}=(Qc_{k+1})\cdot(Qc_{k+1})=0,

against ck+1⋅ck+1=1c_{k+1}\cdot c_{k+1}=1. Hence ui=ciu_{i}=c_{i} for every i∈[r]i\in[r], and

(QZ)i=ci⋅Z=(CZ)i(i∈[r]).(QZ)_{i}=c_{i}\cdot Z=(CZ)_{i}\qquad(i\in[r]).

Finally, PQZ=γkP_{QZ}=\gamma_{k} by Step 10. Let B1,…,Br∈B(R)B_{1},\dots,B_{r}\in\mathcal{B}(\mathbb{R}), and put Di=BiD_{i}=B_{i} for i∈[r]i\in[r] and Di=RD_{i}=\mathbb{R} for r<i≤kr<i\le k. Then {CZ∈B1×⋯×Br}={QZ∈D1×⋯×Dk}\{CZ\in B_{1}\times\dots\times B_{r}\}=\{QZ\in D_{1}\times\dots\times D_{k}\}, so the computation of Step 5, with QZQZ in place of ZZ, n=rn=r and ji=ij_{i}=i, and (∗)(\ast) in dimension rr give

P(CZ∈B1×⋯×Br)=γk(D1×⋯×Dk)=∏i=1rγ(Bi)=γr(B1×⋯×Br).P(CZ\in B_{1}\times\dots\times B_{r})=\gamma_{k}(D_{1}\times\dots\times D_{k})=\prod_{i=1}^{r}\gamma(B_{i})=\gamma_{r}(B_{1}\times\dots\times B_{r}).

As CZCZ is a random vector (Random Vectors: Coordinates, Functions, Pairs and Almost-Sure Equality (i)), Step 3 in dimension rr gives PCZ=γrP_{CZ}=\gamma_{r}, and CZCZ is a standard normal vector in Rr\mathbb{R}^{r} by (iii) in dimension rr.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…