Linear algebra is concerned with vector spaces of all dimensions and linear transformations between them, including systems of linear equations, bases, dimensions, subspaces, matrices, determinants, traces, eigenvalues and eigenvectors, diagonalization, Jordan forms, etc. For questions specifically ...

learn more… | top users | synonyms (1)

123
votes
20answers
25k views

If $AB = I$ then $BA = I$

If $A$ and $B$ are square matrices such that $AB = I$ where $I$ is identity matrix. Show that $BA = I$. I do not understand anything more than the following. Elementary row operations. Linear ...
353
votes
10answers
55k views

What's an intuitive way to think about the determinant?

In my linear algebra class, we just talked about determinants. So far I’ve been understanding the material okay, but now I’m very confused. I get that when the determinant is zero, the matrix doesn’t ...
14
votes
9answers
2k views

A linear operator commuting with all such operators is a scalar multiple of the identity.

The question is from Axler's "Linear Algebra Done Right", which I'm using for self-study. We are given a linear operator $T$ over a finite dimensional vector space $V$. We have to show that $T$ is a ...
13
votes
7answers
1k views

Determinant of a specially structured matrix

I have the following $n\times n$ matrix: $$A=\begin{bmatrix}a&b&\cdots&b\\b&a&\cdots&b\\\vdots& &\ddots&\vdots\\b&\cdots&b&a\end{bmatrix}$$ where $0 ...
18
votes
7answers
7k views

How to prove and interpret $\operatorname{rank}(AB) \leq \operatorname{min}(\operatorname{rank}(A), \operatorname{rank}(B))$?

Let $A$ and $B$ be two matrices which can be multiplied. Then $$\operatorname{rank}(AB) \leq \operatorname{min}(\operatorname{rank}(A), \operatorname{rank}(B)).$$ I proved ...
9
votes
3answers
2k views

The Center of $\operatorname{GL}(n,k)$

The given question: Let $k$ be a field and $n \in \mathbb{N}$. Show that the centre of $\operatorname{GL}(n, k)$ is $\lbrace\lambda I\mid λ ∈ k^∗\rbrace$. I have spent a while trying to prove this ...
33
votes
7answers
18k views

What is a good book to study linear algebra?

I'm looking for a book to learn Algebra. The programme is the following. The units marked with a $\star$ are the ones I'm most interested in (in the sense I know nothing about) and those with a ...
39
votes
4answers
34k views

Union of two vector subspaces not a subspace?

I'm having a difficult time understanding this statement. Can someone please explain with a concrete example?
22
votes
5answers
6k views

Given a matrix, is there always another matrix which commutes with it?

Given a matrix $A$ over a field $F$, does there always exist a matrix $B$ such that $AB = BA$? (except the trivial case and the polynomial ring?)
70
votes
17answers
67k views

Where to start learning Linear Algebra? [closed]

I'm starting a very long quest to learn about math, so that I can program games. I'm mostly a corporate developer, and it's somewhat boring and non exciting. When I began my career, I chose it because ...
69
votes
4answers
11k views

Is there a quick proof as to why the vector space of $\mathbb{R}$ over $\mathbb{Q}$ is infinite-dimensional?

It would seem that one way of proving this would be to show the existence of non-algebraic numbers. Is there a simpler way to show this?
14
votes
1answer
619 views

Determinant of a rank $1$ update of a scalar matrix, or characteristic polynomial of a rank $1$ matrix

This question aims to create an "abstract duplicate" of numerous questions that ask about determinants of specific matrices (I may have missed a few): Eigenvalues of a matrix of $1$'s ...
7
votes
3answers
7k views

Prove rank $A^TA$ = rank $A$ for any $A_{m \times n}$

How can I prove rank $A^TA$ = rank $A$ for any $A_{m \times n}$? This is an exercise in my textbook associated with orthogonal projections and Gram–Schmidt process but I am unsure how they are ...
26
votes
5answers
2k views

Similar matrices and field extensions

Given a field $F$ and a subfield $K$ of $F$. Let $A$, $B$ be $n\times n$ matrices such that all the entries of $A$ and $B$ are in $K$. Is it true that if $A$ is similar to $B$ in $F^{n\times n}$ ...
107
votes
8answers
71k views

What is the importance of eigenvalues/eigenvectors?

What is the importance of eigenvalues/eigenvectors?
54
votes
9answers
80k views

Inverse of the sum of matrices

I have two square matrices - $A$ and $B$. $A^{-1}$ is known and I want to calculate $(A+B)^{-1}$. Are there theorems that help with calculating the inverse of the sum of matrices? In general case ...
24
votes
1answer
18k views

Simultaneously Diagonalizable Proof

Two $n\times n$ matrices $A, B$ are said to be simultaneously diagonalizable if there is a nonsingular matrix $S$ such that both $S^{-1}AS$ and $S^{-1}BS$ are diagonal matrices. a.) Show ...
25
votes
3answers
7k views

Matrix is conjugate to its own transpose

Mariano mentioned somewhere that everyone should prove once in their life that every matrix is conjugate to its transpose. I spent quite a bit of time on it now, and still could not prove it. At the ...
10
votes
3answers
2k views

A vector space over $R$ is not a countable union of proper subspaces

I was looking for alternate proofs of the theorem that "a vector space $V$ of dimension greater than $1$ over an infinite field $\mathbf{F}$ is not a union of fewer than $|\mathbf{F}|$ proper ...
-2
votes
3answers
861 views

Solution of 3 equations in 3 unknowns [closed]

Find the value of $c$ which makes it possible to solve: $$u+v+2w=2,$$ $$2u+3v-w=5,$$ $$3u+4v+w=c$$
29
votes
9answers
29k views

How to show that $\det(AB) =\det(A)\det(B)$

Given two square matrices $A$ and $B$, how do you show that $\det(AB) = \det(A)\det(B)$, where $\det(\cdot)$ is the determinant of the matrix?
23
votes
4answers
3k views

Do $ AB $ and $ BA $ have same minimal and characteristic polynomials?

Let $ A, B $ be two square matrices of order $n$. Do $ AB $ and $ BA $ have same minimal and characteristic polynomials? I have a proof only if $ A$ or $ B $ is invertible. Is it true for all ...
54
votes
3answers
5k views

Why are vector spaces not isomorphic to their duals?

Assuming the axiom of choice, set $\mathbb F$ to be some field (we can assume it has characteristics $0$). I was told, by more than one person, that if $\kappa$ is an infinite cardinal then the ...
14
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 to ...
16
votes
3answers
4k views

When are minimal and characteristic polynomials the same?

Assume that we are working over a complex space $W$ of dimension $n$. When would an operator on this space have the same characteristic and minimal polynomial? I think the easy case is when the ...
8
votes
8answers
2k views

How to calculate the following determinants (all ones, minus $I$)

How do I calculate the determinant of the following $n\times n$ matrices $ \left[ \begin {matrix} 0 & 1 & \ldots & 1 \\ 1 & 0 & \ldots & 1 \\ \vdots & \vdots & ...
7
votes
2answers
613 views

If a field $F$ is such that $\left|F\right|>n-1$ why is $V$ a vector space over $F$ not equal to the union of proper subspaces of $V$

If $U_1$, $U_2,\ldots,U_n$ are proper subspaces of a vector space $V$ over a field $F$, and $|F|\gt n-1$, why is $V$ not equal to the union of the subspaces $U_1$, $U_2,\ldots,U_n$?
8
votes
3answers
3k views

Sylvester's determinant identity

Sylvester's determinant identity states that if $A$ and $B$ are matrices of sizes $m\times n$ and $n\times m$, then $$ \det(I+AB) = \det(I+BA), $$ where in the first case $I$ denotes the $m\times m$ ...
47
votes
4answers
67k views

Eigenvectors of real symmetric matrices are orthogonal

Can someone point me to a paper, or show here, why symmetric matrices have orthogonal eigenvectors? In particular, I'd like to see proof that for a symmetric matrix $A$ there exists decomposition $A = ...
46
votes
2answers
2k views

Axiom of choice and automorphisms of vector spaces

A classical exercise in group theory is "Show that if a group has a trivial automorphism group, then it is of order 1 or 2." I think that the straightforward solution uses that a exponent two group is ...
24
votes
2answers
15k views

matrices commute=common basis of eigenvectors?

I've come across a paper that mentions this as a fact...where can I find the proof?
26
votes
2answers
7k views

Why is the ring of matrices over a field simple?

Denote by $M_{n \times n}(k)$ the ring of $n$ by $n$ matrices with coefficients in the field $k$. Then why does this ring not contain any two-sided ideal? Thanks for any clarification, and this is ...
12
votes
3answers
21k views

Product of symmetric positive semidefinite matrices is positive definite?

I see on wikipedia that the product of two symmetric positive definite matrices is also positive definite (Edit: the matrices must commute or else this is false; I leave the false statement here so ...
14
votes
6answers
2k views

How to solve this recurrence relation? $f_n = 3f_{n-1} + 12(-1)^n$

How to solve this particular recurrence relation ? $$f_n = 3f_{n-1} + 12(-1)^n,\quad f_1 = 0$$ such that $f_2 = 12, f_3 = 24$ and so on. I tried out a lot but due to $(-1)^n$ I am not able to ...
14
votes
5answers
12k views

How to prove $\text{Rank}(AB)\leq \min(\text{Rank}(A), \text{Rank}(B))$? [duplicate]

How to prove $\text{Rank}(AB)\leq \min(\text{Rank}(A), \text{Rank}(B))$?
6
votes
3answers
195 views

reference for linear algebra books that teach reverse Hermite method for symmetric matrices

January 13, 2016: book that does this mentioned in a question today, Linear Algebra Done Wrong by Sergei Treil. He calls it non-orthogonal diagonalization of a quadratic form, calls his first method ...
3
votes
4answers
345 views

If $a,b,c \in R$ are distinct, then $-a^3-b^3-c^3+3abc \neq 0$.

If $a,b,c \in R$ are distinct, then $-a^3-b^3-c^3+3abc \neq 0$. I think it is trivial because they are distinct. So I wonder just saying "Since they are distinct" is enough to prove it? Of course ...
46
votes
3answers
33k views

Why is the eigenvector of a covariance matrix equal to a principal component?

If I have a covariance matrix for a data set and I multiply it times one of it's eigenvectors. Let's say the eigenvector with the highest eigenvalue. The result is the eigenvector or a scaled ...
22
votes
4answers
11k views

Understanding of the theorem that all norms are equivalent in finite dimensional vector space

(Edit: Replaced $||\cdot||_0$ with $||\cdot||_1$ to clarify.) The following is a well-known result in functional analysis: If the vector space $X$ is finite dimensional, all norms are equivalent. ...
12
votes
4answers
9k views

Prove that $A+I$ is invertible if $A$ is nilpotent [duplicate]

Possible Duplicate: Units and Nilpotents Given $A^{2012}=0$ prove that $A+I$ is invertible and find an expression for $(A+I)^{-1}$ in terms of $A$. ($I$ is the identity matrix).
9
votes
3answers
1k views

Proof of this result related to Fibonacci numbers: $\begin{pmatrix}1&1\\1&0\end{pmatrix}^n=\begin{pmatrix}F_{n+1}&F_n\\F_n&F_{n-1}\end{pmatrix}$?

$$\begin{pmatrix}1&1\\1&0\end{pmatrix}^n=\begin{pmatrix}F_{n+1}&F_n\\F_n&F_{n-1}\end{pmatrix}$$ Somebody has any idea how to go about proving this result? I know a proof by ...
0
votes
4answers
509 views

Given a $4\times 4$ symmetric matrix, is there an efficient way to find its eigenvalues and diagonalize it?

I have a $4\times 4$ matrix $$A=\left(\begin{array}{cccc}8 & 11 & 4 & 3\\11 & 12 & 4 & 7\\4 & 4 & 7 & 12\\3 & 7 & 12 & 17\end{array}\right).$$ I want to ...
34
votes
5answers
28k views

How do I tell if matrices are similar?

I have two $2\times 2$ matrices, $A$ and $B$, with the same determinant. I want to know if they are similar or not. I solved this by using a matrix called $S$: $$\left(\begin{array}{cc} a& b\\ ...
27
votes
9answers
4k views

Very good linear algebra book.

I plan to self-study linear algebra this summer. I am sorta already familiar with vectors, vector spaces and subspaces and I am really interested in everything about matrices (diagonalization, ...), ...
7
votes
2answers
13k views

Simultaneous diagonalization

Let $V$ be a vector space of finite dimension and let $T,S$ linear diagonalizable transformations from $V$ to itself. I need to prove that if $TS=ST$ every eigenspace $V_\lambda$ of $S$ is ...
6
votes
3answers
3k views

I don't understand why the inverse is this?

my question is related to matrix inverting and Hill cipher(you don't have to know what it is to help me) My teacher gave me an example. First we have a matrix (the key matrix) that multiplied by a ...
38
votes
4answers
3k views

Solutions to the matrix equation $\mathbf{AB-BA=I}$ over general fields

Some days ago, I was thinking on a problem, which states that $AB-BA=I$ does not have a solution in $M_{n\times n}(\mathbb R)$ and $M_{n\times n}(\mathbb C)$. (Here $M_{n\times n}(\mathbb F)$ denotes ...
32
votes
5answers
32k views

Proof that the Trace of a Matrix is the sum of its Eigenvalues

I have looked extensively for a proof on the internet but all of them were too obscure. I would appreciate if someone could lay out a simple proof for this important result. Thank you.
12
votes
5answers
27k 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 ...
8
votes
5answers
3k views

The characteristic and minimal polynomial of a companion matrix

The companion matrix of a monic polynomial in 1 variable over a field $F$ plays an important role in understanding the structure of finite dimensional $F[x]$-modules. It is an important fact that the ...