I. Isomorphisms II. Homomorphisms III. Computing Linear Maps IV. Matrix Operations V. Change of Basis VI. Projection Topics: Line of Best Fit Geometry.

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

8.2 Kernel And Range.
Chapter 3: Linear transformations
Elementary Linear Algebra Anton & Rorres, 9th Edition
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.
THE DIMENSION OF A VECTOR SPACE
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.
3.II.1. Representing Linear Maps with Matrices 3.II.2. Any Matrix Represents a Linear Map 3.II. Computing Linear Maps.
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.II. Homomorphisms 3.II.1. Definition 3.II.2. Range Space and Nullspace.
Dimension of a Vector Space (11/9/05) Theorem. If the vector space V has a basis consisting of n vectors, then any set of more than n vectors in V must.
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.
Coordinate Systems (11/4/05) It turns out that every vector space V which has a finite basis can be “realized” as one of the spaces R n as soon as we pick.
Chapter 4 Linear Transformations. Outlines Definition and Examples Matrix Representation of linear transformation Similarity.
5.IV. Jordan Form 5.IV.1. Polynomials of Maps and Matrices 5.IV.2. Jordan Canonical Form.
Preliminaries/ Chapter 1: Introduction. Definitions: from Abstract to Linear Algebra.
Class 25: Question 1 Which of the following vectors is orthogonal to the row space of A?
Orthogonality and Least Squares
Elementary Linear Algebra Anton & Rorres, 9 th Edition Lecture Set – 08 Chapter 8: Linear Transformations.
III. Reduced Echelon Form
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.
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.
CHAPTER FIVE Orthogonality Why orthogonal? Least square problem Accuracy of Numerical computation.
Elementary Linear Algebra Anton & Rorres, 9th Edition
4 4.2 © 2012 Pearson Education, Inc. Vector Spaces NULL SPACES, COLUMN SPACES, AND LINEAR TRANSFORMATIONS.
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,
AN ORTHOGONAL PROJECTION
Page 146 Chapter 3 True False Questions. 1. The image of a 3x4 matrix is a subspace of R 4 ? False. It is a subspace of R 3.
Chap. 6 Linear Transformations
Orthogonality and Least Squares
Elementary Linear Algebra Anton & Rorres, 9th Edition
Introductions to Linear Transformations Function T that maps a vector space V into a vector space W: V: the domain of T W: the codomain of T Chapter.
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.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.
4 © 2012 Pearson Education, Inc. Vector Spaces 4.4 COORDINATE SYSTEMS.
Class 26: Question 1 1.An orthogonal basis for A 2.An orthogonal basis for the column space of A 3.An orthogonal basis for the row space of A 4.An orthogonal.
SECTION 8 Groups of Permutations Definition A permutation of a set A is a function  ϕ : A  A that is both one to one and onto. If  and  are both permutations.
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.
A function is a rule f that associates with each element in a set A one and only one element in a set B. If f associates the element b with the element.
4.5: The Dimension of a Vector Space. Theorem 9 If a vector space V has a basis, then any set in V containing more than n vectors must be linearly dependent.
Chapter 4 Chapter Content 1. Real Vector Spaces 2. Subspaces 3. Linear Independence 4. Basis 5.Dimension 6. Row Space, Column Space, and Nullspace 8.Rank.
Chapter 6- LINEAR MAPPINGS LECTURE 8 Prof. Dr. Zafer ASLAN.
4 4.5 © 2016 Pearson Education, Inc. Vector Spaces THE DIMENSION OF A VECTOR SPACE.
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.
Sec Sec Sec 4.4 CHAPTER 4 Vector Spaces Let V be a set of elements with vector addition and multiplication by scalar is a vector space if these.
Group A set G is called a group if it satisfies the following axioms. G 1 G is closed under a binary operation. G 2 The operation is associative. G 3 There.
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.
 Matrix Operations  Inverse of a Matrix  Characteristics of Invertible Matrices …
Elementary Linear Algebra
Linear Transformations
GROUPS & THEIR REPRESENTATIONS: a card shuffling approach
Basis and Dimension Basis Dimension Vector Spaces and Linear Systems
Homomorphisms (11/20) Definition. If G and G’ are groups, a function  from G to G’ is called a homomorphism if it is operation preserving, i.e., for all.
2.III. Basis and Dimension
Theorems about LINEAR MAPPINGS.
Row-equivalences again
Preliminaries/ Chapter 1: Introduction
3.IV. Change of Basis 3.IV.1. Changing Representations of Vectors
Chapter 4 Linear Transformations
Row-equivalences again
Vector Spaces COORDINATE SYSTEMS © 2012 Pearson Education, Inc.
Presentation transcript:

I. Isomorphisms II. Homomorphisms III. Computing Linear Maps IV. Matrix Operations V. Change of Basis VI. Projection Topics: Line of Best Fit Geometry of Linear Maps Markov Chains Orthonormal Matrices Chapter Three: Maps Between Spaces

3.I. Isomorphisms 3.I.1. Definition and Examples 3.I.2. Dimension Characterizes Isomorphism

3.I.1. Definition and Examples Example 1.1:n-wide Row Vectors  n-tall Column Vectors Example 1.2: P n  R n+1 Definition 1.3: Isomorphism An isomorphism between two vector spaces V and W is a map f : V →W that (1) is a correspondence: f is a bijection (1-to-1 and onto); (2) preserves structure: In which case, V  W, read “ V is isomorphic to W. ” Example 1.4: Example 1.5:

Automorphism Automorphism = Isomorphism of a space with itself. Example 1.6: Dilation : Rotation : Reflection : Example 1.7: Translation Symmetry: Invariance under mapping.

Lemma 1.8:An isomorphism maps a zero vector to a zero vector. Proof: Lemma 1.9: For any map f : V → W between vector spaces these statements are equivalent. (1) f preserves structure f(v 1 + v 2 ) = f(v 1 ) + f(v 2 ) and f(cv) = c f(v) (2) f preserves linear combinations of two vectors f(c 1 v 1 + c 2 v 2 ) = c 1 f(v 1 ) + c 2 f(v 2 ) (3) f preserves linear combinations of any finite number of vectors f(c 1 v 1 +…+ c n v n ) = c 1 f(v 1 ) +…+ c n f(v n ) Proof: See Hefferon p.175.

Exercises 3.I.1 1. Show that the map f : R → R given by f(x) = x 3 is one-to-one and onto. Is it an isomorphism? 2. (a) Show that a function f : R 2 → R 2 is an automorphism iff it has the form where a, b, c, d  R and ad  bc  0 (b) Let f be an automorphism of R 2 with and Find

3. Show that, although R 2 is not itself a subspace of R 3, it is isomorphic to the xy-plane subspace of R 3. This is a vector space, the external direct sum (Cartesian product) of U and W. (a) Check that it is a vector space. (b) Find a basis for, and the dimension of, the external direct sum P 2  R 2. (c) What is the relationship among dim(U), dim(W), and dim(U  W)? (d) Suppose that U and W are subspaces of a vector space V such that V = U  W (in this case we say that V is the internal direct sum of U and W). Show that the map f : U  W → V given by ( u, w )  u + w is an isomorphism. Thus if the internal direct sum is defined then the internal and external direct sums are isomorphic. 4. Let U and W be vector spaces. Define a new vector space, consisting of the set U  W = { ( u, w ) | u  U and w  W } along with these operations. and

3.I.2. Dimension Characterizes Isomorphism Theorem 2.1:Isomorphism is an equivalence relation between vector spaces. Proof: ( For details, see Hefferon p.179 ) 1) Reflexivity: Identity map, id: v  v, preserves L.C. 2) Symmetry: f is bijection → f  1 exists & preserves L.C. 3) Transitivity: Composition preserves L.C. Isomorphism classes:

Theorem 2.3: Vector spaces are isomorphic  they have the same dim. Proof: (see Hefferon p.180) Isomorphism → correspondence between bases. Lemma 2.4:If spaces have the same dimension then they are isomorphic. Proof: (see Hefferon p.180) Every n-D vector space is isomorphic to R n. Isomorphism classes are characterized by dimension. Corollary 2.6: A finite-dimensional vector space is isomorphic to one and only one of the R n. is unique for given B. Decomposition

Example 2.7: M 2  2  R 4 where

Exercises 3.I Consider the isomorphism Rep B (·) : P 1 → R 2 where B =  1, 1+x . Find the image of each of these elements of the domain. (a) 3  2x; (b) 2 + 2x; (c) x 2. Suppose that V = V 1  V 2 and that V is isomorphic to the space U under the map f. Show that U = f(V 1 )  f(V 2 ).