1 © 2012 Pearson Education, Inc. Matrix Algebra THE INVERSE OF A MATRIX.

Slides:



Advertisements
Similar presentations
Chapter 4 Euclidean Vector Spaces
Advertisements

1.5 Elementary Matrices and a Method for Finding
Linear Equations in Linear Algebra
1.5 Elementary Matrices and a Method for Finding
Eigenvalues and Eigenvectors
1.2 Row Reduction and Echelon Forms
Linear Equations in Linear Algebra
2 2.3 © 2012 Pearson Education, Inc. Matrix Algebra CHARACTERIZATIONS OF INVERTIBLE MATRICES.
The Inverse of a Matrix (10/14/05) If A is a square (say n by n) matrix and if there is an n by n matrix C such that C A = A C = I n, then C is called.
Ch 7.3: Systems of Linear Equations, Linear Independence, Eigenvalues
Linear Equations in Linear Algebra
Matrix Algebra THE INVERSE OF A MATRIX © 2012 Pearson Education, Inc.
ENGG2013 Unit 7 Non-singular matrix and Gauss-Jordan elimination Jan, 2011.
Chapter 3 The Inverse. 3.1 Introduction Definition 1: The inverse of an n  n matrix A is an n  n matrix B having the property that AB = BA = I B is.
1 1.1 © 2012 Pearson Education, Inc. Linear Equations in Linear Algebra SYSTEMS OF LINEAR EQUATIONS.
Boyce/DiPrima 9th ed, Ch 7.3: Systems of Linear Equations, Linear Independence, Eigenvalues Elementary Differential Equations and Boundary Value Problems,
Linear Equations in Linear Algebra
 Row and Reduced Row Echelon  Elementary Matrices.
Copyright © 2011 Pearson, Inc. 7.3 Multivariate Linear Systems and Row Operations.
More on Inverse. Last Week Review Matrix – Rule of addition – Rule of multiplication – Transpose – Main Diagonal – Dot Product Block Multiplication Matrix.
4 4.2 © 2012 Pearson Education, Inc. Vector Spaces NULL SPACES, COLUMN SPACES, AND LINEAR TRANSFORMATIONS.
Eigenvalues and Eigenvectors
4 4.4 © 2012 Pearson Education, Inc. Vector Spaces COORDINATE SYSTEMS.
2 2.1 © 2016 Pearson Education, Inc. Matrix Algebra MATRIX OPERATIONS.
Linear Equations in Linear Algebra
1 1.7 © 2016 Pearson Education, Inc. Linear Equations in Linear Algebra LINEAR INDEPENDENCE.
Sec 3.5 Inverses of Matrices Where A is nxn Finding the inverse of A: Seq or row operations.
Copyright © 2009 Pearson Education, Inc. CHAPTER 9: Systems of Equations and Matrices 9.1 Systems of Equations in Two Variables 9.2 Systems of Equations.
Section 1.5 Elementary Matrices and a Method for Finding A −1.
Matrices CHAPTER 8.1 ~ 8.8. Ch _2 Contents  8.1 Matrix Algebra 8.1 Matrix Algebra  8.2 Systems of Linear Algebra Equations 8.2 Systems of Linear.
Orthogonality and Least Squares
5 5.2 © 2012 Pearson Education, Inc. Eigenvalues and Eigenvectors THE CHARACTERISTIC EQUATION.
4 4.6 © 2012 Pearson Education, Inc. Vector Spaces RANK.
Vector Spaces RANK © 2016 Pearson Education, Inc..
4 © 2012 Pearson Education, Inc. Vector Spaces 4.4 COORDINATE SYSTEMS.
The Inverse of a Matrix Prepared by Vince Zaccone For Campus Learning Assistance Services at UCSB.
2 2.1 © 2012 Pearson Education, Inc. Matrix Algebra MATRIX OPERATIONS.
Properties of Inverse Matrices King Saud University.
CHARACTERIZATIONS OF INVERTIBLE MATRICES
2.2 The Inverse of a Matrix. Example: REVIEW Invertible (Nonsingular)
Matrices and Matrix Operations. Matrices An m×n matrix A is a rectangular array of mn real numbers arranged in m horizontal rows and n vertical columns.
4.8 Rank Rank enables one to relate matrices to vectors, and vice versa. Definition Let A be an m  n matrix. The rows of A may be viewed as row vectors.
2.5 – Determinants and Multiplicative Inverses of Matrices.
2 2.2 © 2016 Pearson Education, Ltd. Matrix Algebra THE INVERSE OF A MATRIX.
2 2.5 © 2016 Pearson Education, Ltd. Matrix Algebra MATRIX FACTORIZATIONS.
1 1.4 Linear Equations in Linear Algebra THE MATRIX EQUATION © 2016 Pearson Education, Ltd.
2 2.1 © 2012 Pearson Education, Inc. Matrix Algebra MATRIX OPERATIONS.
1 1.2 Linear Equations in Linear Algebra Row Reduction and Echelon Forms © 2016 Pearson Education, Ltd.
2 - 1 Chapter 2A Matrices 2A.1 Definition, and Operations of Matrices: 1 Sums and Scalar Products; 2 Matrix Multiplication 2A.2 Properties of Matrix Operations;
Linear Algebra Engineering Mathematics-I. Linear Systems in Two Unknowns Engineering Mathematics-I.
6 6.5 © 2016 Pearson Education, Ltd. Orthogonality and Least Squares LEAST-SQUARES PROBLEMS.
College Algebra Chapter 6 Matrices and Determinants and Applications
MAT 322: LINEAR ALGEBRA.
Linear Equations in Linear Algebra
CHARACTERIZATIONS OF INVERTIBLE MATRICES
Linear Equations in Linear Algebra
Elementary Matrix Methid For find Inverse
Linear Equations in Linear Algebra
Orthogonality and Least Squares
The Inverse of a Matrix Prepared by Vince Zaccone
EIGENVECTORS AND EIGENVALUES
Sec 3.5 Inverses of Matrices
Vector Spaces RANK © 2012 Pearson Education, Inc..
Linear Equations in Linear Algebra
Matrix Algebra THE INVERSE OF A MATRIX © 2012 Pearson Education, Inc.
Linear Equations in Linear Algebra
Vector Spaces COORDINATE SYSTEMS © 2012 Pearson Education, Inc.
CHARACTERIZATIONS OF INVERTIBLE MATRICES
Orthogonality and Least Squares
Presentation transcript:

1 © 2012 Pearson Education, Inc. Matrix Algebra THE INVERSE OF A MATRIX

Slide © 2012 Pearson Education, Inc. ELEMENTARY MATRICES  An invertible matrix A is row equivalent to an identity matrix, and we can find by watching the row reduction of A to I.  An elementary matrix is one that is obtained by performing a single elementary row operation on an identity matrix.

Slide © 2012 Pearson Education, Inc. ELEMENTARY MATRICES  Example 1: Let,,, Compute E 1 A, E 2 A, and E 3 A, and describe how these products can be obtained by elementary row operations on A.

Slide © 2012 Pearson Education, Inc. ELEMENTARY MATRICES  An interchange of rows 1 and 2 of A produces E 2 A, and multiplication of row 3 of A by 5 produces E 3 A.  Left-multiplication by E 1 in Example 1 has the same effect on any matrix.  Since, we see that E 1 itself is produced by this same row operation on the identity.

Slide © 2012 Pearson Education, Inc. ELEMENTARY MATRICES  Example 1 illustrates the following general fact about elementary matrices.  If an elementary row operation is performed on an matrix A, the resulting matrix can be written as EA, where the matrix E is created by performing the same row operation on I m.  Each elementary matrix E is invertible. The inverse of E is the elementary matrix of the same type that transforms E back into I.

Slide © 2012 Pearson Education, Inc. ELEMENTARY MATRICES  Theorem 7: An matrix A is invertible if and only if A is row equivalent to I n, and in this case, any sequence of elementary row operations that reduces A to I n also transforms I n into.  Proof: Suppose that A is invertible.  Then, since the equation has a solution for each b, A has a pivot position in every row.  Because A is square, the n pivot positions must be on the diagonal, which implies that the reduced echelon form of A is I n. That is,.

Slide © 2012 Pearson Education, Inc. ELEMENTARY MATRICES  Now suppose, conversely, that.  Then, since each step of the row reduction of A corresponds to left-multiplication by an elementary matrix, there exist elementary matrices E 1, …, E p such that.  That is, ----(1)  Since the product E p …E 1 of invertible matrices is invertible, (1) leads to.

Slide © 2012 Pearson Education, Inc. MATRIX OPERATIONS  Theorem 4: Let. If, then A is invertible and If, then A is not invertible.  The quantity is called the determinant of A, and we write  This theorem says that a matrix A is invertible if and only if det.

Slide © 2012 Pearson Education, Inc. ALGORITHM FOR FINDING  Example 2: Find the inverse of the matrix, if it exists.

1 © 2012 Pearson Education, Inc. Matrix Algebra CHARACTERIZATIONS OF INVERTIBLE MATRICES

Slide © 2012 Pearson Education, Inc. THE INVERTIBLE MATRIX THEOREM  Theorem 8: Let A be a square matrix. Then the following statements are equivalent. That is, for a given A, the statements are either all true or all false. a. A is an invertible matrix. b. A is row equivalent to the identity matrix. c. A has n pivot positions. d.The equation has only the trivial solution. e.The columns of A form a linearly independent set.

Slide © 2012 Pearson Education, Inc. THE INVERTIBLE MATRIX THEOREM f.The linear transformation is one-to- one. g.The equation has at least one solution for each b in. h.The columns of A span. i.The linear transformation maps onto. j.There is an matrix C such that. k.There is an matrix D such that. l. A T is an invertible matrix.

Slide © 2012 Pearson Education, Inc. THE INVERTIBLE MATRIX THEOREM  Theorem 8 could also be written as “ The equation has a unique solution for each b in. ”  This statement implies (b) and hence implies that A is invertible.  The following fact follows from Theorem 8. Let A and B be square matrices. If, then A and B are both invertible, with and.  The Invertible Matrix Theorem divides the set of all matrices into two disjoint classes: the invertible (nonsingular) matrices, and the noninvertible (singular) matrices.

Slide © 2012 Pearson Education, Inc. THE INVERTIBLE MATRIX THEOREM  Each statement in the theorem describes a property of every invertible matrix.  The negation of a statement in the theorem describes a property of every singular matrix.  For instance, an singular matrix is not row equivalent to I n, does not have n pivot position, and has linearly dependent columns.

Slide © 2012 Pearson Education, Inc. THE INVERTIBLE MATRIX THEOREM  Example 1: Use the Invertible Matrix Theorem to decide if A is invertible:  Solution:

Slide © 2012 Pearson Education, Inc. THE INVERTIBLE MATRIX THEOREM  So A has three pivot positions and hence is invertible, by the Invertible Matrix Theorem, statement (c).  The Invertible Matrix Theorem applies only to square matrices.  For example, if the columns of a matrix are linearly independent, we cannot use the Invertible Matrix Theorem to conclude anything about the existence or nonexistence of solutions of equation of the form.

Slide © 2012 Pearson Education, Inc. INVERTIBLE LINEAR TRANSFORMATIONS  Matrix multiplication corresponds to composition of linear transformations.  When a matrix A is invertible, the equation can be viewed as a statement about linear transformations. See the following figure.

Slide © 2012 Pearson Education, Inc. INVERTIBLE LINEAR TRANSFORMATIONS  A linear transformation is said to be invertible if there exists a function such that for all x in ----(1) for all x in ----(2)  Theorem 9: Let be a linear transformation and let A be the standard matrix for T. Then T is invertible if and only if A is an invertible matrix. In that case, the linear transformation S given by is the unique function satisfying equation (1) and (2).

Slide © 2012 Pearson Education, Inc. INVERTIBLE LINEAR TRANSFORMATIONS  Proof: Suppose that T is invertible.  The (2) shows that T is onto, for if b is in and, then, so each b is in the range of T.  Thus A is invertible, by the Invertible Matrix Theorem, statement (i).  Conversely, suppose that A is invertible, and let. Then, S is a linear transformation, and S satisfies (1) and (2).  For instance,.  Thus, T is invertible.