This document contains lecture notes from Dr. Krishnendra Shekhawat of BITS Pilani on the topic of linear algebra. The notes cover various concepts related to matrices including the inverse of a matrix. The key points discussed are:
1. A matrix A is invertible if there exists another matrix B such that AB = BA = I. This inverse B is unique and denoted as A^-1.
2. The reduced row echelon form (RREF) of a matrix can be used to determine if a matrix is invertible and to find its inverse. Specifically, if the RREF of [A|I] is [I|B], then B is the inverse of A.
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 ratings0% found this document useful (0 votes)
23 views
LA L5notes
This document contains lecture notes from Dr. Krishnendra Shekhawat of BITS Pilani on the topic of linear algebra. The notes cover various concepts related to matrices including the inverse of a matrix. The key points discussed are:
1. A matrix A is invertible if there exists another matrix B such that AB = BA = I. This inverse B is unique and denoted as A^-1.
2. The reduced row echelon form (RREF) of a matrix can be used to determine if a matrix is invertible and to find its inverse. Specifically, if the RREF of [A|I] is [I|B], then B is the inverse of A.
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/ 38
Linear Algebra for Undergraduates
Dr. Krishnendra Shekhawat
BITS PILANI Department of Mathematics lecturesks@gmail.com
Krishnendra Shekhawat BITS PILANI Linear Algebra
Chapter 1
1 Introduction to System of Linear Equations
2 Reduced Row Echelon Form (RREF) 3 Solving System of Linear Equations using RREF 4 Rank of a Matrix 5 Inverse of a Matrix using RREF
Krishnendra Shekhawat BITS PILANI Linear Algebra
Inverse of a Matrix using RREF
Krishnendra Shekhawat BITS PILANI Linear Algebra
Inverse of a Matrix
Krishnendra Shekhawat BITS PILANI Linear Algebra
Inverse of a Matrix
Let A be an n × n matrix. Then an n × n matrix B is a
(multiplicative) inverse of A if and only if AB = BA = In, where In is the n × n identity matrix.
Krishnendra Shekhawat BITS PILANI Linear Algebra
Inverse of a Matrix
Let A be an n × n matrix. Then an n × n matrix B is a
(multiplicative) inverse of A if and only if AB = BA = In, where In is the n × n identity matrix. 1 If such a matrix B exists then A is called invertible (or nonsingular) and B is called inverse of A.
Krishnendra Shekhawat BITS PILANI Linear Algebra
Inverse of a Matrix
Let A be an n × n matrix. Then an n × n matrix B is a
(multiplicative) inverse of A if and only if AB = BA = In, where In is the n × n identity matrix. 1 If such a matrix B exists then A is called invertible (or nonsingular) and B is called inverse of A. 2 If no such matrix B can be found, then A is called singular.
Krishnendra Shekhawat BITS PILANI Linear Algebra
Result. Inverse of a matrix is unique if it exists.
Krishnendra Shekhawat BITS PILANI Linear Algebra
Result. Inverse of a matrix is unique if it exists. As the inverse of a matrix A is unique, we denote it by A−1. That is, AA−1 = A−1 A = I.
Krishnendra Shekhawat BITS PILANI Linear Algebra
Result. Inverse of a matrix is unique if it exists. As the inverse of a matrix A is unique, we denote it by A−1. That is, AA−1 = A−1 A = I. Theorem. Let A and B be an n × n nonsingular matrices. Then 1 (A−1)−1 = A.
Krishnendra Shekhawat BITS PILANI Linear Algebra
Result. Inverse of a matrix is unique if it exists. As the inverse of a matrix A is unique, we denote it by A−1. That is, AA−1 = A−1 A = I. Theorem. Let A and B be an n × n nonsingular matrices. Then 1 (A−1)−1 = A. 2 (AB)−1 = B−1 A−1.
Krishnendra Shekhawat BITS PILANI Linear Algebra
Result. Inverse of a matrix is unique if it exists. As the inverse of a matrix A is unique, we denote it by A−1. That is, AA−1 = A−1 A = I. Theorem. Let A and B be an n × n nonsingular matrices. Then 1 (A−1)−1 = A. 2 (AB)−1 = B−1 A−1. 3 (AT )−1 = (A−1)T .
Krishnendra Shekhawat BITS PILANI Linear Algebra
Theorem. Let A and B be n × n matrices. 1 If BA = In then B = A−1. 2 If AB = In then B = A−1.
Krishnendra Shekhawat BITS PILANI Linear Algebra
Theorem. Let A and B be n × n matrices. 1 If BA = In then B = A−1. 2 If AB = In then B = A−1. Q: When a matrix has an inverse?
Krishnendra Shekhawat BITS PILANI Linear Algebra
Theorem. Let A and B be n × n matrices. 1 If BA = In then B = A−1. 2 If AB = In then B = A−1. Q: When a matrix has an inverse? Q: If a matrix has an inverse, how we can find it
Krishnendra Shekhawat BITS PILANI Linear Algebra
Theorem. Let A and B be n × n matrices. 1 If BA = In then B = A−1. 2 If AB = In then B = A−1. Q: When a matrix has an inverse? Q: If a matrix has an inverse, how we can find it (can RREF be helpful in finding Inverse) ?
Krishnendra Shekhawat BITS PILANI Linear Algebra
Theorem. Let A be an n × n matrix. The following statements are equivalent: 1 A is invertible.
Krishnendra Shekhawat BITS PILANI Linear Algebra
Theorem. Let A be an n × n matrix. The following statements are equivalent: 1 A is invertible. 2 Ax = b has a unique solution for every b ∈ Rn.
Krishnendra Shekhawat BITS PILANI Linear Algebra
Theorem. Let A be an n × n matrix. The following statements are equivalent: 1 A is invertible. 2 Ax = b has a unique solution for every b ∈ Rn. 3 The homogenous system Ax = 0 has only the trivial solution.
Krishnendra Shekhawat BITS PILANI Linear Algebra
Theorem. Let A be an n × n matrix. The following statements are equivalent: 1 A is invertible. 2 Ax = b has a unique solution for every b ∈ Rn. 3 The homogenous system Ax = 0 has only the trivial solution. 4 The reduced row echelon form of A is In.
Krishnendra Shekhawat BITS PILANI Linear Algebra
Theorem. Let A be an n × n matrix. The following statements are equivalent: 1 A is invertible. 2 Ax = b has a unique solution for every b ∈ Rn. 3 The homogenous system Ax = 0 has only the trivial solution. 4 The reduced row echelon form of A is In.
Krishnendra Shekhawat BITS PILANI Linear Algebra
Finding the Inverse of a matrix (if it exists)
Krishnendra Shekhawat BITS PILANI Linear Algebra
Finding the Inverse of a matrix (if it exists)
Let A be a given n × n matrix.
Krishnendra Shekhawat BITS PILANI Linear Algebra
Finding the Inverse of a matrix (if it exists)
Let A be a given n × n matrix.
Step 1: Write the augmented matrix [A | In].
Krishnendra Shekhawat BITS PILANI Linear Algebra
Finding the Inverse of a matrix (if it exists)
Let A be a given n × n matrix.
Step 1: Write the augmented matrix [A | In]. Step 2: Transform the augmented matrix [A | In] to the matrix [C | D] in reduced row echelon form via elementary row operations.
Krishnendra Shekhawat BITS PILANI Linear Algebra
Finding the Inverse of a matrix (if it exists)
Let A be a given n × n matrix.
Step 1: Write the augmented matrix [A | In]. Step 2: Transform the augmented matrix [A | In] to the matrix [C | D] in reduced row echelon form via elementary row operations. Step 3: If 1 C = In then D = A−1.
Krishnendra Shekhawat BITS PILANI Linear Algebra
Finding the Inverse of a matrix (if it exists)
Let A be a given n × n matrix.
Step 1: Write the augmented matrix [A | In]. Step 2: Transform the augmented matrix [A | In] to the matrix [C | D] in reduced row echelon form via elementary row operations. Step 3: If 1 C = In then D = A−1. 2 C , In then A is singular and A−1 does not exist.
Krishnendra Shekhawat BITS PILANI Linear Algebra
Example. Using row reduction method, find the inverse 1 −1 −2 of A = 2 −3 −5, if it exists. −1 3 5
Krishnendra Shekhawat BITS PILANI Linear Algebra
Example. Using row reduction method, find the inverse 1 −1 −2 of A = 2 −3 −5, if it exists. −1 3 5