Questions tagged [matrix-theory]
Matrix theory is the study of matrices as concrete objects, rather than as abstract linear operators between vector spaces (whose study belongs to linear algebra). For instance, this involves matrix factorizations and decompositions, nonnegative matrices and Perron-Frobenius theory, Schur complements, structured and special matrices, matrix functions and equations.
451
questions
40
votes
4
answers
4k
views
The sum of squared logarithms conjecture
I am searching for the first proof of (or counterexample to) the following conjecture.
(The sum of squared logarithms conjecture)
For all natural numbers $n$ and positive numbers $x_1,x_2, \ldots , ...
32
votes
0
answers
624
views
Existence of orthogonal basis of symmetric $n\times n$ matrices, where each matrix is unitary?
For a positive integer $n$, let $S_n$ denote the set of $n\times n$ symmetric matrices over $\mathbb{C}$. As a complex vector space, this set has dimension $\mathrm{dim}(S_n)=\binom{n+1}{2}$. The ...
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 ...
28
votes
2
answers
15k
views
Determinants in Graph Theory
In graph theory, we work with adjacency matrices which define the connections between the vertices. These matrices have various linear-algebraic properties. For example, their trace can be calculated (...
23
votes
0
answers
8k
views
An $n \times n$ matrix $A$ is similar to its transpose $A^{\top}$: elementary proof?
A famous result in linear algebra is the following.
An $n \times n$ matrix $A$ over a field $\mathbb{F}$ is similar to its transpose $A^T$.
I know one proof using the Smith Normal Form (SNF). ...
22
votes
2
answers
13k
views
Infinite matrices and the concept of "determinant"
Suppose we have an infinite matrix A = (aij) (i, j positive integers). What is the "right" definition of determinant of such a matrix? (Or does such a notion even exist?) Of course, I don't ...
22
votes
1
answer
1k
views
How to see that the determinant of this matrix is nonzero for all primes?
I'm trying to show that $\sum_{i = 0}^{p-2} (i+1)^{-1} t^{i+n}$ where $0 \leq n \leq p-2$ spans the vector space $\mathbb{F}_p[t]/(1-t)^{p-1}$ as a rank $p-1$ module over $\mathbb{F}_p$.
In other ...
21
votes
3
answers
48k
views
What is the time complexity of truncated SVD?
Full SVD, on an $m \times n$ matrix $A$, [U,S,V] = svd(A), would cost $O(m^2n + mn^2 + n^3)$ time. But what is the time complexity if we only need the $k$ largest ...
20
votes
1
answer
25k
views
When does the $4\times 4$ 'false Sarrus rule' compute the determinant correctly?
This question is most probably not research level, but I thought that the MO folks might like it... Feel free to close.
Here is the motivation: If you have ever taught a maths course for engineers ...
19
votes
1
answer
813
views
Number of matrices with given Smith normal form
Denote with $\mathcal{M}$ the set of $(m \times n)$-matrices with integer coefficients bounded by some $K$. Given a matrix $B \in \mathcal{M}$ that is in Smith normal form, is anything known about the ...
18
votes
2
answers
4k
views
Minimum off-diagonal elements of a matrix with fixed eigenvalues
I am an engineer working in radar research. I came accross a problem on which I cannot seem to find literature. I can ask it in two different ways. Perhaps depending on the reader, the alternative ...
17
votes
2
answers
970
views
Are unitarily equivalent permutation matrices permutation similar?
Two matrices $A, B \in \mathbb R^{n \times n}$ are called unitarily equivalent if there exists an unitary matrix $U \in \mathbb C^{n \times n}$ such that $A = U B U^{\ast}$. If in addition $U$ is a ...
17
votes
2
answers
2k
views
Is the determinant the only multiplicative matrix function? [closed]
Is there a matrix invariant or property that is multiplicative, i.e.,
$$f(AB) = f(A) f(B)$$
other than the determinant? In addition, some matrix norms are submultiplicative, but is there a ...
17
votes
3
answers
1k
views
Finding the nearest matrix with real eigenvalues
In this thread on MATLAB Central, I found a discussion on finding the nearest matrix with real eigenvalues. The first hypothesis was to simply truncate the complex part of the eigenvalues. So, given ...
17
votes
1
answer
3k
views
2x2 subdeterminants of a matrix
If N>2, it is well known that if two invertible NxN matrices A and B have the same determinants of any 2x2 corresponding submatrices, then A=B or A=-B.
Given then all these 2x2 determinants of an ...
16
votes
5
answers
2k
views
Expected value of determinant of simple infinite random matrix
Suppose we have a matrix $A \in \mathbb{R}^{n\times n}$ where
$$A_{ij} = \begin{cases} 1 & \text{with probability} \quad p\\ 0 &\text{with probability} \quad1-p\end{cases}$$
I would like to ...
16
votes
2
answers
497
views
The number of 0-1 normal matrices
Let $A\in\{0,1\}^{n\times n}$ be a $n\times n $ matrix with entries in the discrete set $\{0,1\}$.
My question: What is the number of matrices in $\{0,1\}^{n\times n}$ that are normal, that is, ...
15
votes
7
answers
2k
views
Is the linear span of special orthogonal matrices equal to the whole space of $N\times N$ matrices?
(Disclaimer : I know very well that $SO(N)$ has a Lie algebra of dimension $N(N-1)/2$ etc. This absolutely not the point of my question.)
To make my problem more understandable, I start with the ...
15
votes
1
answer
745
views
Is SL(n,Z[x]) generated by transvections?
Is $\mathrm{SL}(n,\mathbb{Z}[x])$ equal to $E(n,\mathbb{Z}[x])$, the subgroup generated by transvections?
14
votes
1
answer
619
views
Is this "semi-tensor product" something recently invented? Are there other usages of it?
The context: I was reading a paper in which they used the following definition called "Semi-Tensor Product" (STP) or "Cheng" product (In honor to its "inventor" D. Cheng):...
13
votes
3
answers
3k
views
Differentiability of Eigenvalues - Perturbation Theory
first, I have a general question. In perturbation theory, I saw perturbations in eigenvalues and eigenvectors of square, non-symmetric matrices and the calculations were all right but no one ever ...
13
votes
2
answers
5k
views
Parametrization of positive semidefinite matrices
We know that a real, symmetric, positive definite matrix $A$ of size $n\times n$ can be parametrized by a vector $\theta$ of $\frac{n(n+1)}{2}$ parameters thanks to the Cholesky decomposition:
$$
A = ...
13
votes
2
answers
4k
views
Structure theorem for finite dimensional $C^*$-algebras and their representations
I would like a source for some Artin-Wedderburn type facts about these algebras which seem to have easy proofs, and are probably written somewhere.
Let $\mathcal{A} \subset M_n(\mathbb{C})$ be an ...
13
votes
2
answers
390
views
Is every finite-order unimodular matrix conjugate to a $0,1,-1$ matrix?
Problem. Given a matrix $A\in\mathrm{GL}(n,\mathbb{Z})$ such that $A^k=1$ for some $k\geq 1$, is there a matrix $g\in\mathrm{GL}(n,\mathbb{Z})$ such that $gAg^{-1}$ has only $0$, $1$, and $-1$ as ...
13
votes
1
answer
273
views
What is the symmetry group fixing norms of elements of a unitary matrix?
Let $N\geq1$ be an integer and let us say that two matrices $U,V\in U(N)$ are related if $|U_{ij}|=|V_{ij}|$ for all indices $1\leq i,j\leq N$.
When exactly are two unitary matrices related in this ...
12
votes
2
answers
20k
views
Cholesky decomposition of a positive semi-definite
We know that a positive definite matrix has a Cholesky decomposition,but I want to know how a Cholesky decomposition can be done for positive semi-definite matrices?The following sentences come from a ...
11
votes
1
answer
863
views
Decide if a matrix is transposable
A matrix $M$ is called transposable if it can be transformed into its transpose $M^t$ via row and column permutations.
Is there an efficient a way/algorithm to decide if a given matrix is
...
11
votes
1
answer
427
views
A variant of Cholesky decomposition involving binary matrices
Studying a problem that is not directly related to linear algebra I came across the following problem.
Let $B$ be $n \times n$ symmetric matrix whose entries are non-negative integers. I would like ...
11
votes
2
answers
751
views
A (linear) optimization problem subject to (linear) matrix inequality constraints
Let $A \in \mathbb{R}^{n \times n}$ be a Hurwitz matrix, i.e. $A$ satisfies $\mathrm{Re}\,\lambda_i< 0$, where $\{\lambda_i\}_{i=1}^n$ is the set of eigenvalues of $A$. Suppose that the trace of $A$...
10
votes
2
answers
1k
views
When the sum of positive definite matrices converges, does the sum of the norm of the associate matrices converges?
Suppose $A_k>0$ (which means they are positive definitive square $n\times n$-matrices with $n>1$).
If $\sum_{k=1}^\infty A_k$ exists, then
$\sum_{k=1}^\infty \|A_k\| < +\infty$,
Where $\|A\|=\...
10
votes
1
answer
577
views
is it possible to have two non-isomorphic non-regular graphs with the same adjacent spectrum and the same laplacian spectrum?
For two regular graphs $G$ and $H$, it is possible for them to share the same adjacent spectrum and the same laplacian spectrum. While, on the other hand, is it possible to have two non-regular graphs ...
10
votes
1
answer
609
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 ...
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}(\|...
10
votes
0
answers
227
views
Matrix identities in two variables
The famous Amitsur-Levitzki Theorem states that the algebra $M_n(\mathbb C)$ satisfies no polynomial identity of degree less than $2n$ and it satisfies
$$p(x_1,\dots,x_{2n}) = \sum_{\sigma \in \frak ...
9
votes
3
answers
538
views
Product of a Finite Number of Matrices Related to Roots of Unity
Does anyone have an idea how to prove the following identity?
$$
\mathop{\mathrm{Tr}}\left(\prod_{j=0}^{n-1}\begin{pmatrix}
x^{-2j} & -x^{2j+1} \\
1 & 0
\end{pmatrix}\right)=
\begin{cases}
...
9
votes
2
answers
315
views
Almgren's regularity Theorem ; a simple example?
Let me remind Almgren's regularity Theorem: the singular set of area-minimizing surface has codimension at least $2$. I wish to share here a simple example in low dimension, although I don't know ...
9
votes
1
answer
242
views
Linear subspaces of $\mathrm{GL}_n(\mathbb{R})$ whose inverses are also linear subspaces
$\DeclareMathOperator\GL{GL}$We will call a subset $S \subset \GL_n(\mathbb{R})$ a linear subspace if it is of the form $S = S'\cap \GL_n(\mathbb{R})$ for some $S'\subset M_n(\mathbb{R})$ which is a ...
9
votes
1
answer
511
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?
$${...
9
votes
2
answers
1k
views
On closest unitary matrix
In this question $\|A\|_p$ is the normalized $p$-th Schatten norm which is defined to be $\left(\mathbb E_{i} \lambda_i^p\right)^{1/p}$, where $\lambda_i$ are singular values of matrix $A$.
Suppose ...
9
votes
2
answers
464
views
Minors of low rank skew-symmetric matrix
Let $A$ be an $n\times n$ skew-symmetric matrix of rank $r$.
Given subsets $X$ and $Y$ of row and column indices respectively, let $A_{X,Y}$ denote the submatrix of $A$ obtained by only keeping rows ...
9
votes
1
answer
347
views
Kulkarni-Nomizu square root of the Riemann tensor
Given a Riemann tensor $Riem$, what are conditions such that $Riem=B\star B$ for some bilinear symmetric form $B$, where $\star$ is the Kulkarni-Nomizu product? It follows from the proof of ...
9
votes
1
answer
632
views
Samuel Karlin's problem: Probability of positive solution to system of random linear equations
I came to know this problem from Dr. W. Bryc's slides (at University of Cincinnati), and I have been continually working on this problem for almost 5 days using different techniques. But I am only ...
9
votes
3
answers
370
views
Is there a standard name for the following type of linear operator?
Is there a standard name for a linear operator $T$ on a finite dimensional vector space satisfying $T^n=T^{n+1}$ for some $n\geq 1$ or, equivalently, $T$ is a similar to a direct sum of a nilpotent ...
8
votes
7
answers
999
views
One observation of special type of square matrix exponentiation
I was studying the following type of matrices,
$$
A = \begin{pmatrix}
1 & x_{12} & \cdots &x_{1n}\\
0 & x_{22} & \cdots &x_{2n}\\
\vdots\\
0&\cdots&0&x_{nn}
\end{...
8
votes
2
answers
610
views
Question on whether, "An entire function, nowhere zero, has an entire logarithm," holds for matrix-valued entire functions as well
It is known that an entire function that is nowhere zero must be the exponential of another entire function.
Does this hold for matrix-valued functions as well? That is, given a matrix-valued entire ...
8
votes
1
answer
1k
views
Closed form solution for $XAX^{T}=B$
Let $d \times d$ matrices $A, B$ be positive definite. Is there a closed form solution for the following quadratic equation in $X$?
$$X A X^{T} = B$$
Thank you.
8
votes
2
answers
506
views
Orthogonal basis of ${\bf Sym}_n(\mathbb R)$, made of orthogonal matrices
My question is motivated by this one, but within real matrices instead of complex ones.
${\bf Sym}_n(\mathbb R)$ is a vector space of dimension $N=\frac{n(n+1)}2$. Equipped with the scalar product $\...
8
votes
3
answers
636
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$...
8
votes
2
answers
320
views
What is the most efficient way to factor a matrix into a given set of generators?
I am studying finite index subgroups of certain finitely presented groups. The particular conditions on my groups make this problem easier than I phrase it here, but I am curious about a more general ...
8
votes
2
answers
410
views
Existence and characterization of transitive matrices?
We call a matrix $M \in \mathbb{R}^{d \times d}$ transitive if it satisfies the following:
For any three vectors $u, v, w$ in $\mathbb{R}^d$. If $u^T M v > 0$ and $v^T M w > 0$ then $u^TMw &...