Linear Combination of Vectors

One vector is dependent on other vectors, if it is a linear combination of the other vectors. If one vector is equal to the sum of scalar multiples of other vectors, it is said to be a linear combination of the other vectors. For example, suppose a = 2b + 3c, as shown below.

Note that 2b is a scalar multiple and 3c is a scalar multiple. Thus, a is a linear combination of b and c.

Linear Dependence of Vectors

A set of vectors is linearly independent if no vector in the set is (a) a scalar multiple of another vector in the set or (b) a linear combination of other vectors in the set; conversely, a set of vectors is linearly dependent if any vector in the set is (a) a scalar multiple of another vector in the set or (b) a linear combination of other vectors in the set. Consider the row vectors below.

Note the following:

Vectors a and b are linearly independent, because neither vector is a scalar multiple of the other. Vectors a and d are linearly dependent, because d is a scalar multiple of a; i.e., d = 2a. Vector c is a linear combination of vectors a and b, because c = a + b. Therefore, the set of vectors a, b, and c is linearly dependent. Vectors d, e, and f are linearly independent, since no vector in the set can be derived as a scalar multiple or a linear combination of any other vectors in the set.

Test Your Understanding of This Lesson

Consider the row vectors shown below. [ 0 1 2]
A

[ 3 2 1]
B

[ 3 3 3]
C

[ 3 4 5]
d

Which of the following statements are true? (A) Vectors a, b, and c are linearly dependent. (B) Vectors a, b, and d are linearly dependent. (C) Vectors b, c, and d are linearly dependent. (D) All of the above. (E) None of the above. Solution The correct answer is (D), as shown below.

Vectors a, b, and c are linearly dependent, since a + b = c. Vectors a, b, and d are linearly dependent, since 2a + b = d. Vectors b, c, and d are linearly dependent, since 2c - b = d.

Row Echelon Form

A matrix is in row echelon form (ref) when it satisfies the following conditions.

The first non-zero element in each row, called the leading entry, is 1. Each leading entry is in a column to the right of the leading entry in the previous row. Rows with all zero elements, if any, are below rows having a non-zero element.

Each of the matrices shown below are examples of matrices in row echelon form.
1234 1234 0013 0013 0001 0001 0000 Aref Bref Cref 00 01 12

Reduced Row Echelon Form

A matrix is in reduced row echelon form (rref) when it satisfies the following conditions.

The matrix satisfies conditions for a row echelon form. The leading entry in each row is the only non-zero entry in its column.

Each of the matrices shown below are examples of matrices in reduced row echelon form.
1200 1200 0010 0010 0001 0001 0000 Arref Brref Crref 00 01 10

The Rank of a Matrix

You can think of an r x c matrix as a set of r row vectors, each having c elements; or you can think of it as a set of c column vectors, each having r elements. The rank of a matrix is defined as (a) the maximum number of linearly independent column vectors in the matrix or (b) the maximum number of linearly independent row vectors in the matrix. Both definitions are equivalent. For an r x c matrix,

If r is less than c, then the maximum rank of the matrix is r. If r is greater than c, then the maximum rank of the matrix is c.

The rank of a matrix would be zero only if the matrix had no elements. If a matrix had even one element, its minimum rank would be one.

How to Find Matrix Rank

The maximum number of linearly independent vectors in a matrix is equal to the number of non-zero rows in its row echelon matrix. Therefore, to find the rank of a matrix, we simply transform the matrix to its row echelon form and count the number of non-zero rows. Consider matrix A and its row echelon matrix, Aref. Previously, we showed how to find the row echelon form for matrix A.
012 121 278 A 121 012 000 Aref

Because the row echelon form Aref has two non-zero rows, we know that matrix A has two independent row vectors; and we know that the rank of matrix A is 2.

You can verify that this is correct. Row 1 and Row 2 of matrix A are linearly independent. However, Row 3 is a linear combination of Rows 1 and 2. Specifically, Row 3 = 3*( Row 1 ) + 2*( Row 2). Therefore, matrix A has only two independent row vectors.

Full Rank Matrices

When all of the vectors in a matrix are linearly independent, the matrix is said to be full rank. Consider the matrices A and B below.
102 123 A= 246 321 B= 210

Notice that row 2 of matrix A is a scalar multiple of row 1; that is, row 2 is equal to twice row 1. Therefore, rows 1 and 2 are linearly dependent. Matrix A has only one linearly independent row, so its rank is 1. Hence, matrix A is not full rank. Now, look at matrix B. All of its rows are linearly independent, so the rank of matrix B is 3. Matrix B is full rank.

Test Your Understanding of This Lesson

Consider the matrix X, shown below.
1244 X= 3480

What is its rank? (A) 0 (B) 1 (C) 2 (D) 3 (E) 4 Solution The correct answer is (C). Since the matrix has more than zero elements, its rank must be greater than zero. And since it has fewer rows than columns, its maximum rank is equal to the maximum number of linearly independent rows. And because neither row is linearly dependent on the other row, the matrix has 2 linearly independent rows; so its rank is 2.

Problem 2 Consider the matrix Y, shown below.

123 235 Y= 347 459

What is its rank? (A) 0 (B) 1 (C) 2 (D) 3 (E) 4 Solution The correct answer is (C). Since the matrix has more than zero elements, its rank must be greater than zero. And since it has fewer columns than rows, its maximum rank is equal to the maximum number of linearly independent columns. Columns 1 and 2 are independent, because neither can be derived as a scalar multiple of the other. However, column 3 is linearly dependent on columns 1 and 2, because column 3 is equal to column 1 plus column 2. That leaves the matrix with a maximum of two linearly independent columns; e.g., column 1 and column 2. So the matrix rank is 2.

FOR MORE INFO ON MATRICES: http://stattrek.com/matrix-algebra/matrix-algebra-tutorial.aspx