Matrix Vector Spaces: Invertible Basis?

Click For Summary

Homework Help Overview

The discussion revolves around the question of whether the vector space of all square matrices can have a basis consisting solely of invertible matrices. The original poster notes that while the 2x2 case has an invertible basis, they are uncertain about generalizing this to all nxn matrices.

Discussion Character

  • Exploratory, Assumption checking, Conceptual clarification

Approaches and Questions Raised

  • Participants explore the possibility of finding a basis for square matrices without the invertibility constraint. There is a suggestion to consider matrices with a single 1 and zeros elsewhere as a basis. The original poster also attempts to construct invertible matrices from this basis.

Discussion Status

The discussion is ongoing, with participants sharing ideas and questioning assumptions about the properties of determinants and invertibility. Some guidance has been offered regarding the construction of matrices, but no consensus has been reached on the main question.

Contextual Notes

There is a mention of the determinant's properties, specifically that it is not linear, which may influence the discussion on constructing invertible matrices. The original poster's attempt to generalize from the 2x2 case to nxn matrices is also a point of consideration.

venom192
Messages
5
Reaction score
0

Homework Statement



Does the vector space of all square matrices have a basis of invertible matrices?

Homework Equations



No relevant equations.

The Attempt at a Solution



I know that the 2x2 case has an invertible basis, but I don't know how to generalize it for the vector space of all nxn matrices. Any hint would be appreciated.
 
Physics news on Phys.org
Can you find a basis of the square matrices (without the requirement that every element of the basis should be invertible)??
 
Here's what I'm thinking.
Take a basis of vector space of square matrices V, such that each matrix has a single 1 and all other elements are 0.
If you take a basis {v1, ... vn} and replace vk with c1v1 + ... + cnvn, you still get a basis, as long as ck is not 0. That is easy to prove, if needed.
Take some invertible matrix m1 = c1v1 + ... + cnvn in V, such that c1 is not 0 and replace v1 with it. I'm going to build an invertible matrix m2 = m1 + a2v2. Since det is a linear function, we can write it as kx + b, where x is some element of the matrix. The thing to prove is that if kx+b ≠ 0, then there exists 'a' ≠ 0 such that k(x+a) + b ≠ 0. The condition implies that k and b can't be both 0, so (due to linearity) there exists at most 1 point where k(x+a)+b = 0. We can always choose a different one, thus we can always build m2. Likewise mn = mn-1 + anvn, gives an invertible basis {m1, ..., mn}
 
Well first of all, the determinant is not a linear function.

But you have a nice idea. Just take a matrix with 0 everywhere but on one place a 1. This is obviously not invertible. But can you modify it so that it becomes invertible? Try to do some stuff to the diagonal.
 

Similar threads

Replies
8
Views
2K
  • · Replies 18 ·
Replies
18
Views
3K
Replies
15
Views
3K
  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
Replies
4
Views
5K