Papers

Topics

Authors

Recent

View all

Assistant

AI Research Assistant

Well-researched responses based on relevant abstracts and paper content.

Custom Instructions Pro

Preferences or requirements that you'd like Emergent Mind to consider when generating responses.

Gemini 2.5 Flash

Gemini 2.5 Flash 71 tok/s

Gemini 2.5 Pro 48 tok/s Pro

GPT-5 Medium 23 tok/s Pro

GPT-5 High 17 tok/s Pro

GPT-4o 111 tok/s Pro

Kimi K2 161 tok/s Pro

GPT OSS 120B 412 tok/s Pro

Claude Sonnet 4 35 tok/s Pro

2000 character limit reached

A trace inequality for positive definite matrices (1011.6325v1)

Published 20 Nov 2010 in math.FA

Abstract: In this note we prove that Tr (MN+ PQ)>= 0 when the following two conditions are met: (i) the matrices M, N, P, Q are structured as follows: M = A -B, N = inv(B)-inv(A), P = C-D, Q =inv (B+D)-inv(A+C), where inv(X) denotes the inverse matrix of X (ii) A, B are positive definite matrices and C, D are positive semidefinite matrices.