TheoremBase

Trace Inequalities for Positive Semidefinite Matrices

For a positive semidefinite P, X ↦ tr(PX) is nonnegative on positive semidefinite matrices, monotone in the semidefinite ordering, and lies between λ_n(X) tr P and λ_1(X) tr P.

Statement

In the setting of Symmetric and Positive Semidefinite Matrices, the Operator Norm and Spectral Notation, let n∈Nn\in\mathbb{N}, let P∈S(n)P\in\mathcal{S}(n) be positive semidefinite, and let X∈S(n)X\in\mathcal{S}(n). Write tr⁡\operatorname{tr} for the trace and λ1(X)≥⋯≥λn(X)\lambda_{1}(X)\ge\dots\ge\lambda_{n}(X) for the ordered eigenvalues of XX.

Nonnegativity. If XX is positive semidefinite, then tr⁡(PX)≥0\operatorname{tr}(PX)\ge0.

Monotonicity. If Y∈S(n)Y\in\mathcal{S}(n) and X⪯YX\preceq Y, then tr⁡(PX)≤tr⁡(PY)\operatorname{tr}(PX)\le\operatorname{tr}(PY).

Eigenvalue bounds.

λn(X)tr⁡(P)≤tr⁡(PX)≤λ1(X)tr⁡(P).\lambda_{n}(X)\operatorname{tr}(P)\le\operatorname{tr}(PX)\le\lambda_{1}(X)\operatorname{tr}(P).

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…