3.II.1. Representing Linear Maps with Matrices 3.II.2. Any Matrix Represents a Linear Map 3.II. Computing Linear Maps.

Slides:



Advertisements
Similar presentations
Vector Spaces A set V is called a vector space over a set K denoted V(K) if is an Abelian group, is a field, and For every element vV and K there exists.
Advertisements

5.4 Basis And Dimension.
5.2 Rank of a Matrix. Set-up Recall block multiplication:
8.2 Kernel And Range.
Chapter 3: Linear transformations
Section 4.6 (Rank).
2 2.3 © 2012 Pearson Education, Inc. Matrix Algebra CHARACTERIZATIONS OF INVERTIBLE MATRICES.
3.III. Matrix Operations 3.III.1. Sums and Scalar Products 3.III.2. Matrix Multiplication 3.III.3. Mechanics of Matrix Multiplication 3.III.4. Inverses.
Chapter 5 Orthogonality
I. Homomorphisms & Isomorphisms II. Computing Linear Maps III. Matrix Operations VI. Change of Basis V. Projection Topics: Line of Best Fit Geometry of.
2.III. Basis and Dimension 1.Basis 2.Dimension 3.Vector Spaces and Linear Systems 4.Combining Subspaces.
3.III.1. Representing Linear Maps with Matrices 3.III.2. Any Matrix Represents a Linear Map 3.III. Computing Linear Maps.
4.I. Definition 4.II. Geometry of Determinants 4.III. Other Formulas Topics: Cramer’s Rule Speed of Calculating Determinants Projective Geometry Chapter.
5.II. Similarity 5.II.1. Definition and Examples
3.VI.1. Orthogonal Projection Into a Line 3.VI.2. Gram-Schmidt Orthogonalization 3.VI.3. Projection Into a Subspace 3.VI. Projection 3.VI.1. & 2. deal.
3.II. Homomorphisms 3.II.1. Definition 3.II.2. Range Space and Nullspace.
Line of Best Fit Geometry of Linear Maps Markov Chains Orthonormal Matrices 3. Topics.
3.V.1. Changing Representations of Vectors 3.V.2. Changing Map Representations 3.V. Change of Basis.
The Terms that You Have to Know! Basis, Linear independent, Orthogonal Column space, Row space, Rank Linear combination Linear transformation Inner product.
I. Isomorphisms II. Homomorphisms III. Computing Linear Maps IV. Matrix Operations V. Change of Basis VI. Projection Topics: Line of Best Fit Geometry.
5.IV. Jordan Form 5.IV.1. Polynomials of Maps and Matrices 5.IV.2. Jordan Canonical Form.
Elementary Linear Algebra Anton & Rorres, 9 th Edition Lecture Set – 08 Chapter 8: Linear Transformations.
1 © 2012 Pearson Education, Inc. Matrix Algebra THE INVERSE OF A MATRIX.
5.III. Nilpotence 5.III.1 Self-Composition 5.III.2 Strings Every square matrix is similar to one that is a sum of 2 kinds of simple matrices: diagonal.
Subspaces, Basis, Dimension, Rank
App III. Group Algebra & Reduction of Regular Representations 1. Group Algebra 2. Left Ideals, Projection Operators 3. Idempotents 4. Complete Reduction.
5.1 Orthogonality.
1 MAC 2103 Module 10 lnner Product Spaces I. 2 Rev.F09 Learning Objectives Upon completing this module, you should be able to: 1. Define and find the.
Linear Algebra Lecture 25.
Chapter 5: The Orthogonality and Least Squares
CHAPTER FIVE Orthogonality Why orthogonal? Least square problem Accuracy of Numerical computation.
4 4.2 © 2012 Pearson Education, Inc. Vector Spaces NULL SPACES, COLUMN SPACES, AND LINEAR TRANSFORMATIONS.
CPSC 491 Xin Liu Nov 17, Introduction Xin Liu PhD student of Dr. Rokne Contact Slides downloadable at pages.cpsc.ucalgary.ca/~liuxin.
4.1 Vector Spaces and Subspaces 4.2 Null Spaces, Column Spaces, and Linear Transformations 4.3 Linearly Independent Sets; Bases 4.4 Coordinate systems.
4 4.4 © 2012 Pearson Education, Inc. Vector Spaces COORDINATE SYSTEMS.
Chapter 2: Vector spaces
Chapter 3 Vector Spaces. The operations of addition and scalar multiplication are used in many contexts in mathematics. Regardless of the context, however,
Matrices. Definitions  A matrix is an m x n array of scalars, arranged conceptually as m rows and n columns.  m is referred to as the row dimension.
Chap. 6 Linear Transformations
Orthogonality and Least Squares
Elementary Linear Algebra Anton & Rorres, 9th Edition
Chapter 4 Linear Transformations 4.1 Introduction to Linear Transformations 4.2 The Kernel and Range of a Linear Transformation 4.3 Matrices for Linear.
4.6: Rank. Definition: Let A be an mxn matrix. Then each row of A has n entries and can therefore be associated with a vector in The set of all linear.
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.
Chap. 5 Inner Product Spaces 5.1 Length and Dot Product in R n 5.2 Inner Product Spaces 5.3 Orthonormal Bases: Gram-Schmidt Process 5.4 Mathematical Models.
4 © 2012 Pearson Education, Inc. Vector Spaces 4.4 COORDINATE SYSTEMS.
Chap. 4 Vector Spaces 4.1 Vectors in Rn 4.2 Vector Spaces
Matrices A matrix is an array of numbers, the size of which is described by its dimensions: An n x m matrix has n rows and m columns Eg write down the.
Matrices and linear transformations For grade 1, undergraduate students For grade 1, undergraduate students Made by Department of Math.,Anqing Teachers.
Review of Linear Algebra Optimization 1/16/08 Recitation Joseph Bradley.
Linear Transformations
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.
Chapter 6- LINEAR MAPPINGS LECTURE 8 Prof. Dr. Zafer ASLAN.
4 Vector Spaces 4.1 Vector Spaces and Subspaces 4.2 Null Spaces, Column Spaces, and Linear Transformations 4.3 Linearly Independent Sets; Bases 4.4 Coordinate.
Chapter 4 Linear Transformations 4.1 Introduction to Linear Transformations 4.2 The Kernel and Range of a Linear Transformation 4.3 Matrices for Linear.
Graphics Graphics Korea University kucg.korea.ac.kr Mathematics for Computer Graphics 고려대학교 컴퓨터 그래픽스 연구실.
Lecture XXVII. Orthonormal Bases and Projections Suppose that a set of vectors {x 1,…,x r } for a basis for some space S in R m space such that r  m.
EE611 Deterministic Systems Vector Spaces and Basis Changes Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
8.2 Kernel And Range.
CHARACTERIZATIONS OF INVERTIBLE MATRICES
Linear Transformations
ECE 638: Principles of Digital Color Imaging Systems
Basis and Dimension Basis Dimension Vector Spaces and Linear Systems
4.6: Rank.
2.III. Basis and Dimension
Linear Algebra Lecture 21.
3.IV. Change of Basis 3.IV.1. Changing Representations of Vectors
Row-equivalences again
Vector Spaces COORDINATE SYSTEMS © 2012 Pearson Education, Inc.
CHARACTERIZATIONS OF INVERTIBLE MATRICES
Presentation transcript:

3.II.1. Representing Linear Maps with Matrices 3.II.2. Any Matrix Represents a Linear Map 3.II. Computing Linear Maps

3.II.1. Representing Linear Maps with Matrices A linear map is determined by its action on the bases. Consider h : V n → W m with bases B and D for V and W, resp. Range space of h = Range h = span h( B ) = subspace of W. Rank h = dim[Range h ]  min( n, m ) Definition:Matrix Representation The matrix representation of linear map h: V n → W m w.r.t. B and D is an m  n matrix. where

Example: Let h: R 2 → R 3 by Given

Let → → → →

E.g.

Example: h: R 3 → P 1 by Let Task: Calculate where h sends

Example 1.7: Let π: R 3 → R 2 be the projection onto the xy-plane. And → Illustrating Theorem 1.4 using→ →

Example 1.8:Rotation Let t θ : R 2 → R 2 be the rotation by angle θ in the xy-plane. → E.g. Example 1.10:Matrix-vector product as column sum

Exercise 3.II.1. Using the standard bases, find (a) the matrix representing this map; (b) a general formula for h(v). 1. Assume that h: R 2 → R 3 is determined by this action. 2. Let d/dx: P 3 → P 3 be the derivative transformation. (a) Represent d/dx with respect to B, B where B =  1, x, x 2, x 3 . (b) Represent d/dx with respect to B, D where D =  1, 2x, 3x 2, 4x 3 .

3.II.2. Any Matrix Represents a Linear Map Theorem 2.1: Every matrix represents a homomorphism between vector spaces, of appropriate dimensions, with respect to any pair of bases. h : V n → W m with bases B and D s.t. Proof by construction: Let H be an m  n matrix. Then there is an homomorphism

Example 2.2: Which map the matrix represents depends on which bases are used. Let Then h 1 : R 2 → R 2 as represented by H w.r.t. B 1 and D 1 gives While h 2 : R 2 → R 2 as represented by H w.r.t. B 2 and D 2 gives   Convention: An m  n matrix with no spaces or bases specified will be assumed to represent h: V n → W m w.r.t. the standard bases. In which case, column space of H = R (h).

Theorem 2.3: rank H = rank h Proof: (See Hefferon, p.207.) For each set of bases for h: V n → W m,  Isomorphism: W m → R m. ∴ dim columnSpace = dim rangeSpace Example 2.4: Any map represented by must be of type h: V 3 → W 4 rank H = 2 →dim R (h) = 2 Corollary 2.5: Let h be a linear map represented by an m  n matrix H. Then h is onto  rank H = m  All rows L.I.( dim R = dim W ) h is 1-1  rank H = n  All cols L.I.( dim R = dim V )

Corollary 2.6: A square matrix represents nonsingular maps iff it is a nonsingular matrix. A matrix represents an isomorphism iff it is square and nonsingular. Example 2.7: Any map from R 2 to P 1 represented w.r.t. any pair of bases by is nonsingular because rank H = 2. Example 2.8: Any map represented by is singular because H is singular. Definition: A matrix is nonsingular if it is square and the corresponding linear system has a unique solution. A linear map is nonsingular if it is one-to-one.

Exercise 3.II Decide if each vector lies in the range of the map from R 3 to R 2 represented with respect to the standard bases by the matrix. (a)(b) 2. Describe geometrically the action on R 2 of the map represented with respect to the standard bases E 2, E 2 by this matrix. Do the same for these: