For any topic related to matrices. This includes: systems of linear equations, eigenvalues and eigenvectors (diagonalization, triangularization), determinant, trace, characteristic polynomial, adjugate, transpose, Jordan normal form, matrix algorithms (e.g. LU, Gauss elimination, SVD, QR), ...

learn more… | top users | synonyms (2)

15
votes
3answers
2k views

Traces of all positive powers of a matrix are zero implies it is nilpotent

Let $A$ be an $n\times n$ complex nilpotent matrix. Then we know that because all eigenvalues of $A$ must be $0$, it follows that $\text{tr}(A^n)=0$ for all positive integers $n$. What I would like ...
15
votes
4answers
1k views

Expected Value of a Determinant

Suppose that I construct an $n \times n$ matrix $A$ such that each entry of $A$ is a random integer in the range $[1, \, n]$. I'd like to calculate the expected value of $\det(A)$. My conjecture is ...
15
votes
3answers
3k views

Why do the $n \times n$ non-singular matrices form an “open” set?

Why is the set of $n\times n$ real, non-singular matrices an  open subset of the set of all $n\times n$ real matrices? I don't quite understand what "open" means in this context. Thank you.
15
votes
8answers
27k views

How to check if a symmetric $4\times4$ matrix is positive semi-definite?

How does one check whether symmetric $4\times4$ matrix is positive semi-definite? What if this matrix has also rank deficiency: is it rank 3?
15
votes
5answers
872 views

Is this matrix obviously positive definite?

Consider the matrix $A$ whose elements are $A_{ij} = a^{|i-j|}$ for $-1<a<1$ and $i,j=1,\dots,n$ e.g. for $n=4$ the matrix is $$A = \left[ \begin{matrix} 1 & a & a^2 & a^3 \\ a &...
15
votes
3answers
3k views

Recovering the two $SU(2)$ matrices from$ SO(4)$ matrix

Since there is a $2$-$1$ homomorphism from $SU(2)\times SU(2)$ to $SO(4)$ there should be a way to recover the two $SU(2)$ matrices given an $SO(4)$ matrix. I believe I could set this up as a ...
15
votes
3answers
727 views

For every matrix $A\in M_{2}( \mathbb{C}) $ there's $X\in M_{2}( \mathbb{C})$ such that $X^2=A$?

True\False? For every matrix $A\in M_{2}( \mathbb{C}) $ there's $X\in M_{2}( \mathbb{C})$ such that $X^2=A$. I know that every complexed matrix has a Jordan form matrix $J$ such that $P^{-1}CP=J$, ...
15
votes
3answers
293 views

If $A$ is positive definite, then $\int_{\mathbb{R}^n}\mathrm{e}^{-\langle Ax,x\rangle}\text{d}x=\left|\det\left({\pi}^{-1}A\right)\right|^{-1/2}$

Let $A$ be a positive definite real $n\times n$ matrix. How can I prove that $$ \int_{\mathbb{R}^n}\mathrm{e}^{-\langle Ax,x\rangle}\text{d}x=\left|\,\det\left(\pi^{-1}{A}\right)\right|^{-1/2}=\pi^{n/...
15
votes
2answers
14k views

Prove that the eigenvalues of a block matrix are the combined eigenvalues of its blocks

Let $A$ be a block upper triangular matrix: $A = \left( \begin{matrix} A_{1,1}&A_{1,2}\\ 0&A_{2,2} \end{matrix} \right)$ where $A_{1,1} ∈ C^{p×p}$, $A_{2,2} ∈ C^{(n-p)×(n-p)}$ Show ...
15
votes
4answers
442 views

Theorem about positive matrices

We will call a matrix positive matrix if all elements in the matrix are positive, and we will denote the largest eigenvalue with $\lambda_{\max}$, what is exist because of the Perron–Frobenius theorem....
15
votes
1answer
2k views

What kind of matrices are non-diagonalizable?

I'm trying to build an intuitive geometric picture about diagonalization. Let me show what I got so far. Eigenvector of some linear operator signifies a direction in which operator just ''works'' ...
15
votes
1answer
2k views

Direct proof that nilpotent matrix has zero trace

Does anyone know a proof from the first principles that a nilpotent matrix has zero trace. No eigenvalues, no characteristic polynomials, just definition and basic facts about bases and matrices.
15
votes
2answers
289 views

Why does calculating matrix inverses, roots, etc. using the spectrum of a matrix work?

Suppose $A$ is a $n \times n$ matrix from $M_n(\mathbb{C})$ with eigenvalues $\lambda_1, \ldots, \lambda_s$. Let $$m(\lambda) = (\lambda - \lambda_1)^{m_1} \ldots (\lambda - \lambda_s)^{m_s}$$ be the ...
15
votes
1answer
219 views

Bound on the difference of two determinants

Let $A$ and $B$ be two real, $n\times n$ matrices. Using Hadamard's inequality, it is not hard to show that $$ \left|\det A - \det B \right| \leq \|A-B\|_{2} \frac{\|A\|_{2}^n -\|B\|_{2}^n}{\|A\|_2 -\|...
15
votes
2answers
490 views

Does this expression have a (“better”) determinant form?

[Edit I've found a determinant that satisfies the letter of the previous version of this question, but not its "Cayley-Menger" spirit.] A tetrahedron with face areas $w$, $x$, $y$, $z$ and "pseudo-...
15
votes
1answer
236 views

Linear Algebra : Invertible Matrix Proof

I was doing some linear algebra exercises and came across the following tough problem : Let $M_{n\times n}(\mathbf{R})$ denote the set of all the matrices whose entries are real numbers. Suppose $\...
15
votes
3answers
389 views

Prove the inequality: $\prod_{j=1}^ka_{jj}\leq\left(\frac{1}{k}\sum_{j=1}^k\lambda_j\right)^k.$

To all those who are eagerly awaiting a new question, all those who love math, I give this challenge and I hope for you good moments of reflection. Let $A=(a_{ij})_n$ a real nonnegative symmetric ...
15
votes
1answer
343 views

What do characteristic polynomials characterize?

Let $R$ be an integral domain and $F$ a finitely generated free module over $R$. For a linear transformation $\alpha\in\operatorname{End}_R(F)$, the characteristic polynomial is \begin{equation} p_\...
15
votes
0answers
186 views

Integrating a matrix function involving a determinant and exponential trace

I am trying to find the normalizing constant for a probability distribution and ran into a difficult integral. When $X$ is an $p \times k$ matrix, $a>0,$ and $g>0,$ how can I compute $$\int \...
14
votes
4answers
576 views

Eigenvectors and ''eigenrows''

Usually we search the eigenvectors of a matrix $M$ as the vectors that span a subspace that is invariant by left multiplication by the matrix: $M\vec x= \lambda \vec x$. If we take the transpose ...
14
votes
6answers
447 views

Prove that $A^k = 0 $ iff $A^2 = 0$

Let $A$ be a $ 2 \times 2 $ matrix and a positive integer $k \geq 2$. Prove that $A^k = 0 $ iff $A^2 = 0$. I can make it to do this exercise if I have $ \det (A^k) = (\det A)^k $. But this ...
14
votes
4answers
6k views

How to calculate the matrix exponential explicitly for a matrix which isn't diagonalizable?

How can I compute an expression for $(\exp(Qt))_{i,j}$ for some fixed $i, j$ and matrix $Q$? When $Q$ is diagonalizable, we can diagonalize, but what can be done otherwise? Thanks.
14
votes
1answer
3k views

Is the matrix $A$ diagonalizable if $A^2=I$

If $A$ is an involutory matrix, i.e. $A^2=I$, then is $A$ diagonalizable?
14
votes
2answers
458 views

Any neat way to calculate this Vandermonde-like determinant?

Let $x_i,i\in\{1,\cdots,n\}$ be real numbers, and $s_k=x_1^k+\cdots+x_n^k$, I'm asked to calculate $$ |S|:= \begin{vmatrix} s_0 & s_1 & s_2 & \cdots & s_{n-1}\\ s_1 ...
14
votes
4answers
743 views

Choosing an orthonormal basis in which a linear operator has a sparse matrix

Given a linear operator $T$ on an $n$-dimensional vector space $V$ (over $\mathbb R$), I want to find an orthonormal basis for $V$ in which the matrix of $T$ is sparse (has many zeros). How many zeros ...
14
votes
3answers
2k views

Block Diagonal Matrix Diagonalizable

I am trying to prove that: The matrix $C = \left(\begin{smallmatrix}A& 0\\0 & B\end{smallmatrix}\right)$ is diagonalizable, if only if $A$ and $B$ are diagonalizable. If $A\in\mathbb{C}^n$ ...
14
votes
3answers
315 views

Are matrices best understood as linear maps?

Any linear map between finite-dimensional vector spaces may be represented by a matrix, and conversely. Matrix-matrix multiplication corresponds to map composition, and matrix-vector multiplication ...
14
votes
1answer
554 views

determinant of a standard magic square

What is the lowest positive, what the highest possible value for the determinant of a standard-magic-square-matrix of order n ? Are there singular standard-magic-square-matrices of any order greater ...
14
votes
0answers
475 views

Determining the kernel of a Vandermonde-like matrix

The kernel of a Vandermonde matrix can be determined using this formula. The following type of matrix has a similar structure, and should also have a one-dimensional kernel. $$V= \begin{bmatrix} ...
13
votes
9answers
2k views

Matrix with zeros on diagonal and ones in other places is invertible

Hi guys I am working with this and I am trying to prove to myself that n by n matrices of the type zero on the diagonal and 1 everywhere else are invertible. I ran some cases and looked at the ...
13
votes
5answers
28k views

Similar matrices have the same eigenvalues with the same geometric multiplicity

Suppose $A$ and $B$ are similar matrices. Show that $A$ and $B$ have the same eigenvalues with the same geometric multiplicities. Similar matrices: Suppose $A$ and $B$ are $n\times n$ matrices ...
13
votes
4answers
3k views

$I_m - AB$ is invertible if and only if $I_n - BA$ is invertible.

The problem is from Algebra by Artin, Chapter 1, Miscellaneous Problems, Exercise 8. I have been trying for a long time now to solve it but I am unsuccessful. Let $A,B$ be $m \times n$ and $n \...
13
votes
8answers
701 views

Finding the Exponential of a Matrix that is not Diagonalizable

Consider the $3 \times 3$ matrix $$A = \begin{pmatrix} 1 & 1 & 2 \\ 0 & 1 & -4 \\ 0 & 0 & 1 \end{pmatrix}.$$ I am trying to find $e^{At}$. The only tool I have to find ...
13
votes
3answers
6k views

why determinant is volume of parallelepiped in any dimensions

for $n = 2,$ I can visualize that the determinant $n \times n$ matrix is the area of the parallelograms by actually calculate the area by coordinates. But how can one easily realize that it is true ...
13
votes
4answers
7k views

What is the fastest way to find the characteristic polynomial of a matrix?

Finding the characteristic polynomial of a matrix of order $n$ is a tedious and boring task for $n > 2$. I know that: the coefficient of $\lambda^n$ is $(-1)^n$, the coefficient of $\lambda^{n-1}...
13
votes
2answers
19k views

What is the proof that covariance matrices are always semi-definite?

Suppose that we have two different discreet signal vectors of $N^\text{th}$ dimension, namely $\mathbf{x}[i]$ and $\mathbf{y}[i]$, each one having a total of $M$ set of samples/vectors. $\mathbf{x}[m]...
13
votes
1answer
1k views

How to understand spectral decomposition geometrically

Let $A$ be a $k\times k$ positive definite symmetric matrix. By spectral decomposition, we have $$A = \lambda_1e_1e_1'+ ... + \lambda_ke_ke_k'$$ and $$A^{-1} = \sum_{i=1}^k\frac{1}{\...
13
votes
4answers
248 views

Matrices such that $M^2+M^T=I_n$ are invertible

Let $M$ be an $n\times n$ real matrix such that $M^2+M^T=I_n$. Prove that $M$ is invertible Here is my progress: Playing with determinant: one has $\det(M^2)=\det(I_n-M^T)$ hence $\det(M)^2=\...
13
votes
4answers
438 views

Exponential lower bound for the determiant of a (0,1)-matrix

Give matrices, which only contain 0 and 1, and their determinant grows exponentially. In other words, show an $n \times n$ matrix for all n, which only contains 0 and 1, and $$\det A(n)>d \cdot c^...
13
votes
2answers
757 views

Variety of Nilpotent Matrices

Let $k$ be an algebraically closed field and view $M_n(k)$ as $\mathbb{A}^{n^2}$. $A\in M_n(k)$ is nilpotent if and only if $A^n=0$. Since the equation $A^n=0$ is given by $n^2$ polynomial equations,...
13
votes
1answer
4k views

Is it faster to multiply a matrix by its transpose than ordinary matrix multiplication?

I'm writing a program that multiples a matrix by its transpose, and was trying to find efficiency hacks I could exploit considering that the two matrices being multiplied are related. Any ideas?
13
votes
3answers
570 views

If $C$ commutes with certain matrices $A$ and $B$, why is $C$ a scalar multiple of the identity?

I'm self studying Steven Roman's Advanced Linear Algebra, and this is problem 10 of Chapter 8. Let $A,B\in M_2(\mathbb{C})$, $A^2=B^3=I$, $ABA=B^{-1}$, but $A\neq I$ and $B\neq I$. If $C\in M_2(\...
13
votes
3answers
967 views

How to show determinant of a specific matrix is nonnegative

How to show that $$\det A= \det \begin{pmatrix}\cos\frac{\pi}{n}&-\frac{\cos\theta_1}{2}&0&0&\cdots&0&-\frac{\cos\theta_n}{2} \\-\frac{\cos\theta_1}{2}&\cos\frac{\pi}{n}&...
13
votes
1answer
199 views

Largest determinant of a real $3\times 3$-matrix

What is the largest determinant of a real $3\times 3$-matrix with entries from the interval $[-1,1]$ ? A result of John Williamson says that the largest value is equal to $4$, if the entries are just ...
13
votes
2answers
696 views

Are eigenvalues of the limit of a sequence of matrices limits of eigenvalue sequences?

Let $\{A_n\}\in \mathbb{R}^{m\times m}$ be a sequence of symmetric matrices such that $A_n\to A$ as $n\to \infty$, i.e. $\lim_{n\to \infty}a_{ij}(n)=a_{ij}\ \forall 1\le i,j\le m$ where $A_n=[a_{ij}(n)...
13
votes
1answer
280 views

Compute $\det(A^n+B^n)$

Let $A, B $ be two real $3\times 3 $ matrices, $AB=BA$, and $ \det(A-B)=\det(A^2+B^2)=1,\det(A+B)=3, \det(B)=0 $, then, what is ? $$\det(A^n+B^n)$$ here $n$ is a positive integer. The problem ...
13
votes
3answers
535 views

when does $\det(AB^T+BA^T)\le \det(AA^T+BB^T)$ hold?

When does the following matrix inequality hold? $$\det(AB+B^TA^T)\le \det(AA^T+BB^T)$$ $A$ and $B$ are any real matrices. My reply gives a counter example. The question is under what condition ...
13
votes
1answer
816 views

Detecting symmetric matrices of the form (low-rank + diagonal matrix)

Let $\Sigma$ be a symmetric positive definite matrix of dimensions $n \times n$. Is there a numerically robust way of checking whether it can be decomposed as $\Sigma = \mathcal{D} + v^t.v$ where $v$ ...
13
votes
1answer
9k views

When does a Square Matrix have an LU Decomposition?

When can we split a square matrix (rows = columns) into it’s LU decomposition? The LUP (LU Decomposition with pivoting) always exists; however, a true LU decomposition does not always exist. How do ...
13
votes
1answer
629 views

Minimum and maximum determinant of a sudoku-matrix

Let $A$ be a sudoku-matrix. Assume that its determinant is positive. What is the lowest, what the highest possible value for the determinant of $A$ ? $A$ must have the dominant eigenvalue $45$, but ...