MATH 423 Linear Algebra II Lecture 10: Inverse matrix. Change of coordinates.

Similar documents
MATH 423 Linear Algebra II Lecture 11: Change of coordinates (continued). Isomorphism of vector spaces.

Linear Algebra. Session 8

Elementary maths for GMT

MATH 304 Linear Algebra Lecture 15: Linear transformations (continued). Range and kernel. Matrix transformations.

Linear Algebra. Week 7

1 Last time: inverses

MATH 423 Linear Algebra II Lecture 20: Geometry of linear transformations. Eigenvalues and eigenvectors. Characteristic polynomial.

MATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants.

Matrices Gaussian elimination Determinants. Graphics 2009/2010, period 1. Lecture 4: matrices

n n matrices The system of m linear equations in n variables x 1, x 2,..., x n can be written as a matrix equation by Ax = b, or in full

Math 4377/6308 Advanced Linear Algebra

Matrices and Linear Algebra

MAT 1332: CALCULUS FOR LIFE SCIENCES. Contents. 1. Review: Linear Algebra II Vectors and matrices Definition. 1.2.

Matrix Arithmetic. j=1

(c)

Linear Algebra and Matrix Inversion

System of Linear Equations

MATH Topics in Applied Mathematics Lecture 2-6: Isomorphism. Linear independence (revisited).

We could express the left side as a sum of vectors and obtain the Vector Form of a Linear System: a 12 a x n. a m2

Components and change of basis

MATRICES. a m,1 a m,n A =

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

Chapter 2: Linear Independence and Bases

MATH2210 Notebook 2 Spring 2018

DM559 Linear and Integer Programming. Lecture 3 Matrix Operations. Marco Chiarandini

Formula for the inverse matrix. Cramer s rule. Review: 3 3 determinants can be computed expanding by any row or column

Math 3108: Linear Algebra

Section 4.5. Matrix Inverses

1 Last time: least-squares problems

Math 4377/6308 Advanced Linear Algebra

Determinants Chapter 3 of Lay

Math 3191 Applied Linear Algebra

Math Camp II. Basic Linear Algebra. Yiqing Xu. Aug 26, 2014 MIT

Linear Algebra and Vector Analysis MATH 1120

ANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3

Matrix Operations. Linear Combination Vector Algebra Angle Between Vectors Projections and Reflections Equality of matrices, Augmented Matrix

A FIRST COURSE IN LINEAR ALGEBRA. An Open Text by Ken Kuttler. Matrix Arithmetic

MATH 304 Linear Algebra Lecture 33: Bases of eigenvectors. Diagonalization.

Math Linear Algebra II. 1. Inner Products and Norms

A matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and

Partial Solution Set, Leon 4.3

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

A matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and

Lecture notes on Quantum Computing. Chapter 1 Mathematical Background

Matrices. Chapter Definitions and Notations

Linear Equations and Matrix

Math Linear Algebra Final Exam Review Sheet

Math 60. Rumbos Spring Solutions to Assignment #17

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

ENGR-1100 Introduction to Engineering Analysis. Lecture 21

Online Exercises for Linear Algebra XM511

Introduction to Matrices

OR MSc Maths Revision Course

Things we can already do with matrices. Unit II - Matrix arithmetic. Defining the matrix product. Things that fail in matrix arithmetic

Chapter 2 Notes, Linear Algebra 5e Lay

Throughout these notes we assume V, W are finite dimensional inner product spaces over C.

Math 320, spring 2011 before the first midterm

Fall Inverse of a matrix. Institute: UC San Diego. Authors: Alexander Knop

Lecture 16: 9.2 Geometry of Linear Operators

MTH501- Linear Algebra MCQS MIDTERM EXAMINATION ~ LIBRIANSMINE ~

Math113: Linear Algebra. Beifang Chen

Linear Algebra Section 2.6 : LU Decomposition Section 2.7 : Permutations and transposes Wednesday, February 13th Math 301 Week #4

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

Elementary Linear Algebra

Endomorphisms, Automorphisms, and Change of Basis

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2

Matrix operations Linear Algebra with Computer Science Application

12. Perturbed Matrices

Practical Linear Algebra: A Geometry Toolbox

Problem # Max points possible Actual score Total 120

Review of linear algebra

Math 2331 Linear Algebra

Lecture 03. Math 22 Summer 2017 Section 2 June 26, 2017

Linear Algebra Review

Diagonalization by a unitary similarity transformation

Vectors and matrices: matrices (Version 2) This is a very brief summary of my lecture notes.

1 Matrices and Systems of Linear Equations

MATRICES AND MATRIX OPERATIONS

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

1 Linear transformations; the basics

TOPIC III LINEAR ALGEBRA

For comments, corrections, etc Please contact Ahnaf Abbas: Sharjah Institute of Technology. Matrices Handout #8.

MATH.2720 Introduction to Programming with MATLAB Vector and Matrix Algebra

Introduction. Vectors and Matrices. Vectors [1] Vectors [2]

Homework For each of the following matrices, find the minimal polynomial and determine whether the matrix is diagonalizable.

Phys 201. Matrices and Determinants

Inverses and Elementary Matrices

Math Bootcamp An p-dimensional vector is p numbers put together. Written as. x 1 x =. x p

Review of Basic Concepts in Linear Algebra

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

Linear Algebra Homework and Study Guide

Lecture: Linear algebra. 4. Solutions of linear equation systems The fundamental theorem of linear algebra

Elementary Row Operations on Matrices

Math 343 Midterm I Fall 2006 sections 002 and 003 Instructor: Scott Glasgow

1 Matrices and matrix algebra

Math 1B03/1ZC3 - Tutorial 2. Jan. 21st/24th, 2014

MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.

Math Matrix Theory - Spring 2012

Announcements Wednesday, October 04

MATH 110: LINEAR ALGEBRA HOMEWORK #2

Transcription:

MATH 423 Linear Algebra II Lecture 10: Inverse matrix. Change of coordinates.

Let V be a vector space and α = [v 1,...,v n ] be an ordered basis for V. Theorem 1 The coordinate mapping C : V F n given by C(v) = [v] α is linear and invertible (i.e., one-to-one and onto). Let W be another vector space and β = [w 1,...,w m ] be an ordered basis for W. Theorem 2 The mapping M : L(V,W) M m,n (F) given by M(L) = [L] β α is linear and invertible.

Linear maps and matrix multiplication Let V, W, and X be vector spaces. Suppose α = [v 1,...,v n ] is an ordered basis for V, β = [w 1,...,w m ] is an ordered basis for W, and γ = [x 1,...,x k ] is an ordered basis for X. Theorem 1 For any linear transformation L : V W and any vector v V, [L(v)] β = [L] β α[v] α. Theorem 2 For any linear transformations L : V W and T : W X, [T L] γ α = [T] γ β [L]β α. Theorem 3 For any linear operators L : V V and T : V V, [T L] α = [T] α [L] α.

Identity matrix Definition. The identity matrix (or unit matrix) is an n n matrix I = (a ij ) such that a ii = 1 and a ij = 0 for i j. It is also denoted I n. I 1 = (1), I 2 = ( ) 1 0, I 0 1 3 = 1 0... 0 0 1... 0 In general, I =....... 0 0... 1 1 0 0 0 1 0. 0 0 1 Theorem. Let A be an arbitrary m n matrix. Then I m A = AI n = A.

Inverse matrix Definition. Let A M n,n (F). Suppose there exists an n n matrix B such that AB = BA = I n. Then the matrix A is called invertible and B is called the inverse of A (denoted A 1 ). AA 1 = A 1 A = I Basic properties of inverse matrices: If B = A 1 then A = B 1. In other words, if A is invertible, so is A 1, and A = (A 1 ) 1. The inverse matrix (if it exists) is unique. If n n matrices A and B are invertible, so is AB, and (AB) 1 = B 1 A 1. Similarly, (A 1 A 2...A k ) 1 = A 1 k...a 1 2 A 1 1.

Inverting 2 2 matrices Definition. ( ) The determinant of a 2 2 matrix a b A = is det A = ad bc. c d ( ) a b Theorem A matrix A = is invertible if c d and only if det A 0. If det A 0 then ( ) 1 a b = c d 1 ad bc ( ) d b. c a

( ) a b Theorem A matrix A = is invertible if c d and only if det A 0. If det A 0 then ( ) 1 ( ) a b 1 d b =. c d ad bc c a ( d b Proof: Let B = c a AB = BA = ). Then ( ad bc 0 0 ad bc ) = (ad bc)i 2. In the case det A 0, we have A 1 = (det A) 1 B. In the case det A = 0, the matrix A is not invertible as otherwise AB = O = A 1 (AB) = A 1 O = O = (A 1 A)B = O = I 2 B = O = B = O = A = O, but the zero matrix is not invertible.

Left multiplication Any m n matrix A M m,n (F) gives rise to a linear transformation L A : F n F m given by L A (x) = Ax, where x F n and L(x) F m are regarded as column vectors. Theorem 1 The matrix of the transformation L A relative to the standard bases in F n and F m is exactly A. Theorem 2 Suppose L : F n F m is a linear map. Then there exists an m n matrix A such that L(x) = Ax for all x F n. Columns of A are vectors L(e 1 ), L(e 2 ),...,L(e n ), where e 1,e 2,...,e n is the standard basis for F n.

Matrix of a linear transformation (revisited) Let V,W be vector spaces and f : V W be a linear map. Let α = [v 1,v 2,...,v n ] be a basis for V and g 1 : V F n be the coordinate mapping corresponding to this basis. Let β = [w 1,...,w m ] be a basis for W and g 2 : W F m be the coordinate mapping corresponding to this basis. V g 1 f W g2 F n F m The composition g 2 f g 1 1 is a linear mapping of F n to F m. It is uniquely represented as x Ax, where A M m,n (F). Theorem A = [f ] β α, the matrix of the transformation f relative to the bases α and β.

Change of coordinates Let V be a vector space of dimension n. Let v 1,v 2,...,v n be a basis for V and g 1 : V F n be the coordinate mapping corresponding to this basis. Let u 1,u 2,...,u n be another basis for V and g 2 : V F n be the coordinate mapping corresponding to this basis. V g 1 g 2 ւ ց F n F n The composition g 2 g 1 1 is a linear operator on F n. It has the form x Ux, where U is an n n matrix. U is called the transition matrix from v 1,v 2...,v n to u 1,u 2...,u n. Columns of U are coordinates of the vectors v 1,v 2,...,v n with respect to the basis u 1,u 2,...,u n.

Problem. Find the transition matrix from the basis v 1 = (1, 2, 3), v 2 = (1, 0, 1), v 3 = (1, 2, 1) to the basis u 1 = (1, 1, 0), u 2 = (0, 1, 1), u 3 = (1, 1, 1). It is convenient to make a two-step transition: first from v 1,v 2,v 3 to e 1,e 2,e 3, and then from e 1,e 2,e 3 to u 1,u 2,u 3. Let U 1 be the transition matrix from v 1,v 2,v 3 to e 1,e 2,e 3 and U 2 be the transition matrix from u 1,u 2,u 3 to e 1,e 2,e 3 : 1 1 1 1 0 1 U 1 = 2 0 2, U 2 = 1 1 1. 3 1 1 0 1 1

Basis v 1,v 2,v 3 = coordinates x Basis e 1,e 2,e 3 = coordinates U 1 x Basis u 1,u 2,u 3 = coordinates U 1 2 (U 1x)=(U 1 2 U 1)x Thus the transition matrix from v 1,v 2,v 3 to u 1,u 2,u 3 is U2 1 U 1. 1 1 0 1 1 1 1 U2 1 U 1 = 1 1 1 2 0 2 0 1 1 3 1 1 0 1 1 1 1 1 1 1 1 = 1 1 0 2 0 2 = 1 1 1. 1 1 1 3 1 1 2 2 0

Problem. Consider a linear operator L : F 2 F 2, ( ) ( ) ( ) x 1 1 x L =. y 0 1 y Find the matrix of L with respect to the basis v 1 = (3, 1), v 2 = (2, 1). Let N be the desired matrix. Columns of N are coordinates of the vectors L(v 1 ) and L(v 2 ) w.r.t. the basis v 1,v 2. ( ) ( ( ) ( 1 1 3 4 1 1 2 3 L(v 1 ) = =, L(v 0 1)( 1 1) 2 ) = =. 0 1)( 1 1) Clearly, L(v 2 ) = v 1 = 1v 1 + 0v 2. L(v 1 ) = av 1 + bv 2 ( ) 2 1 Thus N =. 1 0 { 3a + 2b = 4 a + b = 1 { a = 2 b = 1

Change of coordinates for a linear operator Let L : V V be a linear operator on a vector space V. Let A be the matrix of L relative to a basis a 1,a 2,...,a n for V. Let B be the matrix of L relative to another basis b 1,b 2,...,b n for V. Let U be the transition matrix from the basis a 1,a 2,...,a n to b 1,b 2,...,b n. a-coordinates of v U b-coordinates of v A B a-coordinates of L(v) U b-coordinates of L(v) It follows that UAx = BUx for all x F n = UA = BU. Then A = U 1 BU and B = UAU 1.

Problem. Consider a linear operator L : F 2 F 2, ( ) ( ) ( ) x 1 1 x L =. y 0 1 y Find the matrix of L with respect to the basis v 1 = (3, 1), v 2 = (2, 1). Let S be the matrix of L with respect to the standard basis, N be the matrix of L with respect to the basis v 1,v 2, and U be the transition matrix from v 1,v 2 to e 1,e 2. Then N = U 1 SU. ( ) ( ) 1 1 3 2 S =, U =, 0 1 1 1 ( ) ( ) ( ) 1 2 1 1 3 2 N = U 1 SU = 1 3 0 1 1 1 ( ) ( ) ( ) 1 1 3 2 2 1 = =. 1 2 1 1 1 0