[go: up one dir, main page]

0% found this document useful (0 votes)
54 views14 pages

Math 240: Linear Systems and Rank of A Matrix: Ryan Blair

The document discusses using the rank of a matrix to determine linear independence and consistency of systems of linear equations. It defines linear independence and describes how to use the rank of a matrix to determine if vectors are linearly independent. It also explains how the rank of an augmented matrix can determine if a system is consistent, has infinitely many solutions, or is inconsistent.

Uploaded by

Vishwa Sai
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
54 views14 pages

Math 240: Linear Systems and Rank of A Matrix: Ryan Blair

The document discusses using the rank of a matrix to determine linear independence and consistency of systems of linear equations. It defines linear independence and describes how to use the rank of a matrix to determine if vectors are linearly independent. It also explains how the rank of an augmented matrix can determine if a system is consistent, has infinitely many solutions, or is inconsistent.

Uploaded by

Vishwa Sai
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 14

Math 240: Linear Systems and Rank of a Matrix

Ryan Blair

University of Pennsylvania

Thursday January 20, 2011

Ryan Blair (U Penn) Math 240: Linear Systems and Rank of a Matrix Thursday January 20, 2011 1 / 10
Outline

1 Review of Last Time

2 linear Independence

Ryan Blair (U Penn) Math 240: Linear Systems and Rank of a Matrix Thursday January 20, 2011 2 / 10
Review of Last Time

Review of last time

1 Transpose of a matrix
2 Special types of matrices
3 Matrix properties
4 Row-echelon and reduced row echelon form
5 Solving linear systems using Gaussian and Gauss-Jordan elimination

Ryan Blair (U Penn) Math 240: Linear Systems and Rank of a Matrix Thursday January 20, 2011 3 / 10
Review of Last Time

Echelon Forms

Definition
A matrix is in row-echelon form if
1 Any row consisting of all zeros is at the bottom of the matrix.
2 For all non-zero rows the leading entry must be a one. This is called
the pivot.
3 In consecutive rows the pivot in the lower row appears to the right of
the pivot in the higher row.

Definition
A matrix is in reduced row-echelon form if it is in row-echelon form and
every pivot is the only non-zero entry in its column.

Ryan Blair (U Penn) Math 240: Linear Systems and Rank of a Matrix Thursday January 20, 2011 4 / 10
Review of Last Time

Row Operations

We will be applying row operations to augmented matrices to find solutions


to linear equations. This is called Gaussian or Gauss-Jordan elimination.

Here are the row operations:


1 Multiply a row by a number.
2 Switch rows.
3 Add a multiple of one row to another.

Ryan Blair (U Penn) Math 240: Linear Systems and Rank of a Matrix Thursday January 20, 2011 5 / 10
Review of Last Time

Row Operations

We will be applying row operations to augmented matrices to find solutions


to linear equations. This is called Gaussian or Gauss-Jordan elimination.

Here are the row operations:


1 Multiply a row by a number.
2 Switch rows.
3 Add a multiple of one row to another.
Key Fact: If you alter an augmented matrix by row operations you
preserve the set of solutions to the linear system.

Ryan Blair (U Penn) Math 240: Linear Systems and Rank of a Matrix Thursday January 20, 2011 5 / 10
linear Independence

Todays Goals

1 Be able to use rank of a matrix to determine if vectors are linearly


independent.
2 Be able to use rank of an augmented matrix to determine consistency
or inconsistency of a system.

Ryan Blair (U Penn) Math 240: Linear Systems and Rank of a Matrix Thursday January 20, 2011 6 / 10
linear Independence

Linear Independence

Definition
Let v1 , ..., vm be vectors in Rn . The set S = {v1 , ..., vm } is linearly
independent if c1 v1 + c2 v2 + ... + cn vn = 0 implies c1 = c2 = ... = cn = 0.

If there exists a non trivial solution to c1 v1 + c2 v2 + ... + cn vn = 0 we say


the set S is linearly dependant.

Ryan Blair (U Penn) Math 240: Linear Systems and Rank of a Matrix Thursday January 20, 2011 7 / 10
linear Independence

Linear Independence

Definition
Let v1 , ..., vm be vectors in Rn . The set S = {v1 , ..., vm } is linearly
independent if c1 v1 + c2 v2 + ... + cn vn = 0 implies c1 = c2 = ... = cn = 0.

If there exists a non trivial solution to c1 v1 + c2 v2 + ... + cn vn = 0 we say


the set S is linearly dependant.

Example: Are the following vectors linearly independent?

< 1, 2, 1 >, < 1, 1, 0 >, < 1, 0, 1 >

Ryan Blair (U Penn) Math 240: Linear Systems and Rank of a Matrix Thursday January 20, 2011 7 / 10
linear Independence

Definition
Let A be an m n matrix. The rank of A is the maximal number of
linearly independent row vectors

Definition
(Pragmatic)
Let A be an m n matrix and B be its row-echelon form. The rank of A
is the number of pivots of B.

Ryan Blair (U Penn) Math 240: Linear Systems and Rank of a Matrix Thursday January 20, 2011 8 / 10
linear Independence

Definition
Let A be an m n matrix. The rank of A is the maximal number of
linearly independent row vectors

Definition
(Pragmatic)
Let A be an m n matrix and B be its row-echelon form. The rank of A
is the number of pivots of B.

Example
What is therank of the following matrix.
2 0 1 1
0 1 2 1
2 1 1 2

Ryan Blair (U Penn) Math 240: Linear Systems and Rank of a Matrix Thursday January 20, 2011 8 / 10
linear Independence

Determining Linear independence Using Matrices

How to find if m vectors are linearly independent:


1 Make the vectors the rows of a m n matrix (where the vectors are
of size n)
2 Find the rank of the matrix.
3 If the rank is m then the vectors are linearly independent. If the rank
is less than m, then the vectors are linearly dependant.

Ryan Blair (U Penn) Math 240: Linear Systems and Rank of a Matrix Thursday January 20, 2011 9 / 10
linear Independence

Determining Linear independence Using Matrices

How to find if m vectors are linearly independent:


1 Make the vectors the rows of a m n matrix (where the vectors are
of size n)
2 Find the rank of the matrix.
3 If the rank is m then the vectors are linearly independent. If the rank
is less than m, then the vectors are linearly dependant.

Example: Are the following vectors linearly independent?

< 2, 0, 4, 1 >, < 0, 0, 1, 1 >, < 0, 1, 0, 1 >, < 3, 2, 3, 0 >

Ryan Blair (U Penn) Math 240: Linear Systems and Rank of a Matrix Thursday January 20, 2011 9 / 10
linear Independence

Determining Consistency

Given the linear system Ax = B and the augmented matrix (A|B).


1 If rank(A) = rank(A|B) = the number of rows in x, then the system
has a unique solution.
2 If rank(A) = rank(A|B) < the number of rows in x, then the system
has -many solutions.
3 If rank(A) < rank(A|B), then the system is inconsistent.

Ryan Blair (U Penn) Math 240: Linear Systems and Rank of a MatrixThursday January 20, 2011 10 / 10

You might also like