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)

17
votes
2answers
4k views

$AB-BA=I$ having no solutions

The question is from Artin's Algebra. If $A$ and $B$ are two square matrices with real entries, show that $AB-BA=I$ has no solutions. I have no idea on how to tackle this question. I tried block ...
17
votes
3answers
21k views

How do I exactly project a vector onto a subspace?

I am trying to understand how - exactly - I go about projecting a vector onto a subspace. Now, I know enough about linear algebra to know about projections, dot products, spans, etc etc, so I am not ...
17
votes
4answers
8k views

Determining whether a symmetric matrix is positive-definite (algorithm)

I'm trying to create a program, that will decompose a matrix using the Cholesky decomposition. The decomposition itself isn't a difficult algorithm, but a matrix, to be eligible for Cholesky ...
17
votes
4answers
12k views

Can a real symmetric matrix have complex eigenvectors?

A Hermitian matrix always has real eigenvalues and real or complex orthogonal eigenvectors. A real symmetric matrix is a special case of Hermitian matrices, so it too has orthogonal eigenvectors and ...
17
votes
3answers
976 views

Let $A$ and $B$ be $n \times n$ real matrices such that $AB=BA=0$ and $A+B$ is invertible

I came across the following problem that says: Let $A$ and $B$ be $n \times n$ real matrices such that $AB=BA=0$ and $A+B$ is invertible. Then how can I prove the following: rank $A$+ ...
17
votes
6answers
7k views

Sylvester rank inequality

If $A$ and $B$ are two matrices of the same order $n$, then $$ \operatorname{rank} A + \operatorname{rank}B \leq \operatorname{rank} AB + n. $$ I don't know how to start proving this inequality. I ...
17
votes
2answers
282 views

Show that the kernel of the map $SL(n, \mathbb{Z}) \to SL(n, \mathbb{Z}/3\mathbb{Z})$ has no torsion.

I am trying to show that the kernel of the natural map $SL(n, \mathbb{Z}) \to SL(n, \mathbb{Z}/3\mathbb{Z})$ has no torsion. That is, if $A$ is in the kernel then $A = I$ or $A^n \neq I$ for all $n \...
17
votes
2answers
1k views

$AB=BA$ implies $AB^T=B^TA$.

I am looking for an elementary proof (if such exists) of the following: $$ AB=BA \quad\Longrightarrow\quad AB^T=B^TA, $$ where $A$ and $B$ are $n\times n$ real matrices, and $A$ is a normal matrix, i....
17
votes
4answers
830 views

Determinant of a generalized Pascal matrix

Let $M$ denote the infinite matrix defined recursively by $$ M_{ij} = \begin{cases} 1, & \text{if } i=1 \text{ and } j=1; \\ aM_{i-1,j}+bM_{i,j-1}+cM_{i-1,j-1}, & \mbox{otherwise}.\...
17
votes
2answers
1k views

Why does the inverse of the Hilbert matrix have integer entries?

Let $A$ be the $n\times n$ matrix given by $ A_{ij}=\frac{1}{i + j - 1}$. I need to show that $A$ is invertible and the inverse has integer entries. I was able to show that $A$ is invertible. How do I ...
17
votes
4answers
13k views

Is there a 3-dimensional “matrix” by “matrix” product?

Is it possible to multiply A[m,n,k] by B[p,q,r]? Does the regular matrix product have generalized form? I would appreciate it if you could help me to find out some tutorials online or mathematical '...
17
votes
2answers
268 views

A curious property of orthogonal matrices

Let $A$ be an $n\times n$ orthogonal matrix, i.e. $AA^T=A^TA=I$. I noticed experimentally that if we take any increasing set of indices $i_1<\cdots<i_p$, then the sum of the squares of all ...
17
votes
3answers
925 views

Eigenvalues of $A$ and $A + A^T$

This question has popped up at me several times in my research in differential equations and other areas: Let $A$ be a real $N \times N$ matrix. How are the eigenvalues of $A$ and $A + A^T$ related? ...
17
votes
1answer
1k views

Max dimension of a subspace of singular $n\times n$ matrices

I am sure the answer to this is (kind of) well known. I've searched the web and the site for a proof and found nothing, and if this is a duplicate, I'm sorry. The following question was given in a ...
17
votes
4answers
2k views

The arithmetic-geometric mean for symmetric positive definite matrices

A while back, I wanted to see if the notion of the arithmetic-geometric mean could be extended to a pair of symmetric positive definite matrices. (I considered positive definite matrices only since ...
17
votes
1answer
339 views

Proof that the range of a map is determined by its behaviour on the boundary.

Let f be a mapping from an open neighbourhood of the 3-dimensional unit ball to the 2-dimensional plane. Suppose that f is smooth (infinitely continuously differentiable on its domain) and regular (it'...
17
votes
1answer
195 views

When do two matrices have the same exponential?

Let $A$ and $B$ be $n\times n$ hermitean matrices. When do we have $e^{iA}=e^{iB}$? Can we somehow classify those pairs of matrices that have the same exponential? Here are some observations that I ...
17
votes
1answer
1k views

Proof of $\det(\textbf{ST})=\det(\textbf{S})\det(\textbf{T})$ in Penrose graphical notation

For two matrices $\textbf{S}$ and $\textbf{T}$, a proof of $\det(\textbf{ST})=\det(\textbf{S})\det(\textbf{T})$ is given below in the diagrammatic tensor notation. Here $\det$ denotes the ...
17
votes
0answers
229 views

Fundamental domain of $\operatorname{GL}(n,\mathbb R)$ acted on by $\operatorname{GL}(n, \mathbb Z)$

What is a simple description of a fundamental domain of $\operatorname{GL}(n,\mathbb R)$ acted on by $\operatorname{GL}(n,\mathbb Z)$? $\operatorname{GL}(n,\mathbb R)$ is the group of all real ...
16
votes
8answers
2k views

I need to calculate $x^{50}$ [duplicate]

$x=\begin{pmatrix}1&0&0\\1&0&1\\0&1&0\end{pmatrix}$, I need to calculate $x^{50}$ Could anyone tell me how to proceed? Thank you.
16
votes
5answers
1k views

Simple linear algebra problem: prove a matrix is invertible

I'm preparing for a test in linear algebra and I've come across a problem I'm having trouble with for some reason: Given a square matrix A, $A^2=2I$, prove that $A-I$ is invertible. I know this is ...
16
votes
5answers
1k views

Is every noninvertible matrix a zero divisor?

Is every noninvertible matrix over a field a zero divisor? Related to this: What are sufficient conditions for a matrix to be a zero divisor over a noncommutative ring?
16
votes
2answers
10k views

Are the eigenvalues of $AB$ equal to the eigenvalues of $BA$? (Citation needed!)

First of all, am I being crazy in thinking that if $\lambda$ is an eigenvalue of $AB$, where $A$ and $B$ are both $N \times N$ matrices (not necessarily invertible), then $\lambda$ is also an ...
16
votes
4answers
1k views

Relation of this antisymmetric matrix $r = \left(\begin{smallmatrix}0 &1\\-1&0\end{smallmatrix}\right)$ to $i$

I was reviewing some matrices and found this interesting if $r = \begin{pmatrix} 0&1\\ -1&0 \end{pmatrix}$ then $rr=-I$, also $$\exp{(\theta r)} = \cos\theta I + \sin\theta r$$ No wonder, the ...
16
votes
4answers
16k views

What is the geometric meaning of singular matrix

Could anyone help explain what is the geometric meaning of singular matrix ? What's the difference between singular and non-singular matrix ? I know the definition, but couldn't understand it very ...
16
votes
9answers
1k views

Why do determinants have their particular form?

I know that for a matrix $A$, if $\det(A)=0$ then the matrix does not have an inverse, and hence the associated system of equations does not have a unique solution. However, why do the determinant ...
16
votes
2answers
843 views

Characteristic polynomials exhaust all monic polynomials?

Let $A$ be an $n\times n$ matrix, then $\mathrm{char}_A(x):=\det(xI-A)$ is a monic polynomial of degree $n$. It is called the characteristic polynomial of $A$. My question is the converse: Let $p(...
16
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 ...
16
votes
2answers
20k views

Reflection across a line?

The linear transformation matrix for a reflection across the line $y = mx$ is: $$\frac{1}{1 + m^2}\begin{pmatrix}1-m^2&2m\\2m&m^2-1\end{pmatrix} $$ My professor gave us the formula ...
16
votes
2answers
711 views

Geometric interpretation of the cofactor expansion theorem

I find the geometric interpretation of determinants to be really intuitive - they are the "area" created by the column vectors of the matrix. Could someone give me a geometric interpretation of the ...
16
votes
2answers
867 views

easier way of calculating the determinant for this matrix

I have to calculate the determinant of this matrix: $$ \begin{pmatrix} a&b&c&d\\b&c&d&a\\c&d&a&b\\d&a&b&c \end{pmatrix} $$ Is there an easier way of ...
16
votes
2answers
4k views

Topology of matrices

1.Consider the set of all $n×n$ matrices with real entries as the space $\mathbb R^{n^2}$ . Which of the following sets are compact? (a) The set of all orthogonal matrices. (b) The set of all ...
16
votes
4answers
2k views

How does multiplying by trigonometric functions in a matrix transform the matrix?

I found this comic: But I can't understand the humor because I can't understand how trig functions affect matrix multiplication. Can someone please explain?
16
votes
4answers
2k views

Converting recursive equations into matrices

How do we convert recursive equations into matrix forms? For instance, consider this recursive equation(Fibonacci Series): $$F_n = F_{n-1} + F_{n-2}$$ And it comes out to be that the following that ...
16
votes
4answers
569 views

Powers of random matrices

Let $M$ be an $n \times n$ matrix whose elements are random reals in [0,1]. Two questions. What is the growth rate of the magnitude of the elements of $M^k$ as a function of $k$? It is definitely ...
16
votes
4answers
771 views

Avoiding the Cayley–Hamilton theorem [duplicate]

Every $n\times n$ matrix satisfies a polynomial equation of degree at most $n^2$, simply because the space of $n\times n$ matrices has dimension $n^2$. By the Cayley–Hamilton theorem, every matrix ...
16
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'' ...
16
votes
1answer
3k views

Probability that a random binary matrix is invertible?

What is the probability that a random $\{0,1\}$, $n \times n$ matrix is invertible? Assume the 0 and 1 are each present in an entry with probability $\frac{1}{2}$. Is there an explicit formula as a ...
16
votes
4answers
5k views

Square root of a matrix

Under what conditions does a matrix $A$ have a square root? I saw somewhere that this is true for Hermitian positive definite matrices(whose definition I just looked up). Moreover, is it possible ...
16
votes
3answers
5k views

Are one-by-one matrices equivalent to scalars?

I am a programmer, so to me $[x] \neq x$—a scalar in some sort of container is not equal to the scalar. However, I just read in a math book that for $1 \times 1$ matrices, the brackets are often ...
16
votes
1answer
6k views

Relationship between eigendecomposition and singular value decomposition

Let $A \in \mathbb{R}^{n\times n}$ be a real symmetric matrix. Please help me clear up some confusion about the relationship between the singular value decomposition of $A$ and the eigen-decomposition ...
16
votes
2answers
296 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 ...
16
votes
1answer
2k views

Under what circumstance will a covariance matrix be positive semi-definite rather than positive definite?

I have a covariance matrix: $\operatorname{cov}(\mathbf{X}, \mathbf{X}) = \operatorname{E}[(\mathbf{X} - \operatorname{E}[\mathbf{X}])(\mathbf{X} - \operatorname{E}[\mathbf{X}])^T]$ According to ...
16
votes
2answers
773 views

Trace inequality for real matrices

Is there any general result characterizing real matrices $A$ such that $$[\mathrm{tr}(A)]^2\leq n\mathrm{tr}(A^2)?$$ I can see that the inequality holds if: all eigenvalues of $A$ are real (by the ...
16
votes
1answer
166 views

How to calculate the number of factorizations of a square matrix?

I need to write a function, that, given a square matrix M of non-negative integers, calculates the number of representations of M as a product of two square matrices of non-negative integers. Could ...
16
votes
1answer
333 views

What is the number of $n \times n$ binary matrices $A$ such that $\det(A) = \text{perm}(A)$?

Recall that the permanent is the 'positive analog' of the determinant whereby the signs in the cofactor expansion process are taken as positive. That is, the permanent is the immanant corresponding to ...
16
votes
0answers
283 views

What does the ideal norm of matrix elements really mean?

Say we have a number field $K$ (specifically, an imaginary quadratic field) and a $2\times2$ matrix $\sigma=\pmatrix{a&c\\b&d}$ with elements $a,b,c,d\in\mathcal O_k$, the ring of integers of $...
15
votes
8answers
1k views

How can I show that $\begin{pmatrix} 1 & 1 \\ 0 & 1\end{pmatrix}^n = \begin{pmatrix} 1 & n \\ 0 & 1\end{pmatrix}$?

Well, the original task was to figure out what the following expression evaluates to for any $n$. $$\begin{pmatrix} 1 & 1 \\ 0 & 1\end{pmatrix}^{\large n}$$ By trying out different values of ...
15
votes
4answers
2k views

Is $A + A^{-1}$ always invertible?

Let $A$ be an invertible matrix. Then is $A + A^{-1}$ invertible for any $A$? I have a hunch that it's false, but can't really find a way to prove it. If you give a counterexample, could you please ...
15
votes
5answers
751 views

Does there exist a matrix $\mathbf{A}\in\mathbb{R}^{3\times3}$ such that $\mathbf{A}^{2}=-\mathbf{I}$?

Is it possible for a matrix $\mathbf{A}\in\mathbb{R}^{3\times3}$, $$\mathbf{A}^2=-\mathbf{I}$$ I know that It is possible for $2\times2$ matrix, but is it possible for $3\times3$ matrix ?