## Extensions to the Golden-Thompson inequality?

### Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

Let $A$ and $B$ be two Hermitian matrices. The famous Golden-Thompson inequality states that

$$\text{tr}(e^{A+B}) \le \text{tr}(e^Ae^B)$$

However, for determinants we have equality

$$\det(e^{A+B}) =\det(e^Ae^B)$$

I was wondering if similar results can be shown, if instead of trace and determinant, we use any of the other fundamental scalar functions of a matrix (e.g., trace is $\phi_1(X) :=\sum_i \lambda_i(X)$; $\phi_2(X)=\sum_{i \neq j} \lambda_i(X)\lambda_j(X)$, determinant is $\phi_n$)

PS: Please feel free to add more tags, if you deem it to be necessary.

-

## 1 Answer

This is theorem IX.3.5 in "Matrix analysis" by R. Bhatia (Graduate Texts in Mathematics, 169). See also corollary IX.3.6 and theorem IX.3.7. The Golden-Thompson inequality holds when $Tr$ is replaced with a function $f$ which satisfies $f(XY)=f(YX)$ and $|f(X^{2m})|\le f(|XX^{\ast}|^m)$ for all $m\geq 1$. Such functions can be the elementary symmetric functions in the eigenvalues as in your question, the product of the $k$ largest eigenvalues (in absolute value) etc.

-
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 11, "mathjax_display_tex": 2, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.8629586100578308, "perplexity_flag": "head"}