All Questions
187 questions
0
votes
0
answers
149
views
L_q matrix inequality
The following arose out of studying $\ell_q$ Lewis weights. Let $P$ be a real $n \times n$ orthogonal projection matrix (i.e., $P$ is symmetric and $P^2 = P$) and let $W$ be the diagonal matrix ...
- 101
-1
votes
1
answer
172
views
$A\geq B\Rightarrow A^{-1}\leq B^{-1}$ entrywise for pos.def. symmetric matrices?
My question follows from https://math.stackexchange.com/questions/3857976/inverse-inequality-of-symmetric-matrix. Suppose we assume that $A$ and $B$ are two positive definite matrices with positive ...
- 188k
2
votes
0
answers
588
views
Bounding Frobenius norm of pseudo-inverse
$\DeclareMathOperator{\F}{\mathrm{F}}$Let $\mathbf{A}$ and $\mathbf{A}^\prime$ be two $m\times n$ matrix such that $\|\mathbf{A}-\mathbf{A}^\prime\|_{\F}\leq \delta$. Is there any bound for the ...
- 63.9k
4
votes
3
answers
239
views
Properties of matrix $X=\left[\frac{1}{1-\bar\alpha_i \alpha_j}\right]_{ij}$
Let $\{\alpha_i\}_{i=1}^n$ be complex numbers such that $|\alpha_i|<1$, and consider the following $n\times n$ structured matrix
$$
X=\left[\frac{1}{1-\bar\alpha_i \alpha_j}\right]_{ij}.
$$
Such ...
- 1,769
5
votes
1
answer
909
views
Proving a majorization inequality for the singular value of the product of two matrices without using tensor product
For any two matrices $\mathbf{A},\mathbf{B} \in \mathbb{C}^{n \times n}$, we know that the following majorization inequality holds
$$
\tag{1}
\label{grz}
\sigma^{\downarrow}(\mathbf{A}\mathbf{B}) \...
- 10.1k
4
votes
0
answers
1k
views
Can an orthogonal matrix move monotonically toward a signed permutation matrix?
The question is motivated by this question on Mathematics SE.
Let $A \in O(n)$ be an orthogonal matrix that is not a signed permutation matrix, and let $P$ be the nearest signed permutation matrix to $...
- 209
1
vote
1
answer
61
views
Effect of column normalization on maximum diagonal entry
Let $\mathbf{A}$ be a $M\times N$ complex matrix, and $\bar{\mathbf{A}}$ be constituted by normalizing each column of $\mathbf{A}$. Therefore, we have
$$\mathbf{A}=\bar{\mathbf{A}}\mathbf{\Gamma},$$
...
CommunityBot
- 1
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 ...
- 6,351
0
votes
0
answers
47
views
"Probability" for a partitioned matrix to be singular
Let $A,B\in\mathbb{R}^{n\times n}$ be two nonsingular matrices with $A\ne B$, and consider the following partitioned matrix
$$
M:=\begin{bmatrix}AA^\top + BB^\top & A^\top \Delta_1 A + B^\top \...
- 2,712
2
votes
0
answers
1k
views
Estimates on norm Hessian Matrix
Let $u:\Omega \rightarrow \mathbb{R}$ a twice differential function, with $\Omega$ a subset of $\mathbb{R}^n$.
Suppose that we have the following:
$$D^2u\geq - \dfrac{(1+K^2)^{1/2}}{\epsilon}I$$
...
- 6,357
8
votes
3
answers
663
views
Representation theorem for matrices (reference request)
Motivation. If $A \in \mathbb{C}^{n \times n}$ is self-adjoint (or, more generally, normal), then we all know that
$$
A = \sum_{k=1}^n \lambda_k \, h_k \otimes h_k,
$$
where $\lambda_1,\dots,\lambda_n$...
- 52.3k
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
$$\...
0
votes
1
answer
91
views
Choosing the best submatrix
Let $\mathbf{A}_{m\times n}$ be a matrix with non-negative elements. Assume that a submatrix $\mathbf{B}$ from $\mathbf{A}$ is defined as
\begin{align}
B_{i,j} =
\begin{cases}
A_{i,j}, & i\in\...
- 5,429
0
votes
0
answers
96
views
Eigenvalues of the matrix obtained by letting some of the rows vanish, hoping for some inequality
Let $A$ be an $n \times n$ matrix. Let $A_k$ be the matrix obtained by keeping the first $k$ rows of $A$ fixed and substituting $0$ for the rows $k+1$ to $n$. To be precise, we write $A= [R_1...R_k, ...
- 1,465
0
votes
0
answers
400
views
Comparison of two similarity matrices
English is not my first language, so please excuse any mistakes.
I'm working with two similarity matrices on the same data set: Suppose I have $n$ items, and I calculated the similarity of each item ...
- 1
8
votes
1
answer
1k
views
Operator norm of square root of matrix vs original
If I have a nonsymmetric matrix whose operator norm is $\leq 1$ and square root it, does its operator norm remain below $1$?
More formally, I want to know whether there is always at least one square ...
- 63.9k
14
votes
4
answers
3k
views
Vandermonde matrix is totally positive
A totally positive matrix $M\in \mathcal{M}_{n\times m}(\mathbb R)$ is such that all of its minors of all sizes are positive. It is true that any Vandermonde matrix (with well-ordered positive entries)...
- 24.2k
21
votes
1
answer
2k
views
Almost commuting unitary matrices
Suppose that $A_1,\dots, A_k$ are unitary matrices such that any two of them can be approximated by commuting unitary matrices. i.e. for any $i$ and $j$, there are unitary matrices $A_i'$ and $A_j'$ ...
- 9,486
1
vote
0
answers
132
views
Transformations preserving the number of distinct eigenvalues
Let $A\in\mathbb{R}^{n\times n}$ be an $n\times n$ symmetric, invertible matrix with nonnegative real entries, $\mathbf{1}$ be the all one $n$-dimensional vector, and $\mathrm{diag}(v)$, $v=[v_1,v_2,\...
- 2,712
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 ...
CommunityBot
- 1
2
votes
1
answer
498
views
Does the Perron vector maximize $x^TAx$ in the simplex?
Let $\mathbf{A}$ be any $n\times n$ symmetric positive matrix ($A_{ij}>0$). It is easy to show that the solution to the following optimization problem
\begin{align}
\max_{\mathbf{x}}~~\mathbf{x^...
0
votes
1
answer
129
views
Hadamard $\ell_2$ sum of two symmetric positive semidefinite matrices
This is a follow-up question to this and this.
Let $A=(a_{ij})$ and $B=(b_{ij})$ be symmetric positive semidefinite $n\times n$ matrices such that all $a_{ij}\geq 0$, $b_{ij}\geq 0$ and $a_{ii}=b_{ii}...
- 175
2
votes
0
answers
92
views
Hadamard $\ell_p$ sum of two symmetric positive semidefinite matrices: follow-up
I asked the following question here: "Does there exist $p>1$ such that for all $n\geq 2$, if $(a_{ij})$ and $(b_{ij})$ are symmetric positive semidefinite $n\times n$ matrices and $a_{ij}, b_{ij}\...
- 175
3
votes
1
answer
381
views
Hadamard $\ell_p$ sum of two symmetric positive semidefinite matrices
Does there exist $p>1$ such that for all $n\geq 2$, if $(a_{ij})$ and $(b_{ij})$ are symmetric positive semidefinite $n\times n$ matrices and $a_{ij}, b_{ij}\geq 0$ then $\bigl(\|(a_{ij},b_{ij})\|...
- 61.9k
5
votes
1
answer
402
views
Best orthogonal approximation of rank 1 matrix
Let $X=\lambda_0u_0v_0^T\in\mathbb{R}^{n\times n}$ be a rank 1 matrix where $\lambda_0\in\mathbb{R}$, $u_0,v_0$ are of unit Euclidean norm. What is the solution of the following problem?
$$\hat{X}=\...
- 6,351
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{...
- 7,514
3
votes
1
answer
172
views
Representation of $4\times4$ matrices in the form of $\sum B_i\otimes C_i$
Every matrix $A\in M_4(\mathbb{R})$
can be represented in the form of $$A=\sum_{i=1}^{n(A)} B_i\otimes C_i$$ for $B_i,C_i\in M_2(\mathbb{R})$.
What is the least uniform upper bound $M$ for such $n(A)$...
- 148k
1
vote
1
answer
146
views
Solve a linear matrix ODE involving symmetric blocks
Let $P \in \mathbb R^{n \times n}$ be a symmetric positive definite matrix with eigenvalues denoted by $\lambda_i$ and corresponding eigenvectors denoted by $v_i$. For each $j \in \{1, 2, 3, 4\}$, let ...
- 188k
3
votes
1
answer
2k
views
Relation between Frobenius norm, infinity norm and sum of maxima
Let $A$ be a sequence of $n \times n$ matrices so that the Frobenius norm squared satisfies $\|A\|_F^2 \simeq n$ and the infinity norm squared is $\|A\|_{\infty}^2 = 1$. Is the following true?
$$\...
- 105
12
votes
0
answers
508
views
More mysterious properties of Gram matrix
This is another question related to the mysterious properties of the Gram matrix in dimension $4$. Here's the previous question.
The following fact could be extracted from 0402087:
For any $a_i\...
- 356
5
votes
1
answer
2k
views
Inverse of a matrix and the inverse of its diagonals
While researching a question, I faced with the following problem: I have to prove that for a positive definite matrix we have
$${\mathbf n}^T {\mathbf R}^{-1}{\mathbf n}\geq {\mathbf n}^T {\mathbf D}...
- 109k
9
votes
1
answer
396
views
Bound on the ratio of top 2 eigenvalues
Let $P$ be a $n \times n$ stochastic matrix such that $P_{ij}=\tau$ if $i \neq j$ and $P_{ii} = 1 - (n-1)\tau$ where $0<\tau < \frac{1}{n}$.
It is clear that the largest eigenvalue of $P$ is 1, ...
- 109k
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
3
votes
1
answer
196
views
Can we classify the general linear maps such that for a fixed matrix $A \in M_n(\mathbb R)$ the conjuagation action fixes the first column?
Let $A \in GL_n(\mathbb R)$ be fixed. Let us consider the conjugation action by $G \in GL_n(\mathbb R)$, i.e., $G^{-1}AG$. I would like to see a way to identify the matrices such that the action fixes ...
- 356
1
vote
2
answers
1k
views
A "positive diagonal plus skew-symmetric" matrix decomposition
Let $A\in\mathbb{R}^{n\times n}$ be a diagonalizable matrix with real and strictly positive eigenvalues (note that $A$ is not required to be symmetric).
My question. Do there exist an orthogonal ...
- 4,991
3
votes
0
answers
243
views
An inequality concerning the solution of a Lyapunov equation
Let $A$ be an Hurwitz stable matrix (i.e. the real part of the eigenvalues of $A$ lie in the left-half plane) and $Q$ be a positive semidefinite matrix ($Q\ge 0$, for short). Let $P>0$ be the ...
- 2,712
4
votes
1
answer
206
views
How to find the analytical representation of eigenvalues of the matrix $G$?
I have the following matrix arising when I tried to discretize the Green function， now to show the convergence of my algorithm I need to find the eigenvalues of the matrix $G$ and show it has absolute ...
- 1,593
1
vote
1
answer
103
views
On ranks of matrices with tensor structure
Fix two $2^t$ length vector of form $p=\begin{bmatrix}u_1&v_1\end{bmatrix}\otimes\dots\otimes\begin{bmatrix}u_t&v_t\end{bmatrix}$ and $r=\begin{bmatrix}w_1&z_1\end{bmatrix}\otimes\dots\...
- 13.9k
3
votes
0
answers
629
views
Diagonal elements of Hermitian matrices with given eigenvalues
Given real vectors $d = (d_1, \ldots, d_n)$ and $\lambda = (\lambda_1, \ldots, \lambda_n)$, where I will assume that their coefficients are arranged in non-increasing order, the Schur-Horn theorem ...
- 31
4
votes
0
answers
284
views
Maximizing a certain eigenvalue ratio
Let $A\in\mathbb{R}^{n\times n}$ be an Hurwitz stable matrix (i.e., the spectrum of $A$ lies on the left-half complex plane) and let $P$ be the unique positive definite solution of the following ...
- 2,712
1
vote
1
answer
2k
views
SVD of two matrices A and B having the same right singular vectors?
I saw this statement in a lecture note
Assume the generalized SVD of matrices $A\in R^{m\times n}$ and $B\in R^{p\times n}$ given as:
$$U^TAX = diag(\alpha_1, ..., \alpha_n),~ U^TU = I_m$$
$$V^TBX = ...
CommunityBot
- 1
11
votes
2
answers
2k
views
Inverse of a small submatrix
Let $A$ be a large matrix (say, $1000 \times 1000$), and let $\mathcal I = \{2,3,5\}$ be a set of row/column indices. Let $(A^{-1})_{\cal I \times I}$ denote the submatrix of $A^{-1}$ that consists of ...
- 28.6k
2
votes
1
answer
236
views
An inequality regarding projection
Let $a, b \in \mathbb{R}^k$ be two normalized vectors such that $a^T b << 1$. Define matrix $C$ such that $[a, b, C]$ is full column rank, and let matrix $D$ be positive definite. Define ...
- 128k
14
votes
5
answers
5k
views
Matrix trace & norm [closed]
For any nonnegative semidefinite matrix $A$ and any matrix $B$, we have
$$\mbox{tr} (AB) \le \mbox{tr} (A) \, \|B\|$$
where $\mbox{tr}(\cdot)$ is the trace and $\|\cdot\|$ is the operator norm. How ...
- 153
0
votes
0
answers
224
views
Upper bound on matrix perturbation such that all eigenvalues lie within the unit circle
Consider the matrix
$$N=\left[\matrix{\mathbb{I}_n-\epsilon L & X\\ \epsilon Y & Z}\right]$$
where $\epsilon>0$ is a small positive parameter and $Z$ is a square $m\times m$ matrix with ...
4
votes
1
answer
289
views
A property of positive matrices
Let $\mathbb{S}^{dn} \ni X \succeq 0$ with $d,n \in \mathbb{N}$, where $X \succeq 0$ indicates that $X$ is positive semidefinite. Now partition $X$ into the block form
\begin{gather}
\begin{pmatrix}
...
- 81
1
vote
0
answers
172
views
A vanishing sum of symmetric matrices
Let $\{G_i\}_{i=1}^N\in\mathbb{R}^{n\times m}$ be a set of full column rank matrices (i.e., $\mathrm{rank}(G_i)=m$ for all $i$) and $\{P_i\}_{i=1}^N\in\mathbb{R}^{m\times m}$ be a set of positive ...
- 2,712
2
votes
0
answers
87
views
Conditions for $B$ that make $ADB + (ADB)^T$ positive (semi-)definite
I am trying to find conditions under which this dynamical system converges. At the end of the day, we have something like
$$
0 \leq x^TD_0W_0D_1W_1D_2 \dots W_ND_NCx
$$
With $D_i$ matrices that are ...
- 121
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(\...
- 2,753
4
votes
3
answers
3k
views
Is this inequality involving the Frobenius norm right?
Let $A$ be a generic (or varying) square, real $ n \times n$ matrix. Let $G$ be a fixed $n \times k$ matrix, $k < n.$ Denote by $||.||_F$ the Frobenius norm.
Is it true that $||AG||_F \geq c(G) ||...
CommunityBot
- 1