Skip to main content

All Questions

Filter by
Sorted by
Tagged with
1 vote
1 answer
151 views

How to prove that each element of $A(A^TA)^{-1}A^Ty$ is greater than 0, if $A(i,j)>0$ and $y=[1, 1, 1, ..., 1]^T$

Let $A\in \mathbb{R}^{m\times n}$, $m>n$, $rank(A)=n$, and $\forall 1 \leq i \leq m, 1 \leq j \leq n, A(i, j)>0$, $y=[1, 1, 1, ..., 1]^T$. Let $\beta=A(A^TA)^{-1}A^Ty$, how to prove that each ...
Songqiao Hu's user avatar
7 votes
1 answer
390 views

Questions on symmetric Hadamard matrices

Definitions: An $n\times n$ Hadamard matrix (HM for short) is a matrix whose entries are either $1$ or $−1$ and whose rows are mutually orthogonal. If $A$ is a symmetric matrix, then $A = A^T$ and if $...
user369335's user avatar
1 vote
2 answers
137 views

Methods to solve for a matrix whose entries satisfy certain properties

(This question is a repost of a deleted question I asked, because the previous version had several elements missing) Setting For fixed $N \in \mathbb{N}$, I wish to compute the entries of a matrix $...
algebroo's user avatar
  • 135
0 votes
0 answers
99 views

Efficient method to determine minimum eigenvalue of $2 \times 2$ block diagonal matrix

Suppose $H$ is a $2 \times 2$ block-diagonal symmetric matrix in $\mathbb{R}^{2^N \times 2^N} $. That is $$ H = \begin{pmatrix} A_1 & 0 & \cdots & 0\\ 0 & A_2 & \cdots & 0 \\ ...
KAJ226's user avatar
  • 131
3 votes
1 answer
144 views

On the bounds of the sum of the squares of spectral variation of two real symmetric matrices

Suppose $A$ and $B$ are two symmetric real $\{0,1,-1\}$ matrices of order $n$ with diagonal elements as zeros (therefore the traces are zeros) and eigenvalues $\lambda_1\ge \lambda_2\ge \dotsb \ge \...
shahulhameed's user avatar
1 vote
0 answers
72 views

Solve linear matrix equation involving convolution

I am facing following equation: $$ A * X + C \cdot X = D $$ with: $A, C, D \in \mathbb{R}^{n \times n}$ some known matrices without any particular structure, $X \in \mathbb{R}^{n \times n}$ the ...
JannyBunny's user avatar
1 vote
1 answer
70 views

A question about the sign of quadratic forms on nonnegative vectors

Let $M$ be a real square matrix of order $n\ge 3$. Assume that for every nonnegative vector $\textbf{z}\in \mathbb R^n$ which has at lease one zero entry we have $\textbf{z}^T M \textbf{z} \ge 0$. Can ...
user139975's user avatar
1 vote
0 answers
146 views

Identities for the determinant of a matrix similar to $\det(A)=\exp\circ\operatorname{tr}\circ\log(A)$ for different matrix functionals

The identity for the determinant of $A$ in the title is well know in matrix analysis and comes from the Jacobi's formula. I am interested in the existence of nontrivial formulas like this one (they do ...
Hvjurthuk's user avatar
  • 573
2 votes
1 answer
141 views

On the eigen vectors of a diagonalizable matrix

Let us consider the space $M_n(\mathbb{C})$. By a unitary matrix $U=(u_{ij})$ we mean that $U^{-1}=(\overline{u_{ji}})$. Q. Let $U$ be a unitary matrix. I am looking for the pairs of matrices $(D,A)$ ...
ABB's user avatar
  • 4,058
2 votes
2 answers
104 views

Inequality for matrix with rows summing to 1

Let $A$ be real matrix with $M > 1$ rows and $K > 2$ columns, and each entry $a_{m,k} \in (0,1)$, with each row summing to $1$. For all $m$ $$ \sum_{k=1}^{K} a_{m,k} = 1 $$ I want to find out if ...
Kasper's user avatar
  • 23
4 votes
1 answer
721 views

Singular value decomposition of truncated discrete Fourier transform matrix

Let $\mathbf{F}$ be a discrete Fourier transform (DFT) matrix such that \begin{align} F_{m,n}=e^{-j2\pi(m-1)(n-1)/N},\quad m,n=1,\ldots,N. \end{align} What we can say about the singular value ...
Math_Y's user avatar
  • 287
7 votes
1 answer
511 views

Is it true that $\lVert A\rVert \leq \lVert A^2\rVert$ for $A\in \operatorname{SL}(2, \mathbb{R})$ when $\operatorname{trace}(A)>2$?

$\DeclareMathOperator\SL{SL}\DeclareMathOperator\trace{trace}$Let $A \in \SL(2,\mathbb{R})$ and $\trace(A)>2$. Is it true that $$\lVert A\rVert \leq \lVert A^2\rVert,$$ where $\lVert \rVert$ is the ...
Adam's user avatar
  • 1,043
3 votes
1 answer
741 views

Operator norm of difference of matrix decompositions

This question is in part related to a question that I have already posed. Say I have two symmetric positive definite matrices and their respective Cholesky decompositions $\mathbf{A} = \mathbf{L}_A \...
Heinrich A's user avatar
2 votes
0 answers
176 views

System of matrix equations

Problem definition: Let $x_i \in \mathbb{R}^d$ and $a_i \in [0,1]$, for all $i = 1,\dots, k$ (with $k\geq d$). Define $M(a) = \sum_{i = 1}^k a_i x_ix_i^T,$ and assume $M(a) \succ 0.$ Question: Is ...
Apprentice's user avatar
1 vote
2 answers
143 views

If $x \ge 0$ and $\mathbf{1}^Tx \le \|x\|^2$ then $\mathbf{1}^T(I - xx^T / \|x\|^2) \mathbf{1} \ge \| [\mathbf{1} - x]_+ \|^2$

Notation. Denote $\mathbf{1}=(1,1,\ldots,1)$ as the vector-of-ones in $\mathbb{R}^n$. Write the "positive part" as $[\alpha]_+ = \max\{\alpha,0\}$ for $\alpha\in\mathbb{R}$ and $[(x_1,x_2,\...
Richard Zhang's user avatar
1 vote
0 answers
139 views

A lower-bound on matrix-function with vector product

I am currently trying to show that a sequence of homeomorphisms converges to some limiting homeomorphism using Anderson's the inductive convergence criterion. However I can't explicitly compute the ...
ABIM's user avatar
  • 5,405
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 ...
Ludwig's user avatar
  • 2,712
2 votes
1 answer
375 views

Bound for matrix inner product based on singular values

Regarding the matrix inner product based on singular values, Lewis (1995) "The convex analysis of unitarily invariant matrix functions" states the result by von Neumann that $\langle X,Y \rangle \leq \...
Prateek Sasan's user avatar
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 +...
Felix Huber's user avatar
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$...
Jochen Glueck's user avatar
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\...
Math_Y's user avatar
  • 287
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, ...
Learning math's user avatar
29 votes
2 answers
5k views

Consequences of eigenvector-eigenvalue formula found by studying neutrinos

This article describes the discovery by three physicists, Stephen Parke of Fermi National Accelerator Laboratory, Xining Zhang of the University of Chicago, and Peter Denton of Brookhaven National ...
Ivan Meir's user avatar
  • 4,862
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,\...
Ludwig's user avatar
  • 2,712
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 ...
Taylor Huang's user avatar
5 votes
1 answer
404 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}=\...
neverevernever's user avatar
0 votes
0 answers
52 views

How do I test two square matrices are transpose to each other if only the column vector summations are known?

Given two secret square matrices, say $\left( {\begin{array}{*{20}{c}} {{a_{11}}}&{{a_{12}}}&{{a_{13}}}\\ {{a_{21}}}&{{a_{22}}}&{{a_{23}}}\\ {{a_{31}}}&{{a_{32}}}&{{a_{33}}} \...
user67451's user avatar
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 ...
Justin Le's user avatar
  • 113
1 vote
1 answer
810 views

Relationship between $2 \to 2$ norm and $\infty \to 2$ norm [closed]

I am wondering what are the best known relationship between $\|A\|_{2\rightarrow 2}$ and $\|A\|_{\infty\rightarrow 2}$ and how tight it is. E.g., the trivial result is that for matrix $A$ with ...
Alex Wenxin Xu's user avatar
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 ...
Ludwig's user avatar
  • 2,712
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\...
Turbo's user avatar
  • 13.9k
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? $${...
Hammerhead's user avatar
  • 1,211
10 votes
2 answers
5k views

Nuclear norm as minimum of Frobenius norm product

Nuclear, or trace, or Ky Fan, norm of a matrix is defined as the sum of the singular values of the matrix. It is claimed that $$ \|X\|_\sigma = \min_{UV^T=X} \|U\|\|V\| = \min_{UV^T=X} \frac{1}{2}(\|...
Hans's user avatar
  • 2,239
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 ...
Jeff's user avatar
  • 482
8 votes
1 answer
2k views

Matrix elements of exponential of tridiagonal matrices

Is there a way to compute one matrix element of the exponential of a tridiagonal matrix without having to compute the rest of the elements? Motivation: I'm trying to find the first passage time ...
stochastic's user avatar
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} ...
Johannes's user avatar
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 ...
Ludwig's user avatar
  • 2,712
-1 votes
1 answer
195 views

Determinant of $Z^TZ$ [closed]

If one is looking at the characteristic polynomial of the $m \times m$ dimensional matrix $Z^TZ$ then apparently the coefficient of $(-1)^{m-k}$ in it can be written as, $\sum_{U \subset [m], V \...
gradstudent's user avatar
  • 2,246
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 ...
M. Lin's user avatar
  • 1,748
6 votes
2 answers
1k views

Nontrivial lower bound on the sum of matrix norms

Let $X, V\in\mathbb{R}^{n\times r}$ such that $X^\top V$ is symmetric. The central quantity I care about is \begin{equation} \|XV^\top\|_{F}^2+\|X^\top V\|_{F}^2 +[\text{Tr}(X^\top V)]^2. \end{...
Wuchen's user avatar
  • 515
6 votes
1 answer
777 views

Is every real matrix conjugate to a semi antisymmetric matrix?

Is it true to say that every matrix $A\in M_n(\mathbb{R})$ is similar (conjugate) to a matrix $B=(b_{ij})$ with $b_{ij}=-b_{ji}$ for all $i\neq j$?(With some abuse of terminology,a matrix $B$ with ...
Ali Taghavi's user avatar
1 vote
2 answers
486 views

Closed form for integral of function of a symmetric positive definite matrix

Let $M$ be a real symmetric positive definite matrix of size $n \times n$, and let $\log M$ denote its (principal) matrix logarithm. Is it possible to evaluate the following integral in closed form? ...
Abhishek Halder's user avatar
2 votes
2 answers
123 views

Behavior of matrix rank under thresholding of its elements

Let $A$ be a $n \times n$ real matrix of, say, rank $r$. Consider the matrix $$\max \{0,A\}$$ whereby each negative element of $A$ is set to $0$ and the non-negative elements are left unchanged. Is ...
gradstudent's user avatar
  • 2,246
3 votes
0 answers
56 views

Equivalence Classes of a Subgroup of Similarity Transformations

Let $X$ be a real, finite-dimensional vector space and $A, B, C,$ and $D$ be matrices on $X$. I'm interested in the similarity classes of the block matrices $$ \begin{bmatrix} A & B\\ C & D\\ ...
JMJ's user avatar
  • 263
8 votes
1 answer
490 views

Determinants (and traces) of linear maps of matrices

Let $k$ be a field or a commutative ring with unit and let $F:M_n(k)\to M_n(k)$ be a $k$-linear map. Suppose that $F$ is given in the form $F(X) = A_1XB_1 + \cdots + A_m X B_m$ for some $A_i,B_i\in ...
M.G.'s user avatar
  • 7,127
1 vote
1 answer
623 views

Can I modify the singular values of a matrix in order to get a negative eigenvalue?

Let $A \in \mathbb{R}^{n \times n}$ be a real nonsymmetric matrix with eigenvalues $\left\{\lambda_i : i=1..n\right\}$ with positive real part $\Re(\lambda_i) > 0$ $\forall i=1..n$ Let $A=U\Sigma ...
Astor's user avatar
  • 323
1 vote
0 answers
76 views

When is $F(X)BF(X)$ operator monotone, if $F(X)$ is operator monotone?

Let $\Omega_{n}$ denote the cone of $n\times n$ real symmetric positive definite matrices, and consider $F:\Omega_{n} \mapsto \Omega_{n}$. For $X,Y \in \Omega_{n}$, the matrix valued function $F(\cdot)...
Abhishek Halder's user avatar
4 votes
2 answers
311 views

Solving $\text{trace}\left[\left(I + pY\right)^{-1} \left(I - p^{2}Y\right)\right] = 0$ for scalar $p$

For given $n\times n$ real symmetric positive definite matrices $X_{1}, X_{2}$, let $Y := X_{1}^{-1}X_{2}$, and let $I$ be the identity matrix. I would like to solve the following equation for the ...
Abhishek Halder's user avatar
5 votes
1 answer
2k views

Diagonalization of real symmetric matrices with symplectic matrices

Consider the following real symmetric matrix $M=\left[\begin{array}{ccc} A & B\\ B^T & D \end{array}\right]$ Both A and D are real symmetric $n\times n$ matrices. B is a real $n\times n$...
fagd's user avatar
  • 51
3 votes
0 answers
70 views

Condition number after some "non standard" transform

Given a positive definite matrix $A$, and a diagonal matrix $B$ with positive diagonal entries, is the following inequality generally true? $$\kappa((A + B)(I + B)^{-1}) \leq \kappa(A)$$ $I$ is an ...
randomprojection's user avatar