Definition of adjoint

Size: px
Start display at page:

Download "Definition of adjoint"

Transcription

1 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 with inner products denoted ( ) V, ( ) W. Let D V : V V, D W : W W be the canonical maps. Prop-Defn Let T : V W, T : W V be linear. 1 T T D W = D V T : W V iff for all v, V, w W we have (T w v) V = (w T v) W. 2 Given T, there is at most one linear map T : W V satisfying the condn in 1) above. In this case we write T = T & call it the adjoint of T. 3 If V is fin dim then T exists & T = D 1 V T T D W. Rem The defn of the adjoint depends critically on the inner products involved though the notation does not record this! Proof. For 3), just note that D V is invertible & D 1 V T T D W is linear being the composite of two conjugate linear maps with a linear one. Daniel Chan (UNSW) Lecture 36: Adjoints Semester / 7

2 Proof cont d For 1) just note T T D W = D V T for all w W, T T (D W w) = D V (T w) for all w W, (D W w) T = (T w ) for all w W, (w T ( )) = (T w ) For 2), suppose T, T both satisfy the condn in 1). Then D V T = D V T. Suffice show for any w W that T w = T w. But D V (T w) = D V (T w) so the result follows from injectivity of D V. Daniel Chan (UNSW) Lecture 36: Adjoints Semester / 7

3 Fancy example (not examinable) E.g. Let V = Cc be the R-space of compactly supported (= zero outside of some compact set) infinitely differentiable functions on R. Note T = d dt is a lin map from V V. Note that we have an inner product (f g) = f (t)g(t)dt. What s T? A Given f, g V note that integration by parts gives Hence T = d dt. (f dg dt ) = f (t) dg(t) dt dt = [f (t)g(t)] = = ( df dt g) df (t) g(t)dt dt df (t) g(t)dt dt Daniel Chan (UNSW) Lecture 36: Adjoints Semester / 7

4 Connection with matrix adjoint Q Let A M mn (F) & T A : F n F m be the assoc lin map. What is T A : Fm F n? Answer T A = T A Proof. It suffices to show that for any v F n, w F m we have (A w v) = (w Av). Indeed Daniel Chan (UNSW) Lecture 36: Adjoints Semester / 7

5 Conjugate linearity & functoriality Prop The following formulae hold whenever they make sense. S, T are appropriate linear maps. 1 (S + T ) = S + T. 2 (βs) = βs for β F. 3 (S T ) = T S. 4 (T ) = T. 5 id = id. In particular, if V, W are fin dim, then the adjoint operator ( ) : L(V, W ) L(W, V ) : S S is conjugate linear. Proof. These all follow from defns & corresponding results for the transpose. For example, Daniel Chan (UNSW) Lecture 36: Adjoints Semester / 7

6 Orthogonal complements to kernels Prop Let T : V W be a linear map between fin dim inner product spaces. Then 1 (ker T ) = im T 2 If V, W are fin dim then, rankt = rankt. Proof. 1) We show equiv that (im T ) = ker T. Let v V v (im T ) (T w v) = 0 for all w W (w T v) = 0 for all w W 0 = (T v ) = D W (T v) T v = 0, (recall D W is injective) v ker T For 2) we use rank-nullity rankt = dim(im T ) = dim((ker T ) )) = dim V dim(ker T ) = dim(im T ) = rankt. Daniel Chan (UNSW) Lecture 36: Adjoints Semester / 7

7 Kernel of T T Prop Let T : V W be linear. 1 If S : W X is linear then ker(s T ) ker T. 2 ker T T = ker T. 3 If V, W are fin dim then rankt T = rankt. Proof. 1) is easy ex. 2) By 1), it suffices to show ker T T ker T so let v ker T T. Then so T v = 0 & v ker T. Part 2) follows. 0 = (T (T v) v) = (T v T v) 3) This follows from the rank-nullity thm since part 2) ensures the nullities are the same (whilst the domains are also the same). Daniel Chan (UNSW) Lecture 36: Adjoints Semester / 7

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Math 115A: Homework 5

Math 115A: Homework 5 Math 115A: Homework 5 1 Suppose U, V, and W are finite-dimensional vector spaces over a field F, and that are linear a) Prove ker ST ) ker T ) b) Prove nullst ) nullt ) c) Prove imst ) im S T : U V, S

More information

Old & new co-ordinates

Old & new co-ordinates 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

More information

Econ Lecture 8. Outline. 1. Bases 2. Linear Transformations 3. Isomorphisms

Econ Lecture 8. Outline. 1. Bases 2. Linear Transformations 3. Isomorphisms Econ 204 2011 Lecture 8 Outline 1. Bases 2. Linear Transformations 3. Isomorphisms 1 Linear Combinations and Spans Definition 1. Let X be a vector space over a field F. A linear combination of x 1,...,

More information

Definition 3 A Hamel basis (often just called a basis) of a vector space X is a linearly independent set of vectors in X that spans X.

Definition 3 A Hamel basis (often just called a basis) of a vector space X is a linearly independent set of vectors in X that spans X. Economics 04 Summer/Fall 011 Lecture 8 Wednesday August 3, 011 Chapter 3. Linear Algebra Section 3.1. Bases Definition 1 Let X be a vector space over a field F. A linear combination of x 1,..., x n X is

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

Singular Value Decomposition (SVD) and Polar Form

Singular Value Decomposition (SVD) and Polar Form Chapter 2 Singular Value Decomposition (SVD) and Polar Form 2.1 Polar Form In this chapter, we assume that we are dealing with a real Euclidean space E. Let f: E E be any linear map. In general, it may

More information

Chapter 2 Linear Transformations

Chapter 2 Linear Transformations Chapter 2 Linear Transformations Linear Transformations Loosely speaking, a linear transformation is a function from one vector space to another that preserves the vector space operations. Let us be more

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

A = 1 6 (y 1 8y 2 5y 3 ) Therefore, a general solution to this system is given by

A = 1 6 (y 1 8y 2 5y 3 ) Therefore, a general solution to this system is given by Mid-Term Solutions 1. Let A = 3 1 2 2 1 1 1 3 0. For which triples (y 1, y 2, y 3 ) does AX = Y have a solution? Solution. The following sequence of elementary row operations: R 1 R 1 /3, R 1 2R 1 + R

More information

ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA

ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA Kent State University Department of Mathematical Sciences Compiled and Maintained by Donald L. White Version: August 29, 2017 CONTENTS LINEAR ALGEBRA AND

More information

Math 113 Midterm Exam Solutions

Math 113 Midterm Exam Solutions Math 113 Midterm Exam Solutions Held Thursday, May 7, 2013, 7-9 pm. 1. (10 points) Let V be a vector space over F and T : V V be a linear operator. Suppose that there is a non-zero vector v V such that

More information

8 General Linear Transformations

8 General Linear Transformations 8 General Linear Transformations 8.1 Basic Properties Definition 8.1 If T : V W is a function from a vector space V into a vector space W, then T is called a linear transformation from V to W if, for all

More information

Math 115A: Homework 4

Math 115A: Homework 4 Math A: Homework page question but replace subset by tuple where appropriate and generates with spans page question but replace sets by tuple This won t be graded so do as much as you need Find bases for

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

Lecture 9. Econ August 20

Lecture 9. Econ August 20 Lecture 9 Econ 2001 2015 August 20 Lecture 9 Outline 1 Linear Functions 2 Linear Representation of Matrices 3 Analytic Geometry in R n : Lines and Hyperplanes 4 Separating Hyperplane Theorems Back to vector

More information

(VI.D) Generalized Eigenspaces

(VI.D) Generalized Eigenspaces (VI.D) Generalized Eigenspaces Let T : C n C n be a f ixed linear transformation. For this section and the next, all vector spaces are assumed to be over C ; in particular, we will often write V for C

More information

MATH 235. Final ANSWERS May 5, 2015

MATH 235. Final ANSWERS May 5, 2015 MATH 235 Final ANSWERS May 5, 25. ( points) Fix positive integers m, n and consider the vector space V of all m n matrices with entries in the real numbers R. (a) Find the dimension of V and prove your

More information

x 3y 2z = 6 1.2) 2x 4y 3z = 8 3x + 6y + 8z = 5 x + 3y 2z + 5t = 4 1.5) 2x + 8y z + 9t = 9 3x + 5y 12z + 17t = 7

x 3y 2z = 6 1.2) 2x 4y 3z = 8 3x + 6y + 8z = 5 x + 3y 2z + 5t = 4 1.5) 2x + 8y z + 9t = 9 3x + 5y 12z + 17t = 7 Linear Algebra and its Applications-Lab 1 1) Use Gaussian elimination to solve the following systems x 1 + x 2 2x 3 + 4x 4 = 5 1.1) 2x 1 + 2x 2 3x 3 + x 4 = 3 3x 1 + 3x 2 4x 3 2x 4 = 1 x + y + 2z = 4 1.4)

More information

Linear Algebra II Lecture 8

Linear Algebra II Lecture 8 Linear Algebra II Lecture 8 Xi Chen 1 1 University of Alberta October 10, 2014 Outline 1 2 Definition Let T 1 : V W and T 2 : V W be linear transformations between two vector spaces V and W over R. Then

More information

The Fundamental Theorem of Linear Algebra

The Fundamental Theorem of Linear Algebra The Fundamental Theorem of Linear Algebra Nicholas Hoell Contents 1 Prelude: Orthogonal Complements 1 2 The Fundamental Theorem of Linear Algebra 2 2.1 The Diagram........................................

More information

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

Throughout these notes we assume V, W are finite dimensional inner product spaces over C. Math 342 - Linear Algebra II Notes Throughout these notes we assume V, W are finite dimensional inner product spaces over C 1 Upper Triangular Representation Proposition: Let T L(V ) There exists an orthonormal

More information

The Adjoint of a Linear Operator

The Adjoint of a Linear Operator The Adjoint of a Linear Operator Michael Freeze MAT 531: Linear Algebra UNC Wilmington Spring 2015 1 / 18 Adjoint Operator Let L : V V be a linear operator on an inner product space V. Definition The adjoint

More information

Summary of Week 9 B = then A A =

Summary of Week 9 B = then A A = Summary of Week 9 Finding the square root of a positive operator Last time we saw that positive operators have a unique positive square root We now briefly look at how one would go about calculating the

More information

Elementary linear algebra

Elementary linear algebra Chapter 1 Elementary linear algebra 1.1 Vector spaces Vector spaces owe their importance to the fact that so many models arising in the solutions of specific problems turn out to be vector spaces. The

More information

Linear Algebra Notes. Lecture Notes, University of Toronto, Fall 2016

Linear Algebra Notes. Lecture Notes, University of Toronto, Fall 2016 Linear Algebra Notes Lecture Notes, University of Toronto, Fall 2016 (Ctd ) 11 Isomorphisms 1 Linear maps Definition 11 An invertible linear map T : V W is called a linear isomorphism from V to W Etymology:

More information

Test 1 Review Problems Spring 2015

Test 1 Review Problems Spring 2015 Test Review Problems Spring 25 Let T HomV and let S be a subspace of V Define a map τ : V /S V /S by τv + S T v + S Is τ well-defined? If so when is it well-defined? If τ is well-defined is it a homomorphism?

More information

Linear Vector Spaces

Linear Vector Spaces CHAPTER 1 Linear Vector Spaces Definition 1.0.1. A linear vector space over a field F is a triple (V, +, ), where V is a set, + : V V V and : F V V are maps with the properties : (i) ( x, y V ), x + y

More information

A PRIMER ON SESQUILINEAR FORMS

A PRIMER ON SESQUILINEAR FORMS A PRIMER ON SESQUILINEAR FORMS BRIAN OSSERMAN This is an alternative presentation of most of the material from 8., 8.2, 8.3, 8.4, 8.5 and 8.8 of Artin s book. Any terminology (such as sesquilinear form

More information

Math 113 Final Exam: Solutions

Math 113 Final Exam: Solutions Math 113 Final Exam: Solutions Thursday, June 11, 2013, 3.30-6.30pm. 1. (25 points total) Let P 2 (R) denote the real vector space of polynomials of degree 2. Consider the following inner product on P

More information

Linear Transformations

Linear Transformations DM554 Linear and Integer Programming Lecture 8 Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. 2 Resume Linear dependence and independence Determine

More information

Ir O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v )

Ir O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v ) Section 3.2 Theorem 3.6. Let A be an m n matrix of rank r. Then r m, r n, and, by means of a finite number of elementary row and column operations, A can be transformed into the matrix ( ) Ir O D = 1 O

More information

MA20216: Algebra 2A. Notes by Fran Burstall

MA20216: Algebra 2A. Notes by Fran Burstall MA20216: Algebra 2A Notes by Fran Burstall Corrections by: Callum Kemp Carlos Galeano Rios Kate Powell Tobias Beith Krunoslav Lehman Pavasovic Dan Corbie Phaidra Anastasiadou Louise Hannon Vlad Brebeanu

More information

Math 113 Winter 2013 Prof. Church Midterm Solutions

Math 113 Winter 2013 Prof. Church Midterm Solutions Math 113 Winter 2013 Prof. Church Midterm Solutions Name: Student ID: Signature: Question 1 (20 points). Let V be a finite-dimensional vector space, and let T L(V, W ). Assume that v 1,..., v n is a basis

More information

Further Mathematical Methods (Linear Algebra) 2002

Further Mathematical Methods (Linear Algebra) 2002 Further Mathematical Methods (Linear Algebra) 00 Solutions For Problem Sheet 0 In this Problem Sheet we calculated some left and right inverses and verified the theorems about them given in the lectures.

More information

Definition Suppose S R n, V R m are subspaces. A map U : S V is linear if

Definition Suppose S R n, V R m are subspaces. A map U : S V is linear if .6. Restriction of Linear Maps In this section, we restrict linear maps to subspaces. We observe that the notion of linearity still makes sense for maps whose domain and codomain are subspaces of R n,

More information

2.2. Show that U 0 is a vector space. For each α 0 in F, show by example that U α does not satisfy closure.

2.2. Show that U 0 is a vector space. For each α 0 in F, show by example that U α does not satisfy closure. Hints for Exercises 1.3. This diagram says that f α = β g. I will prove f injective g injective. You should show g injective f injective. Assume f is injective. Now suppose g(x) = g(y) for some x, y A.

More information

Travis Schedler. Thurs, Oct 27, 2011 (version: Thurs, Oct 27, 1:00 PM)

Travis Schedler. Thurs, Oct 27, 2011 (version: Thurs, Oct 27, 1:00 PM) Lecture 13: Proof of existence of upper-triangular matrices for complex linear transformations; invariant subspaces and block upper-triangular matrices for real linear transformations (1) Travis Schedler

More information

Then x 1,..., x n is a basis as desired. Indeed, it suffices to verify that it spans V, since n = dim(v ). We may write any v V as r

Then x 1,..., x n is a basis as desired. Indeed, it suffices to verify that it spans V, since n = dim(v ). We may write any v V as r Practice final solutions. I did not include definitions which you can find in Axler or in the course notes. These solutions are on the terse side, but would be acceptable in the final. However, if you

More information

Scientific Computing: Dense Linear Systems

Scientific Computing: Dense Linear Systems Scientific Computing: Dense Linear Systems Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 Course MATH-GA.2043 or CSCI-GA.2112, Spring 2012 February 9th, 2012 A. Donev (Courant Institute)

More information

MATH 33A LECTURE 3 PRACTICE MIDTERM I

MATH 33A LECTURE 3 PRACTICE MIDTERM I MATH A LECTURE PRACTICE MIDTERM I Please note: Show your work Correct answers not accompanied by sufficent explanations will receive little or no credit (except on multiple-choice problems) Please call

More information

Elliptic Regularity. Throughout we assume all vector bundles are smooth bundles with metrics over a Riemannian manifold X n.

Elliptic Regularity. Throughout we assume all vector bundles are smooth bundles with metrics over a Riemannian manifold X n. Elliptic Regularity Throughout we assume all vector bundles are smooth bundles with metrics over a Riemannian manifold X n. 1 Review of Hodge Theory In this note I outline the proof of the following Fundamental

More information

(VII.E) The Singular Value Decomposition (SVD)

(VII.E) The Singular Value Decomposition (SVD) (VII.E) The Singular Value Decomposition (SVD) In this section we describe a generalization of the Spectral Theorem to non-normal operators, and even to transformations between different vector spaces.

More information

March 27 Math 3260 sec. 56 Spring 2018

March 27 Math 3260 sec. 56 Spring 2018 March 27 Math 3260 sec. 56 Spring 2018 Section 4.6: Rank Definition: The row space, denoted Row A, of an m n matrix A is the subspace of R n spanned by the rows of A. We now have three vector spaces associated

More information

NORMS ON SPACE OF MATRICES

NORMS ON SPACE OF MATRICES NORMS ON SPACE OF MATRICES. Operator Norms on Space of linear maps Let A be an n n real matrix and x 0 be a vector in R n. We would like to use the Picard iteration method to solve for the following system

More information

Solution: (a) S 1 = span. (b) S 2 = R n, x 1. x 1 + x 2 + x 3 + x 4 = 0. x 4 Solution: S 5 = x 2. x 3. (b) The standard basis vectors

Solution: (a) S 1 = span. (b) S 2 = R n, x 1. x 1 + x 2 + x 3 + x 4 = 0. x 4 Solution: S 5 = x 2. x 3. (b) The standard basis vectors .. Dimension In this section, we introduce the notion of dimension for a subspace. For a finite set, we can measure its size by counting its elements. We are interested in a measure of size on subspaces

More information

Linear and Bilinear Algebra (2WF04) Jan Draisma

Linear and Bilinear Algebra (2WF04) Jan Draisma Linear and Bilinear Algebra (2WF04) Jan Draisma CHAPTER 1 Basics We will assume familiarity with the terms field, vector space, subspace, basis, dimension, and direct sums. If you are not sure what these

More information

Linear Maps and Matrices

Linear Maps and Matrices Linear Maps and Matrices Maps Suppose that V and W are sets A map F : V W is a function; that is, to every v V there is assigned a unique element w F v in W Two maps F : V W and G : V W are equal if F

More information

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

MATH 20F: LINEAR ALGEBRA LECTURE B00 (T. KEMP) MATH 20F: LINEAR ALGEBRA LECTURE B00 (T KEMP) Definition 01 If T (x) = Ax is a linear transformation from R n to R m then Nul (T ) = {x R n : T (x) = 0} = Nul (A) Ran (T ) = {Ax R m : x R n } = {b R m

More information

Consider a subspace V = im(a) of R n, where m. Then,

Consider a subspace V = im(a) of R n, where m. Then, 5.4 LEAST SQUARES AND DATA FIT- TING ANOTHER CHARACTERIZATION OF ORTHOG- ONAL COMPLEMENTS Consider a subspace V = im(a) of R n, where A = [ ] v 1 v 2... v m. Then, V = { x in R n : v x = 0, for all v in

More information

Kernel and range. Definition: A homogeneous linear equation is an equation of the form A v = 0

Kernel and range. Definition: A homogeneous linear equation is an equation of the form A v = 0 Kernel and range Definition: The kernel (or null-space) of A is ker A { v V : A v = 0 ( U)}. Theorem 5.3. ker A is a subspace of V. (In particular, it always contains 0 V.) Definition: A is one-to-one

More information

Linear System Theory

Linear System Theory Linear System Theory Wonhee Kim Lecture 4 Apr. 4, 2018 1 / 40 Recap Vector space, linear space, linear vector space Subspace Linearly independence and dependence Dimension, Basis, Change of Basis 2 / 40

More information

Mathematics Department Stanford University Math 61CM/DM Inner products

Mathematics Department Stanford University Math 61CM/DM Inner products Mathematics Department Stanford University Math 61CM/DM Inner products Recall the definition of an inner product space; see Appendix A.8 of the textbook. Definition 1 An inner product space V is a vector

More information

Selected exercises from Abstract Algebra by Dummit and Foote (3rd edition).

Selected exercises from Abstract Algebra by Dummit and Foote (3rd edition). Selected exercises from Abstract Algebra by Dummit and Foote (3rd edition). Bryan Félix Abril 12, 217 Section 11.1 Exercise 6. Let V be a vector space of finite dimension. If ϕ is any linear transformation

More information

Linear Algebra Lecture Notes-II

Linear Algebra Lecture Notes-II Linear Algebra Lecture Notes-II Vikas Bist Department of Mathematics Panjab University, Chandigarh-64 email: bistvikas@gmail.com Last revised on March 5, 8 This text is based on the lectures delivered

More information

Linear Algebra I MAT Fall Alistair Savage. Department of Mathematics and Statistics. University of Ottawa

Linear Algebra I MAT Fall Alistair Savage. Department of Mathematics and Statistics. University of Ottawa Linear Algebra I MAT 2141 Fall 2018 Alistair Savage Department of Mathematics and Statistics University of Ottawa This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International

More information

Algebra II. Paulius Drungilas and Jonas Jankauskas

Algebra II. Paulius Drungilas and Jonas Jankauskas Algebra II Paulius Drungilas and Jonas Jankauskas Contents 1. Quadratic forms 3 What is quadratic form? 3 Change of variables. 3 Equivalence of quadratic forms. 4 Canonical form. 4 Normal form. 7 Positive

More information

MAT 445/ INTRODUCTION TO REPRESENTATION THEORY

MAT 445/ INTRODUCTION TO REPRESENTATION THEORY MAT 445/1196 - INTRODUCTION TO REPRESENTATION THEORY CHAPTER 1 Representation Theory of Groups - Algebraic Foundations 1.1 Basic definitions, Schur s Lemma 1.2 Tensor products 1.3 Unitary representations

More information

Lecture 21: The decomposition theorem into generalized eigenspaces; multiplicity of eigenvalues and upper-triangular matrices (1)

Lecture 21: The decomposition theorem into generalized eigenspaces; multiplicity of eigenvalues and upper-triangular matrices (1) Lecture 21: The decomposition theorem into generalized eigenspaces; multiplicity of eigenvalues and upper-triangular matrices (1) Travis Schedler Tue, Nov 29, 2011 (version: Tue, Nov 29, 1:00 PM) Goals

More information

Mathematics Department Stanford University Math 61CM/DM Vector spaces and linear maps

Mathematics Department Stanford University Math 61CM/DM Vector spaces and linear maps Mathematics Department Stanford University Math 61CM/DM Vector spaces and linear maps We start with the definition of a vector space; you can find this in Section A.8 of the text (over R, but it works

More information

Contents. Preface for the Instructor. Preface for the Student. xvii. Acknowledgments. 1 Vector Spaces 1 1.A R n and C n 2

Contents. Preface for the Instructor. Preface for the Student. xvii. Acknowledgments. 1 Vector Spaces 1 1.A R n and C n 2 Contents Preface for the Instructor xi Preface for the Student xv Acknowledgments xvii 1 Vector Spaces 1 1.A R n and C n 2 Complex Numbers 2 Lists 5 F n 6 Digression on Fields 10 Exercises 1.A 11 1.B Definition

More information

MATH PRACTICE EXAM 1 SOLUTIONS

MATH PRACTICE EXAM 1 SOLUTIONS MATH 2359 PRACTICE EXAM SOLUTIONS SPRING 205 Throughout this exam, V and W will denote vector spaces over R Part I: True/False () For each of the following statements, determine whether the statement is

More information

Math 4A Notes. Written by Victoria Kala Last updated June 11, 2017

Math 4A Notes. Written by Victoria Kala Last updated June 11, 2017 Math 4A Notes Written by Victoria Kala vtkala@math.ucsb.edu Last updated June 11, 2017 Systems of Linear Equations A linear equation is an equation that can be written in the form a 1 x 1 + a 2 x 2 +...

More information

Dot Products, Transposes, and Orthogonal Projections

Dot Products, Transposes, and Orthogonal Projections Dot Products, Transposes, and Orthogonal Projections David Jekel November 13, 2015 Properties of Dot Products Recall that the dot product or standard inner product on R n is given by x y = x 1 y 1 + +

More information

RIEMANN S INEQUALITY AND RIEMANN-ROCH

RIEMANN S INEQUALITY AND RIEMANN-ROCH RIEMANN S INEQUALITY AND RIEMANN-ROCH DONU ARAPURA Fix a compact connected Riemann surface X of genus g. Riemann s inequality gives a sufficient condition to construct meromorphic functions with prescribed

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

Fall TMA4145 Linear Methods. Exercise set Given the matrix 1 2

Fall TMA4145 Linear Methods. Exercise set Given the matrix 1 2 Norwegian University of Science and Technology Department of Mathematical Sciences TMA445 Linear Methods Fall 07 Exercise set Please justify your answers! The most important part is how you arrive at an

More information

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

MATH 304 Linear Algebra Lecture 15: Linear transformations (continued). Range and kernel. Matrix transformations. MATH 304 Linear Algebra Lecture 15: Linear transformations (continued). Range and kernel. Matrix transformations. Linear mapping = linear transformation = linear function Definition. Given vector spaces

More information

6 Inner Product Spaces

6 Inner Product Spaces Lectures 16,17,18 6 Inner Product Spaces 6.1 Basic Definition Parallelogram law, the ability to measure angle between two vectors and in particular, the concept of perpendicularity make the euclidean space

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

homogeneous 71 hyperplane 10 hyperplane 34 hyperplane 69 identity map 171 identity map 186 identity map 206 identity matrix 110 identity matrix 45

homogeneous 71 hyperplane 10 hyperplane 34 hyperplane 69 identity map 171 identity map 186 identity map 206 identity matrix 110 identity matrix 45 address 12 adjoint matrix 118 alternating 112 alternating 203 angle 159 angle 33 angle 60 area 120 associative 180 augmented matrix 11 axes 5 Axiom of Choice 153 basis 178 basis 210 basis 74 basis test

More information

Vector Spaces. Commutativity of +: u + v = v + u, u, v, V ; Associativity of +: u + (v + w) = (u + v) + w, u, v, w V ;

Vector Spaces. Commutativity of +: u + v = v + u, u, v, V ; Associativity of +: u + (v + w) = (u + v) + w, u, v, w V ; Vector Spaces A vector space is defined as a set V over a (scalar) field F, together with two binary operations, i.e., vector addition (+) and scalar multiplication ( ), satisfying the following axioms:

More information

Math Topology II: Smooth Manifolds. Spring Homework 2 Solution Submit solutions to the following problems:

Math Topology II: Smooth Manifolds. Spring Homework 2 Solution Submit solutions to the following problems: Math 132 - Topology II: Smooth Manifolds. Spring 2017. Homework 2 Solution Submit solutions to the following problems: 1. Let H = {a + bi + cj + dk (a, b, c, d) R 4 }, where i 2 = j 2 = k 2 = 1, ij = k,

More information

Math Linear Algebra II. 1. Inner Products and Norms

Math Linear Algebra II. 1. Inner Products and Norms Math 342 - Linear Algebra II Notes 1. Inner Products and Norms One knows from a basic introduction to vectors in R n Math 254 at OSU) that the length of a vector x = x 1 x 2... x n ) T R n, denoted x,

More information

33 Idempotents and Characters

33 Idempotents and Characters 33 Idempotents and Characters On this day I was supposed to talk about characters but I spent most of the hour talking about idempotents so I changed the title. An idempotent is defined to be an element

More information

YORK UNIVERSITY. Faculty of Science Department of Mathematics and Statistics MATH M Test #2 Solutions

YORK UNIVERSITY. Faculty of Science Department of Mathematics and Statistics MATH M Test #2 Solutions YORK UNIVERSITY Faculty of Science Department of Mathematics and Statistics MATH 3. M Test # Solutions. (8 pts) For each statement indicate whether it is always TRUE or sometimes FALSE. Note: For this

More information

5 Linear Transformations

5 Linear Transformations Lecture 13 5 Linear Transformations 5.1 Basic Definitions and Examples We have already come across with the notion of linear transformations on euclidean spaces. We shall now see that this notion readily

More information

Numerical Linear Algebra

Numerical Linear Algebra University of Alabama at Birmingham Department of Mathematics Numerical Linear Algebra Lecture Notes for MA 660 (1997 2014) Dr Nikolai Chernov April 2014 Chapter 0 Review of Linear Algebra 0.1 Matrices

More information

Topological K-theory, Lecture 3

Topological K-theory, Lecture 3 Topological K-theory, Lecture 3 Matan Prasma March 2, 2015 1 Applications of the classification theorem continued Let us see how the classification theorem can further be used. Example 1. The bundle γ

More information

Equality: Two matrices A and B are equal, i.e., A = B if A and B have the same order and the entries of A and B are the same.

Equality: Two matrices A and B are equal, i.e., A = B if A and B have the same order and the entries of A and B are the same. Introduction Matrix Operations Matrix: An m n matrix A is an m-by-n array of scalars from a field (for example real numbers) of the form a a a n a a a n A a m a m a mn The order (or size) of A is m n (read

More information

Solution for Homework 5

Solution for Homework 5 Solution for Homework 5 ME243A/ECE23A Fall 27 Exercise 1 The computation of the reachable subspace in continuous time can be handled easily introducing the concepts of inner product, orthogonal complement

More information

Lecture 5: Hodge theorem

Lecture 5: Hodge theorem Lecture 5: Hodge theorem Jonathan Evans 4th October 2010 Jonathan Evans () Lecture 5: Hodge theorem 4th October 2010 1 / 15 Jonathan Evans () Lecture 5: Hodge theorem 4th October 2010 2 / 15 The aim of

More information

About Grupo the Mathematical de Investigación Foundation of Quantum Mechanics

About Grupo the Mathematical de Investigación Foundation of Quantum Mechanics About Grupo the Mathematical de Investigación Foundation of Quantum Mechanics M. Victoria Velasco Collado Departamento de Análisis Matemático Universidad de Granada (Spain) Operator Theory and The Principles

More information

Linear Algebra Lecture Notes-I

Linear Algebra Lecture Notes-I Linear Algebra Lecture Notes-I Vikas Bist Department of Mathematics Panjab University, Chandigarh-6004 email: bistvikas@gmail.com Last revised on February 9, 208 This text is based on the lectures delivered

More information

MATH 240 Spring, Chapter 1: Linear Equations and Matrices

MATH 240 Spring, Chapter 1: Linear Equations and Matrices MATH 240 Spring, 2006 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 8th Ed. Sections 1.1 1.6, 2.1 2.2, 3.2 3.8, 4.3 4.5, 5.1 5.3, 5.5, 6.1 6.5, 7.1 7.2, 7.4 DEFINITIONS Chapter 1: Linear

More information

T ((x 1, x 2,..., x n )) = + x x 3. , x 1. x 3. Each of the four coordinates in the range is a linear combination of the three variables x 1

T ((x 1, x 2,..., x n )) = + x x 3. , x 1. x 3. Each of the four coordinates in the range is a linear combination of the three variables x 1 MATH 37 Linear Transformations from Rn to Rm Dr. Neal, WKU Let T : R n R m be a function which maps vectors from R n to R m. Then T is called a linear transformation if the following two properties are

More information