TheoremBase

Testing a Block Semidefinite Inequality on the Diagonal

Statement

Let nn be a natural number with 1≤n1\le n, let R\mathbb{R} be the real numbers, let α∈R\alpha\in\mathbb{R}, and let XX and YY be symmetric real n×nn\times n matrices. Write InI_n for the identity matrix of size nn, write 0n0_n for the real n×nn\times n matrix all of whose entries are the additive identity 00 of R\mathbb{R}, and write μP\mu P for the scalar multiple of a matrix PP; set −Y=(−1)Y-Y=(-1)Y and −αIn=(−α)In-\alpha I_n=(-\alpha)I_n. The matrices 0n0_n and InI_n are symmetric, their entries being unchanged when the two indices are interchanged, and hence so are −Y-Y, αIn\alpha I_n and −αIn-\alpha I_n by claim 1 of The Positive Semidefinite Ordering is a Partial Order Compatible with the Linear Structure; moreover 0n⊤=0n0_n^{\top}=0_n and (−αIn)⊤=−αIn(-\alpha I_n)^{\top}=-\alpha I_n with the transpose.

Let

M=(X0n0n−Y),N=(αIn−αIn−αInαIn)M=\begin{pmatrix}X&0_n\\0_n&-Y\end{pmatrix},\qquad N=\begin{pmatrix}\alpha I_n&-\alpha I_n\\-\alpha I_n&\alpha I_n\end{pmatrix}

be the block matrices determined by these blocks; both are symmetric real (n+n)×(n+n)(n+n)\times(n+n) matrices by claim 3 of Action and Quadratic Form of a Block Matrix. Write P⪯QP\preceq Q for the positive semidefinite ordering.

If M⪯NM\preceq N, then X⪯YX\preceq Y.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…