Ready to improve network connectivity? Watch this webinar to learn how SD-WANs and a one-click instant connect tool can boost provisions, deployment, and management of your cloud connection.

Become a Premium Member and unlock a new, free course in leading technologies each month.

Solved

Posted on 2004-04-12

hi, all,

Does anybody know how to prove that for the nxn matrix, if rank(A)<n, then det(A)=0;

any help will be highly appreciated.

Chris

Does anybody know how to prove that for the nxn matrix, if rank(A)<n, then det(A)=0;

any help will be highly appreciated.

Chris

Add your voice to the tech community where 5M+ people just like you are talking about what matters.

- Help others & share knowledge
- Earn cash & points
- Learn & ask questions

2 Comments

if one of the rows or columns of the matrix is a linear combination of the other rows or columns then the determinate of the matrix is 0

thanks for the answer, I think I got the answer already.

Since the determinant of a matrix has such properties as follows.

1. any row or column of a matrix added to one row or column, the determinant will not change.

2. if matrix B is one row or column of a matrix A multiply a constant k, then the det(B)=k*det(A);

3. if any row or column of a matrix A is 0, then det(A)=0;

And if rank(A)<n, then we must have at least two rows or columns are linearly dependant, it means k*Ai+Aj=0(Ai and Aj are the vectors of matrix A).

So if we do this operation on matrix A to get a matrix B in which one vector is 0, then we can have det(A)=k*det(B)=0. Then we got it proved.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

This is a research brief on the potential colonization of humans on Mars.

Course of the Month8 days, 15 hours left to enroll

Join the community of 500,000 technology professionals and ask your questions.