Rank and Nullity. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics

Similar documents
Lecture 21: 5.6 Rank and Nullity

Elementary Matrices. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics

Row Space, Column Space, and Nullspace

4.9 The Rank-Nullity Theorem

General Vector Space (3A) Young Won Lim 11/19/12

Math 313 Chapter 5 Review

Properties of Linear Transformations from R n to R m

Row Space and Column Space of a Matrix

MATH 2360 REVIEW PROBLEMS

LECTURE 6: VECTOR SPACES II (CHAPTER 3 IN THE BOOK)

Algorithms to Compute Bases and the Rank of a Matrix

Solutions to Math 51 First Exam April 21, 2011

Math 323 Exam 2 Sample Problems Solution Guide October 31, 2013

MATH 2331 Linear Algebra. Section 2.1 Matrix Operations. Definition: A : m n, B : n p. Example: Compute AB, if possible.

Math 123, Week 5: Linear Independence, Basis, and Matrix Spaces. Section 1: Linear Independence

DM559 Linear and Integer Programming. Lecture 6 Rank and Range. Marco Chiarandini

Linear Algebra: Homework 7

5.4 Basis And Dimension

Math 2174: Practice Midterm 1

MATH 2331 Linear Algebra. Section 1.1 Systems of Linear Equations. Finding the solution to a set of two equations in two variables: Example 1: Solve:

3.3 Linear Independence

MATH10212 Linear Algebra B Homework Week 3. Be prepared to answer the following oral questions if asked in the supervision class

Chapter 1. Vectors, Matrices, and Linear Spaces

Math 102, Winter 2009, Homework 7

Diagonalization. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics

The definition of a vector space (V, +, )

Properties of the Determinant Function

Evaluating Determinants by Row Reduction

Glossary of Linear Algebra Terms. Prepared by Vince Zaccone For Campus Learning Assistance Services at UCSB

Midterm 1 Solutions Math Section 55 - Spring 2018 Instructor: Daren Cheng

Lecture 22: Section 4.7

Review Notes for Linear Algebra True or False Last Updated: February 22, 2010

Solutions of Linear system, vector and matrix equation

Chapter 2. General Vector Spaces. 2.1 Real Vector Spaces

Chapters 5 & 6: Theory Review: Solutions Math 308 F Spring 2015

Section 1.1 System of Linear Equations. Dr. Abdulla Eid. College of Science. MATHS 211: Linear Algebra

SECTION 3.3. PROBLEM 22. The null space of a matrix A is: N(A) = {X : AX = 0}. Here are the calculations of AX for X = a,b,c,d, and e. =

MODULE 8 Topics: Null space, range, column space, row space and rank of a matrix

Linear Independence. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics

Lecture 6 & 7. Shuanglin Shao. September 16th and 18th, 2013

2. Linear algebra. matrices and vectors. linear equations. range and nullspace of matrices. function of vectors, gradient and Hessian

Orthonormal Bases; Gram-Schmidt Process; QR-Decomposition

MATH 323 Linear Algebra Lecture 12: Basis of a vector space (continued). Rank and nullity of a matrix.

2. Every linear system with the same number of equations as unknowns has a unique solution.

(a) only (ii) and (iv) (b) only (ii) and (iii) (c) only (i) and (ii) (d) only (iv) (e) only (i) and (iii)

MTH 362: Advanced Engineering Mathematics

Math Final December 2006 C. Robinson

Chapter 2 Subspaces of R n and Their Dimensions

Math 18, Linear Algebra, Lecture C00, Spring 2017 Review and Practice Problems for Final Exam

ft-uiowa-math2550 Assignment OptionalFinalExamReviewMultChoiceMEDIUMlengthForm due 12/31/2014 at 10:36pm CST

LINEAR ALGEBRA REVIEW

Applied Matrix Algebra Lecture Notes Section 2.2. Gerald Höhn Department of Mathematics, Kansas State University

MATH 240 Spring, Chapter 1: Linear Equations and Matrices

MATH 20F: LINEAR ALGEBRA LECTURE B00 (T. KEMP)

MA 242 LINEAR ALGEBRA C1, Solutions to First Midterm Exam

Chapter 3. Directions: For questions 1-11 mark each statement True or False. Justify each answer.

MA 265 FINAL EXAM Fall 2012

EK102 Linear Algebra PRACTICE PROBLEMS for Final Exam Spring 2016

ELE/MCE 503 Linear Algebra Facts Fall 2018

Math 4A Notes. Written by Victoria Kala Last updated June 11, 2017

YORK UNIVERSITY. Faculty of Science Department of Mathematics and Statistics MATH M Test #1. July 11, 2013 Solutions

1 Systems of equations

Chapter 5. Linear Algebra. A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form

MATH 1553, Intro to Linear Algebra FINAL EXAM STUDY GUIDE

Dr. Abdulla Eid. Section 4.2 Subspaces. Dr. Abdulla Eid. MATHS 211: Linear Algebra. College of Science

Vector Spaces, Orthogonality, and Linear Least Squares

Chapter 5. Linear Algebra. Sections A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form

1. Let m 1 and n 1 be two natural numbers such that m > n. Which of the following is/are true?

Elementary Linear Algebra Review for Exam 2 Exam is Monday, November 16th.

Math 353, Practice Midterm 1

Spring 2014 Math 272 Final Exam Review Sheet

Find the solution set of 2x 3y = 5. Answer: We solve for x = (5 + 3y)/2. Hence the solution space consists of all vectors of the form

Midterm 1 Review. Written by Victoria Kala SH 6432u Office Hours: R 12:30 1:30 pm Last updated 10/10/2015

1. Determine by inspection which of the following sets of vectors is linearly independent. 3 3.

7. Dimension and Structure.

Math 308 Discussion Problems #4 Chapter 4 (after 4.3)

CSL361 Problem set 4: Basic linear algebra

Math 3C Lecture 20. John Douglas Moore

Math 315: Linear Algebra Solutions to Assignment 7

Matrix invertibility. Rank-Nullity Theorem: For any n-column matrix A, nullity A +ranka = n

We showed that adding a vector to a basis produces a linearly dependent set of vectors; more is true.

Chapter 5. Linear Algebra. Sections A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form

1. Select the unique answer (choice) for each problem. Write only the answer.

Name: MATH 3195 :: Fall 2011 :: Exam 2. No document, no calculator, 1h00. Explanations and justifications are expected for full credit.

SSEA Math 51 Track Final Exam August 30, Problem Total Points Score

System of Linear Equations

Math 54 First Midterm Exam, Prof. Srivastava September 23, 2016, 4:10pm 5:00pm, 155 Dwinelle Hall.

Notes on Row Reduction

Solution: (a) S 1 = span. (b) S 2 = R n, x 1. x 1 + x 2 + x 3 + x 4 = 0. x 4 Solution: S 5 = x 2. x 3. (b) The standard basis vectors

Introduction to Mathematical Programming IE406. Lecture 3. Dr. Ted Ralphs

Lecture 2 Systems of Linear Equations and Matrices, Continued

2018 Fall 2210Q Section 013 Midterm Exam II Solution

Review of Some Concepts from Linear Algebra: Part 2

Math 224, Fall 2007 Exam 3 Thursday, December 6, 2007

MAT 242 CHAPTER 4: SUBSPACES OF R n

Math 314H EXAM I. 1. (28 points) The row reduced echelon form of the augmented matrix for the system. is the matrix

Linear Algebra Exam 1 Spring 2007

1111: Linear Algebra I

MATH2210 Notebook 3 Spring 2018

Math 54 HW 4 solutions

Transcription:

Rank and Nullity MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015

Objectives We have defined and studied the important vector spaces associated with matrices (row space, column space, and null space). We will focus today on the relationships between the dimensions of these vector spaces.

Equal Dimensions for Row and Column Spaces Consider the matrix A and its reduced row echelon form R. 1 3 4 2 5 4 A = 2 6 9 1 8 2 2 6 9 1 9 7 1 3 4 2 5 4 R = 1 3 0 14 0 37 0 0 1 3 0 4 0 0 0 0 1 5 0 0 0 0 0 0 We can see from R that the column space and row space of A are both three-dimensional.

General Result Theorem The row space and column space of a matrix A have the same dimension.

General Result Theorem The row space and column space of a matrix A have the same dimension. Proof. Elementary row operations do not change the dimensions of the row space or column space of a matrix.

General Result Theorem The row space and column space of a matrix A have the same dimension. Proof. Elementary row operations do not change the dimensions of the row space or column space of a matrix. If R is the row echelon form of A then dim(row space of A) = dim(row space of R) dim(column space of A) = dim(column space of R).

General Result Theorem The row space and column space of a matrix A have the same dimension. Proof. Elementary row operations do not change the dimensions of the row space or column space of a matrix. If R is the row echelon form of A then dim(row space of A) = dim(row space of R) dim(column space of A) = dim(column space of R). Dimension of row space of R is the number of nonzero rows which equals the number of leading 1 s which is the dimension of the column space.

Rank and Nullity Definition The dimension of the row and column space of A is called the rank of A, denoted rank(a). The dimension of the null space of A is called the nullity of A, denoted nullity(a).

Example, 5 5 Matrix Find the rank and nullity of A = 1 3 1 1 2 0 3 6 0 3 2 3 2 3 4 3 6 0 6 5 2 9 2 4 6 1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 = R

Example 4 6 Matrix Find the rank and nullity of B = 6 5 2 5 9 4 8 1 6 6 3 1 6 1 6 7 4 1 1 9 1 3 9 8 1105 1148 375 574 164 153 164 2029 1 0 0 0 1148 101 0 1 0 0 574 259 0 0 1 0 0 0 0 1 1989 574 43 574

Solution (1 of 2) The reduced row echelon form of the matrix equation B x = 0 is equivalent to the system of equations: x 1 = 2029 1148 x 5 1105 1148 x 6 x 2 = 101 574 x 5 375 574 x 6 x 3 = 259 164 x 5 + 153 164 x 6 x 4 = 1989 574 x 5 + 43 574 x 6

Solution (2 of 2) If we treat x 5 and x 6 as parameters we see that the null space of B is spanned by two vectors and hence is two-dimensional. x 1 x 2 x 3 x 4 x 5 x 6 = s 2029 1148 101 574 259 164 1989 574 1 0 + t 1105 1148 375 574 153 164 43 574 0 1

Maximum Value for Rank Question: if A is an m n matrix, what is the maximum possible rank(a)?

Maximum Value for Rank Question: if A is an m n matrix, what is the maximum possible rank(a)? Answer: rows of A lie in R n and the columns of A lie in R m. Maximum dimension of the row space is n and the maximum dimension of the column space is m, thus rank(a) min(m, n).

Dimension Theorem for Matrices Theorem If A is a matrix with n columns, then rank(a) + nullity(a) = n.

Proof Since A has n columns, the linear system A x = 0 has n unknowns. # of leading variables + # of free variables = n

Proof Since A has n columns, the linear system A x = 0 has n unknowns. # of leading variables + # of free variables = n The number of leading variables is the same as the number of leading 1 s in the reduced row echelon form of A. This is the rank(a).

Proof Since A has n columns, the linear system A x = 0 has n unknowns. # of leading variables + # of free variables = n The number of leading variables is the same as the number of leading 1 s in the reduced row echelon form of A. This is the rank(a). The number of free variables is the number of parameters in the solution to A x = 0. This is the nullity(a).

Example Show that the matrix below obeys the Dimension Theorem for Matrices. 6 5 2 5 9 4 B = 8 1 6 6 3 1 6 1 6 7 4 1 1 9 1 3 9 8

Example Show that the matrix below obeys the Dimension Theorem for Matrices. 6 5 2 5 9 4 B = 8 1 6 6 3 1 6 1 6 7 4 1 1 9 1 3 9 8 We saw earlier that rank(b) = 4 and nullity(b) = 2.

Parameters for a Nonhomogeneous System Theorem If A x = b is a consistent linear system of m equations and n unknowns, and if rank(a) = r, then the general solution of A x = b contains n r parameters.

Parameters for a Nonhomogeneous System Theorem If A x = b is a consistent linear system of m equations and n unknowns, and if rank(a) = r, then the general solution of A x = b contains n r parameters. Example If A is a 7 9 matrix of rank 6, then how many free variables are in the general solution of A x = b?

Fundamental Matrix Spaces Suppose A is an m n matrix, then we can discuss the following vector spaces: row space of A column space of A null space of A column space of A T row space of A T null space of A T

Fundamental Matrix Spaces Suppose A is an m n matrix, then we can discuss the following vector spaces: row space of A column space of A null space of A column space of A T row space of A T null space of A T Question: which of these spaces are the same?

Four Fundamental Spaces There are four fundamental matrix spaces: row space of A ( R n ) column space of A ( R m ) null space of A ( R n ) null space of A T ( R m )

Results Theorem If A is a matrix, then rank(a) = rank(a T ).

Results Theorem If A is a matrix, then rank(a) = rank(a T ). Proof. rank(a) = dim(row space of A) = dim(column space of A T ) = rank(a T )

Implications We can express the dimensions of all four of the fundamental spaces in terms of the rank(a). Suppose A is an n m matrix with rank(a) = r

Implications We can express the dimensions of all four of the fundamental spaces in terms of the rank(a). Suppose A is an n m matrix with rank(a) = r nullity(a) = n rank(a) = n r rank(a T ) = rank(a) = r nullity(a T ) = m rank(a) = m r.

Summary Suppose A is an m n matrix of rank r, then Fundamental Space row space of A column space of A null space of A null space of A T Dimension r r n r m r Remark: rank(a) min(m, n)

Equivalent Statements (1 of 2) Theorem If A is an n n matrix, then the following are equivalent. 1. A is invertible. 2. Ax = 0 has only the trivial solution. 3. The reduced row echelon form of A is I n. 4. A is expressible as the product of elementary matrices. 5. Ax = b is consistent for every n 1 matrix b. 6. Ax = b has exactly one solution for every n 1 matrix b. 7. det(a) 0.

Equivalent Statements (2 of 2) Theorem If A is an n n matrix, then in addition to statements (1) (7) the following are equivalent. 8. The column vectors of A are linearly independent. 9. The row vectors of A are linearly independent. 10. The column vectors of A span R n. 11. The row vectors of A span R n. 12. The column vectors of A form a basis for R n. 13. The row vectors of A form a basis for R n. 14. A has rank n. 15. A has nullity 0.

Proof Many of these equivalences have already been proved. Others are homework exercises. Some are proved here. ((2) = (15)) If A x = 0 has only the trivial solution, then there are no parameters in the solution. Thus nullity(a) = 0.

Proof Many of these equivalences have already been proved. Others are homework exercises. Some are proved here. ((2) = (15)) If A x = 0 has only the trivial solution, then there are no parameters in the solution. Thus nullity(a) = 0. ((15) = (14)) If nullity(a) = 0 then rank(a) = n 0 = n.

Proof Many of these equivalences have already been proved. Others are homework exercises. Some are proved here. ((2) = (15)) If A x = 0 has only the trivial solution, then there are no parameters in the solution. Thus nullity(a) = 0. ((15) = (14)) If nullity(a) = 0 then rank(a) = n 0 = n. ((14) = (2)) If rank(a) = n then there are n leading variables and no free variables in the solution of A x = 0. Thus the only solution is the trivial solution.

Overdetermined Systems Remark: If a linear system has more equations than unknowns, it is said to be overdetermined. Consider Ax = b where A is an m n matrix with m > n. rank(a) < m,

Overdetermined Systems Remark: If a linear system has more equations than unknowns, it is said to be overdetermined. Consider Ax = b where A is an m n matrix with m > n. rank(a) < m, column vectors of A cannot span R m,

Overdetermined Systems Remark: If a linear system has more equations than unknowns, it is said to be overdetermined. Consider Ax = b where A is an m n matrix with m > n. rank(a) < m, column vectors of A cannot span R m, Ax = b cannot be consistent for an arbitrary b R m.

Underdetermined Systems Remark: If a linear system has more unknowns than equations, it is said to be underdetermined. Consider Ax = b where A is an m n matrix with m < n. rank(a) < n,

Underdetermined Systems Remark: If a linear system has more unknowns than equations, it is said to be underdetermined. Consider Ax = b where A is an m n matrix with m < n. rank(a) < n, if Ax = b is consistent then the general solution has at least one parameter (free variable),

Underdetermined Systems Remark: If a linear system has more unknowns than equations, it is said to be underdetermined. Consider Ax = b where A is an m n matrix with m < n. rank(a) < n, if Ax = b is consistent then the general solution has at least one parameter (free variable), a consistent underdetermined system has infinitely many solutions.

Example (1 of 2) Question: What can be said about the solutions of an overdetermined system A x = b of 7 equations with 5 unknowns in which rank(a) = 4?

Example (1 of 2) Question: What can be said about the solutions of an overdetermined system A x = b of 7 equations with 5 unknowns in which rank(a) = 4? Answer: there is some vector b R 7 for which the system is consistent. For any such b the number of parameters in the general solution is n rank(a) = 5 4 = 1.

Example (2 of 2) Question: What can be said about the solutions of an underdetermined system A x = b of 5 equations with 7 unknowns in which rank(a) = 4?

Example (2 of 2) Question: What can be said about the solutions of an underdetermined system A x = b of 5 equations with 7 unknowns in which rank(a) = 4? Answer: the system may be consistent or inconsistent. If it is consistent for vector b R 5, then the general solution has a number of parameters equal to n rank(a) = 7 4 = 3.

Homework Read Section 4.8 Exercises: 1, 3, 5, 7, 10, 11, 15, 19, 27