Skip to main content

All Questions

Tagged with
Filter by
Sorted by
Tagged with
2 votes
0 answers
100 views

An inequality related to Problem 10210 AMM 1992 No. 3

Problem. Let $A$ be a $N \times N$ real matrix whose $(i,j)$ entry is $a_{ij} \ge 0, \forall i, j$. Let $1$ denote $N\times 1$ all-ones vector. Prove that $$N^2 1^\top A^\top A A^\top 1 \ge (1^\top A ...
River Li's user avatar
  • 1,053
0 votes
0 answers
57 views

Class of covariance matrices invariant under permutations

I am reading a paper on covariance matrix estimation, and in this paper is introduced a class of covariance matrices: \begin{equation} U(q, c_0(p),M)=\{\Sigma: \sigma_{ii}\leq M,\quad \max_j\sum_{j=1}^...
spenziak's user avatar
1 vote
2 answers
86 views

Entrywise $\infty$-norm of squared difference of square roots of matrices

For a positive $n \times n$ definite real matrix $M$ we denote by $\sqrt{M}$ the positive square root of $M$. For an $n \times n$ matrix $A$ denote its entrywise infinity norm by $$\|A\|_{\infty,\...
ssss nnnn's user avatar
  • 177
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} \\\ & ...
Kermatoni's user avatar
  • 101
3 votes
0 answers
118 views

A matrix-valued analogue of a classical inequality

Let $p \geq 4$ be an even integer. In the study of variational problems in $W^{1, p}$, it is handy to know that for $a, b \in \mathbb R^d$, $$|a - b|^p \leq 2^{p - 1} (|a|^{p - 2} + |b|^{p - 2}) |a - ...
Aidan Backus's user avatar
2 votes
0 answers
160 views

An "almost" true inequality for Hermitian matrices

Let $A$ be an $N\times N$ Hermitian matrix. For $p+q$ even, consider the following inequality: $$\frac{1}{N}\sum_{i=1}^N (A^p)_{ii} (A^q)_{ii} \geq \Big(\frac{1}{N}\sum_{i=1}^N (A^p)_{ii} \Big) \Big(\...
WunderNatur's user avatar
8 votes
3 answers
595 views

Jensen-like inequality for random matrix: $\Bbb E[\det X^2]\ge\det\Bbb E[X^2]$

Let $X\in M_n(\Bbb R)$ be a random matrix with iid elements following a continuous distribution. What are the necessary and sufficient conditions for $$\Bbb E[\det X^2]\ge\det\Bbb E[X^2]$$ to hold? Is ...
TheSimpliFire's user avatar
2 votes
0 answers
51 views

What conclusions can I derive from this family of trace inequalities?

Problem. Let $n_1,\ldots,n_s,m_1,\ldots,m_s\ge 0$ be nonnegative integers and set $m := \sum_{i=1}^s m_i$ and $n := \sum_{i=1}^s n_i$. Let $\oplus$ be an operation on matrices which stacks them in a ...
eepperly16's user avatar
5 votes
1 answer
474 views

An inequality for certain positive-semidefinite matrices

Suppose that $G=(G_{ij})$ is a positive-semidefinite symmetric matrix with the diagonal entries all equal $1$ and all off-diagonal entries $\le0$. Does it then necessarily follow that $$\sum_{i,j}(G^5)...
Iosif Pinelis's user avatar
8 votes
1 answer
412 views

Big triples in a matrix

Consider an $n\times n$ real matrix $A=(a_{ij})$ with non negative entries. Assume that - the sum of the three largest entries in each row is a constant $R$ (the same for all rows), - the sum of the ...
Yaakov Baruch's user avatar
3 votes
2 answers
249 views

Extend an inequality on matrix norms

Let $A$ denote an $n \times n$ matrix, and $\sigma_i(\cdot)$ denote $i$-th largest singular value. Can we extend the following result to general $p \geq 1$? For all $k = 1, \dots, n$, $$ \sum_{i = 1}^...
Xiangxiang Xu's user avatar
1 vote
0 answers
216 views

Schatten norm inequality

Let $A,B$ be two $n\times n$ matrices. Find a lower bound of the $p$-th Schatten norm $\|(A-B)(A-B)^\ast\|_{S_{p/2}}^{1/2}$ in terms of Schatten norm of $\|(AA^*+BB^*)\|_{S_q}$ for any relation ...
volond's user avatar
  • 97
8 votes
0 answers
400 views

When do we have $\|X - Y\| = \|\Sigma(X) - \Sigma(Y)\|$?

For any $X \in \mathbb{C}^{m\times n}$, let $\Sigma(X)$ be the "middle factor" in its SVD, so that $X = U\Sigma(X) V^H$ and the diagonal of $\Sigma(X)$ is arranged in descending order. ...
Nuno's user avatar
  • 269
2 votes
0 answers
97 views

Fractional reverse direction Cauchy-Schwarz inequality

If $Z_1,\dots,Z_r$ are complex $m\times m$-matrices, then let $\Phi(A_1,\dots,A_r):M_m(\mathbb{C})\rightarrow M_m(\mathbb{C})$ be the linear mapping defined by $\Phi(A_1,\dots,A_r)(X)=A_1XA_1^*+\dots+...
Joseph Van Name's user avatar
1 vote
0 answers
103 views

Is the rank preserved when the spectral radius is maximized?

If $A$ is a matrix, then let $\rho(A)$ denote the spectral radius of $A$. If $A=(a_{i,j})_{i,j}$, then let $\overline{A}=(\overline{a_{i,j}})_{i,j}$. Suppose that $A_1,\dots,A_r\in M_{n}(\mathbb{C})$ ...
Joseph Van Name's user avatar
4 votes
1 answer
147 views

prove spectral equivalence bounds for inverse fractional power of matrices

The question is an extention to the answered question prove spectral equivalence bounds for fractional power of matrices. Let $A, D \in \mathbb{R}^{n \times n}$ be two symmetric,positive definite and ...
Luna947's user avatar
  • 75
3 votes
1 answer
80 views

prove spectral equivalence bounds for fractional power of matrices

Let $A, D \in \mathbb{R}^{n \times n}$ be two symmetric,positive definite and tri-diagonal matrices for that we know that they are spectrally equivalent, thus ist holds $$ c^- x^\top D x \le x^\top A ...
Luna947's user avatar
  • 75
2 votes
2 answers
264 views

Prove spectral equivalence of matrices

Let $A,D \in \mathbb{R}^{n\times n}$ be two positive definite matrices given by $$ D = \begin{bmatrix} 1 & -1 & 0 & 0 & \dots & 0\\ -1 & 2 & -1 & 0 & \dots & 0\\...
Luna947's user avatar
  • 31
3 votes
2 answers
839 views

An inequality for the spectral radius of block matrices

Let $d,m$ be positive integers. Suppose that $A_{i,j}$ is a $d\times d$-matrix with real entries whenever $i,j\in\{1,\dots m\}$. Let $A$ be the $dm\times dm$ matrix that can be written as a block ...
Joseph Van Name's user avatar
5 votes
1 answer
197 views

The largest $\ell_p$-norm of a sum of rows of a Sylvester-Hadamard-Walsh matrix

Given any $n\in\mathbb N$, consider the the Sylvester-Hadamard-Walsh matrix $M=(a_{i,j})_{i,j\in 2^n}$ of size $2^n\times 2^n$ and for a number $p\in[1,\infty)$, let $$\nu_{n,p}=\max_{F\subseteq 2^n}\...
Taras Banakh's user avatar
  • 41.8k
3 votes
1 answer
427 views

Minimum upper bound for sum of the entries of the inverse covariance matrix

Let $x \in \mathbb{R}^n$ and $k$ is RBF kernel $$k(x, x') := \exp \left(-\frac{\|x-x'\|^2}{2\sigma^2}\right)$$ and let $\mathbf{K}$ be the following $n \times n$ covariance matrix $$\mathbf{K} = \...
Maryam Bahrami's user avatar
2 votes
1 answer
337 views

Operator norm of triangular truncation on symmetric matrices

Inspired by this question. It is known that for the matrix $T_n \in \mathcal{M}_n$ (the space of real-valued $n \times n$ matrices) defined by \begin{equation*} (T_n)_{ij} = \begin{cases} 1 & i \...
SAWblade's user avatar
3 votes
0 answers
49 views

Stability of matrix equation

Let $M=I+A\in \mathbb{R}^{n\times n}$ for a skew-symmetric matrix $A$ with $\|A\|<1$ in the spectral norm. Using the $LU$-decomposition of $M$, it is easy to construct a solution $L,U\in \mathbb{R}^...
user3095304's user avatar
3 votes
1 answer
297 views

Showing the positivity of the determinant of $\mathfrak{sp}(n)$ without making use of diagonalization

Let $\mathfrak{sp}(n)$ be the lie algebra of compact symplectic group $\mathrm{SP}(n)$, regarded as a compact form of $\mathfrak{sp}(2n,\mathbb{C})$, so we can talk about its (complex) determinant. ...
Chan Ki Fung's user avatar
14 votes
4 answers
1k views

An inequality on some pairs of orthogonal vectors

Let $n,k\geq 1$. Suppose that $a_1, \ldots, a_n\in \mathbb{R}^k$, $b_1, \ldots, b_n\in \mathbb{R}^k$ and $a_i^T b_i = 0$ for $i=1,\dots, n$. Is it true that $$ \sum_{i=1}^n \|a_i\|_2^2 + \sum_{i=1}^n \...
Mahdi - Free Palestine's user avatar
0 votes
1 answer
109 views

Could someone help me to prove or disprove the following inequality?

Let $(c_{nr})$ be an $N\times R$ complex matrix, then $\forall z_n \in \mathbb{C}$, we have $$ \sum_r \Big|\sum_n c_{nr}z_n\Big|^2 \geq \frac{1}{\sigma_{max}} \sum_n |z_n|^2 $$ where $\sigma_{max}$ is ...
Milin's user avatar
  • 395
0 votes
1 answer
81 views

A matrix inequality involving a singular matrix

I have three matrices $A \in \mathbb R^{n \times n}$, $B \in \mathbb R^{n \times n}$, and $X \in \mathbb R^{n \times n}$. Suppose that $A$ is singular, $B = B^\top > 0$ and $X = X^\top > 0$. ...
livehhh's user avatar
  • 85
5 votes
1 answer
241 views

Trace inequality under consideration of definiteness

Let $G \in \mathbb{R}^{3 \times 3}$ a symmetric, but indefinite matrix and $U \in \mathbb{R}^{3\times 3}$ a symmetric and positive definite matrix. I would like to prove the inequality $$ \text{Tr} \...
TARS's user avatar
  • 51
3 votes
0 answers
155 views

Frobenius inner product of a zero line-sum matrix and a doubly stochastic matrix

Let $A$, $B$ be two $n\times n$ real matrices. Let $A$ be a zero line-sum matrix where each row sum and each column sum equals zero, i.e., $$\sum_{i=1}^{n}a_{ij}=\sum_{j=1}^{n}a_{ij}=0 $$ (it seems ...
Lo Celso's user avatar
11 votes
1 answer
1k views

A square root inequality for symmetric matrices?

In this post all my matrices will be $\mathbb R^{N\times N}$ symmetric positive semi-definite (psd), but I am also interested in the Hermitian case. In particular the square root $A^{\frac 12}$ of a ...
leo monsaingeon's user avatar
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 ...
s hukahi's user avatar
4 votes
0 answers
455 views

Inequalities for trace/eigenvalues of product of multiple 2x2 matrices

Consider the matrix product $\prod_i^n A_i$, where each $A_i$ is a $2\times2$ matrix having the form $A_i = \left( \begin{smallmatrix} \lambda + \alpha_i & -\beta_i \\ 1 & 0\end{smallmatrix}\...
Artemy's user avatar
  • 695
0 votes
2 answers
124 views

Bounding $E[\|\Sigma^{-1/2}(X-\mu)\|_2^3]$ for 2-dimensional Bernoulli

Let $X\in\{0,1\}^2$ have mean $\mu=\left[\begin{smallmatrix}p_1\\p_2\end{smallmatrix}\right]$ and $\Pr[X_1 = X_2 = 1] = p\le \min\{p_1,p_2\}$. (Note we must have $1-p_1-p_2+p\ge 0$ for the ...
Thomas Dybdahl Ahle's user avatar
2 votes
0 answers
106 views

Connections between eigenvalues of $B$ and $A+iB$

Consider two symmetric and real matrices $A,B\in\mathbb{R}^n$ and definie $A+iB$. Note that $A+iB$ is not hermitian in this case. There are many results based on Brendixson and Courant-Fischer, saying,...
Stephan's user avatar
  • 21
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 $$\...
Julian's user avatar
  • 623
1 vote
0 answers
52 views

About means of positive definite matrices

This question is related to this recent one. Recall that on the cone $SPD_n$ of $n\times n$ symmetric positive definite matrices, there are various notions of means, which extend the same notions ...
Denis Serre's user avatar
  • 52.3k
10 votes
1 answer
629 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 ...
Mostafa - Free Palestine's user avatar
1 vote
0 answers
422 views

Integral of matrix determinant with respect to Lebesgue measure

$\newcommand\norm[1]{\lVert#1\rVert} \newcommand\opnorm[1]{\norm{#1}_{\text{op}}} \newcommand\Frnorm[1]{\norm{#1}_{\text F}}$Define \begin{align*} S_t=\{ (A,B)\in\mathbb{R}^{n\times n}\times\...
neverevernever's user avatar
-1 votes
1 answer
330 views

Holder inequality for a general rectangular matrix

Let $A \in \mathbb{R}^{m\times n}$ and $p,q \in \mathbb{R}^{+}$ such that $\frac{1}{p}+\frac{1}{q}=1$. I am interested to prove the following: $$ \|A\|_{p}=\|A^T\|_q$$ I have tried using Holder ...
Prashant Govindarajan's user avatar
3 votes
2 answers
375 views

Inequality for 0-1 matrices

Given an $n \times n$-matrix $A$ with entries only $0$ or $1$ and determinant equal to $\pm 1$. Define the magnitude $M_A$ of $A$ as the sum of all entries of the inverse of $A$. Question 0: Do we ...
Mare's user avatar
  • 26.5k
8 votes
1 answer
678 views

Inequality involving tensor product of orthonormal unit vectors

Let $e_1,...,e_r$ be the first $r$ standard basis of $\mathbb{R}^n, r<n$. Let $u_1,...,u_n$ be another orthonormal basis of $\mathbb{R}^n$. Let $\otimes$ be the tensor product on $\mathbb{R}^n$ and ...
neverevernever's user avatar
9 votes
2 answers
1k views

$2$-norm distance between square roots of matrices

Suppose two square real matrices $A$ and $B$ are close in the Schatten 1-norm, i.e. $\|A-B\|_1=\varepsilon$. Can this be used to put a bound on the Schatten 2-norm distance between their square roots. ...
Pratik Rath's user avatar
1 vote
1 answer
144 views

Matrix inequalities for the moment of the fixed Shatten norm

Let $A_i, i=1, \ldots, N$ be real (or complex) matrices of the same dimension. Let $r_i, i=1, \ldots, N$ be independent Rademacher random variables. The following inequality gives a bound on the ...
user124297's user avatar
5 votes
1 answer
644 views

A conjecture about the submatrix of orthogonal matrix

Let $U$ be an $n\times n$ orthogonal matrix, i.e. $U\in\mathbb{R}^{n \times n}$. For any non-empty ordered sets $S_1,S_2\subset\{1,2,...,n\}$, define $U_{S_1S_2}$ to be an $|S_1|\times|S_2|$ submatrix ...
neverevernever's user avatar
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{...
neverevernever's user avatar
9 votes
2 answers
912 views

A Matrix Inequality for positive definite matrices

Let $X$ and $Y$ be positive semi-definite self-adjoint complex matrices of same finite order. The, is it true that $|X-Y|\leq X+Y$ where for any matrix $A$, $|A|$ is defined to be $|A|:=(A^*A)^{\frac{...
A beginner mathmatician's user avatar
1 vote
0 answers
111 views

Matrix eigenvalues inequality (2)

Suppose that $A$ is a $n\times n$ positive matrix, whose eigenvalues are $a_1\ge a_2\ldots \ge a_n>0;$ $B$ is a $m \times m$ positive matrix, whose eigenvalues are $b_1\ge b_2\ldots \ge b_m>0;$ ...
Xiaopai Song's user avatar
2 votes
1 answer
376 views

Matrix eigenvalues inequality (1)

Assume that $A$ is a $n\times n$ positive matrix, whose eigenvalues are $a_1\ge a_2\ldots \ge a_n>0;$ $B$ is a $p \times p$ positive matrix, whose eigenvalues are $b_1\ge b_2\ldots \ge b_p>0.$ ...
Xiaopai Song's user avatar
16 votes
0 answers
487 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 ...
Mostafa - Free Palestine's user avatar
6 votes
1 answer
487 views

Intuitive proof of Golden-Thompson inequality

Sutter et al. [1] in their paper "Multivariate Trace Inequalities" give an intuitive proof of the following Golden-Thompson inequality: For any hermitian matrices $A,B$: $$ \text{tr}(\exp{(A+B)}) \...
Saket Choudhary's user avatar