Skip to main content

All Questions

Filter by
Sorted by
Tagged with
13 votes
1 answer
1k views

An inequality for the spectral radius of matrices used by J. Bochi

I am interested in the history of an inequality for the spectral radius of a $d\times d$ real or complex matrix, which occurs in Jairo Bochi's 2002 article Inequalities for numerical invariants of ...
Ian Morris's user avatar
  • 6,206
12 votes
0 answers
218 views

Which ordering of factors is needed to obtain this kind of determinantal inequalities?

Let $A$ and $B$ be $n\times n$ Hermitian positive definite matrices. The curious determinantal inequality given here, which can be stated as $$\det (A^{4}+ ABBA+BAAB+B^{4})\ge\det(A^{4}+ AABB+BBAA+B^{...
Wolfgang's user avatar
  • 13.4k
35 votes
3 answers
4k views

A curious determinantal inequality

In my study, I come across the following curious inequality, which I do not know a proof yet (so I am asking it here). Let $A, B$ be $n\times n$ (Hermitian) positive definite matrices. It is very ...
M. Lin's user avatar
  • 1,748
1 vote
0 answers
85 views

What are good bounds on ratios of subdeterminants?

Let $A$ be a symmetric matrix and $A_i$ be the matrix obtained from $A$ by dropping the $i^{th}$ row and column. Then what are some good bounds on the value of $\frac{det(A_i)}{det(A)}$ ? Using the ...
user6818's user avatar
  • 1,893
1 vote
1 answer
358 views

Matrix Submodular Inequality

Given $a,b,x > 0$ I know following the submodularity property holds: \begin{align} \frac{1}{a} - \frac{1}{a+x} \geq \frac{1}{a+b} - \frac{1}{a+b+x} \end{align} My question is, does this property ...
OttoVonBismarck's user avatar
1 vote
0 answers
396 views

Bound of spectral radius of polynomial of a complex matrix

I am trying to prove or disprove the following inequality. $$ ||P(A)||_2\leq 2 \max_{\alpha\in W(A)}| P(\alpha)|,$$ where $P(\cdot)$ is a complex polynomial, $A\in \mathbb{C}^{n\times n}$ and $W(A)...
Brian Ding's user avatar
1 vote
0 answers
112 views

Tools to bound the singular values of a finite sum of random matrices from below?

Matrix Chernoff bounds (see also this arXiv paper) are usually used to give upper bounds on the largest eigenvalue of a finite sum of random matrices. Sometimes it can also be used to give a lower ...
olivia's user avatar
  • 111
17 votes
1 answer
2k views

Hlawka inequality for determinants of positive definite matrices

It is mentioned here that if $A, B, C\in M_{n}(\mathbb C)$ are positive semidefinite, then $$\det (A+B+C)+\det C\ge \det (A+C)+\det (B+C)$$ (quoted from this article) and the special case ($C=\bf 0$) $...
Wolfgang's user avatar
  • 13.4k
16 votes
0 answers
808 views

Determinant inequality involving Hermitian, positive definite matrices

Let $A,B,C\in M_{n}(\mathbb C)$ be Hermitian and positive-definite matrices such that $A+B+C=I_{n}$. Show that $$\det\left(6(A^3+B^3+C^3)+I_{n}\right)\ge 5^n\det(A^2+B^2+C^2)$$ This question has been ...
Krokop's user avatar
  • 269
2 votes
1 answer
1k views

An inequality involving traces and matrix inversions

The following question kept me wondering for some time: Given the symmetric matrices $A,B,C\in\mathbb{R}^{n×n}$ where $A$ and $C$ are positive definite (hence invertible), and $B$ is positive ...
borntotry83's user avatar
19 votes
1 answer
856 views

A possible extension of a determinant inequality

It is well known that if $A, B$ are positive semidefinite matrices, then $$\det (A+B)\ge \det A+\det B.$$ I am considering a possible extension of this result. Let $\mathbb{M}_m(\mathbb{M}_n)$ ...
M. Lin's user avatar
  • 1,748
5 votes
0 answers
2k views

A stronger Cauchy-Schwarz inequality for traces of compression matrices

Assume that $A$ and $B$ are contractions, so $I-AA^T$ and $I-BB^T$ are positive-definite matrices. Let $C=(I-AB^T)^{-1}(I-AA^{T})(I-BA^{T})^{-1}$, and show that: $$Tr\left(\frac{1}{1-AA^T}\right)...
math110's user avatar
  • 4,270
26 votes
3 answers
17k views

Hölder's inequality for matrices

I was wondering if the Hölder's inequality was true for matrix induced norms, i.e. if $$\|AB\|_1 \leq \|A\|_p\|B\|_q, \quad\forall p,q \in [1,\infty] \text{ s.t. } \tfrac{1}{p}+\tfrac{1}{q} = 1.$$ But ...
Paglia's user avatar
  • 837
1 vote
1 answer
4k views

How to solve this optimization with the orthogonal constraint?

Problem Supposing that $A$ is a symmetric real matrix and $\{\mathbf{w}\_i\}_{i=1}^n$ is any orthogonal basis on $\mathbb{R}^n$ such that $W^\top W=WW^\top=\mathbf{I}_n$ where $W=\left[\mathbf{w}_1\;\...
ppyang's user avatar
  • 607
4 votes
1 answer
1k views

Generalizing inequality relating Euclidean distance & Frobenius norm to Bregman divergences such as relative entropy & von Neumann divergence

Motivation- A Special Case Supposing $A,B\in\mathbb{S}^{m\times m}$ are symmetric positive semi-definite (SPD) matrices and $\mathbf{x}\in\mathbb{R}^m$ is a unit vector where $\|\mathbf{x}\|=1$, we ...
ppyang's user avatar
  • 607
4 votes
1 answer
977 views

Ratio sum comparison on operators

It is known by the Lidskii inequality, that $\sum_{i=1}^n \left|s_i(S)-s_i(T)\right|\le\sum_{i=1}^n s_i(S+T)$, where $s_i(S)$ is the $i$-th singular value of $S$. How would one prove that $$\sum_{i=1}^...
Ktb's user avatar
  • 41
1 vote
1 answer
719 views

A question on gauge functions

In the second paragraph on Page 71 of the book Matrix Analysis by Bhatia, 1997, it says ``as a consequence of (III.12) we have Theorem III 4.4''. How can one get the inequality in Theorem III 4.4 from ...
user21199's user avatar
2 votes
1 answer
1k views

On an eigenvalue inequality

Let $\lambda_1 (\cdot)$ be the larger absolute value eigenvalue of a $2\times2$ matrix and $\lambda_2 (\cdot)$ the smaller absolute value eigenvalue of a $2\times2$ matrix, i.e. $|\lambda_1 (\cdot)| \...
user20216's user avatar
10 votes
2 answers
7k views

Bounding the trace of a matrix product by the operator norms; generalized Hölder inequality?

$\DeclareMathOperator\Tr{Tr}$Let $A_i$ with $i=1,\dotsc,N$ and $p$ be real $M\times M$ matrices. Further, let $p$ be positive definite, i.e., $p\succ 0$, with $\Tr(p)=1$. Let $0< a_i<1$ and $\...
Tom Marks's user avatar
  • 103
53 votes
7 answers
51k views

Determinant of sum of positive definite matrices

Say $A$ and $B$ are symmetric, positive definite matrices. I've proved that $$\det(A+B) \ge \det(A) + \det(B)$$ in the case that $A$ and $B$ are two dimensional. Is this true in general for $n$-...
user15221's user avatar
  • 541
9 votes
2 answers
1k views

Question on eigenvalue square root subadditivity

ORIGINAL QUESTION Let $\lambda_{1}\left(\cdot\right)$ be the larger eigenvalue of a $2\times2$ matrix and $\lambda_{2}\left(\cdot\right)$ the smaller eigenvalue of a $2\times2$ matrix. Is it true ...
user13773's user avatar
4 votes
1 answer
3k views

Cauchy-like inequality for Kronecker (tensor) product

General question first: upper/lower bound a sum of Kronecker products by its components. More specifically, how is $$ \Vert\sum_{\alpha}S_{\alpha}\otimes B_{\alpha}\Vert$$ bounded by the operator ...
Kaveh Khodjasteh's user avatar
7 votes
4 answers
2k views

Is the componentwise square-root of a positive-definite matrix also pos.-def.?

Let $A=(a_{ij}) \in \mathbb{R}^{n \times n}$ be a matrix with $a_{ij} = a_{ji} \geq 0$ and $B=(b_{ij})$ with $b_{ij} = \sqrt{a_{ij}}$. Is $B$ positive-definite whenever $A$ is? In other words: $\...
Christian Stahlhut's user avatar
6 votes
2 answers
2k views

Tight bound for sum of entries of the inverse of a nonnegative matrix

While playing around with certain non-negative matrices, I got stuck at the following question. Let $A$ be a strictly positive-definite $n \times n$ matrix ($n \ge 3$), with ones on the diagonal, and ...
Suvrit's user avatar
  • 28.6k

1
2