Rank of a Matrix: Can We Eliminate Lines to Get Non-Vanishing Determinant?

  • Thread starter Thread starter quasar987
  • Start date Start date
  • Tags Tags
    Matrix rank
quasar987
Science Advisor
Homework Helper
Gold Member
Messages
4,796
Reaction score
32
If A is an nxk matrix of real numbers (n>=k) of rank k, is it true that we can eliminate n-k lines of A to obtain a matrix A' of nonvanishing determinant?

I convinced myself of that one time while in the bus and now I can't find the proof.
 
Physics news on Phys.org
Hmm, if A is of rank k, then that means that the row space of A is spanned by k vectors , and this means that we can eliminate (n-k) rows of A which are effectively linear combinations of the others. So when we do that we have A', which is a kxk matrix and of rank k, which implies that it is invertible which in turn implies its det is non-zero.
 
Ohhh.. yeah!

Thanks!
 
Welcome. I'm trying to jog my linear algebra memory for a intermediate linear algebra class this semester.
 

Thread 'Trouble understanding an online solution to an exercise in Dummit & Foote'

##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
View full post »

Thread 'Questions about non existence of GCDs vs (coimages, cokernels)'

The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
View full post »

Thread 'Decomposition into irreps of compact Lie group'

When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
View full post »

Similar threads

I Matrix rank in terms of determinant polynomial
Replies
14
Views
3K
I Uniqueness of reduced row echelon form (proof verification)
Replies
4
Views
1K
I Confused about small detail in rank-nullity theorem
Replies
1
Views
1K
I How can I convince myself that I can find the inverse of this matrix?
Replies
34
Views
3K
I Can't understand a step in an LU decomposition proof
Replies
1
Views
2K
A Understanding Rank of a Matrix: Important Theorem and Demonstration
Replies
5
Views
2K
Probability of a matrix having full rank
Replies
2
Views
4K
B Is it invalid to redefine the sgn function in this way in a proof?
Replies
15
Views
4K
I On a bound on the norm of a matrix with a simple pole
Replies
8
Views
3K
Determinant of a non-square matrix?
Replies
5
Views
11K

Hot Threads

Recent Insights

Back
Top