Definition Suppose S R n, V R m are subspaces. A map U : S V is linear if
|
|
- Octavia Ophelia Hodges
- 5 years ago
- Views:
Transcription
1 .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, R m, not necessarily R n and R m themselves. We discuss what notions are still preserved and what notions have to be adjusted to account for this increase in generality. Definition.6.. Suppose S R n, V R m are subspaces. A map U : S V is linear if (a) U( x + y) = U( x) + T ( y) (b) U(c x) = c U( x), for all x, y S and scalars c. Why do we assume the domain and codomain are subspaces? To answer this, consider what { [ happens if the domain is a subset of R n which is not a subspace. For example, what would it mean U : 0, R 0]} to be linear? In particular, it would mean ([ U = U ]) ([ 0]), { } which makes no sense, since / 0,. In order for the notion of linearity to make sense, adding or scaling inputs must result in other valid inputs. This means if the domain is a subset of R n, it must be a subspace of R n. Assuming the codomain is a subspace then becomes a natural assumption because the range of any linear map is a subspace, Section., Problem (The same logic applies when the domain is any subspace). In fact, we can make the domain and codomain any set of objects where the operations of addition and scalar multiplication make sense, but this level of generality is a topic for a more advanced linear algebra class. One way to obtain a linear map between subspaces is simply to restrict the domain from R n to some subspace of R n. Restricting the domain is a notion that makes sense for any map, so now define for maps in general. We look at an example restricting a map between finite sets and an example restricting a linear map T : R R. We leave it to the reader to show that restricting a linear map to subspace results in a linear map, Problem. Definition.6.. Given a map f : X Y, and a subset S X, let f restricted to S, denoted f S, be the map f S : S Y given by f S ( x) = f( x) for all x S. Example.6.. Suppose f : {,,, 4, 5} {,,, 4, 5} is visualized below: 4 5 Visualize the restriction f {,,5}. In addition, determine if f, f {,,5} are injective and/or surjective. Solution: We simply remove, 4 and the arrows that go with them to get f {,,5} below: 6 8 9
2 6 8 5 Note that while f is not injective and surjective, f {,,5} is injective, but not surjective. Suppose S R n, V R m are subspaces. The notion of kernel and range still makes sense for linear maps U : S V. We have ker(u) = { x S U( x) = 0}, range(u) = {U( x) x S}. Restricting linear maps can change the kernel and range. We defined injectivity and surjectivity for maps in general, so these notions apply here as well. For linear U : S V, we have U is injective ker(u) = { 0}, U is surjective range(u) = V, by Theorem..4 and Definition..6. Although Theorem..4 was proven in the context of linear maps T : R n R m, its proof extends to linear maps U : S V as well. Example.6.4. Consider the linear map T : R R with [T ] = (a) Find ker(t ), range(t ), (b) Find ker(t S ), range(t S ), (c) Find a linear map U : R R so that U T, but U S = T S. Solution: (a) We find ker(t ) = ker () = { 0}, range(t ) = span 4 (b) Converting S to relation form gives S = x x =. Thus, we can rewrite the formula for T S : S R as x 9 ([, and let S = span. 4 ]) (, {[ x x ] x = x }. Thus, every x = ) = R. 4 x x () x x x T S ( x) = T S = =. x 4 x x x Therefore, for each x = S, x () x x T S ( x) = 0 T S = 0 = 0 x x x = 0 x = This means ker(t S ) = { 0}. For range(t S ), we have { x range(t S ) = {T S ( x) x S} = x x R} = { } x = span S is of the form [ x x ] = 0. ().
3 [ x ] (c) We have already seen that for all x = S, x x + x T ( x) = = x + 4x where U : R R has [U] = relation x = x on x = U( x), x 0. Hence, U T, but T 0 S = U S. In addition, one can use to T () x x + x = x x + 4x to get infinitely more linear maps U : R R that agree with T on S. One point to get from Example (c) is the notion of [U] for linear maps U : S V between subspaces is not defined, since U could be written as matrix multiplication for many different matrices. In Example (c), 0 T S : S R could be seen as matrix multiplication by or. 4 0 Suppose S R n is a subspace. Restricting a linear map T : R n R m to S gives us a linear map U : S R m. But are all linear maps U : S R n restrictions of linear maps T : R n R m? Yes, as explained in Proposition 0. We then explain how to find the kernel and range or restricted linear maps in general. Proposition.6.5. Suppose S R n is a subspace, and U : S R m is linear. Then there exists a linear map T : R n R m so that U = T S. Proof. Problem 0. Theorem.6.6. Suppose T : R n R m is a linear map, and S = span( U,..., U k ) is a subspace of R n. Then T S : S R m has ker(t S ) = S ker(t ), ( range(t S ) = span T ( U ),..., T ( U ) k ) Proof. First, x ker(t S ) means T ( x) = 0 and x S. So, ker(t S ) = { x S T ( x) = 0} = { x S x ker(t )} = S ker(t ). As for range(t S ), we see directly that range(t S ) = {T ( x) x S} = {T (c u + + c k u k ) c,..., c k R} = {c T ( u ) + + c k T ( u k ) c,..., c k R} = span (T ( u ),..., T ( u k )). 0 Example.6.. Consider the linear map T : R 4 R with [T ] =, and let S = span 0 0,. 0 (a) Find ker(t ), range(t ) (b) Find ker(t S ), range(t S ). Solution:
4 4 (a) We have ( ker(t ) = span, 4 0, range(t ) = span, 0 0 (b) Converting to relation form and using Theorem.6.6, 0,, ) = R. 4 ker(t S ) = S ker(t ) x x = x x x =, x = x x x x = 0, x x 4 = 0 x = x x x =, x =, x x = 0, x x 4 = 0 = span. 0 Using Theorem.6.6 with S = span 0 0, gives 0 0 ( ) ([ range(t S ) = span T 0 0, T = span, = span, 0]) 0 [ () since span, using Section., Problem 4. 0] 0 Although we are studying linear maps U : S V between subspaces in this section, we have hardly mentioned the codomain V. What role does the codomain V play here? The role of the codomain is simply to contain all of the outputs, namely the range. The codomain can be changed without affecting the([ inputs, ]) the [ outputs, ] or Theorem.6.6, as long as the codomain still contain the range. For example, if x x + x U x = x + 4x, then ([ does NOT make sense since U = ]) ([ U : span ]) [ ] / span ([ span ]) ([ ]). However, ([ ([ ([ U : span span, U : span R ]) ]) ]) ( ()) () both make sense, since range(u) = span U = span by Theorem.6.6. The main purpose of changing the codomain is to make maps surjective. One reason to study restricted linear maps is that injectivity and surjectivity are properties of linear maps that we want, and we can always restrict the domain and codomain of a linear map T : R n R m to make it bijective. We first exhibit an example of this phenomenon and then explain how to restrict the domain and codomain of a linear map T : R n R m to make it bijective in general.
5 Example.6.8. Consider T : R R linear with [T ] = 0 0, and let S = span 0, 0. 0 Show that U : S range(t ) given by U( x) = T ( x) is bijective. Solution: First, we observe ker(t ) = span, Using Theorem.6.6, ker(u) = ker(t ) S = and Thus, U is bijective. 0 range(t ) = span, 0, = span, x x x x = x = x range(u) = span U 0, U 0 = span x x x x = 0 = { 0},, 0 = range(t ). 0 5 Theorem.6.9. Suppose T : R n R m is linear, and S R n is a subspace complementary to ker(t ). Then, is bijective. Proof. First, for injectivity, we have U : S range(t ) ker(u) = S ker(t ) = { 0}, since S, ker(t ) are complements in R n. Hence, U is injective. As for surjectivity, for any y range(t ), we can write y = T ( x) for some x R n. This does not mean y = U( x), since U( x) only makes sense when x S, and x need not be in S. But, we know that S + ker(t ) = R n, so Hence, since v S, w ker(t ). Therefore, U is surjective. x = v + w for some v S, w ker(t ). y = T ( x) = T ( v + w) = T ( v) + T ( w) = T ( v) = U( v), Why might we care about a map being bijective? As Theorem tells us, bijective maps preserve dimension. In Section??, we will use Theorem to deduce a special case of the Rank-Nullity Theorem. Theorem.6.0. If U : S V is bijective, then dim(s) = dim(v ). Proof. Suppose ( a,..., a k ) is a basis for S, which means dim(s) = k. Thus, ( a,..., a k ) spans S, so by Theorem.6.6, range(u) = span (U( a ),..., U( a k )). But also, range(u) = V since U is surjective. Putting these facts together, we conclude that (U( a ),..., U( a k )) spans V. On the other hand, ( a,..., a k ) is linearly independent, and U is injective, so by Section., Problem (U( a ),..., U( a k )) is linearly independent as well. Hence, (U( a ),..., U( a k )) is a basis for V, so dim(v ) = k. Therefore, dim(v ) = dim(w ).
6 6 Finally, we discuss how the Rank-Nullity Theorem, Theorem.6. generalizes to restricted linear maps. The dimension of the domain is still the sum of the dimensions of the kernel and range. Also, this generalized Rank-Nullity Thoerem still characterizes what ranges and kernels are possible for restricted linear maps. Theorem.6. (Rank-Nullity). Suppose V R n, W R m are subspaces. If T : V W is linear, then dim(range(t )) + dim(ker(t )) = dim(v ). Proposition.6.. Suppose V R n, W R m are subspaces. Given any subspaces S V and S W satisfying dim(s ) + dim(s ) = dim(v ), there exists a linear map T : V W so that Proof. Problem 5. Exercises:. Consider the linear map T : R 4 R with [T ] = of R 4, find ker(t S ) and range(t S ). (a) S = R 4 x (b) S = x x x + x + x + = 0 x (c) S = x x 4x 0x + x + 5 = 0 0 (d) S = span 0 0, 0 0 (e) S = span 0 0, 0 (f) S = span 0, (g) S = span (h) S = span (i) S = { 0} Problems:. () Suppose S R n is a subspace, and ker(t ) = S, range(t ) = S For each of the following subspaces S
7 . Suppose T, U : R n R m are linear maps, S R n, V R m are subspaces. Show that restriction to S has the following properties: (a) () (T + U) S = T S +U S, (b) () For any scalar c (ct ) S = c(t S ).. () Suppose T : R n R m is a linear map, and S, S R n are subspaces with S S. Show that (T S ) S = T S 4. () Suppose T, U : R n R n are linear maps, and S R n is a subspace. Prove or give a counterexample: (U T ) S = U S T +S. 5. () Suppose T : R n R m is a linear map, and S R n, V R m are subspaces. Show that (T S ) (V ) = T (V ) S. 6. () Suppose T : R n R m is a linear map, and S R n is a subspace. Show that T S : S R m is the zero map if and only if S ker(t ).. () Suppose U, T : R n R m are linear maps, and S, S are complementary subspaces in R n so that U S = T S and U S = T S. Show that U = T. 8. Suppose T : R n R m is a linear map, and S, S R n are subspaces. For each of the following statements, prove it or give a counterexample: (a) () ker(t S ) ker(t S ) = ker(t S S ), (b) () range(t S ) range(t S ) = range(t S S ), (c) () ker(t S ) + ker(t S ) = ker(t S+S ), (d) () range(t S ) + range(t S ) = range(t S+S ). 9. () Suppose T : R n R k, U : R k R m are linear, and S R k is a subspace so that range(t ) S. Show that U T = U S T. 0. () Prove Proposition () Suppose T : R n R m is linear, and S R n is a subspace. Prove or give a counterexample: If U : S range(t ) given by U( x) = T ( x) is bijective, then S, ker(t ) are complementary subspaces of R n.. () Suppose S, S R n are complementary subspaces, and T : S R m and T : S R m are linear maps. Show that there exists a unique linear map T : R n R m so that T S = T, T S = T.. () Suppose S,..., S k R n are subspaces so that every x R n can be written as x = v + + v k, for some unique v S,..., v k S k. Suppose T : S R m,..., T k : S k R m are linear maps. Show that there exists a unique linear map T : R n R m so that T Sj = T j, for all j =,..., k. 4. () Let S, S be subspaces in R n with S + S = R n. Let T : S R m and T : S R m be linear maps satisfying T S S = T S S. Show that there exists a unique linear map T : R n R m so that T S = T, T S = T.
8 8 5. Prove Proposition Let T : R n R k and U : R k R m be linear maps, and let S = ker(u T ). Consider the restriction T S : S R k. (a) () Show that range(t S ) = ker(u) range(t ). (b) () Show that nullity(u T ) = nullity(t ) + dim(ker(u) range(t )).. Let T : R n R k and U : R k R m be linear maps, and let V = range(t ). Consider the restriction U V : V R m. (a) () Show that range(u V ) = range(u T ). (b) () Show that rank(u T ) = rank(t ) dim(ker(u) range(t )). 8. () Let S be a subspace of R n, and let k = dim(s). Show that there exists a bijective linear maps T : S R k and U : R k S. 9. () Suppose S R n, V R m are subspaces. Show that exists a surjective linear map U : S V if and only if dim(s) dim(v ). 0. () Suppose S R n, V R m are subspaces. Show that exists a injective linear map U : S V if and only if dim(s) dim(v ).. () Suppose S R n, V R m are subspaces. Show that exists a bijective linear map U : S V if and only if dim(s) = dim(v ).
Notice that the set complement of A in U satisfies
Complements and Projection Maps In this section, we explore the notion of subspaces being complements Then, the unique decomposition of vectors in R n into two pieces associated to complements lets us
More informationSolution: (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 information8 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 informationof A in U satisfies S 1 S 2 = { 0}, S 1 + S 2 = R n. Examples 1: (a.) S 1 = span . 1 (c.) S 1 = span, S , S 2 = span 0 (d.
. Complements and Projection Maps In this section, we explore the notion of subspaces being complements. Then, the unique decomposition of vectors in R n into two pieces associated to complements lets
More informationLinear Algebra Practice Problems
Linear Algebra Practice Problems Page of 7 Linear Algebra Practice Problems These problems cover Chapters 4, 5, 6, and 7 of Elementary Linear Algebra, 6th ed, by Ron Larson and David Falvo (ISBN-3 = 978--68-78376-2,
More informationMath 110: Worksheet 3
Math 110: Worksheet 3 September 13 Thursday Sept. 7: 2.1 1. Fix A M n n (F ) and define T : M n n (F ) M n n (F ) by T (B) = AB BA. (a) Show that T is a linear transformation. Let B, C M n n (F ) and a
More informationx 2 For example, Theorem If S 1, S 2 are subspaces of R n, then S 1 S 2 is a subspace of R n. Proof. Problem 3.
.. Intersections and Sums of Subspaces Until now, subspaces have been static objects that do not interact, but that is about to change. In this section, we discuss the operations of intersection and addition
More informationTest 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 informationAdvanced Linear Algebra Math 4377 / 6308 (Spring 2015) March 5, 2015
Midterm 1 Advanced Linear Algebra Math 4377 / 638 (Spring 215) March 5, 215 2 points 1. Mark each statement True or False. Justify each answer. (If true, cite appropriate facts or theorems. If false, explain
More informationis injective because f(a) = f(b) only when a = b. On the other hand, 1
2.. Injective maps, Kernel, and Linear Independence In this section, we introduce the concept of injectivity for maps. Being injective is a very important property for maps and it appears everywhere in
More informationMath 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 information2: LINEAR TRANSFORMATIONS AND MATRICES
2: LINEAR TRANSFORMATIONS AND MATRICES STEVEN HEILMAN Contents 1. Review 1 2. Linear Transformations 1 3. Null spaces, range, coordinate bases 2 4. Linear Transformations and Bases 4 5. Matrix Representation,
More informationChapter 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 informationLinear Algebra. Chapter 5
Chapter 5 Linear Algebra The guiding theme in linear algebra is the interplay between algebraic manipulations and geometric interpretations. This dual representation is what makes linear algebra a fruitful
More informationLinear Algebra Lecture Notes
Linear Algebra Lecture Notes Lecturers: Inna Capdeboscq and Damiano Testa Warwick, January 2017 Contents 1 Number Systems and Fields 3 1.1 Axioms for number systems............................ 3 2 Vector
More informationPractice Final Exam Solutions
MAT 242 CLASS 90205 FALL 206 Practice Final Exam Solutions The final exam will be cumulative However, the following problems are only from the material covered since the second exam For the material prior
More informationMath 4377/6308 Advanced Linear Algebra
2. Linear Transformations Math 4377/638 Advanced Linear Algebra 2. Linear Transformations, Null Spaces and Ranges Jiwen He Department of Mathematics, University of Houston jiwenhe@math.uh.edu math.uh.edu/
More informationLinear 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 informationLINEAR ALGEBRA BOOT CAMP WEEK 1: THE BASICS
LINEAR ALGEBRA BOOT CAMP WEEK 1: THE BASICS Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F has characteristic zero. The following are facts (in
More informationCarleton College, winter 2013 Math 232, Solutions to review problems and practice midterm 2 Prof. Jones 15. T 17. F 38. T 21. F 26. T 22. T 27.
Carleton College, winter 23 Math 232, Solutions to review problems and practice midterm 2 Prof. Jones Solutions to review problems: Chapter 3: 6. F 8. F. T 5. T 23. F 7. T 9. F 4. T 7. F 38. T Chapter
More informationLinear transformations
Linear transformations Samy Tindel Purdue University Differential equations and linear algebra - MA 262 Taken from Differential equations and linear algebra by Goode and Annin Samy T. Linear transformations
More informationMath 4153 Exam 1 Review
The syllabus for Exam 1 is Chapters 1 3 in Axler. 1. You should be sure to know precise definition of the terms we have used, and you should know precise statements (including all relevant hypotheses)
More informationA = 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 informationMath 110, Spring 2015: Midterm Solutions
Math 11, Spring 215: Midterm Solutions These are not intended as model answers ; in many cases far more explanation is provided than would be necessary to receive full credit. The goal here is to make
More informationVector Spaces and Linear Transformations
Vector Spaces and Linear Transformations Wei Shi, Jinan University 2017.11.1 1 / 18 Definition (Field) A field F = {F, +, } is an algebraic structure formed by a set F, and closed under binary operations
More informationT ((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 information1 Invariant subspaces
MATH 2040 Linear Algebra II Lecture Notes by Martin Li Lecture 8 Eigenvalues, eigenvectors and invariant subspaces 1 In previous lectures we have studied linear maps T : V W from a vector space V to another
More informationSolutions: We leave the conversione between relation form and span form for the reader to verify. x 1 + 2x 2 + 3x 3 = 0
6.2. Orthogonal Complements and Projections In this section we discuss orthogonal complements and orthogonal projections. The orthogonal complement of a subspace S is the set of all vectors orthgonal to
More informationMathematics 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 informationDefinition 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 informationMath 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 informationWe see that this is a linear system with 3 equations in 3 unknowns. equation is A x = b, where
Practice Problems Math 35 Spring 7: Solutions. Write the system of equations as a matrix equation and find all solutions using Gauss elimination: x + y + 4z =, x + 3y + z = 5, x + y + 5z = 3. We see that
More informationFirst of all, the notion of linearity does not depend on which coordinates are used. Recall that a map T : R n R m is linear if
5 Matrices in Different Coordinates In this section we discuss finding matrices of linear maps in different coordinates Earlier in the class was the matrix that multiplied by x to give ( x) in standard
More informationVector space and subspace
Vector space and subspace Math 112, week 8 Goals: Vector space, subspace. Linear combination and span. Kernel and range (null space and column space). Suggested Textbook Readings: Sections 4.1, 4.2 Week
More informationy 2 . = x 1y 1 + x 2 y x + + x n y n 2 7 = 1(2) + 3(7) 5(4) = 3. x x = x x x2 n.
6.. Length, Angle, and Orthogonality In this section, we discuss the defintion of length and angle for vectors and define what it means for two vectors to be orthogonal. Then, we see that linear systems
More informationcan only hit 3 points in the codomain. Hence, f is not surjective. For another example, if n = 4
.. Conditions for Injectivity and Surjectivity In this section, we discuss what we can say about linear maps T : R n R m given only m and n. We motivate this problem by looking at maps f : {,..., n} {,...,
More informationLinear 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 informationLinear 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 informationx y + z = 3 2y z = 1 4x + y = 0
MA 253: Practice Exam Solutions You may not use a graphing calculator, computer, textbook, notes, or refer to other people (except the instructor). Show all of your work; your work is your answer. Problem
More informationLINEAR ALGEBRA REVIEW
LINEAR ALGEBRA REVIEW SPENCER BECKER-KAHN Basic Definitions Domain and Codomain. Let f : X Y be any function. This notation means that X is the domain of f and Y is the codomain of f. This means that for
More informationx 1 + 2x 2 + 3x 3 = 0 x 1 + 2x 2 + 3x 3 = 0, x 2 + x 3 = 0 x 3 3 x 3 1
. Orthogonal Complements and Projections In this section we discuss orthogonal complements and orthogonal projections. The orthogonal complement of a subspace S is the complement that is orthogonal to
More informationSystems of Linear Equations
Systems of Linear Equations Math 108A: August 21, 2008 John Douglas Moore Our goal in these notes is to explain a few facts regarding linear systems of equations not included in the first few chapters
More informationFall 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 informationReview Notes for Midterm #2
Review Notes for Midterm #2 Joris Vankerschaver This version: Nov. 2, 200 Abstract This is a summary of the basic definitions and results that we discussed during class. Whenever a proof is provided, I
More informationThe definition of a vector space (V, +, )
The definition of a vector space (V, +, ) 1. For any u and v in V, u + v is also in V. 2. For any u and v in V, u + v = v + u. 3. For any u, v, w in V, u + ( v + w) = ( u + v) + w. 4. There is an element
More informationAbstract Vector Spaces and Concrete Examples
LECTURE 18 Abstract Vector Spaces and Concrete Examples Our discussion of linear algebra so far has been devoted to discussing the relations between systems of linear equations, matrices, and vectors.
More informationMath 24 Winter 2010 Sample Solutions to the Midterm
Math 4 Winter Sample Solutions to the Midterm (.) (a.) Find a basis {v, v } for the plane P in R with equation x + y z =. We can take any two non-collinear vectors in the plane, for instance v = (,, )
More informationLinear Algebra (Math-324) Lecture Notes
Linear Algebra (Math-324) Lecture Notes Dr. Ali Koam and Dr. Azeem Haider September 24, 2017 c 2017,, Jazan All Rights Reserved 1 Contents 1 Real Vector Spaces 6 2 Subspaces 11 3 Linear Combination and
More informationFinal Review Sheet. B = (1, 1 + 3x, 1 + x 2 ) then 2 + 3x + 6x 2
Final Review Sheet The final will cover Sections Chapters 1,2,3 and 4, as well as sections 5.1-5.4, 6.1-6.2 and 7.1-7.3 from chapters 5,6 and 7. This is essentially all material covered this term. Watch
More informationLinear Algebra. Grinshpan
Linear Algebra Grinshpan Saturday class, 2/23/9 This lecture involves topics from Sections 3-34 Subspaces associated to a matrix Given an n m matrix A, we have three subspaces associated to it The column
More informationLINEAR ALGEBRA MICHAEL PENKAVA
LINEAR ALGEBRA MICHAEL PENKAVA 1. Linear Maps Definition 1.1. If V and W are vector spaces over the same field K, then a map λ : V W is called a linear map if it satisfies the two conditions below: (1)
More informationMath 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 informationWhat is on this week. 1 Vector spaces (continued) 1.1 Null space and Column Space of a matrix
Professor Joana Amorim, jamorim@bu.edu What is on this week Vector spaces (continued). Null space and Column Space of a matrix............................. Null Space...........................................2
More informationMath 121 Homework 4: Notes on Selected Problems
Math 121 Homework 4: Notes on Selected Problems 11.2.9. If W is a subspace of the vector space V stable under the linear transformation (i.e., (W ) W ), show that induces linear transformations W on W
More informationMath 308 Discussion Problems #4 Chapter 4 (after 4.3)
Math 38 Discussion Problems #4 Chapter 4 (after 4.3) () (after 4.) Let S be a plane in R 3 passing through the origin, so that S is a two-dimensional subspace of R 3. Say that a linear transformation T
More informationProof that ker(t) is a Subspace of R n
Proof that ker(t) is a Subspace of R n Gene Quinn Proof that ker(t) is a Subspace of R n p.1/7 Suppose T : R m R n is a linear transformation with domain R m and codomain R n. Proof that ker(t) is a Subspace
More informationChapter 3. Directions: For questions 1-11 mark each statement True or False. Justify each answer.
Chapter 3 Directions: For questions 1-11 mark each statement True or False. Justify each answer. 1. (True False) Asking whether the linear system corresponding to an augmented matrix [ a 1 a 2 a 3 b ]
More informationMATH2210 Notebook 3 Spring 2018
MATH2210 Notebook 3 Spring 2018 prepared by Professor Jenny Baglivo c Copyright 2009 2018 by Jenny A. Baglivo. All Rights Reserved. 3 MATH2210 Notebook 3 3 3.1 Vector Spaces and Subspaces.................................
More informationMath 308 Midterm, Feb 11th 2015 Winter Form Bonus. Possible (6) 63
Math 38 Midterm, Feb th 5 Winter 5 Your Name Your Signature Student ID # Points.. 3. 4. 5. Form Bonus Possible 6 6 6 3 (6) 63 No books are allowed. You may use a calculator. Place a box around your final
More informationChapter SSM: Linear Algebra. 5. Find all x such that A x = , so that x 1 = x 2 = 0.
Chapter Find all x such that A x : Chapter, so that x x ker(a) { } Find all x such that A x ; note that all x in R satisfy the equation, so that ker(a) R span( e, e ) 5 Find all x such that A x 5 ; x x
More informationMATH 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 information2. (10 pts) How many vectors are in the null space of the matrix A = 0 1 1? (i). Zero. (iv). Three. (ii). One. (v).
Exam 3 MAS 3105 Applied Linear Algebra, Spring 2018 (Clearly!) Print Name: Apr 10, 2018 Read all of what follows carefully before starting! 1. This test has 7 problems and is worth 110 points. Please be
More informationLinear 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 informationMATH 196, SECTION 57 (VIPUL NAIK)
TAKE-HOME CLASS QUIZ: DUE MONDAY NOVEMBER 25: SUBSPACE, BASIS, DIMENSION, AND ABSTRACT SPACES: APPLICATIONS TO CALCULUS MATH 196, SECTION 57 (VIPUL NAIK) Your name (print clearly in capital letters): PLEASE
More informationSolutions to Final Exam
Solutions to Final Exam. Let A be a 3 5 matrix. Let b be a nonzero 5-vector. Assume that the nullity of A is. (a) What is the rank of A? 3 (b) Are the rows of A linearly independent? (c) Are the columns
More informationMathematics 700 Test #2 Name: Solution Key
Mathematics 7 Test #2 Name: Solution Key Show your work to get credit. An answer with no work will not get credit. (1) (15 points) Define the following: (a) A linear map T : V V is diagonalizable (where
More informationMath 110 Answers for Homework 6
Math 0 Answers for Homework 6. We know both the matrix A, and its RREF: 0 6 A = 0 0 9 0 0 0 0 0 0 0 (a) A basis for the image of A is (,, ), (0,, 0), and (, 0, ). The reason we know this is that we know
More information1. General Vector Spaces
1.1. Vector space axioms. 1. General Vector Spaces Definition 1.1. Let V be a nonempty set of objects on which the operations of addition and scalar multiplication are defined. By addition we mean a rule
More information1.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 informationCriteria for Determining If A Subset is a Subspace
These notes closely follow the presentation of the material given in David C. Lay s textbook Linear Algebra and its Applications (3rd edition). These notes are intended primarily for in-class presentation
More information1. Give the dimension of each of the following vector spaces over R.
Answers to Exercise Set II.2. Drills 1. Give the dimension of each of the following vector spaces over R. (a) dimr 4 = 4, (b) dimp 5 = 6, (c) dimm 3,4 = 12, (d) dimf X = 4, (X = {1,2,3,4}) 2. Thedimensionof
More informationElementary 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 informationLemma 3. Suppose E, F X are closed subspaces with F finite dimensional.
Notes on Fredholm operators David Penneys Let X, Y be Banach spaces. Definition 1. A bounded linear map T B(X, Y ) is called Fredholm if dim(ker T ) < and codim(t X)
More informationLecture notes - Math 110 Lec 002, Summer The reference [LADR] stands for Axler s Linear Algebra Done Right, 3rd edition.
Lecture notes - Math 110 Lec 002, Summer 2016 BW The reference [LADR] stands for Axler s Linear Algebra Done Right, 3rd edition. 1 Contents 1 Sets and fields - 6/20 5 1.1 Set notation.................................
More informationThis last statement about dimension is only one part of a more fundamental fact.
Chapter 4 Isomorphism and Coordinates Recall that a vector space isomorphism is a linear map that is both one-to-one and onto. Such a map preserves every aspect of the vector space structure. In other
More informationChapter 3. Abstract Vector Spaces. 3.1 The Definition
Chapter 3 Abstract Vector Spaces 3.1 The Definition Let s look back carefully at what we have done. As mentioned in thebeginning,theonly algebraic or arithmetic operations we have performed in R n or C
More informationNAME MATH 304 Examination 2 Page 1
NAME MATH 4 Examination 2 Page. [8 points (a) Find the following determinant. However, use only properties of determinants, without calculating directly (that is without expanding along a column or row
More informationOutline. Linear maps. 1 Vector addition is commutative: summands can be swapped: 2 addition is associative: grouping of summands is irrelevant:
Outline Wiskunde : Vector Spaces and Linear Maps B Jacobs Institute for Computing and Information Sciences Digital Security Version: spring 0 B Jacobs Version: spring 0 Wiskunde / 55 Points in plane The
More information0.2 Vector spaces. J.A.Beachy 1
J.A.Beachy 1 0.2 Vector spaces I m going to begin this section at a rather basic level, giving the definitions of a field and of a vector space in much that same detail as you would have met them in a
More informationand The important theorem which connects these various spaces with each other is the following: (with the notation above)
When F : U V is a linear transformation there are two special subspaces associated to F which are very important. One is a subspace of U and the other is a subspace of V. They are: kerf U (the kernel of
More informationVector Spaces and Linear Maps
Vector Spaces and Linear Maps Garrett Thomas August 14, 2018 1 About This document is part of a series of notes about math and machine learning. You are free to distribute it as you wish. The latest version
More informationLinear 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 informationChapter 2: Linear Independence and Bases
MATH20300: Linear Algebra 2 (2016 Chapter 2: Linear Independence and Bases 1 Linear Combinations and Spans Example 11 Consider the vector v (1, 1 R 2 What is the smallest subspace of (the real vector space
More informationKernel 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 informationComps Study Guide for Linear Algebra
Comps Study Guide for Linear Algebra Department of Mathematics and Statistics Amherst College September, 207 This study guide was written to help you prepare for the linear algebra portion of the Comprehensive
More informationLecture Summaries for Linear Algebra M51A
These lecture summaries may also be viewed online by clicking the L icon at the top right of any lecture screen. Lecture Summaries for Linear Algebra M51A refers to the section in the textbook. Lecture
More informationAFFINE AND PROJECTIVE GEOMETRY, E. Rosado & S.L. Rueda 4. BASES AND DIMENSION
4. BASES AND DIMENSION Definition Let u 1,..., u n be n vectors in V. The vectors u 1,..., u n are linearly independent if the only linear combination of them equal to the zero vector has only zero scalars;
More informationLinear 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 informationBare-bones outline of eigenvalue theory and the Jordan canonical form
Bare-bones outline of eigenvalue theory and the Jordan canonical form April 3, 2007 N.B.: You should also consult the text/class notes for worked examples. Let F be a field, let V be a finite-dimensional
More information1 Equivalence Relations
Mitchell Faulk June 12, 2014 Equivalence Relations and Quotient Spaces 1 Equivalence Relations Recall that a relation on a set X is a subset S of the cartesian product X X. Problem Set 2 has several examples
More informationFootnotes to Linear Algebra (MA 540 fall 2013), T. Goodwillie, Bases
Footnotes to Linear Algebra (MA 540 fall 2013), T. Goodwillie, Bases November 18, 2013 1 Spanning and linear independence I will outline a slightly different approach to the material in Chapter 2 of Axler
More informationLinear Algebra Final Exam Solutions, December 13, 2008
Linear Algebra Final Exam Solutions, December 13, 2008 Write clearly, with complete sentences, explaining your work. You will be graded on clarity, style, and brevity. If you add false statements to a
More informationHonors Algebra II MATH251 Course Notes by Dr. Eyal Goren McGill University Winter 2007
Honors Algebra II MATH251 Course Notes by Dr Eyal Goren McGill University Winter 2007 Last updated: April 4, 2014 c All rights reserved to the author, Eyal Goren, Department of Mathematics and Statistics,
More informationV (v i + W i ) (v i + W i ) is path-connected and hence is connected.
Math 396. Connectedness of hyperplane complements Note that the complement of a point in R is disconnected and the complement of a (translated) line in R 2 is disconnected. Quite generally, we claim that
More informationLinear Algebra Highlights
Linear Algebra Highlights Chapter 1 A linear equation in n variables is of the form a 1 x 1 + a 2 x 2 + + a n x n. We can have m equations in n variables, a system of linear equations, which we want to
More informationLinear System Theory
Linear System Theory Wonhee Kim Lecture 3 Mar. 21, 2017 1 / 38 Overview Recap Nonlinear systems: existence and uniqueness of a solution of differential equations Preliminaries Fields and Vector Spaces
More informationLinear Algebra and Matrix Theory
Linear Algebra and Matrix Theory Part 3 - Linear Transformations 1 References (1) S Friedberg, A Insel and L Spence, Linear Algebra, Prentice-Hall (2) M Golubitsky and M Dellnitz, Linear Algebra and Differential
More informationMATH 323 Linear Algebra Lecture 12: Basis of a vector space (continued). Rank and nullity of a matrix.
MATH 323 Linear Algebra Lecture 12: Basis of a vector space (continued). Rank and nullity of a matrix. Basis Definition. Let V be a vector space. A linearly independent spanning set for V is called a basis.
More informationMath 308 Practice Test for Final Exam Winter 2015
Math 38 Practice Test for Final Exam Winter 25 No books are allowed during the exam. But you are allowed one sheet ( x 8) of handwritten notes (back and front). You may use a calculator. For TRUE/FALSE
More informationSolutions for Math 225 Assignment #5 1
Solutions for Math 225 Assignment #5 1 (1) Find a polynomial f(x) of degree at most 3 satisfying that f(0) = 2, f( 1) = 1, f(1) = 3 and f(3) = 1. Solution. By Lagrange Interpolation, ( ) (x + 1)(x 1)(x
More information