Exercise 2.3.3. Given the general triangular matrix
show that the rows of are linearly dependent if any of the diagonal entries , , or is zero.
Answer: We can test for linear independence of the rows by doing elimination on a second matrix whose columns are the rows of :
We start by doing a row exchange to exchange the first row with the third:
If we have the following matrix:
This matrix has at most only two pivots, and might have only one or even zero depending on the values of the other entries, so that the rank . So if the columns of , and thus the rows of , are linearly dependent.
if we have the following matrix
Elimination would produce a matrix with two pivots at most, so if we again have and the columns of , and thus the rows of , are linearly dependent.
Finally if we have the following matrix
Again elimination would produce a matrix with two pivots at most, so if we again have and the columns of , and thus the rows of , are linearly dependent.
We conclude that if any of , , or are zero then the rows of are guaranteed to be linearly dependent.
NOTE: This continues a series of posts containing worked out exercises from the (out of print) book Linear Algebra and Its Applications, Third Edition by Gilbert Strang.
If you find these posts useful I encourage you to also check out the more current Linear Algebra and Its Applications, Fourth Edition, Dr Strang’s introductory textbook Introduction to Linear Algebra, Fourth Edition and the accompanying free online course, and Dr Strang’s other books.