TheoremBase

Proof

Let ξ\xi be a point of Euclidean space Rn\mathbb{R}^n, a real vector space by Euclidean Space Rn\mathbb{R}^n is a Real Vector Space, with the dot product; write PζP\zeta for the matrix-vector product and set z=ι(ξ,ξ)∈Rn+nz=\iota(\xi,\xi)\in\mathbb{R}^{n+n}, where ι\iota is the concatenation map of Concatenation Identifies a Product of Euclidean Spaces with a Euclidean Space.

First, 0 t=00\,t=0 for every t∈Rt\in\mathbb{R}, since 0 t=(0+0) t=0 t+0 t0\,t=(0+0)\,t=0\,t+0\,t by distributivity and claim 2 of Additive Cancellation and Elementary Additive Identities in a Field applies; consequently t+(−1) t=(1+(−1)) t=0t+(-1)\,t=(1+(-1))\,t=0, so (−1) t=−t(-1)\,t=-t by claim 1 of that lemma. In particular 0n=0 In0_n=0\,I_n by Scalar Multiple of a Real Matrix and Identity Matrix.

By claims 1 and 2 of Linearity of the Matrix-Vector Product and the Quadratic Form as a Double Sum, 0nξ=(0 In)ξ=0 (Inξ)=0 ξ0_n\xi=(0\,I_n)\xi=0\,(I_n\xi)=0\,\xi, and by claim 5 of Bilinearity and Symmetry of the Dot Product on Rn\mathbb{R}^n, ξ⋅(0 ξ)=0 (ξ⋅ξ)=0\xi\cdot(0\,\xi)=0\,(\xi\cdot\xi)=0. By the same two claims, ξ⋅((βIn)ξ)=β (ξ⋅ξ)\xi\cdot\bigl((\beta I_n)\xi\bigr)=\beta\,(\xi\cdot\xi) for every β∈R\beta\in\mathbb{R}, and

ξ⋅((−Y)ξ)=ξ⋅((−1)(Yξ))=(−1)(ξ⋅(Yξ))=− ξ⋅(Yξ).\xi\cdot\bigl((-Y)\xi\bigr)=\xi\cdot\bigl((-1)(Y\xi)\bigr)=(-1)\bigl(\xi\cdot(Y\xi)\bigr)=-\,\xi\cdot(Y\xi).

Applying claim 2 of Action and Quadratic Form of a Block Matrix to MM, with both arguments of ι\iota equal to ξ\xi on each side,

z⋅(Mz)=ξ⋅(Xξ)+ξ⋅(0nξ)+ξ⋅(0nξ)+ξ⋅((−Y)ξ)=ξ⋅(Xξ)−ξ⋅(Yξ).z\cdot(Mz)=\xi\cdot(X\xi)+\xi\cdot(0_n\xi)+\xi\cdot(0_n\xi)+\xi\cdot\bigl((-Y)\xi\bigr)=\xi\cdot(X\xi)-\xi\cdot(Y\xi).

Applying the same claim to NN, and writing c=ξ⋅ξc=\xi\cdot\xi,

z⋅(Nz)=α c+(−α) c+(−α) c+α c=0,z\cdot(Nz)=\alpha\,c+(-\alpha)\,c+(-\alpha)\,c+\alpha\,c=0,

since (−α) c=−(α c)(-\alpha)\,c=-(\alpha\,c) by the identity (−1) t=−t(-1)\,t=-t together with associativity of multiplication.

The hypothesis M⪯NM\preceq N, applied to the point zz, gives z⋅(Mz)≤z⋅(Nz)=0z\cdot(Mz)\le z\cdot(Nz)=0, that is

ξ⋅(Xξ)−ξ⋅(Yξ)≤0.\xi\cdot(X\xi)-\xi\cdot(Y\xi)\le0 .

By claim 3 of Elementary Arithmetic in an Ordered Field, together with claims 4 and 6 of Additive Cancellation and Elementary Additive Identities in a Field, this is equivalent to 0≤ξ⋅(Yξ)−ξ⋅(Xξ)0\le\xi\cdot(Y\xi)-\xi\cdot(X\xi) and hence, by claim 3 of Elementary Arithmetic in an Ordered Field again, to

ξ⋅(Xξ)≤ξ⋅(Yξ).\xi\cdot(X\xi)\le\xi\cdot(Y\xi).

Since ξ∈Rn\xi\in\mathbb{R}^n was arbitrary, X⪯YX\preceq Y by The Positive Semidefinite Ordering on Symmetric Matrices.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…