Chapter 3. Vector Spaces

Similar documents
Chapter 14. Matrix Representations of Linear Transformations

Math 520 Final Exam Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008

Elementary Linear Algebra

MTH 5102 Linear Algebra Practice Exam 1 - Solutions Feb. 9, 2016

MATRICES AND VECTORS SPACE

Problem Set 4: Solutions Math 201A: Fall 2016

MATH34032: Green s Functions, Integral Equations and the Calculus of Variations 1

The Regulated and Riemann Integrals

Theoretical foundations of Gaussian quadrature

Chapter 3 MATRIX. In this chapter: 3.1 MATRIX NOTATION AND TERMINOLOGY

Quadratic Forms. Quadratic Forms

Bases for Vector Spaces

Inner-product spaces

63. Representation of functions as power series Consider a power series. ( 1) n x 2n for all 1 < x < 1

x = b a n x 2 e x dx. cdx = c(b a), where c is any constant. a b

ODE: Existence and Uniqueness of a Solution

The final exam will take place on Friday May 11th from 8am 11am in Evans room 60.

Abstract inner product spaces

PHYS 4390: GENERAL RELATIVITY LECTURE 6: TENSOR CALCULUS

g i fφdx dx = x i i=1 is a Hilbert space. We shall, henceforth, abuse notation and write g i f(x) = f

Handout 4. Inverse and Implicit Function Theorems.

Advanced Calculus: MATH 410 Uniform Convergence of Functions Professor David Levermore 11 December 2015

Chapter 4 Contravariance, Covariance, and Spacetime Diagrams

(4.1) D r v(t) ω(t, v(t))

1 The fundamental theorems of calculus.

Math Advanced Calculus II

Lecture 3: Curves in Calculus. Table of contents

STUDY GUIDE FOR BASIC EXAM

Notes on length and conformal metrics

Review on Integration (Secs ) Review: Sec Origins of Calculus. Riemann Sums. New functions from old ones.

DEFINITION The inner product of two functions f 1 and f 2 on an interval [a, b] is the number. ( f 1, f 2 ) b DEFINITION 11.1.

a n = 1 58 a n+1 1 = 57a n + 1 a n = 56(a n 1) 57 so 0 a n+1 1, and the required result is true, by induction.

2. VECTORS AND MATRICES IN 3 DIMENSIONS

Unit #9 : Definite Integral Properties; Fundamental Theorem of Calculus

1.1. Linear Constant Coefficient Equations. Remark: A differential equation is an equation

MATH , Calculus 2, Fall 2018

REPRESENTATION THEORY OF PSL 2 (q)

Anonymous Math 361: Homework 5. x i = 1 (1 u i )

Chapter 4. Lebesgue Integration

Chapter 3 Polynomials

1 The Lagrange interpolation formula

Higher Checklist (Unit 3) Higher Checklist (Unit 3) Vectors

dx dt dy = G(t, x, y), dt where the functions are defined on I Ω, and are locally Lipschitz w.r.t. variable (x, y) Ω.

(e) if x = y + z and a divides any two of the integers x, y, or z, then a divides the remaining integer

Here we study square linear systems and properties of their coefficient matrices as they relate to the solution set of the linear system.

STURM-LIOUVILLE BOUNDARY VALUE PROBLEMS

1.2. Linear Variable Coefficient Equations. y + b "! = a y + b " Remark: The case b = 0 and a non-constant can be solved with the same idea as above.

Section 6.1 INTRO to LAPLACE TRANSFORMS

1 The fundamental theorems of calculus.

Review of Gaussian Quadrature method

Convex Sets and Functions

Math 61CM - Solutions to homework 9

Regulated functions and the regulated integral

MORE FUNCTION GRAPHING; OPTIMIZATION. (Last edited October 28, 2013 at 11:09pm.)

Math 554 Integration

AMATH 731: Applied Functional Analysis Fall Additional notes on Fréchet derivatives

Section 6.1 INTRO to LAPLACE TRANSFORMS

Fourier series. Preliminary material on inner products. Suppose V is vector space over C and (, )

NOTES ON HILBERT SPACE

Module 6: LINEAR TRANSFORMATIONS

20 MATHEMATICS POLYNOMIALS

Lecture 3. Limits of Functions and Continuity

df dt f () b f () a dt

Best Approximation in the 2-norm

10 Vector Integral Calculus

Recitation 3: More Applications of the Derivative

Linearity, linear operators, and self adjoint eigenvalue problems

Lesson Notes: Week 40-Vectors

Advanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004

Things to Memorize: A Partial List. January 27, 2017

MATH 423 Linear Algebra II Lecture 28: Inner product spaces.

IMPORTANT THEOREMS CHEAT SHEET

Czechoslovak Mathematical Journal, 55 (130) (2005), , Abbotsford. 1. Introduction

7.2 The Definite Integral

II. Integration and Cauchy s Theorem

Coalgebra, Lecture 15: Equations for Deterministic Automata

UNIFORM CONVERGENCE MA 403: REAL ANALYSIS, INSTRUCTOR: B. V. LIMAYE

AQA Further Pure 1. Complex Numbers. Section 1: Introduction to Complex Numbers. The number system

n f(x i ) x. i=1 In section 4.2, we defined the definite integral of f from x = a to x = b as n f(x i ) x; f(x) dx = lim i=1

Taylor Polynomial Inequalities

Chapter 1. Basic Concepts

a a a a a a a a a a a a a a a a a a a a a a a a In this section, we introduce a general formula for computing determinants.

Best Approximation. Chapter The General Case

Jim Lambers MAT 169 Fall Semester Lecture 4 Notes

Continuous Random Variables

CAAM 453 NUMERICAL ANALYSIS I Examination There are four questions, plus a bonus. Do not look at them until you begin the exam.

THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS.

Math 270A: Numerical Linear Algebra

I. INTEGRAL THEOREMS. A. Introduction

P 3 (x) = f(0) + f (0)x + f (0) 2. x 2 + f (0) . In the problem set, you are asked to show, in general, the n th order term is a n = f (n) (0)

Orthogonal Polynomials

MA123, Chapter 10: Formulas for integrals: integrals, antiderivatives, and the Fundamental Theorem of Calculus (pp.

Review of Riemann Integral

A HELLY THEOREM FOR FUNCTIONS WITH VALUES IN METRIC SPACES. 1. Introduction

AMATH 731: Applied Functional Analysis Fall Some basics of integral equations

Space Curves. Recall the parametric equations of a curve in xy-plane and compare them with parametric equations of a curve in space.

arxiv: v1 [math.ra] 1 Nov 2014

Summary: Method of Separation of Variables

SOLUTIONS FOR ANALYSIS QUALIFYING EXAM, FALL (1 + µ(f n )) f(x) =. But we don t need the exact bound.) Set

Practice final exam solutions

Transcription:

3.4 Liner Trnsformtions 1 Chpter 3. Vector Spces 3.4 Liner Trnsformtions Note. We hve lredy studied liner trnsformtions from R n into R m. Now we look t liner trnsformtions from one generl vector spce to nother. We ll see prllel behvior between these liner trnsformtions nd the mtrix trnsformtions of Section 2.3. In fct, we use ordered bses to ssocite mtrices with liner trnsformtions between generl finite dimensionl vector spces. Definition 3.9. A function T tht mps vector spce V into vector spce V is liner trnsformtion if it stisfies: (1) ( u + v) = T( u) + T( v), nd (2) T(r u) = rt( u), for ll vectors u, v V nd for ll sclrs r R. Note 3.4.A. Exercise 3.4.35 clims tht the condition of T : V V being liner is equivlent to the condition T(r u + s v) = rt( u) + st( v) for ll u, v V nd for ll r,s R. Notice tht the sme clim ws estblished for V nd V Eucliden spces in Exercises 2.3.32. We cn conclude (from Mthemticl Induction, see Appendix A) tht for v 1, v 2,..., v n V nd r 1,r 2,...,r n R, we hve T(r 1 v 1 + r 2 v 2 + + r n v n ) = r 1 T( v 1 ) + r 2 T( v 2 ) + + r n T( v n ). Exmple 3.4.A. Let F be the vector spce of ll functions mpping R into R (see Exmple 3.1.3). Let be nonzero sclr nd define T : F F s T(f) = f. Is T liner trnsformtion?

3.4 Liner Trnsformtions 2 Definition. For liner trnsformtion T : V V, the set V is the domin of T nd the set V is the codomin of T. If W is subset of V, then T[W] = {T( w) w W } is the imge of W under T. T[V ] is the rnge of T. For W V, T 1 [W ] = { v V T( v) W } is the inverse imge of W under T. T 1 [{ 0 }] if the kernel of T, denoted ker(t). Notice tht ker(t) = { v V T( v) = 0 }. Exmple 3.4.B. Let F be the vector spce of ll functions mpping R into R (see Exmple 3.1.3). Let be nonzero sclr nd define T : F F s T(f) = f, s in Exmple 3.4.A. Describe the kernel of T. Definition. Let V,V nd V be vector spces nd let T : V V nd T : V V be liner trnsformtions. The composition trnsformtion T T : V V is defined by (T T)( v) = T (T( v)) for v V. Exmple. Pge 214 Exmple 1. Let F be the vector spce of ll functions f : R R (see Exmple 3.1.3), nd let D be its subspce of ll differentible functions. Show tht differentition is liner trnsformtion of D into F. Exmple. Pge 215 Exmple 3. Let C,b be the set of ll continuous functions mpping [,b] R. Then C,b is vector spce (bsed on n rgument similr to tht which justifies tht C = {f F f is continuous} is subspce of F, s mentioned in Note 3.2.A). Prove tht T : C,b R defined by T(f) = b f(x) dx is liner trnsformtion. Such trnsformtion which mps functions to rel numbers is clled liner functionl.

3.4 Liner Trnsformtions 3 Exmple. Pge 215 Exmple 4. Let C be the vector spce of ll continuous functions mpping R into R (see Note 3.2.A). Let R nd let T : C C be defined by T (f) = x f(t) dt. Prove tht T is liner trnsformtion. Note. One might think tht the differentition opertor D : D F nd the opertor T : C C in the previous exmple re inverses of ech other (we hve not yet defined the inverse of liner trnsformtion from one generl vector spce to nother). This is not the cse, though, since T (f) = x f(t) dt implies tht ( x T (f)() = f(t) dt) = f(t) dt = 0, so T mps continuous functions to continuous functions which re 0 t x =. Now ech T (f) is differentible since d dx [T [ (f)] = d x dx f(t) dt] = f(x) by the Fundmentl Theorem of Clculus. If we define D = {f D d() = 0} (D is subspce of D bsed on n rgument similr to tht given in Exercise 3.2.4) then x= we hve T : C D, D : D C, nd for f C, ( x ) (D T )(f) = D(T (f)) = D f(t) dt = d [ x dx ] f(t) dt = f(x) = f. If f D (so f() = 0) AND f is continuously differentible (tht is, f is continuous) then (T D)(f) = T (D(f)) = T (f ) = x f (t) dt = f(x) f() = f(x) = f. So if we define D 1, = {f D f is continuous} ( subspce of D ), then we do hve tht the differentition D : D 1, C nd T : C D 1, re inverses of ech other.

3.4 Liner Trnsformtions 4 Note. Frleigh nd Beuregrd lso give n exmple of liner functionl T : F R defined for given c R s T(f) = f(c). This is n exmple of n evlution functionl (see Exmple 3.4.2). In Exmple 3.4.5, the uthors show tht T : D D defined, for 0, 1,..., n R, s T(f) = n f (n) (x) + n 1 f (n 1) (x) + + 1 f (x) + 0 f(x) is liner trnsformtion. This exmple plys fundmentl role in the study of nth-order liner differentil equtions with constnt coefficients (where the tools developed for mtrices re useful). Theorem 3.5. Preservtion of Zero nd Subtrction Let V nd V be vectors spces, nd let T : V V be liner trnsformtion. Then (1) T( 0) = 0, nd (2) T( v 1 v 2 ) = T( v 1 ) T( v 2 ), for ny vectors v 1 nd v 2 in V. Theorem 3.6. Bses nd Liner Trnsformtions. Let T : V V be liner trnsformtion, nd let B be bsis for V. For ny vector v in V, the vector T( v) is uniquely determined by the vectors T( b) for ll b B. In other words, if two liner trnsformtions hve the sme vlue t ech bsis vector b B, then the two trnsformtions hve the sme vlue t ech vector in V.

3.4 Liner Trnsformtions 5 Theorem 3.7. Preservtion of Subspces. Let V nd V be vector spces, nd let T : V V be liner trnsformtion. (1) If W is subspce of V, then T[W] is subspce of V. (2) If W is subspce of V, then T 1 [W ] is subspce of V. Theorem 3.4.A. (Pge 229 number 46) Let T : V V be liner trnsformtion nd let T( p) = b for prticulr vector p in V. The solution set of T( x) = b is the set { p + h h ker(t)}. Definition. A trnsformtion T : V V is one-to-one if T( v 1 ) = T( v 2 ) implies tht v 1 = v 2 (or by the contrpositive, v 1 v 2 implies T( v 1 ) T( v 2 )). Trnsformtion T is onto if for ll v V there is v V such tht T( v) = v. Corollry 3.4.A. One-to-One nd Kernel. A liner trnsformtion T is one-to-one if nd only if ker(t) = { 0}. Definition 3.10. Let V nd V be vector spces. A liner trnsformtion T : V V is invertible if there exists liner trnsformtion T 1 : V V such tht T 1 T is the identity trnsformtion on V nd T T 1 is the identity trnsformtion on V. Such T 1 is clled n inverse trnsformtion of T. Theorem 3.8. A liner trnsformtion T : V V is invertible if nd only if it is one-to-one nd onto V. When T 1 exists, it is liner.

3.4 Liner Trnsformtions 6 Exmple 3.4.C. Let F be the vector spce of ll functions mpping R into R (see Exmple 3.1.3). Let be nonzero sclr nd define T : F F s T(f) = f, s in Exmple 3.4.A. Determine if T is invertible. If so, find its inverse. Note. It is t this stge tht Frleigh nd Beuregrd introduce the Fundmentl Theorem of Finite Dimensionl Vector spces (see Theorem 3.3.A). They define n isomorphism s one-to-one nd onto liner trnsformtion (s we did in Section 3.3, though we didn t use the lnguge of liner trnsformtion t tht time). Their comments on isomorphisms on pge 221 re certinly worth reding. For completeness, we now stte their version of the Fundmentl Theorem of Finite Dimensionl Vector Spces long with the nme they give it. Theorem 3.9. Coordintiztion of Finite-Dimensionl Spces. Let V be finite-dimensionl vector spce with ordered bsis B = ( b 1, b 2,..., b n ). The mp T : V R n defined by T( v) = v B, the coordinte vector of v reltive to B, is n isomorphism. Tht is, ny n-dimensionl vector spce is isomorphic to R n. Note. Just s mtrices represented liner trnsformtions mpping R n R m (see Corollry 2.3.A, Stndrd Mtrix Representtion of Liner Trnsformtions ), we cn use the coordintiztion of generl finite dimensionl vector spces V nd V to represent liner trnsformtion mpping V V with mtrix.

3.4 Liner Trnsformtions 7 Theorem 3.10. Mtrix Representtions of Liner Trnsformtions. Let V nd V be finite-dimensionl vector spces nd let B = ( b 1, b 2,..., b n ) nd B = ( b 1, b 2,..., b m) be ordered bses for V nd V, respectively. Let T : V V be liner trnsformtion, nd let T : R n R m be the liner trnsformtion such tht for ech v V, we hve T( v B ) = T( v) B. Then the stndrd mtrix representtion of T is the mtrix A whose jth column vector is T( b j ) B, nd T( v) B = A v B for ll vectors v V. Definition 3.11. The mtrix A of Theorem 3.10 is the mtrix representtion of T reltive to B,B. Exmples. Pge 227 Number 18, Pge 227 Number 22, Pge 227 Number 24. Note. Let T : V V where B is bsis for V nd B is bsis for V. By Theorem 3.8, T 1 is liner when it exists. So it hs mtrix representtion reltive the B,B. The next result gives this mtrix representtion in terms of the mtrix representtion of T reltive to B,B. Theorem 3.4.B. The mtrix representtion of T 1 reltive to B,B is the inverse of the mtrix representtion of T reltive to B,B. Exmples. Pge 228 Number 28, Pge 229 Number 44, Pge 226 Number 12. Revised: 10/24/2018