2.2. Show that U 0 is a vector space. For each α 0 in F, show by example that U α does not satisfy closure.
|
|
- Margaret Austin
- 5 years ago
- Views:
Transcription
1 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. Then β(g(x)) = β(g(y)). Therefore f(α(x)) = f(α(y). Since f is injective, this implies α(x) = α(y). Since α is injective, this implies x = y. Therefore g is injective Show that U 0 is a vector space. For each α 0 in F, show by example that U α does not satisfy closure Use proof by contradiction: Let U 1 and U 2 be subspaces of V such that U 1 U 2 = V, but suppose U 1 V and U 2 V. First show that U 1 = U 2 is impossible. Second, argue that one can find x U 1 \U 2 and one can find y U 2 \U 1. Third, argue that x + y must belong to U 1 or U 2. Fourth, argue that either outcome yields a contradiction using the closure properties of U 1 and U 2. Give brief but accurate reasons for each of the four steps outlined above. 2. Let the elements of the finite field be α 1, α 2, α 3,..., α n, where α 1 = 0 and α 2 = 1. Let i 3. You must show that α i has a multiplicative inverse, i.e. that α i α j = 1 for some j. Complete these steps: (a) Prove that the elements α i α 1, α i α 2,..., α i α n are distinct (no two on this list are the same). (b) Given (a), prove that every element in the finite field is contained in the list α i α 1, α i α 2,..., α i α n. (c) Given (b), prove that α i α j = 1 for some j Let {u 1, u 2,..., u p } be a basis for U 1. Expand this to a basis {u 1, u 2,..., u p, u p+1,..., y n } for V. Let U 2 = L F (u p+1,..., u n ). Prove that U 2 is complementary to U 1. 1
2 3. To avoid dealing with trivial cases, assume n 1. Let V be a vector space over C and let v 1, v 2..., v n V. The book describes two vector spaces over R, W r = L R (v 1, v 2,..., v n ) and W c = L C (v 1, v 2,..., v n ), and we wish to compare dim R (W r ) to dim R (W c ). In order to do this we must compare the two sets W r and W c. Complete the steps below. (a) Prove that W c = L R (v 1, iv 1, v 2, iv 2,..., v n, iv n ). Be sure to prove both subset inclusions. (b) Prove that if the vectors v 1, v 2,..., v n are linearly independent over C, then the vectors v 1, iv 1, v 2, iv 2,..., v n, iv n are linearly independent over R. (c) Given (a) and (b), prove that 0 dim R (W r ) n and 0 dim R (W c ) 2n. (d) Let n = 3 and V = C 2. Find v 1, v 2, v 3 V such that W r has dimension 3 over R and W c has dimension 4 over R. Make sure to specify the coordinates of v 1, v 2, and v 3. Hint: let v 1 and v 2 be two vectors which are linearly independent over C, and let v 3 L C (v 1, v 2 ). Make the simplest possible choices. 3.3P. (a) Explain geometrically why the shortest distance between a line g and a point p is along a path from p to g which is perpendicular to g. A diagram may help. (b) Given (a), explain why the shortest distance between two non-intersecting lines g 1 and g 2 in R 3 is along a path which is perpendicular to both. (c) Given the previous two statements, explain how solving the system of three equations in the three unknowns t 1, t 2, t 3, (p 1 + t 1 v 1 ) (p 2 + t 2 v 2 ) = t 3 (v 1 v 2 ), leads to a method of solution, then do the math and find t 1, t 2, t 3, and the shortest distance between the two lines g 1 and g 2. (Note: there is a hard way and an easy way to solve for t 1, t 2, t 3. Hard way: three equations in three unknowns. Easy way: compute the inner product with v 1 to obtain 2
3 one equation in t 1, t 2, compute the inner product with v 2 to obtain a second equation in t 1, t 2. Use these to solve for t 1, t 2, then find t 3.) 4.1. I will prove that f is injective (f(v 1 ), f(v 2 ),..., f(v n )) is linearly independent. You must prove the converse. Assume that f is injective. To prove that (f(v 1 ), f(v 2 ),..., f(v n )) is linearly independent, suppose α 1 f(v 1 ) + α 2 f(v 2 ) + + α n f(v n ) = 0 W. Since f is a linear map, we must have f(α 1 v 1 + α 2 v α n v n ) = 0 W. Since f is an injective linear map, we must have α 1 v 1 + α 2 v α n v n = 0 V. Since (v 1,..., v n ) is a basis of V, we must have α 1 = α 2 = = α n = 0 F. Hence (f(v 1 ), f(v 2 ),..., f(v n )) is linearly independent We know that V i /Ker f i = Im fi. Therefore which rearranges to dim V i dim Ker f i = dim Im f i, dim V i = dim Ker f i + dim Im f i. Now replace each dim V i by dim Ker f i +dim Im f i in n i=0 ( 1)i dim V i and explain how this can be transformed into n i=0 ( 1)i dim H i (C). 4. We must show that φ 2 is injective and surjective. I will prove that φ 2 is injective by a process called diagram-chasing. You should show that φ 2 is surjective by a similar process. To show that φ 2 is injective it suffices to show that φ 2 (v 2 ) = 0 implies v 2 = 0. Suppose that φ 2 (v 2 ) = 0. Then g 2 (φ 2 (v 2 )) = 0, therefore φ 1 (f 2 (v 2 )) = 3
4 0. Since φ 1 is an isomorphism, this implies that f 2 (v 2 ) = 0. Therefore v 2 Ker f 2, therefore v 2 Im f 3, therefore v 2 = f 3 (v 3 ) for some v 3 V 3. Therefore φ 2 (f 3 (v 3 )) = 0, therefore g 3 (φ 3 (v 3 )) = 0, therefore φ 3 (v 3 ) Ker g 3, therefore φ 3 (v 3 ) = Im g 4, therefore φ 3 (v 3 ) = g 4 (w 4 ) for some w 4 W 4. Since φ 4 is surjective, we must have w 4 = φ 4 (v 4 ) for some v 4 V 4. Therefore φ 3 (v 3 ) = g 4 (φ 4 (v 4 )). Therefore φ 3 (v 3 ) = φ 3 (f 4 (v 4 )). Since φ 3 is an isomorphism, this implies that v 3 = f 4 (v 4 ). Therefore v 2 = f 3 (f 4 (v 4 )). The hypothesis that the top row of the diagram is exact implies that f 3 f 4 = 0, therefore v 2 = 0, as desired. Here is how to start the proof that φ 2 is surjective: Let w 2 W 2 be given. We must show there exists v 2 V 2 such that w 2 = φ 2. We have g 2 (w 2 ) W 1. Since φ 1 is an isomorphism, g 2 (w 2 ) = φ 2 (v 3 ) for some v 3 V 3. Since the bottom row of the diagram is exact, g 1 (g 2 (w 2 )) = 0. Therefore g 1 (φ 2 (v 3 )) = 0. Now proceed as above. 4.2P. (a) Prove that f(x), f(y) = x, y for all x, y V implies f(x) = x for all x V. (b) Prove that f(x) = x for all x V implies f(x), f(y) = x, y for all x, y V. Method: assuming that f(x) = x for all x V, we have f(x), f(x) = x, x for all x V. Use this fact and the equation 2 f(x), f(y) = f(x) + f(y), f(x) + f(y) f(x), f(x) f(y), f(y) and the fact that f is a linear map to prove that f(x), f(y) = x, y for all x, y V To prove that rk A+rk n rk AB, work through the following steps: (a) Let f : BV ABV be the linear map defined by f(bv) = ABv. Using the dimension formula for linear transformations, explain why rk B dim Ker f = rk AB. (b) Explain why dim Ker f nullity A. Once proved, this implies rk B nullity A rk AB. 4
5 (c) Using (b), explain why rk A + rk B n rk AB. To prove that rk AB min(rk A, rk B), work through the following steps: (d) The column space of AB is a subspace of the column space of A (prove this), therefore the rank of AB is the rank of A (explain). (e) Let b 1, b 2,..., b k be a basis for the column space of B. Then Ab 1, Ab 2,..., Ab k spans the column space of AB (prove this), therefore the dimension of the column space of AB is the rank of B (explain). Putting together (d) and (e), we are done You want to show α 1 w 1 + α 2 w 2 + α 3 w 3 = 0 V implies α 1 = α 2 = α 3 = 0. Follow these steps: (a) Explain why α 1 w 1 + α 2 w 2 + α 3 w 3 = 0 V α 2 α 3 = 0 α 1 + 2α 2 + α 3 = 0 α 1 α 2 + α 3 = 0 2α 1 α 2 + α 3 = 0 implies the system of equations (b) Find all solutions to α 1, α 2, α Some background material on matrix representations of endomorphisms: Let V be a vector space and let f : V V be an endomorphism (linear map from V to itself). If (v 1,..., v n ) is a basis for V and if f(v i ) = a 1i v 1 + a 2i v a ni v n = q a qi v q for each i n, then we say that A = (a ij ) is the matrix which represents f with respect to the basis (v 1, v 2,..., v n ). If g is a second endomorphism of V and B = (b ij ) is the matrix which represents g with respect to the same basis (v 1,..., v n ), then we have f(g(v i )) = f(b 1i v 1 + b 2i v b ni v n ) = p b pi f(v p ) = 5
6 ( b pi p q a qp v q ) = q ( ) a qp b pi v q, which implies that the matrix AB represents the endomorphism f g with respect to the basis (v 1,..., v n ). In particular, if f is invertible and g = f 1, then we must have AB = I, which implies B = A 1. Now suppose that A represents f with respect to the basis (v 1,..., v n ) and that B represents f with respect to the basis (w 1,..., w n ). How are the matrices A and B related? Let g : V V be the linear transformation defined by g(v i ) = w i for i n. Let C be the matrix which represents g with respect to the basis (v 1,..., v n ). We have p f(w i ) = p b pi w p. Therefore f(g(v i )) = p b pi w p. Therefore g 1 (f(g(v i ))) = p b pi v p. Therefore B represents g 1 f g with respect to the basis (v 1,..., v n ). On the other hand, so does C 1 AC. Therefore we have C 1 AC = B. (a) Let f : R 2 R 2 be rotation clockwise through 45. Let (v 1, v 2 ) = ( 1, 0, 0, 1 ), (w 1, w 2 ) = ( 1, 1, 1, 1 ). Let A, B, C, g be defined as in the paragraph above. Find the coefficients of A, B, and C, then verify that C 1 AC = B. Note that the latter statement is equivalent to AC = CB. We are ready to tackle 5. We are told that f has the same matrix representation with respect to all bases for V. Let A be the matrix representation 6
7 with respect to one arbitrary basis (v 1,..., v n ). Let (w 1,..., w n ) be any other basis. Let C be the matrix of the linear map g : V V defined by g(v i ) = w i for i n. Then we know that C 1 AC = A. So this relationship is true of every invertible matrix C. Use this fact to prove that A = λi for a some real number λ. This is equivalent to saying that f(v) = λv for all v V. I will do the 2 2 case for F = R. You will do the 2 2 case for F = Z 2 and the general n n case for F = R. We will find it easier to work with the relation AC = CA for all invertible matrices C. Let ( ) a11 a A = 12. a 21 a 22 Let C = ( ) x 0 0 y for two arbitrary field elements x, y, being careful not to form a singular matrix. We have ( ) ( ) ( ) ( ) a11 a 12 x 0 x 0 a11 a = 12, a 21 a 22 0 y 0 y a 21 a 22 ( ) ( ) a11 x a 12 y a11 x a = 12 x. a 21 x a 22 y a 21 y a 22 y Choosing x = 1 and y = 2, this forces a 12 = a 21 = 0. Now let ( ) x y C =. 0 z We have ( ) ( ) ( ) ( ) a11 0 x y x y a11 0 =, 0 a 22 0 z 0 z 0 a 22 ( ) ( ) a11 x a 11 y a11 x a = 22 y. 0 a 22 z 0 a 22 z Choosing x = y = z = 1 we have we have a 11 = a 22. Therefore A = a 11 I. (b) Do the argument for 2 2 matrices when F = Z 2. 7
8 (c) Do the argument for 3 3 matrices when F = R. (d) Do the argument for general n n matrices when F = R. 5.3P. Think in terms of the determinant and use a trigonometric identity. 6. To orient R n is to choose a basis (v 1,..., v n ) for it. Given another basis (v 1,..., v n), one says that it is positively oriented or negatively oriented depending on whether the endomorphism f : R n R n defined by f(v i ) = v i has a positive or a negative determinant. Now let 1 k < n. To simultaneously orient all k-dimensional subspaces of R n is to choose a basis for each and to define orientation for each in the same way. Say that for each k-dimensional subspace W we choose the orientation (w 1, w 2,..., w k ). The problem is to show that there exist continuous functions v 1, v 2,..., v k from [0, 1] to R n such that the vectors f(t) = (v 1 (t),..., v k (t)) are linearly independent for each t [0, 1], the vectors (v 1 (0),..., v k (0)) are positively oriented, but the vectors (v 1 (1),..., v k (1)) are negatively oriented. Complete the following steps: (a) Let (a 1,..., a k ) be a positively oriented basis for a k-dimensional subspace of R n. Prove that there exists a vector b R n which is not in the span of (a 1,..., a k ). (b) Let v 1 (t) = a 1, v 2 (t) = a 2,..., v k 1 (t) = a k 1, v k (t) = (1 t)a k + tb. Prove that the list of vectors (v 1 (t), v 2 (t),... v k (t)) is linearly independent for 0 t 1. (c) If the vectors in the list (v 1 (1),..., v k (1)) are negatively oriented then we are done. But if they are positively oriented, prove that we can use the vector b instead of the vector b to get the job done You know that if x F n is a solution to Ax = b, where A M(n n, F), then the solution set to the matrix equation Ay = b is x+u, where U = {u F n : Au = 0}. If you can find A so that U is the subspace in question, you can set b = Ax. Then the system of equations in question is j a ijy j = b i, 1 i n. So the theorem is equivalent to the following statement: for any subspace U F n there exists a matrix A M(n n, F) such that U = {u F n : Au = 0}. Prove this statement. I will give an example for n = 5 adapt it to provide a general solution for an arbitrary U F n, proving any statements that require a proof. 8
9 Say that U is a 3-dimensional subspace of F 5. Then it has a basis {u 1, u 2, u 3 }. Expand this to a basis {u 1, u 2, u 3, u 4, u 5 } of F 5. Define f : F 5 F 5 by f(a 1 u 1 + a 2 u 2 + a 3 u 3 + a 4 u 4 + a 5 u 5 ) = a 4 u 4 + a 5 u 5. Then f is a linear map with kernel U. If A is the matrix representation of f with respect to the basis {e 1, e 2, e 3, e 4, e 5 } then U = {u F 5 : Au = 0}. 7. Complete the following steps. (a) Argue that if F is an infinite field then any matrix equation Ax = b has either no solutions or an infinite number of solutions, hence can never have exactly three solutions. Hence F must be finite. (b) Given that F is a finite field with a elements, any k-dimensional subspace of F must have a k elements. (c) Given that F is a finite field with a elements, if Ax = b has three solutions then a = 3. (d) Every finite field with three elements is isomorphic to Z P. The system of equations is equivalent to x 1 a 1 + x 2 a x n a n = b. Take the inner product of both sides with b and derive a contradiction using the properties of inner products (see page 31) Observe that a b 2 = a b, a b = (a c) + (c b), (a b) + (b c). Expand this out using the properties of the inner product and use the fact that a c is orthogonal to b c to simplify the expression Verify, carefully, that O(2) satisfies axioms (1), (2), and (3), but not axiom (4) of the group definition (page 145) Assume that such an inner product exists and derive a contradiction. Let e 1 through e n be the standard basis for R n. Define a ij = e i, e j. (a) Given x = (x 1,..., x n ), show that x, x = i,j x ix j a ij. (b) Given (a), prove that a ii = 1 for all i. Hint: compute e i 2 using the inner product and (a). 9
10 (c) Let x(i, j, α) denote the vector with 1 in position i and α in position j, where i j. Assuming that α < 1, prove that α(a ij +a ji ) = 1 by computing x(i, j, α) 2 using the inner product. (d) Explain why (c) implies that a ij + a ji = 0 whenever i j. (e) Explain why (b) and (d) imply that x, x = x x 2 n whenever x = (x 1,..., x n ). (f) Using (e), explain why x 2 = 1 results in a contradiction using x = (1, 1,..., 1) Let U be the set of subsequences in which only a finite number of terms are non-zero. Prove that U is a proper subspace of V and that if v, u = 0 for all u U then v = (0, 0,... ) Show that if M has at least 3 elements then there are two noncommuting elements in (Bij(M), ). 8.3P. The dot notation in physics represents the derivative with respect to a time variable t. To make this problem a little more concrete and manageable, make the following assumptions: V = R 3, φ(t) = (φ 1 (t), φ 2 (t), φ 3 (t)), φ (t) = (φ 1(t), φ 2(t), φ 3(t)), ψ(t) = (ψ 1 (t), ψ 2 (t), ψ 3 (t)), ψ (t) = (ψ 1(t), ψ 2(t), ψ 3(t)), and the inner product in V is given by the formula in problem P: To solve this problem you must show that A(Aw λw) = λ(aw λw) for all w R 2. You will be able to do [ this] provided you know what form a b the matrix A takes. Assume that A =. The assumption that there is c d exactly one eigenvalue tells you that P A (x) = (x λ) 2. Work out the determinant of A( x), compare its coefficients to the coefficients to the coefficients in (x λ) 2, and see what this tells you about a, b, c, d. 9.3: Eigenvalues of this map are real numbers λ such that f (x) = λf(x) for a non-zero function f(x). So λ appears as a constant in a second-order differential equation. Find the solutions to this equation and find the permissible values of λ. 10
11 10.2: By Theorem 10.3 of these notes, the existence of an inner product with respect to which f is self-adjoint implies that f is diagonalizable. To prove the converse, assume f is diagonalizable and let {v 1,..., v n } be a basis of eigenvectors. Assume that f(v i ) = λ i v i for each i. Define the inner product as α i v i, β i v i = α i β i. i i i (a) First, prove carefully that this construction has all the required properties of an inner product. (b) Second, prove that f is self-adjoint with respect to this inner product. 10.3: Choose an orthonormal basis {u 1,..., u k } for U. Expand this to a basis {u 1,..., u k, v k+1,..., v n } for V. The orthogonal projection map P U : V U is defined by k P U (v) = v, u i u i. (a) Prove that P U is self-adjoint. i=1 (b) It is harmless to regard P U as a mapping from V into V. Choose the basis described above for both domain and codomain, then compute the matrix representation A. (c) Compute the eigenvalues of P U by finding the roots of det A( x). (d) Find a basis for each eigenspace of P U. 10 : Let V be an n-dimensional Euclidean vector space. (a) Assume that f and g are self-adjoint linear maps from V to V which can be simultaneously diagonalized. This means that V has a basis {v 1,..., v n } with respect to which the matrix representation for f is A = diag(α 1,..., α n ) and the matrix representation for g is B = diag(β 1,..., β n ), using a notation for diagonal matrices which lists the diagonal elements only. Prove that f g(v i ) = g f(v i ) for 1 i n. This implies that f g(v) = g f(v) for all v V, which implies f g = g f. Now assume that f and g are self-adjoint linear maps from V to V and assume that f g = g f. There are two cases to consider: all the eigenvalues of f are equal; f has at least two different eigenvalues. 11
12 (b) Consider the case where all the eigenvalues of f are equal to λ. Explain why this implies that f(v) = λv for every v V. Explain why this implies that every matrix representation of f is diagonal. Explain why this implies f and g are simultaneously diagonalizable. (c) Now consider the case where f has at least two different eigenvalues. Then a basis of eigenvectors of f can be chosen for V in such a way that the matrix representation of f is of the form A = diag(λ 1,..., λ 1, λ 2,..., λ 2,..., λ k,..., λ k ), where λ 1 through λ k are the distinct eigenvalues of f. A has block matrix form diag(λ 1 I 1, λ 2 I 2,..., λ k I k ), where each I i is an identity matrix with n λi rows and columns. Let B the matrix representation of g with respect to this basis. Then B has the block matrix form B = (B ij ), where B ij is a matrix with n λi rows and n λj columns. Since f g = g f, we must have AB = BA. Explain why this implies B ij = 0 for i j. Hence B = diag(b 11, B 22,..., B kk ). (d) Fix an index i in the range {1, 2,..., k}. Let {v (i) 1, v (i) 2,..., v n (i) λi } be the corresponding basis vectors used to construct the matrix representation of f and g. Let V i = L R (v (i) 1, v (i) 2,..., v (i) n λi ). Explain why f(v i ) V i and g(v i ) V i. Hence f and g are commuting self-adjoint linear operators on V i and all the eigenvalues of f (restricted to V i ) are equal to λ i. Hence by part (c) above, f and g can be simultaneously diagonalized on V i, meaning V i has a basis consisting of vectors which are eigenvectors for both f and g. The union of all these bases forms a basis for V of eigenvectors for both f and g. 10.3P: Interpret Sym(n, R) to mean the set of symmetric n n matrices with entries in R. First prove that this is a subspace of all the real n n matrices, then compute its dimension by finding an appropriate basis of matrices. 12
235 Final exam review questions
5 Final exam review questions Paul Hacking December 4, 0 () Let A be an n n matrix and T : R n R n, T (x) = Ax the linear transformation with matrix A. What does it mean to say that a vector v R n is an
More informationALGEBRA 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 informationThen 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 informationYORK 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 informationTopics in linear algebra
Chapter 6 Topics in linear algebra 6.1 Change of basis I want to remind you of one of the basic ideas in linear algebra: change of basis. Let F be a field, V and W be finite dimensional vector spaces over
More informationLINEAR ALGEBRA REVIEW
LINEAR ALGEBRA REVIEW JC Stuff you should know for the exam. 1. Basics on vector spaces (1) F n is the set of all n-tuples (a 1,... a n ) with a i F. It forms a VS with the operations of + and scalar multiplication
More informationLinear 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 informationMATH 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 informationMAT Linear Algebra Collection of sample exams
MAT 342 - Linear Algebra Collection of sample exams A-x. (0 pts Give the precise definition of the row echelon form. 2. ( 0 pts After performing row reductions on the augmented matrix for a certain system
More informationMATH 31 - ADDITIONAL PRACTICE PROBLEMS FOR FINAL
MATH 3 - ADDITIONAL PRACTICE PROBLEMS FOR FINAL MAIN TOPICS FOR THE FINAL EXAM:. Vectors. Dot product. Cross product. Geometric applications. 2. Row reduction. Null space, column space, row space, left
More informationCalculating determinants for larger matrices
Day 26 Calculating determinants for larger matrices We now proceed to define det A for n n matrices A As before, we are looking for a function of A that satisfies the product formula det(ab) = det A det
More informationMATH 315 Linear Algebra Homework #1 Assigned: August 20, 2018
Homework #1 Assigned: August 20, 2018 Review the following subjects involving systems of equations and matrices from Calculus II. Linear systems of equations Converting systems to matrix form Pivot entry
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 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 information(a) II and III (b) I (c) I and III (d) I and II and III (e) None are true.
1 Which of the following statements is always true? I The null space of an m n matrix is a subspace of R m II If the set B = {v 1,, v n } spans a vector space V and dimv = n, then B is a basis for V III
More informationMath 108b: Notes on the Spectral Theorem
Math 108b: Notes on the Spectral Theorem From section 6.3, we know that every linear operator T on a finite dimensional inner product space V has an adjoint. (T is defined as the unique linear operator
More informationMATH 583A REVIEW SESSION #1
MATH 583A REVIEW SESSION #1 BOJAN DURICKOVIC 1. Vector Spaces Very quick review of the basic linear algebra concepts (see any linear algebra textbook): (finite dimensional) vector space (or linear space),
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 informationTopic 2 Quiz 2. choice C implies B and B implies C. correct-choice C implies B, but B does not imply C
Topic 1 Quiz 1 text A reduced row-echelon form of a 3 by 4 matrix can have how many leading one s? choice must have 3 choice may have 1, 2, or 3 correct-choice may have 0, 1, 2, or 3 choice may have 0,
More informationThe following definition is fundamental.
1. Some Basics from Linear Algebra With these notes, I will try and clarify certain topics that I only quickly mention in class. First and foremost, I will assume that you are familiar with many basic
More informationx 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 information2. Every linear system with the same number of equations as unknowns has a unique solution.
1. For matrices A, B, C, A + B = A + C if and only if A = B. 2. Every linear system with the same number of equations as unknowns has a unique solution. 3. Every linear system with the same number of equations
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 informationMath 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces.
Math 350 Fall 2011 Notes about inner product spaces In this notes we state and prove some important properties of inner product spaces. First, recall the dot product on R n : if x, y R n, say x = (x 1,...,
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 informationMath 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 informationhomogeneous 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 informationIr 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 informationA Little Beyond: Linear Algebra
A Little Beyond: Linear Algebra Akshay Tiwary March 6, 2016 Any suggestions, questions and remarks are welcome! 1 A little extra Linear Algebra 1. Show that any set of non-zero polynomials in [x], no two
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 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 informationj=1 x j p, if 1 p <, x i ξ : x i < ξ} 0 as p.
LINEAR ALGEBRA Fall 203 The final exam Almost all of the problems solved Exercise Let (V, ) be a normed vector space. Prove x y x y for all x, y V. Everybody knows how to do this! Exercise 2 If V is a
More informationA 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 informationLINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM
LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F is R or C. Definition 1. A linear operator
More informationMATH SOLUTIONS TO PRACTICE MIDTERM LECTURE 1, SUMMER Given vector spaces V and W, V W is the vector space given by
MATH 110 - SOLUTIONS TO PRACTICE MIDTERM LECTURE 1, SUMMER 2009 GSI: SANTIAGO CAÑEZ 1. Given vector spaces V and W, V W is the vector space given by V W = {(v, w) v V and w W }, with addition and scalar
More informationThe value of a problem is not so much coming up with the answer as in the ideas and attempted ideas it forces on the would be solver I.N.
Math 410 Homework Problems In the following pages you will find all of the homework problems for the semester. Homework should be written out neatly and stapled and turned in at the beginning of class
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 informationDefinitions for Quizzes
Definitions for Quizzes Italicized text (or something close to it) will be given to you. Plain text is (an example of) what you should write as a definition. [Bracketed text will not be given, nor does
More informationMATH 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 informationNOTES on LINEAR ALGEBRA 1
School of Economics, Management and Statistics University of Bologna Academic Year 207/8 NOTES on LINEAR ALGEBRA for the students of Stats and Maths This is a modified version of the notes by Prof Laura
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 informationMATHEMATICS 217 NOTES
MATHEMATICS 27 NOTES PART I THE JORDAN CANONICAL FORM The characteristic polynomial of an n n matrix A is the polynomial χ A (λ) = det(λi A), a monic polynomial of degree n; a monic polynomial in the variable
More informationIMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET
IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET This is a (not quite comprehensive) list of definitions and theorems given in Math 1553. Pay particular attention to the ones in red. Study Tip For each
More informationNORMS 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 informationGQE ALGEBRA PROBLEMS
GQE ALGEBRA PROBLEMS JAKOB STREIPEL Contents. Eigenthings 2. Norms, Inner Products, Orthogonality, and Such 6 3. Determinants, Inverses, and Linear (In)dependence 4. (Invariant) Subspaces 3 Throughout
More informationSolution to Homework 1
Solution to Homework Sec 2 (a) Yes It is condition (VS 3) (b) No If x, y are both zero vectors Then by condition (VS 3) x = x + y = y (c) No Let e be the zero vector We have e = 2e (d) No It will be false
More informationMATH 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 informationIntroduction to Linear Algebra, Second Edition, Serge Lange
Introduction to Linear Algebra, Second Edition, Serge Lange Chapter I: Vectors R n defined. Addition and scalar multiplication in R n. Two geometric interpretations for a vector: point and displacement.
More informationChapter 6: Orthogonality
Chapter 6: Orthogonality (Last Updated: November 7, 7) These notes are derived primarily from Linear Algebra and its applications by David Lay (4ed). A few theorems have been moved around.. Inner products
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 informationSelected 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 informationThen since v is an eigenvector of T, we have (T λi)v = 0. Then
Problem F02.10. Let T be a linear operator on a finite dimensional complex inner product space V such that T T = T T. Show that there is an orthonormal basis of V consisting of eigenvectors of B. Solution.
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 informationFinal Exam Practice Problems Answers Math 24 Winter 2012
Final Exam Practice Problems Answers Math 4 Winter 0 () The Jordan product of two n n matrices is defined as A B = (AB + BA), where the products inside the parentheses are standard matrix product. Is the
More informationSupplementary Notes on Linear Algebra
Supplementary Notes on Linear Algebra Mariusz Wodzicki May 3, 2015 1 Vector spaces 1.1 Coordinatization of a vector space 1.1.1 Given a basis B = {b 1,..., b n } in a vector space V, any vector v V can
More information5.) For each of the given sets of vectors, determine whether or not the set spans R 3. Give reasons for your answers.
Linear Algebra - Test File - Spring Test # For problems - consider the following system of equations. x + y - z = x + y + 4z = x + y + 6z =.) Solve the system without using your calculator..) Find the
More informationSolving a system by back-substitution, checking consistency of a system (no rows of the form
MATH 520 LEARNING OBJECTIVES SPRING 2017 BROWN UNIVERSITY SAMUEL S. WATSON Week 1 (23 Jan through 27 Jan) Definition of a system of linear equations, definition of a solution of a linear system, elementary
More informationOHSx XM511 Linear Algebra: Solutions to Online True/False Exercises
This document gives the solutions to all of the online exercises for OHSx XM511. The section ( ) numbers refer to the textbook. TYPE I are True/False. Answers are in square brackets [. Lecture 02 ( 1.1)
More informationConceptual Questions for Review
Conceptual Questions for Review Chapter 1 1.1 Which vectors are linear combinations of v = (3, 1) and w = (4, 3)? 1.2 Compare the dot product of v = (3, 1) and w = (4, 3) to the product of their lengths.
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 informationLinear Algebra- Final Exam Review
Linear Algebra- Final Exam Review. Let A be invertible. Show that, if v, v, v 3 are linearly independent vectors, so are Av, Av, Av 3. NOTE: It should be clear from your answer that you know the definition.
More information1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det
What is the determinant of the following matrix? 3 4 3 4 3 4 4 3 A 0 B 8 C 55 D 0 E 60 If det a a a 3 b b b 3 c c c 3 = 4, then det a a 4a 3 a b b 4b 3 b c c c 3 c = A 8 B 6 C 4 D E 3 Let A be an n n matrix
More informationKnowledge Discovery and Data Mining 1 (VO) ( )
Knowledge Discovery and Data Mining 1 (VO) (707.003) Review of Linear Algebra Denis Helic KTI, TU Graz Oct 9, 2014 Denis Helic (KTI, TU Graz) KDDM1 Oct 9, 2014 1 / 74 Big picture: KDDM Probability Theory
More informationLinear algebra 2. Yoav Zemel. March 1, 2012
Linear algebra 2 Yoav Zemel March 1, 2012 These notes were written by Yoav Zemel. The lecturer, Shmuel Berger, should not be held responsible for any mistake. Any comments are welcome at zamsh7@gmail.com.
More informationIMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET
IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET This is a (not quite comprehensive) list of definitions and theorems given in Math 1553. Pay particular attention to the ones in red. Study Tip For each
More information08a. Operators on Hilbert spaces. 1. Boundedness, continuity, operator norms
(February 24, 2017) 08a. Operators on Hilbert spaces Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/real/notes 2016-17/08a-ops
More informationNONCOMMUTATIVE POLYNOMIAL EQUATIONS. Edward S. Letzter. Introduction
NONCOMMUTATIVE POLYNOMIAL EQUATIONS Edward S Letzter Introduction My aim in these notes is twofold: First, to briefly review some linear algebra Second, to provide you with some new tools and techniques
More informationMatrix Theory. A.Holst, V.Ufnarovski
Matrix Theory AHolst, VUfnarovski 55 HINTS AND ANSWERS 9 55 Hints and answers There are two different approaches In the first one write A as a block of rows and note that in B = E ij A all rows different
More informationAlgebra 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 information2.3. VECTOR SPACES 25
2.3. VECTOR SPACES 25 2.3 Vector Spaces MATH 294 FALL 982 PRELIM # 3a 2.3. Let C[, ] denote the space of continuous functions defined on the interval [,] (i.e. f(x) is a member of C[, ] if f(x) is continuous
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 informationMATH 221: SOLUTIONS TO SELECTED HOMEWORK PROBLEMS
MATH 221: SOLUTIONS TO SELECTED HOMEWORK PROBLEMS 1. HW 1: Due September 4 1.1.21. Suppose v, w R n and c is a scalar. Prove that Span(v + cw, w) = Span(v, w). We must prove two things: that every element
More informationMath 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 informationMA 265 FINAL EXAM Fall 2012
MA 265 FINAL EXAM Fall 22 NAME: INSTRUCTOR S NAME:. There are a total of 25 problems. You should show work on the exam sheet, and pencil in the correct answer on the scantron. 2. No books, notes, or calculators
More informationLecture 7: Positive Semidefinite Matrices
Lecture 7: Positive Semidefinite Matrices Rajat Mittal IIT Kanpur The main aim of this lecture note is to prepare your background for semidefinite programming. We have already seen some linear algebra.
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 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 informationMATH Linear Algebra
MATH 304 - Linear Algebra In the previous note we learned an important algorithm to produce orthogonal sequences of vectors called the Gramm-Schmidt orthogonalization process. Gramm-Schmidt orthogonalization
More informationMath Abstract Linear Algebra Fall 2011, section E1 Practice Final. This is a (long) practice exam. The real exam will consist of 6 problems.
Math 416 - Abstract Linear Algebra Fall 2011, section E1 Practice Final Name: This is a (long) practice exam. The real exam will consist of 6 problems. In the real exam, no calculators, electronic devices,
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 115A: SAMPLE FINAL SOLUTIONS
MATH A: SAMPLE FINAL SOLUTIONS JOE HUGHES. Let V be the set of all functions f : R R such that f( x) = f(x) for all x R. Show that V is a vector space over R under the usual addition and scalar multiplication
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 informationBasic Elements of Linear Algebra
A Basic Review of Linear Algebra Nick West nickwest@stanfordedu September 16, 2010 Part I Basic Elements of Linear Algebra Although the subject of linear algebra is much broader than just vectors and matrices,
More informationReview problems for MA 54, Fall 2004.
Review problems for MA 54, Fall 2004. Below are the review problems for the final. They are mostly homework problems, or very similar. If you are comfortable doing these problems, you should be fine on
More informationLinear algebra and applications to graphs Part 1
Linear algebra and applications to graphs Part 1 Written up by Mikhail Belkin and Moon Duchin Instructor: Laszlo Babai June 17, 2001 1 Basic Linear Algebra Exercise 1.1 Let V and W be linear subspaces
More informationLinear Algebra Review. Vectors
Linear Algebra Review 9/4/7 Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa (UCSD) Cogsci 8F Linear Algebra review Vectors
More informationDimension. Eigenvalue and eigenvector
Dimension. Eigenvalue and eigenvector Math 112, week 9 Goals: Bases, dimension, rank-nullity theorem. Eigenvalue and eigenvector. Suggested Textbook Readings: Sections 4.5, 4.6, 5.1, 5.2 Week 9: Dimension,
More informationMATH 23a, FALL 2002 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Solutions to Final Exam (in-class portion) January 22, 2003
MATH 23a, FALL 2002 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Solutions to Final Exam (in-class portion) January 22, 2003 1. True or False (28 points, 2 each) T or F If V is a vector space
More informationLINEAR ALGEBRA SUMMARY SHEET.
LINEAR ALGEBRA SUMMARY SHEET RADON ROSBOROUGH https://intuitiveexplanationscom/linear-algebra-summary-sheet/ This document is a concise collection of many of the important theorems of linear algebra, organized
More informationINTRODUCTION TO LIE ALGEBRAS. LECTURE 2.
INTRODUCTION TO LIE ALGEBRAS. LECTURE 2. 2. More examples. Ideals. Direct products. 2.1. More examples. 2.1.1. Let k = R, L = R 3. Define [x, y] = x y the cross-product. Recall that the latter is defined
More informationExercise Sheet 1.
Exercise Sheet 1 You can download my lecture and exercise sheets at the address http://sami.hust.edu.vn/giang-vien/?name=huynt 1) Let A, B be sets. What does the statement "A is not a subset of B " mean?
More informationHonors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35
Honors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35 1. Let R be a commutative ring with 1 0. (a) Prove that the nilradical of R is equal to the intersection of the prime
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. Select the unique answer (choice) for each problem. Write only the answer.
MATH 5 Practice Problem Set Spring 7. Select the unique answer (choice) for each problem. Write only the answer. () Determine all the values of a for which the system has infinitely many solutions: x +
More informationMathematics 1. Part II: Linear Algebra. Exercises and problems
Bachelor Degree in Informatics Engineering Barcelona School of Informatics Mathematics Part II: Linear Algebra Eercises and problems February 5 Departament de Matemàtica Aplicada Universitat Politècnica
More informationMATH 225 Summer 2005 Linear Algebra II Solutions to Assignment 1 Due: Wednesday July 13, 2005
MATH 225 Summer 25 Linear Algebra II Solutions to Assignment 1 Due: Wednesday July 13, 25 Department of Mathematical and Statistical Sciences University of Alberta Question 1. [p 224. #2] The set of all
More informationOctober 25, 2013 INNER PRODUCT SPACES
October 25, 2013 INNER PRODUCT SPACES RODICA D. COSTIN Contents 1. Inner product 2 1.1. Inner product 2 1.2. Inner product spaces 4 2. Orthogonal bases 5 2.1. Existence of an orthogonal basis 7 2.2. Orthogonal
More informationREVIEW FOR EXAM II. The exam covers sections , the part of 3.7 on Markov chains, and
REVIEW FOR EXAM II The exam covers sections 3.4 3.6, the part of 3.7 on Markov chains, and 4.1 4.3. 1. The LU factorization: An n n matrix A has an LU factorization if A = LU, where L is lower triangular
More informationLinear Algebra. Min Yan
Linear Algebra Min Yan January 2, 2018 2 Contents 1 Vector Space 7 1.1 Definition................................. 7 1.1.1 Axioms of Vector Space..................... 7 1.1.2 Consequence of Axiom......................
More informationLinear Algebra II Lecture 22
Linear Algebra II Lecture 22 Xi Chen University of Alberta March 4, 24 Outline Characteristic Polynomial, Eigenvalue, Eigenvector and Eigenvalue, Eigenvector and Let T : V V be a linear endomorphism. We
More information