Old & new co-ordinates

Size: px
Start display at page:

Download "Old & new co-ordinates"

Transcription

1 Old & new co-ordinates Aim lecture: A wise choice of co-ordinates can make life much easier. We give some examples showing how to make a linear change of co-ords to facilitate calculations. Suppose we have old co-ords (x 1,..., x n ) F n & some new co-ords (y 1,..., y n ) F n. They really lie in different copies of F n & we need some notation to distinguish the two. Notn We let F n x be a copy of F n whose co-ords are (x 1,..., x n ) & F n y be another copy of F n whose co-ords are (y 1,..., y n ). We let GL n (F) denote the set of invertible n n-matrices with entries in F. Daniel Chan (UNSW) Lecture16: Change of co-ordinates Semester / 8

2 Change of co-ordinate matrix Defn A change of co-ordinates matrix (with say old co-ords (x 1,..., x n ) & new co-ords (y 1,..., y n )) is a co-ord system of the form C : F n y F n x. Note the change of co-ordinates formula (x 1,..., x n ) T = C(y 1,..., y n ) T, (y 1,..., y n ) T = C 1 (x 1,..., x n ) T Rem The possible change of co-ords matrices correspond to the elements of GL n (F). E.g. Best to visualise an example geometrically. Suppose C : R 2 y R 2 x is given by the matrix ( 3 ) C = Daniel Chan (UNSW) Lecture16: Change of co-ordinates Semester / 8

3 Reflections via change of co-ordinate system E.g. Use change of co-ordinates to find the matrix A M 22 (R) representing reflection about the line x 2 = 4 3 x 1. A We use the co-ordinate system C : R 2 y R 2 x defined by the matrix ( 3 ) C = In the new co-ords, the representing matrix is easy ( ) ( ) ( ) ( ) y1 y1 1 0 y1 =. y 2 y y 2 But our theory of matrix reprns also gives ( ) C AC = 0 1 Note Hence A = C 1 AC : R 2 y 4 5 C R 2 x 3 5 A R 2 x C 1 R 2 y. Daniel Chan (UNSW) Lecture16: Change of co-ordinates Semester / 8

4 Linear maps & change of co-ords The previous example illustrates the general principle below. Prop Let F n x be the space of old co-ords (x 1,..., x n ) & F n y be the space of new co-ords (y 1,..., y n ) which are related by the change of co-ords matrix C : F n y F n x. If A x : F n x F n x denotes a linear map in old co-ords & A y : F n y F n y denotes the corresponding map in new co-ords then A y = C 1 A x C, A x = CA y C 1 Rem It is useful to think of the composite CA y C 1 : F n x C 1 F n y A y F n y C F n x as the sequence 1 1st pass to new co-ords with C 1 2 then use linear transformation A y wrt new & easier co-ords (y 1,..., y n ). 3 finally use C to convert back to original co-ords. Daniel Chan (UNSW) Lecture16: Change of co-ordinates Semester / 8

5 Rotations via change of co-ords E.g. Write down the matrix representing rotation about the axis R v where v = 1 3 (1, 2, 2)T. Suppose the angle of rotation is θ & the direction is given by the right hand rule with thumb pointing in dirn v. A We first find a good co-ord system to use. Daniel Chan (UNSW) Lecture16: Change of co-ordinates Semester / 8

6 Rotation example cont d Note that the representing matrix in the new co-ords is Daniel Chan (UNSW) Lecture16: Change of co-ordinates Semester / 8

7 Swapping between two co-ordinate systems Let C x : F n x V, C y : F n y V be two co-ordinate systems. Then we can pass from x-co-ords to y-co-ords via F n C x C 1 y x V F n y. This suggests Defn The change of co-ordinates matrix is C = Cy 1 vector v V, its y-co-ords are y = Cx. E.g. Suppose we have new co-ord systems on R 2 given by ( ) ( ) C x =, C 3 1 y =. 1 1 C x. Given the x-co-ords x of a If the x-co-ords of v R 2 are ( x 1 x 2 ), what are the y-co-ords? What is the change of co-ords matrix? Daniel Chan (UNSW) Lecture16: Change of co-ordinates Semester / 8

8 Being careful with identifying vector spaces Isomorphisms sometimes allow us to identify two vector spaces, but this can be confusing at times, & we should be more careful as follows. Suppose given isomorphisms Φ V : V V, Φ W : W W. Defn Given isomorphisms Φ V, Φ W above, the linear map T : V W induces a corresponding linear map T = Φ 1 W T Φ V : V W. If there is no confusion in treating Φ V, Φ W as identifications, then we may also make the identification T = T. E.g. Suppose m = m m M, n = n n N so there are natural isomorphisms Φ W : F m F m1... F m M, Φ V : F n F n1... F n N given by removing internal parentheses. Given an M N-matrix of matrices defining a linear map T : F n1... F n N F m1... F m M, the corresponding linear map Φ 1 W T Φ V : F n F m is just the big matrix obtained by removing internal parentheses. Daniel Chan (UNSW) Lecture16: Change of co-ordinates Semester / 8

Matrix of linear maps. Matrix-vector product

Matrix of linear maps. Matrix-vector product Matrix of linear maps. Matrix-vector product Aim lecture: Introduce matrices of linear maps as a way of understanding more complicated linear maps. Consider direct sums of F-spaces V = m j=1 V j, W = n

More information

Jordan blocks. Defn. Let λ F, n Z +. The size n Jordan block with e-value λ is the n n upper triangular matrix. J n (λ) =

Jordan blocks. Defn. Let λ F, n Z +. The size n Jordan block with e-value λ is the n n upper triangular matrix. J n (λ) = Jordan blocks Aim lecture: Even over F = C, endomorphisms cannot always be represented by a diagonal matrix. We give Jordan s answer, to what is the best form of the representing matrix. Defn Let λ F,

More information

Eigenvectors. Prop-Defn

Eigenvectors. Prop-Defn Eigenvectors Aim lecture: The simplest T -invariant subspaces are 1-dim & these give rise to the theory of eigenvectors. To compute these we introduce the similarity invariant, the characteristic polynomial.

More information

Rotations & reflections

Rotations & reflections Rotations & reflections Aim lecture: We use the spectral thm for normal operators to show how any orthogonal matrix can be built up from rotations. In this lecture we work over the fields F = R & C. We

More information

Rotations & reflections

Rotations & reflections Rotations & reflections Aim lecture: We use the spectral thm for normal operators to show how any orthogonal matrix can be built up from rotations & reflections. In this lecture we work over the fields

More information

Non-square diagonal matrices

Non-square diagonal matrices Non-square diagonal matrices Aim lecture: We apply the spectral theory of hermitian operators to look at linear maps T : V W which are not necessarily endomorphisms. This gives useful factorisations of

More information

Quadratic forms. Defn

Quadratic forms. Defn Quadratic forms Aim lecture: We use the spectral thm for self-adjoint operators to study solns to some multi-variable quadratic eqns. In this lecture, we work over the real field F = R. We use the notn

More information

Kernel. Prop-Defn. Let T : V W be a linear map.

Kernel. Prop-Defn. Let T : V W be a linear map. Kernel Aim lecture: We examine the kernel which measures the failure of uniqueness of solns to linear eqns. The concept of linear independence naturally arises. This in turn gives the concept of a basis

More information

i.e. the i-th column of A is the value of T at the i-th standard basis vector e i R n.

i.e. the i-th column of A is the value of T at the i-th standard basis vector e i R n. Aim lecture In first year you learnt that you can mutliply not only a (real matrix with a (real vector, but more generally, matrices together (of compatible sizes. Furthermore, you learnt the following

More information

Matrix-valued functions

Matrix-valued functions Matrix-valued functions Aim lecture: We solve some first order linear homogeneous differential equations using exponentials of matrices. Recall as in MATH2, the any function R M mn (C) : t A(t) can be

More information

Matrix-valued functions

Matrix-valued functions Matrix-valued functions Aim lecture: We solve some first order linear homogeneous differential equations using exponentials of matrices. Recall as in MATH2, the any function R M mn (C) : t A(t) can be

More information

Rank & nullity. Defn. Let T : V W be linear. We define the rank of T to be rank T = dim im T & the nullity of T to be nullt = dim ker T.

Rank & nullity. Defn. Let T : V W be linear. We define the rank of T to be rank T = dim im T & the nullity of T to be nullt = dim ker T. Rank & nullity Aim lecture: We further study vector space complements, which is a tool which allows us to decompose linear problems into smaller ones. We give an algorithm for finding complements & an

More information

Data fitting. Ideal equation for linear relation

Data fitting. Ideal equation for linear relation Problem Most likely, there will be experimental error so you should take more than 2 data points, & they will not lie on a line so the ideal eqn above has no solution. The question is what is the best

More information

Orthogonal complement

Orthogonal complement Orthogonal complement Aim lecture: Inner products give a special way of constructing vector space complements. As usual, in this lecture F = R or C. We also let V be an F-space equipped with an inner product

More information

Here are some additional properties of the determinant function.

Here are some additional properties of the determinant function. List of properties Here are some additional properties of the determinant function. Prop Throughout let A, B M nn. 1 If A = (a ij ) is upper triangular then det(a) = a 11 a 22... a nn. 2 If a row or column

More information

Jordan chain. Defn. E.g. T = J 3 (λ) Daniel Chan (UNSW) Lecture 29: Jordan chains & tableaux Semester / 10

Jordan chain. Defn. E.g. T = J 3 (λ) Daniel Chan (UNSW) Lecture 29: Jordan chains & tableaux Semester / 10 Jordan chain Aim lecture: We introduce the notions of Jordan chains & Jordan form tableaux which are the key notions to proving the Jordan canonical form theorem. Throughout this lecture we fix the following

More information

Data for a vector space

Data for a vector space Data for a vector space Aim lecture: We recall the notion of a vector space which provides the context for describing linear phenomena. Throughout the rest of these lectures, F denotes a field. Defn A

More information

Definition of adjoint

Definition of adjoint Definition of adjoint Aim lecture: We generalise the adjoint of complex matrices to linear maps between fin dim inner product spaces. In this lecture, we let F = R or C. Let V, W be inner product spaces

More information

Chapter 2: Vector Geometry

Chapter 2: Vector Geometry Chapter 2: Vector Geometry Daniel Chan UNSW Semester 1 2018 Daniel Chan (UNSW) Chapter 2: Vector Geometry Semester 1 2018 1 / 32 Goals of this chapter In this chapter, we will answer the following geometric

More information

Chapter 5: Matrices. Daniel Chan. Semester UNSW. Daniel Chan (UNSW) Chapter 5: Matrices Semester / 33

Chapter 5: Matrices. Daniel Chan. Semester UNSW. Daniel Chan (UNSW) Chapter 5: Matrices Semester / 33 Chapter 5: Matrices Daniel Chan UNSW Semester 1 2018 Daniel Chan (UNSW) Chapter 5: Matrices Semester 1 2018 1 / 33 In this chapter Matrices were first introduced in the Chinese Nine Chapters on the Mathematical

More information

3 Fields, Elementary Matrices and Calculating Inverses

3 Fields, Elementary Matrices and Calculating Inverses 3 Fields, Elementary Matrices and Calculating Inverses 3. Fields So far we have worked with matrices whose entries are real numbers (and systems of equations whose coefficients and solutions are real numbers).

More information

Chapter 4: Linear Equations

Chapter 4: Linear Equations Chapter 4: Linear Equations Daniel Chan UNSW Semester 1 2018 Daniel Chan (UNSW) Chapter 4: Linear Equations Semester 1 2018 1 / 42 An Ancient Chinese Problem The following maths problem was taken from

More information

An overview of key ideas

An overview of key ideas An overview of key ideas This is an overview of linear algebra given at the start of a course on the mathematics of engineering. Linear algebra progresses from vectors to matrices to subspaces. Vectors

More information

Problem 1: (3 points) Recall that the dot product of two vectors in R 3 is

Problem 1: (3 points) Recall that the dot product of two vectors in R 3 is Linear Algebra, Spring 206 Homework 3 Name: Problem : (3 points) Recall that the dot product of two vectors in R 3 is a x b y = ax + by + cz, c z and this is essentially the same as the matrix multiplication

More information

MAT 1302B Mathematical Methods II

MAT 1302B Mathematical Methods II MAT 1302B Mathematical Methods II Alistair Savage Mathematics and Statistics University of Ottawa Winter 2015 Lecture 19 Alistair Savage (uottawa) MAT 1302B Mathematical Methods II Winter 2015 Lecture

More information

Matrices, Row Reduction of Matrices

Matrices, Row Reduction of Matrices Matrices, Row Reduction of Matrices October 9, 014 1 Row Reduction and Echelon Forms In the previous section, we saw a procedure for solving systems of equations It is simple in that it consists of only

More information

AMS 5 NUMERICAL DESCRIPTIVE METHODS

AMS 5 NUMERICAL DESCRIPTIVE METHODS AMS 5 NUMERICAL DESCRIPTIVE METHODS Introduction A histogram provides a graphical description of the distribution of a sample of data. If we want to summarize the properties of such a distribution we can

More information

Lecture 4: Applications of Orthogonality: QR Decompositions

Lecture 4: Applications of Orthogonality: QR Decompositions Math 08B Professor: Padraic Bartlett Lecture 4: Applications of Orthogonality: QR Decompositions Week 4 UCSB 204 In our last class, we described the following method for creating orthonormal bases, known

More information

Chapter 1: Introduction to Vectors (based on Ian Doust s notes)

Chapter 1: Introduction to Vectors (based on Ian Doust s notes) Chapter 1: Introduction to Vectors (based on Ian Doust s notes) Daniel Chan UNSW Semester 1 2018 Daniel Chan (UNSW) Chapter 1: Introduction to Vectors Semester 1 2018 1 / 38 A typical problem Chewie points

More information

6.1 Inverse Functions. Outline

6.1 Inverse Functions. Outline 6.1 Inverse Functions Tom Lewis Fall Semester 2018 Outline The inverse of a relation One-to-one functions Inverse functions Finding inverse functions The calculus of inverse functions Definition A relation

More information

Problem Set # 1 Solution, 18.06

Problem Set # 1 Solution, 18.06 Problem Set # 1 Solution, 1.06 For grading: Each problem worths 10 points, and there is points of extra credit in problem. The total maximum is 100. 1. (10pts) In Lecture 1, Prof. Strang drew the cone

More information

LS.1 Review of Linear Algebra

LS.1 Review of Linear Algebra LS. LINEAR SYSTEMS LS.1 Review of Linear Algebra In these notes, we will investigate a way of handling a linear system of ODE s directly, instead of using elimination to reduce it to a single higher-order

More information

1 Differentiable manifolds and smooth maps. (Solutions)

1 Differentiable manifolds and smooth maps. (Solutions) 1 Differentiable manifolds and smooth maps Solutions Last updated: March 17 2011 Problem 1 The state of the planar pendulum is entirely defined by the position of its moving end in the plane R 2 Since

More information

Computationally, diagonal matrices are the easiest to work with. With this idea in mind, we introduce similarity:

Computationally, diagonal matrices are the easiest to work with. With this idea in mind, we introduce similarity: Diagonalization We have seen that diagonal and triangular matrices are much easier to work with than are most matrices For example, determinants and eigenvalues are easy to compute, and multiplication

More information

1 Differentiable manifolds and smooth maps. (Solutions)

1 Differentiable manifolds and smooth maps. (Solutions) 1 Differentiable manifolds and smooth maps Solutions Last updated: February 16 2012 Problem 1 a The projection maps a point P x y S 1 to the point P u 0 R 2 the intersection of the line NP with the x-axis

More information

Math 3C Lecture 20. John Douglas Moore

Math 3C Lecture 20. John Douglas Moore Math 3C Lecture 20 John Douglas Moore May 18, 2009 TENTATIVE FORMULA I Midterm I: 20% Midterm II: 20% Homework: 10% Quizzes: 10% Final: 40% TENTATIVE FORMULA II Higher of two midterms: 30% Homework: 10%

More information

Lecture 1 Systems of Linear Equations and Matrices

Lecture 1 Systems of Linear Equations and Matrices Lecture 1 Systems of Linear Equations and Matrices Math 19620 Outline of Course Linear Equations and Matrices Linear Transformations, Inverses Bases, Linear Independence, Subspaces Abstract Vector Spaces

More information

Lecture 2: Recurrence relations and population dynamics

Lecture 2: Recurrence relations and population dynamics Lecture 2: Recurrence relations and population dynamics Daniel Chan UNSW Semester 1 2014 Daniel Chan (UNSW) Lecture 2: Recurrence relations Semester 1 2014 1 / 13 Sample real-world problem In this lecture,

More information

Span and Linear Independence

Span and Linear Independence Span and Linear Independence It is common to confuse span and linear independence, because although they are different concepts, they are related. To see their relationship, let s revisit the previous

More information

Lecture 02: 2D Geometry. August 24, 2017

Lecture 02: 2D Geometry. August 24, 2017 Lecture 02: 2D Geometry August 24, 207 This Came Up Tuesday Know what radiosity computation does. Do not expect to implement nor see underlying equations this semester. 8/24/7 CSU CS40 Fall 207, Ross Beveridge

More information

Matrices and Vectors

Matrices and Vectors Matrices and Vectors James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University November 11, 2013 Outline 1 Matrices and Vectors 2 Vector Details 3 Matrix

More information

Matrices and Linear transformations

Matrices and Linear transformations Matrices and Linear transformations We have been thinking of matrices in connection with solutions to linear systems of equations like Ax = b. It is time to broaden our horizons a bit and start thinking

More information

Lecture 3: Graphical analysis- Arms race

Lecture 3: Graphical analysis- Arms race Lecture 3: Graphical analysis- Arms race Daniel Chan UNSW Semester 1 2014 Daniel Chan (UNSW) Lecture 3: Graphical analysis Semester 1 2014 1 / 12 Scenario Event 1 Saruman has taught the orcs the secrets

More information

Math 344 Lecture # Linear Systems

Math 344 Lecture # Linear Systems Math 344 Lecture #12 2.7 Linear Systems Through a choice of bases S and T for finite dimensional vector spaces V (with dimension n) and W (with dimension m), a linear equation L(v) = w becomes the linear

More information

Endomorphisms, Automorphisms, and Change of Basis

Endomorphisms, Automorphisms, and Change of Basis LECTURE 15 Endomorphisms, Automorphisms, and Change of Basis We now specialize to the situation where a vector space homomorphism (a.k.a, linear transformation) maps a vector space to itself. D 15.1. Let

More information

Mathematics for Graphics and Vision

Mathematics for Graphics and Vision Mathematics for Graphics and Vision Steven Mills March 3, 06 Contents Introduction 5 Scalars 6. Visualising Scalars........................ 6. Operations on Scalars...................... 6.3 A Note on

More information

Basic Linear Algebra. Florida State University. Acknowledgements: Daniele Panozzo. CAP Computer Graphics - Fall 18 Xifeng Gao

Basic Linear Algebra. Florida State University. Acknowledgements: Daniele Panozzo. CAP Computer Graphics - Fall 18 Xifeng Gao Basic Linear Algebra Acknowledgements: Daniele Panozzo Overview We will briefly overview the basic linear algebra concepts that we will need in the class You will not be able to follow the next lectures

More information

Lecture 4.1: Homomorphisms and isomorphisms

Lecture 4.1: Homomorphisms and isomorphisms Lecture 4.: Homomorphisms and isomorphisms Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4, Modern Algebra M. Macauley (Clemson) Lecture

More information

Section 4.6 Negative Exponents

Section 4.6 Negative Exponents Section 4.6 Negative Exponents INTRODUCTION In order to understand negative exponents the main topic of this section we need to make sure we understand the meaning of the reciprocal of a number. Reciprocals

More information

LECTURES 14/15: LINEAR INDEPENDENCE AND BASES

LECTURES 14/15: LINEAR INDEPENDENCE AND BASES LECTURES 14/15: LINEAR INDEPENDENCE AND BASES MA1111: LINEAR ALGEBRA I, MICHAELMAS 2016 1. Linear Independence We have seen in examples of span sets of vectors that sometimes adding additional vectors

More information

LECTURE VI: SELF-ADJOINT AND UNITARY OPERATORS MAT FALL 2006 PRINCETON UNIVERSITY

LECTURE VI: SELF-ADJOINT AND UNITARY OPERATORS MAT FALL 2006 PRINCETON UNIVERSITY LECTURE VI: SELF-ADJOINT AND UNITARY OPERATORS MAT 204 - FALL 2006 PRINCETON UNIVERSITY ALFONSO SORRENTINO 1 Adjoint of a linear operator Note: In these notes, V will denote a n-dimensional euclidean vector

More information

EXCERPT FROM ON SOME ACTIONS OF STABLY ELEMENTARY MATRICES ON ALTERNATING MATRICES

EXCERPT FROM ON SOME ACTIONS OF STABLY ELEMENTARY MATRICES ON ALTERNATING MATRICES EXCERPT FROM ON SOME ACTIONS OF STABLY ELEMENTARY MATRICES ON ALTERNATING MATRICES RAVI A.RAO AND RICHARD G. SWAN Abstract. This is an excerpt from a paper still in preparation. We show that there are

More information

Chapter 3: Complex Numbers

Chapter 3: Complex Numbers Chapter 3: Complex Numbers Daniel Chan UNSW Semester 1 2018 Daniel Chan (UNSW) Chapter 3: Complex Numbers Semester 1 2018 1 / 48 Philosophical discussion about numbers Q In what sense is 1 a number? DISCUSS

More information

Lecture 2 Systems of Linear Equations and Matrices, Continued

Lecture 2 Systems of Linear Equations and Matrices, Continued Lecture 2 Systems of Linear Equations and Matrices, Continued Math 19620 Outline of Lecture Algorithm for putting a matrix in row reduced echelon form - i.e. Gauss-Jordan Elimination Number of Solutions

More information

Math 396. An application of Gram-Schmidt to prove connectedness

Math 396. An application of Gram-Schmidt to prove connectedness Math 396. An application of Gram-Schmidt to prove connectedness 1. Motivation and background Let V be an n-dimensional vector space over R, and define GL(V ) to be the set of invertible linear maps V V

More information

On the Arithmetic and Shift Complexities of Inverting of Dierence Operator Matrices

On the Arithmetic and Shift Complexities of Inverting of Dierence Operator Matrices On the Arithmetic and Shift Complexities of Inverting of Dierence Operator Matrices S. Abramov Moscow, Comp. Centre of RAS, MSU S. Abramov the arithmetic and shift complexities 1/12 Let K be a dierence

More information

Vectors Part 2: Three Dimensions

Vectors Part 2: Three Dimensions Vectors Part 2: Three Dimensions Last modified: 23/02/2018 Links Vectors Recap Three Dimensions: Cartesian Form Three Dimensions: Standard Unit Vectors Three Dimensions: Polar Form Basic Vector Maths Three

More information

Final EXAM Preparation Sheet

Final EXAM Preparation Sheet Final EXAM Preparation Sheet M369 Fall 217 1 Key concepts The following list contains the main concepts and ideas that we have explored this semester. For each concept, make sure that you remember about

More information

Math 120: Homework 2 Solutions

Math 120: Homework 2 Solutions Math 120: Homework 2 Solutions October 12, 2018 Problem 1.2 # 9. Let G be the group of rigid motions of the tetrahedron. Show that G = 12. Solution. Let us label the vertices of the tetrahedron 1, 2, 3,

More information

Math 308 Midterm Answers and Comments July 18, Part A. Short answer questions

Math 308 Midterm Answers and Comments July 18, Part A. Short answer questions Math 308 Midterm Answers and Comments July 18, 2011 Part A. Short answer questions (1) Compute the determinant of the matrix a 3 3 1 1 2. 1 a 3 The determinant is 2a 2 12. Comments: Everyone seemed to

More information

is Use at most six elementary row operations. (Partial

is Use at most six elementary row operations. (Partial MATH 235 SPRING 2 EXAM SOLUTIONS () (6 points) a) Show that the reduced row echelon form of the augmented matrix of the system x + + 2x 4 + x 5 = 3 x x 3 + x 4 + x 5 = 2 2x + 2x 3 2x 4 x 5 = 3 is. Use

More information

Three-Dimensional Coordinate Systems. Three-Dimensional Coordinate Systems. Three-Dimensional Coordinate Systems. Three-Dimensional Coordinate Systems

Three-Dimensional Coordinate Systems. Three-Dimensional Coordinate Systems. Three-Dimensional Coordinate Systems. Three-Dimensional Coordinate Systems To locate a point in a plane, two numbers are necessary. We know that any point in the plane can be represented as an ordered pair (a, b) of real numbers, where a is the x-coordinate and b is the y-coordinate.

More information

Lecture 1.4: Inner products and orthogonality

Lecture 1.4: Inner products and orthogonality Lecture 1.4: Inner products and orthogonality Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4340, Advanced Engineering Mathematics M.

More information

v = ( 2)

v = ( 2) Chapter : Introduction to Vectors.. Vectors and linear combinations Let s begin by saying what vectors are: They are lists of numbers. If there are numbers in the list, there is a natural correspondence

More information

CSL361 Problem set 4: Basic linear algebra

CSL361 Problem set 4: Basic linear algebra CSL361 Problem set 4: Basic linear algebra February 21, 2017 [Note:] If the numerical matrix computations turn out to be tedious, you may use the function rref in Matlab. 1 Row-reduced echelon matrices

More information

Math 123, Week 2: Matrix Operations, Inverses

Math 123, Week 2: Matrix Operations, Inverses Math 23, Week 2: Matrix Operations, Inverses Section : Matrices We have introduced ourselves to the grid-like coefficient matrix when performing Gaussian elimination We now formally define general matrices

More information

Introduction to Data Mining

Introduction to Data Mining Introduction to Data Mining Lecture #21: Dimensionality Reduction Seoul National University 1 In This Lecture Understand the motivation and applications of dimensionality reduction Learn the definition

More information

5.2.8: Let A be a finite abelian group written multplicatively, and let p be a prime. Define

5.2.8: Let A be a finite abelian group written multplicatively, and let p be a prime. Define Lecture 7 5.2 The fundamental theorem of abelian groups is one of the basic theorems in group theory and was proven over a century before the more general theorem we will not cover of which it is a special

More information

1.8 Dual Spaces (non-examinable)

1.8 Dual Spaces (non-examinable) 2 Theorem 1715 is just a restatement in terms of linear morphisms of a fact that you might have come across before: every m n matrix can be row-reduced to reduced echelon form using row operations Moreover,

More information

Notes on nilpotent orbits Computational Theory of Real Reductive Groups Workshop. Eric Sommers

Notes on nilpotent orbits Computational Theory of Real Reductive Groups Workshop. Eric Sommers Notes on nilpotent orbits Computational Theory of Real Reductive Groups Workshop Eric Sommers 17 July 2009 2 Contents 1 Background 5 1.1 Linear algebra......................................... 5 1.1.1

More information

Vectors and Matrices

Vectors and Matrices Vectors and Matrices Scalars We often employ a single number to represent quantities that we use in our daily lives such as weight, height etc. The magnitude of this number depends on our age and whether

More information

5 Group theory. 5.1 Binary operations

5 Group theory. 5.1 Binary operations 5 Group theory This section is an introduction to abstract algebra. This is a very useful and important subject for those of you who will continue to study pure mathematics. 5.1 Binary operations 5.1.1

More information

Linear Algebra II. 7 Inner product spaces. Notes 7 16th December Inner products and orthonormal bases

Linear Algebra II. 7 Inner product spaces. Notes 7 16th December Inner products and orthonormal bases MTH6140 Linear Algebra II Notes 7 16th December 2010 7 Inner product spaces Ordinary Euclidean space is a 3-dimensional vector space over R, but it is more than that: the extra geometric structure (lengths,

More information

Differentiation of functions of covariance

Differentiation of functions of covariance Differentiation of log X May 5, 2005 1 Differentiation of functions of covariance matrices or: Why you can forget you ever read this Richard Turner Covariance matrices are symmetric, but we often conveniently

More information

Vectors Year 12 Term 1

Vectors Year 12 Term 1 Vectors Year 12 Term 1 1 Vectors - A Vector has Two properties Magnitude and Direction - A vector is usually denoted in bold, like vector a, or a, or many others. In 2D - a = xı + yȷ - a = x, y - where,

More information

Lecture 4: Orbits. Rajat Mittal. IIT Kanpur

Lecture 4: Orbits. Rajat Mittal. IIT Kanpur Lecture 4: Orbits Rajat Mittal IIT Kanpur In the beginning of the course we asked a question. How many different necklaces can we form using 2 black beads and 10 white beads? In the question, the numbers

More information

Linear Least Square Problems Dr.-Ing. Sudchai Boonto

Linear Least Square Problems Dr.-Ing. Sudchai Boonto Dr-Ing Sudchai Boonto Department of Control System and Instrumentation Engineering King Mongkuts Unniversity of Technology Thonburi Thailand Linear Least-Squares Problems Given y, measurement signal, find

More information

Chapter 3. Vector spaces

Chapter 3. Vector spaces Chapter 3. Vector spaces Lecture notes for MA1111 P. Karageorgis pete@maths.tcd.ie 1/22 Linear combinations Suppose that v 1,v 2,...,v n and v are vectors in R m. Definition 3.1 Linear combination We say

More information

Lecture 11: Dimension. How does Span(S) vary with S

Lecture 11: Dimension. How does Span(S) vary with S Lecture 11: Dimension Aim Lecture A basis {v 1,..., v n } of V gives n-dim coord system. Suggests V is n-dimensional. Need theory to ensure any two bases have the same number of vectors. How does Span(S)

More information

The Cross Product The cross product of v = (v 1,v 2,v 3 ) and w = (w 1,w 2,w 3 ) is

The Cross Product The cross product of v = (v 1,v 2,v 3 ) and w = (w 1,w 2,w 3 ) is The Cross Product 1-1-2018 The cross product of v = (v 1,v 2,v 3 ) and w = (w 1,w 2,w 3 ) is v w = (v 2 w 3 v 3 w 2 )î+(v 3 w 1 v 1 w 3 )ĵ+(v 1 w 2 v 2 w 1 )ˆk = v 1 v 2 v 3 w 1 w 2 w 3. Strictly speaking,

More information

Math 3361-Modern Algebra Lecture 08 9/26/ Cardinality

Math 3361-Modern Algebra Lecture 08 9/26/ Cardinality Math 336-Modern Algebra Lecture 08 9/26/4. Cardinality I started talking about cardinality last time, and you did some stuff with it in the Homework, so let s continue. I said that two sets have the same

More information

Lecture 6 & 7. Shuanglin Shao. September 16th and 18th, 2013

Lecture 6 & 7. Shuanglin Shao. September 16th and 18th, 2013 Lecture 6 & 7 Shuanglin Shao September 16th and 18th, 2013 1 Elementary matrices 2 Equivalence Theorem 3 A method of inverting matrices Def An n n matrice is called an elementary matrix if it can be obtained

More information

Math 3191 Applied Linear Algebra

Math 3191 Applied Linear Algebra Math 9 Applied Linear Algebra Lecture 9: Diagonalization Stephen Billups University of Colorado at Denver Math 9Applied Linear Algebra p./9 Section. Diagonalization The goal here is to develop a useful

More information

11 a 12 a 13 a 21 a 22 a b 12 b 13 b 21 b 22 b b 11 a 12 + b 12 a 13 + b 13 a 21 + b 21 a 22 + b 22 a 23 + b 23

11 a 12 a 13 a 21 a 22 a b 12 b 13 b 21 b 22 b b 11 a 12 + b 12 a 13 + b 13 a 21 + b 21 a 22 + b 22 a 23 + b 23 Chapter 2 (3 3) Matrices The methods used described in the previous chapter for solving sets of linear equations are equally applicable to 3 3 matrices. The algebra becomes more drawn out for larger matrices,

More information

Lecture 2: Groups. Rajat Mittal. IIT Kanpur

Lecture 2: Groups. Rajat Mittal. IIT Kanpur Lecture 2: Groups Rajat Mittal IIT Kanpur These notes are about the first abstract mathematical structure we are going to study, groups. You are already familiar with set, which is just a collection of

More information

(II.B) Basis and dimension

(II.B) Basis and dimension (II.B) Basis and dimension How would you explain that a plane has two dimensions? Well, you can go in two independent directions, and no more. To make this idea precise, we formulate the DEFINITION 1.

More information

Math 4377/6308 Advanced Linear Algebra

Math 4377/6308 Advanced Linear Algebra 2.5 Change of Bases 2.6 Dual Spaces Math 4377/6308 Advanced Linear Algebra 2.5 Change of Bases & 2.6 Dual Spaces Jiwen He Department of Mathematics, University of Houston jiwenhe@math.uh.edu math.uh.edu/

More information

Linear Methods (Math 211) - Lecture 2

Linear Methods (Math 211) - Lecture 2 Linear Methods (Math 211) - Lecture 2 David Roe September 11, 2013 Recall Last time: Linear Systems Matrices Geometric Perspective Parametric Form Today 1 Row Echelon Form 2 Rank 3 Gaussian Elimination

More information

This appendix provides a very basic introduction to linear algebra concepts.

This appendix provides a very basic introduction to linear algebra concepts. APPENDIX Basic Linear Algebra Concepts This appendix provides a very basic introduction to linear algebra concepts. Some of these concepts are intentionally presented here in a somewhat simplified (not

More information

Digital Image Processing

Digital Image Processing Digital Image Processing Image Transforms Unitary Transforms and the 2D Discrete Fourier Transform DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL PROCESSING IMPERIAL COLLEGE LONDON What is this

More information

Math 2210Q (Roby) Practice Midterm #1 Solutions Fall 2017

Math 2210Q (Roby) Practice Midterm #1 Solutions Fall 2017 Math Q (Roby) Practice Midterm # Solutions Fall 7 SHOW ALL YOUR WORK! Make sure you give reasons to support your answers. If you have any questions, do not hesitate to ask! For this exam no calculators

More information

Vectors a vector is a quantity that has both a magnitude (size) and a direction

Vectors a vector is a quantity that has both a magnitude (size) and a direction Vectors In physics, a vector is a quantity that has both a magnitude (size) and a direction. Familiar examples of vectors include velocity, force, and electric field. For any applications beyond one dimension,

More information

EXAMPLES OF CLASSICAL ITERATIVE METHODS

EXAMPLES OF CLASSICAL ITERATIVE METHODS EXAMPLES OF CLASSICAL ITERATIVE METHODS In these lecture notes we revisit a few classical fixpoint iterations for the solution of the linear systems of equations. We focus on the algebraic and algorithmic

More information

Announcements Wednesday, August 30

Announcements Wednesday, August 30 Announcements Wednesday, August 30 WeBWorK due on Friday at 11:59pm. The first quiz is on Friday, during recitation. It covers through Monday s material. Quizzes mostly test your understanding of the homework.

More information

Jordan normal form notes (version date: 11/21/07)

Jordan normal form notes (version date: 11/21/07) Jordan normal form notes (version date: /2/7) If A has an eigenbasis {u,, u n }, ie a basis made up of eigenvectors, so that Au j = λ j u j, then A is diagonal with respect to that basis To see this, let

More information

Metric spaces and metrizability

Metric spaces and metrizability 1 Motivation Metric spaces and metrizability By this point in the course, this section should not need much in the way of motivation. From the very beginning, we have talked about R n usual and how relatively

More information

UC Berkeley Summer Undergraduate Research Program 2015 July 9 Lecture

UC Berkeley Summer Undergraduate Research Program 2015 July 9 Lecture UC Berkeley Summer Undergraduate Research Program 205 July 9 Lecture We will introduce the basic structure and representation theory of the symplectic group Sp(V ). Basics Fix a nondegenerate, alternating

More information

Eigenvalue and Eigenvector Homework

Eigenvalue and Eigenvector Homework Eigenvalue and Eigenvector Homework Olena Bormashenko November 4, 2 For each of the matrices A below, do the following:. Find the characteristic polynomial of A, and use it to find all the eigenvalues

More information

Linear Algebra Done Wrong. Sergei Treil. Department of Mathematics, Brown University

Linear Algebra Done Wrong. Sergei Treil. Department of Mathematics, Brown University Linear Algebra Done Wrong Sergei Treil Department of Mathematics, Brown University Copyright c Sergei Treil, 2004, 2009 Preface The title of the book sounds a bit mysterious. Why should anyone read this

More information

Derivation of the Kalman Filter

Derivation of the Kalman Filter Derivation of the Kalman Filter Kai Borre Danish GPS Center, Denmark Block Matrix Identities The key formulas give the inverse of a 2 by 2 block matrix, assuming T is invertible: T U 1 L M. (1) V W N P

More information