All Questions
28 questions
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 ...
- 1,748
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$) $...
- 13.4k
16
votes
0
answers
488
views
An inequality for matrix norms
Working on a problem in combinatorics I come up with the following inequality on matrix norms, which I checked it also numerically:
Let $A=(a_{ij})$ be a real symmetric $n\times n$ matrix with ...
- 4,484
14
votes
2
answers
574
views
A simple but curious determinantal inequality
Let $A$ and $B$ be $n\times n$ Hermitian positive definite matrices and $k>0$ real. Then $A^k$ is well-defined and experimentally, we have $$\det(A^k+BABA^{-1})\geqslant \det(A^k+BA^{-1}BA),$$or ...
- 13.4k
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^{...
- 13.4k
10
votes
1
answer
615
views
A curious determinantal inequality I
Let $A, B$ be Hermitian matrices. Does the following hold?
$$\det(A^{2}+B^{2}+|AB+BA|)\leq \det(A^{2}+B^{2}+|AB|+|BA|)$$
As usual, $|X|=(X^*X)^{1/2}$. Clearly, quantities on both sides are no less ...
- 1,748
10
votes
1
answer
3k
views
Reverse Minkowski (and related) Determinant Inequalities
For positive semidefinite matrices $A,B,C \in \mathbb{R}^{n\times n}$, the following inequalities are well known:
$$(\det(A+B))^{1/n} \geq (\det A)^{1/n} + (\det B)^{1/n} $$
and
$$\det(A+B+C) + \...
- 716
10
votes
1
answer
630
views
Minimum distance of a symmetric matrix to diagonal matrices
Let $A=(a_{ij})$ be an arbitrary $n \times n$ real symmetric matrix and $n\geq 2$. Let $\| \cdot \|$ denote the operator $2$-norm or equivalently the maximum absolute value of eigenvalues for ...
- 4,484
9
votes
1
answer
535
views
Well known matrix inequality?
I suspect that the following matrix inequality is well known, but I can't find a reference or proof:
Given $n \times n$ symmetric matrices $A,B$ such that $I_n \leq A,B$, is the following true?
$${...
- 1,211
9
votes
1
answer
804
views
A singular value-eigenvalue inequality
Singular value or eigenvalue problems lie at the center of matrix analysis. One classical result is
$$\lambda_{j}(X^{*}X+Y^{*}Y)\geq 2\sigma_j(XY^*)$$
for $j \in \{1, \ldots, n\}$, where $\lambda_j(\...
- 1,748
6
votes
1
answer
446
views
Matrix inequality : trace of exponential of Hermitian matrix
I want to know whether the following inequality holds or not.
\begin{align}
(\mathrm{Tr}\exp[(A+B)/2])^2\leq(\mathrm{Tr}\exp A)(\mathrm{Tr}\exp B)\tag{1}
\end{align}
where $A, B$ are Hermitian ...
- 73
6
votes
1
answer
840
views
Quantum inspired matrix inequality
While mimicking the union bound in quantum systems, we land on the following conjecture but don't know how to prove this. Given any complex-valued $n\times m$ matrix $A$. A sub-matrix of $A$ is ...
- 181
6
votes
0
answers
587
views
Lower bound on the sum of singular values for a sum of Hermitian matrices
Denote the eigenvalues of an $n\times n$ matrix $\mathbf{X}$ by $\lambda_i(\mathbf{X})$ and its singular values by $\sigma_i(\mathbf{X})$, $i=1,\ldots,n$. When $\mathbf{X}$ is Hermitian, we know that $...
- 907
5
votes
1
answer
2k
views
Upper bound of the largest eigenvalue of a PSD block matrix in terms of blocks
Let $\mathbf A=\left[\begin{matrix}\mathbf A_{11}&\mathbf A_{12}\\ \mathbf A_{21}&\mathbf A_{22}\end{matrix}\right]$ be a positive semi-definite matrix, $\mathbf A_{ij}\in\mathbb C^{n\times n}...
- 103
5
votes
0
answers
836
views
Gershgorin's 2nd theorem (disjoint circles): elementary proof?
Let $A \in \mathbb{C}^{n\times n}$ be a complex matrix. We let $a_{i,j}$ be the $\left(i,j\right)$-th entry of $A$ for all $i, j \in \left[n\right]$ (where $\left[n\right]$ denotes $\left\{1,2,\ldots,...
- 33.8k
5
votes
0
answers
586
views
A minimal eigenvalue inequality
Suppose $A$ is an $n\times n$ real symmetric positive definite matrix. Let $A^{(-1)}_{i,j}$ be the $n\times n$ matrix the entries $(i,i),\,(i,j),\,(j,i),\,(j,j)$ of which equal to the corresponding ...
- 2,239
4
votes
1
answer
413
views
Lipschitz property of matrix function only depending on singular values
Let $f$ be a function from $\mathbb{R}^{n\times n}$ to $\mathbb{R}$ such that there exists another symmetric function $g$ (invariant under permutation of coordinates) from $\mathbb{R}^{n}$ to $\mathbb{...
- 1,495
4
votes
0
answers
676
views
Weyl-type inequality for non-Hermitian matrices?
What is the weakest known condition under which a Weyl-type eigenvalue perturbation inequality holds? Does some analogue hold for normal matrices, for example?
- 6,541
3
votes
1
answer
421
views
Inequality for $AB + BA$ when $A,B\geq0$, reference request
Let $A,B\geq0$ be positive semidefinite matrices of arbitrary size $n\times n$. Denote by $\alpha$ and $\beta$ their largest eigenvalues.
It is well-known that the eigenvalues of the expression $AB +...
- 219
2
votes
1
answer
2k
views
An upper bound for a vector with given norm 1 and norm 2
Suppose $X = (x_1, \ldots , x_n)$ is given and we know that $x_i$'s are nonnegative, $\sum_{i=1}^n x_i = n$ and $\sum_{i=1}^n x_i^2 = m $. Just by this information, is it possible to find a vector ...
- 228
2
votes
1
answer
843
views
Bounds on Hilbert-Schmidt norm of difference of products of matrices
I suspect the following is well-known, but don't know of a reference (and it is not close to the area I normally work in).
I have two sequences of matrices $Q_{1},\ldots,Q_{k}$ and $R_{1},\ldots,R_{k}...
- 98
2
votes
0
answers
75
views
Case of equality in entrywise spectral radius bound
Let $A,B$ denote square matrices such that $\lvert A_{ij}\rvert\le B_{ij}$ for all $i,j$, and denote the spectral radius by $\rho$. From the Gelfand spectral radius formula it is easy to see that
$$\...
- 623
2
votes
0
answers
147
views
Is the following inequality true for the norm of Moore-Penrose pseudoinverses?
Let $L$ be a real, positive semi-definite, symmetric, square matrix, with pseudoinverse $L^{+}$. It can be shown for the operator norms $||.||_{op}$ that: if $L$ is invertible and $||I - L||_{op} < ...
- 1,467
1
vote
1
answer
1k
views
Bounding the positive semi-definite matrix with its block diagonal matrix [closed]
Can we bound $\mathbf{A}$ with $\mathbf{A^*}$ as ${\bf{A}} \preceq {{\bf{A}}^*}$ where
\begin{equation}
{\bf{A}} = \left[ {\begin{array}{*{20}{c}}
{{{\bf{A}}_{11}}}&{...}&{{{\bf{A}}_{1N}}}\\
...
- 383
1
vote
1
answer
153
views
How to solve for bounds restricting ${\Sigma}$ to symmetric-positive-semi-definiteness?
Scenario
I have a equation for a covariance matrix ${\Sigma}$ where everything but a vector of correlations is known aka $x=(x_{1}, \dots, x_{D})$ for $x_{i}\in [-1, 1]$.
Problem
I know that ${x}$ ...
1
vote
0
answers
87
views
Approximation bounds for matrix multiplication
$\DeclareMathOperator{\op}{\mathrm{op}}$Since matrix multiplication is continuous, I expect that if $A_n\to A\in \mathrm{Mat}_{d\times d}(\mathbb{R})$ for the operator-norm and if $x_n\to x$ in $\...
- 5,405
0
votes
2
answers
160
views
A matrix between vectors, and inequality!
I have an inequality as follows
$$s^T\phi\leq -|s|^TA$$
where $s$, $\phi$ and $A$ are vectors with appropriate dimensions. I want to prove that this inequality holds for the following too
$$s^TM\...
- 29
0
votes
0
answers
68
views
Inequality between product of companion matrices and power of Pisot number
Let $d\geqslant 2$ be an integer and consider a convergent sequence of "companion" matrices
$$A_k := \begin{pmatrix}
a_{k,1} & a_{k,2} & \cdots & a_{k,d} \\\
& ...
- 101