TheoremBase

For an invertible matrix M the measure B ↦ λₙ(M[B]) is translation invariant and finite on the unit cube, hence c(M)λₙ; the factor is multiplicative, equals 1 on orthogonal matrices and the product of the diagonal entries on positive diagonal matrices, so the singular value decomposition gives c(A)=|det A|. Translation invariance and the image- and density-measure formulas give the remaining clauses.

Proof

Throughout, u=(1,…,1)∈Rn\mathbf{u}=(1,\dots,1)\in\mathbb{R}^{n} and M+=M+(Rn,B(Rn))\mathcal{M}^{+}=\mathcal{M}^{+}(\mathbb{R}^{n},\mathcal{B}(\mathbb{R}^{n})); det⁡A≠0\det A\neq0 (A Square Real Matrix Is Invertible if and only if Its Determinant Is Nonzero (i)); λn(R(0,u))=1\lambda_{n}(R(0,\mathbf{u}))=1 (Lebesgue Measure on Rn\mathbb{R}^n (i) and Existence and Uniqueness of Lebesgue Measure on ℝⁿ (iii)); and B+a∈B(Rn)B+a\in\mathcal{B}(\mathbb{R}^{n}) and λn(B+a)=λn(B)\lambda_{n}(B+a)=\lambda_{n}(B) for B∈B(Rn)B\in\mathcal{B}(\mathbb{R}^{n}) and a∈Rna\in\mathbb{R}^{n} (Translation and Reflection Invariance of Lebesgue Measure on ℝⁿ (i)). Matrix-vector products obey the usual laws, among them M(x+y)=Mx+MyM(x+y)=Mx+My, M(sx)=s(Mx)M(sx)=s(Mx) for s∈Rs\in\mathbb{R}, (MN)x=M(Nx)(MN)x=M(Nx) and Inx=xI_{n}x=x (Algebraic Rules for Matrix Products, Matrix-Vector Products and Transposes (v)), and hence M(−x)=−MxM(-x)=-Mx, taking s=−1s=-1; and a product MNMN of invertible matrices is invertible with (MN)−1=N−1M−1(MN)^{-1}=N^{-1}M^{-1} (Rules for Matrix Inverses (iv)).

Step 1: affine bijections. Let M∈Mn(R)M\in\mathcal{M}_{n}(\mathbb{R}) be invertible, t∈Rnt\in\mathbb{R}^{n}, and S(x)=Mx+tS(x)=Mx+t. Then SS is measurable: it is the sum of the function x↦Mxx\mapsto Mx and the constant tt (Sums, Products, Transposes, Dot Products and Norms of Measurable Vector- and Matrix-Valued Maps (ii) and Sums, Products, Transposes, Dot Products and Norms of Measurable Vector- and Matrix-Valued Maps (i)). It is a bijection with inverse S′(y)=M−1y−M−1tS'(y)=M^{-1}y-M^{-1}t, by Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction (vii), since

M−1(Mx+t)−M−1t=x,M(M−1y−M−1t)+t=y.M^{-1}(Mx+t)-M^{-1}t=x,\qquad M\bigl(M^{-1}y-M^{-1}t\bigr)+t=y .

As S′S' has the same form, with the invertible matrix M−1M^{-1} (Rules for Matrix Inverses (iii)) and the vector −M−1t-M^{-1}t, it is measurable too, and for B∈B(Rn)B\in\mathcal{B}(\mathbb{R}^{n})

S[B]=(S′)−1(B)∈B(Rn),S−1(B)=S′[B],S[B]=(S')^{-1}(B)\in\mathcal{B}(\mathbb{R}^{n}),\qquad S^{-1}(B)=S'[B],

by Images and Preimages under a Bijection and Its Inverse (i) applied to SS and to S′S'. In particular TT is measurable, which is the first assertion of (ii), and T[B]∈B(Rn)T[B]\in\mathcal{B}(\mathbb{R}^{n}) for every Borel set BB.

Step 2: the factor of a matrix. Let M∈Mn(R)M\in\mathcal{M}_{n}(\mathbb{R}) be invertible, and define μM(B)=λn(M[B])\mu_{M}(B)=\lambda_{n}(M[B]) for B∈B(Rn)B\in\mathcal{B}(\mathbb{R}^{n}). By Step 1 with t=0t=0, M[B]=L−1(B)M[B]=L^{-1}(B) for the measurable function L(y)=M−1yL(y)=M^{-1}y, so μM=λn∘L−1\mu_{M}=\lambda_{n}\circ L^{-1} is a measure (Image Measures and Measures with a Density: Measures, Integrals and Change of Variables (i)). It is translation invariant: M[B+a]=M[B]+MaM[B+a]=M[B]+Ma, so

μM(B+a)=λn(M[B]+Ma)=λn(M[B])=μM(B).\mu_{M}(B+a)=\lambda_{n}(M[B]+Ma)=\lambda_{n}(M[B])=\mu_{M}(B).

It is finite on the open unit cube: for x∈R(0,u)x\in R(0,\mathbf{u}) we have ∥x∥2≤n\lVert x\rVert^{2}\le n, hence ∥Mx∥2≤sn\lVert Mx\rVert^{2}\le sn with s=∑i,jMij2s=\sum_{i,j}M_{ij}^{2} (Algebraic Rules for Matrix Products, Matrix-Vector Products and Transposes (ix)) and so ∥Mx∥≤1+sn\lVert Mx\rVert\le1+sn; thus M[R(0,u)]M[R(0,\mathbf{u})] is bounded and has finite measure (Lebesgue Measure on ℝⁿ: σ-Finiteness, Bounded Sets, Open Sets and Coordinate Hyperplanes (ii)). By Translation-Invariant Measures on ℝⁿ Are Multiples of Lebesgue Measure (i), with the real number c(M)=λn(M[R(0,u)])≥0c(M)=\lambda_{n}(M[R(0,\mathbf{u})])\ge0,

λn(M[B])=c(M) λn(B)(B∈B(Rn)).(1)\lambda_{n}(M[B])=c(M)\,\lambda_{n}(B)\qquad(B\in\mathcal{B}(\mathbb{R}^{n})).\tag{1}

Step 3: the factor is multiplicative. Let M,N∈Mn(R)M,N\in\mathcal{M}_{n}(\mathbb{R}) be invertible. Then MNMN is invertible, with inverse N−1M−1N^{-1}M^{-1}, and (MN)[B]=M[N[B]](MN)[B]=M[N[B]] because (MN)x=M(Nx)(MN)x=M(Nx). Applying (1) three times,

c(MN) λn(B)=λn(M[N[B]])=c(M) λn(N[B])=c(M) c(N) λn(B),c(MN)\,\lambda_{n}(B)=\lambda_{n}\bigl(M[N[B]]\bigr)=c(M)\,\lambda_{n}(N[B])=c(M)\,c(N)\,\lambda_{n}(B),

and B=R(0,u)B=R(0,\mathbf{u}) gives

c(MN)=c(M) c(N).(2)c(MN)=c(M)\,c(N).\tag{2}

Step 4: diagonal and orthogonal factors. Let d∈Rnd\in\mathbb{R}^{n} have positive coordinates, let d′∈Rnd'\in\mathbb{R}^{n} have coordinates di′=1/did'_{i}=1/d_{i}, and let D=diag⁡(d)D=\operatorname{diag}(d). Since diag⁡(d)diag⁡(d′)=diag⁡(u)=In\operatorname{diag}(d)\operatorname{diag}(d')=\operatorname{diag}(\mathbf{u})=I_{n} (Eigenvalues: the Determinant Criterion, Diagonal Matrices, Orthogonal Similarity and Orthogonality of Eigenvectors of Symmetric Matrices (ii)), DD is invertible with inverse diag⁡(d′)\operatorname{diag}(d') (Rules for Matrix Inverses (ii)). By Scaling Lebesgue Measure on ℝⁿ by a Diagonal Matrix (i), λn(D[B])=∣d1⋯dn∣ λn(B)=d1⋯dn λn(B)\lambda_{n}(D[B])=|d_{1}\cdots d_{n}|\,\lambda_{n}(B)=d_{1}\cdots d_{n}\,\lambda_{n}(B), the absolute value being redundant because every di>0d_{i}>0; with B=R(0,u)B=R(0,\mathbf{u}) this gives c(D)=d1⋯dnc(D)=d_{1}\cdots d_{n}.

Let U∈O(n)U\in\mathrm{O}(n). Then UU is invertible, U⊤∈O(n)U^{\top}\in\mathrm{O}(n) and UU⊤=InUU^{\top}=I_{n}, and ∥Ux∥=∥x∥\lVert Ux\rVert=\lVert x\rVert for every xx (Rules for Orthogonal Matrices: Inverse, Products, Isometry, Columns, Determinant, Orthonormal Extension and Expansion (i) and Rules for Orthogonal Matrices: Inverse, Products, Isometry, Columns, Determinant, Orthonormal Extension and Expansion (iii)). Let K={x∈Rn:∥x∥≤1}K=\{x\in\mathbb{R}^{n}:\lVert x\rVert\le1\}, a Borel set because x↦∥x∥x\mapsto\lVert x\rVert is measurable (Sums, Products, Transposes, Dot Products and Norms of Measurable Vector- and Matrix-Valued Maps (iii)). The isometry property gives U[K]⊆KU[K]\subseteq K, and every y∈Ky\in K is U(U⊤y)U(U^{\top}y) with ∥U⊤y∥=∥y∥≤1\lVert U^{\top}y\rVert=\lVert y\rVert\le1, so

U[K]=K.U[K]=K .

The set KK is bounded, so λn(K)<∞\lambda_{n}(K)<\infty (Lebesgue Measure on ℝⁿ: σ-Finiteness, Bounded Sets, Open Sets and Coordinate Hyperplanes (ii)); and it contains the open box R(−n−1u,n−1u)R(-n^{-1}\mathbf{u},n^{-1}\mathbf{u}), on which ∥x∥2<n⋅n−2≤1\lVert x\rVert^{2}<n\cdot n^{-2}\le1, so λn(K)≥(2/n)n>0\lambda_{n}(K)\ge(2/n)^{n}>0. Now (1) gives λn(K)=λn(U[K])=c(U) λn(K)\lambda_{n}(K)=\lambda_{n}(U[K])=c(U)\,\lambda_{n}(K), and dividing by λn(K)\lambda_{n}(K),

c(U)=1.c(U)=1 .

Step 5: the factor of AA. By Every Invertible Real Matrix Is an Orthogonal Matrix Times a Positive Diagonal Matrix Times an Orthogonal Matrix (i), there are U,V∈O(n)U,V\in\mathrm{O}(n) and d∈Rnd\in\mathbb{R}^{n} with positive coordinates such that A=UDV⊤A=UDV^{\top} with D=diag⁡(d)D=\operatorname{diag}(d), and ∣det⁡A∣=d1⋯dn|\det A|=d_{1}\cdots d_{n} by Every Invertible Real Matrix Is an Orthogonal Matrix Times a Positive Diagonal Matrix Times an Orthogonal Matrix (ii). Here V⊤∈O(n)V^{\top}\in\mathrm{O}(n) (Rules for Orthogonal Matrices: Inverse, Products, Isometry, Columns, Determinant, Orthonormal Extension and Expansion (i)), DD is invertible by Step 4, and so UDUD is invertible. Applying (2) to UDUD and V⊤V^{\top}, then to UU and DD, and using Step 4,

c(A)=c(U) c(D) c(V⊤)=d1⋯dn=∣det⁡A∣.c(A)=c(U)\,c(D)\,c(V^{\top})=d_{1}\cdots d_{n}=|\det A| .

Step 6: images of Borel sets. Let B∈B(Rn)B\in\mathcal{B}(\mathbb{R}^{n}). Then T[B]=A[B]+bT[B]=A[B]+b, so translation invariance and (1) give

λn(T[B])=λn(A[B])=∣det⁡A∣ λn(B),\lambda_{n}(T[B])=\lambda_{n}(A[B])=|\det A|\,\lambda_{n}(B),

which, with Step 1, is (i).

Step 7: the image measure. By Step 1, T−1(B)=T′[B]T^{-1}(B)=T'[B] for the function T′(y)=A−1y−A−1bT'(y)=A^{-1}y-A^{-1}b. The matrix A−1A^{-1} is invertible (Rules for Matrix Inverses (iii)) with det⁡(A−1)=1/det⁡A\det(A^{-1})=1/\det A (A Square Real Matrix Is Invertible if and only if Its Determinant Is Nonzero (ii)). Steps 1 to 6 hold for every invertible matrix and every vector, in particular for A−1A^{-1} and −A−1b-A^{-1}b, so Step 6 applied to T′T' gives

(λn∘T−1)(B)=λn(T−1(B))=∣det⁡A−1∣ λn(B)=∣det⁡A∣−1λn(B)(\lambda_{n}\circ T^{-1})(B)=\lambda_{n}(T^{-1}(B))=|\det A^{-1}|\,\lambda_{n}(B)=|\det A|^{-1}\lambda_{n}(B)

(Image Measure (i)), which is (ii).

Step 8: nonnegative functions. Let f∈M+f\in\mathcal{M}^{+}. Then f∘T∈M+f\circ T\in\mathcal{M}^{+} as a composition of measurable functions (Measurable Maps: Generators, Composition, Continuous Maps, Restrictions, and Criteria for Real- and [0,∞]-Valued Maps (ii)). Put γ=∣det⁡A∣−1\gamma=|\det A|^{-1}, a positive real number. By (ii), λn∘T−1\lambda_{n}\circ T^{-1} and the constant multiple γλn\gamma\lambda_{n} of λn\lambda_{n}, a measure by Integrals of Finite Sums of Nonnegative Functions, and Constant Multiples of a Measure (ii), agree at every Borel set, so

λn∘T−1=γλn.\lambda_{n}\circ T^{-1}=\gamma\lambda_{n}.

Therefore (Image Measures and Measures with a Density: Measures, Integrals and Change of Variables (ii) and Integrals of Finite Sums of Nonnegative Functions, and Constant Multiples of a Measure (iii))

∫f∘T dλn=∫f d(λn∘T−1)=∫f d(γλn)=γ∫f dλn,\int f\circ T\,d\lambda_{n}=\int f\,d(\lambda_{n}\circ T^{-1})=\int f\,d(\gamma\lambda_{n})=\gamma\int f\,d\lambda_{n},

which is (iii).

Step 9: integrable functions. Let f:Rn→Rf:\mathbb{R}^{n}\to\mathbb{R} be measurable. By the change of variables for real functions (Image Measures and Measures with a Density: Measures, Integrals and Change of Variables (iii)), f∘Tf\circ T is measurable, and f∘T∈L1(λn)f\circ T\in\mathcal{L}^{1}(\lambda_{n}) if and only if f∈L1(λn∘T−1)=L1(γλn)f\in\mathcal{L}^{1}(\lambda_{n}\circ T^{-1})=\mathcal{L}^{1}(\gamma\lambda_{n}), in which case ∫f∘T dλn=∫f d(γλn)\int f\circ T\,d\lambda_{n}=\int f\,d(\gamma\lambda_{n}). As γ>0\gamma>0, Integrals of Finite Sums of Nonnegative Functions, and Constant Multiples of a Measure (iv) gives f∈L1(γλn)f\in\mathcal{L}^{1}(\gamma\lambda_{n}) if and only if f∈L1(λn)f\in\mathcal{L}^{1}(\lambda_{n}), and then ∫f d(γλn)=γ∫f dλn\int f\,d(\gamma\lambda_{n})=\gamma\int f\,d\lambda_{n}. Together, f∘T∈L1(λn)f\circ T\in\mathcal{L}^{1}(\lambda_{n}) if and only if f∈L1(λn)f\in\mathcal{L}^{1}(\lambda_{n}), and in that case

∫f∘T dλn=∫f d(γλn)=γ∫f dλn,\int f\circ T\,d\lambda_{n}=\int f\,d(\gamma\lambda_{n})=\gamma\int f\,d\lambda_{n},

which is (iv).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…