12x + 18y = 30? ax + by = m

Similar documents
MATH 31 - ADDITIONAL PRACTICE PROBLEMS FOR FINAL

1 Last time: least-squares problems

Definition (T -invariant subspace) Example. Example

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

The 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.

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

Math 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces.

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

MATRICES ARE SIMILAR TO TRIANGULAR MATRICES

Math 113 Final Exam: Solutions

Review problems for MA 54, Fall 2004.

Applied Linear Algebra in Geoscience Using MATLAB

Math 24 Spring 2012 Sample Homework Solutions Week 8

Assignment 1 Math 5341 Linear Algebra Review. Give complete answers to each of the following questions. Show all of your work.

1. In this problem, if the statement is always true, circle T; otherwise, circle F.

Linear Algebra: Matrix Eigenvalue Problems

MA 265 FINAL EXAM Fall 2012

LINEAR ALGEBRA 1, 2012-I PARTIAL EXAM 3 SOLUTIONS TO PRACTICE PROBLEMS

235 Final exam review questions

Chapter 4 & 5: Vector Spaces & Linear Transformations

Linear algebra II Homework #1 due Thursday, Feb. 2 A =. 2 5 A = When writing up solutions, write legibly and coherently.

22m:033 Notes: 7.1 Diagonalization of Symmetric Matrices

Algebra Exam Syllabus

ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA

6 Inner Product Spaces

MATH 240 Spring, Chapter 1: Linear Equations and Matrices

First we introduce the sets that are going to serve as the generalizations of the scalars.

HONORS LINEAR ALGEBRA (MATH V 2020) SPRING 2013

Final Exam, Linear Algebra, Fall, 2003, W. Stephen Wilson

Final Exam Practice Problems Answers Math 24 Winter 2012

Columbus State Community College Mathematics Department Public Syllabus

1. General Vector Spaces

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

MATH 54 - FINAL EXAM STUDY GUIDE

I. Multiple Choice Questions (Answer any eight)

LAKELAND COMMUNITY COLLEGE COURSE OUTLINE FORM

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

Linear Algebra Massoud Malek

October 25, 2013 INNER PRODUCT SPACES

Linear Algebra Practice Problems

Linear Algebra. Session 12

Solutions to Final Exam

Quadratic forms. Here. Thus symmetric matrices are diagonalizable, and the diagonalization can be performed by means of an orthogonal matrix.

Math Linear Algebra II. 1. Inner Products and Norms

j=1 u 1jv 1j. 1/ 2 Lemma 1. An orthogonal set of vectors must be linearly independent.

GRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory.

PRACTICE FINAL EXAM. why. If they are dependent, exhibit a linear dependence relation among them.

Lecture 7: Positive Semidefinite Matrices

Final Review Sheet. B = (1, 1 + 3x, 1 + x 2 ) then 2 + 3x + 6x 2

5.) For each of the given sets of vectors, determine whether or not the set spans R 3. Give reasons for your answers.

BASIC ALGORITHMS IN LINEAR ALGEBRA. Matrices and Applications of Gaussian Elimination. A 2 x. A T m x. A 1 x A T 1. A m x

Chapter 3 Transformations

Chap 3. Linear Algebra

Exercise Set 7.2. Skills

Linear algebra II Homework #1 due Thursday, Feb A =

LINEAR ALGEBRA BOOT CAMP WEEK 2: LINEAR OPERATORS

Algebra Exam Topics. Updated August 2017

Lecture 15, 16: Diagonalization

Math 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination

MATH 304 Linear Algebra Lecture 34: Review for Test 2.

Problem Set (T) If A is an m n matrix, B is an n p matrix and D is a p s matrix, then show

Jordan Canonical Form Homework Solutions

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

Eigenvalues and Eigenvectors A =

Lecture Notes. Advanced Discrete Structures COT S

Math 18, Linear Algebra, Lecture C00, Spring 2017 Review and Practice Problems for Final Exam

MATH 167: APPLIED LINEAR ALGEBRA Chapter 3

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

Topics in linear algebra

ANSWERS (5 points) Let A be a 2 2 matrix such that A =. Compute A. 2

Math 3191 Applied Linear Algebra

MATH 1120 (LINEAR ALGEBRA 1), FINAL EXAM FALL 2011 SOLUTIONS TO PRACTICE VERSION

1. Foundations of Numerics from Advanced Mathematics. Linear Algebra

Math 224, Fall 2007 Exam 3 Thursday, December 6, 2007

Diagonalization. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics

MTH 2032 SemesterII

8. Diagonalization.

MATH 167: APPLIED LINEAR ALGEBRA Least-Squares

ft-uiowa-math2550 Assignment NOTRequiredJustHWformatOfQuizReviewForExam3part2 due 12/31/2014 at 07:10pm CST

Remark By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.

Detailed Assessment Report MATH Outcomes, with Any Associations and Related Measures, Targets, Findings, and Action Plans

Spring 2014 Math 272 Final Exam Review Sheet

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

Reduction to the associated homogeneous system via a particular solution

EXAM. Exam 1. Math 5316, Fall December 2, 2012

Diagonalizing Matrices

THE MINIMAL POLYNOMIAL AND SOME APPLICATIONS

1 9/5 Matrices, vectors, and their applications

Homework 11 Solutions. Math 110, Fall 2013.

Spring 2019 Exam 2 3/27/19 Time Limit: / Problem Points Score. Total: 280

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

MATH 221, Spring Homework 10 Solutions

Lecture 19: Isometries, Positive operators, Polar and singular value decompositions; Unitary matrices and classical groups; Previews (1)

Linear Algebra. Workbook

DS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.

SUMMARY OF MATH 1600

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

Math 115A: Homework 5

Questionnaire for CSET Mathematics subset 1

Exercise Sheet 1.

Transcription:

Math 2201, Further Linear Algebra: a practical summary. February, 2009 There are just a few themes that were covered in the course. I. Algebra of integers and polynomials. II. Structure theory of one endomorphism. III. Quadratic forms and bilinear forms. IV. Inner product spaces. I. The main topics covered were: the Euclidean algorithm, Bezout s Lemma, factorization, and congruences. You should know: -How to carry out the Euclidean algorithm for integers and polynomials. -How to explicitly express GCD s as linear combinations of input integers or polynomials, i.e., Bezout s Lemma. -How to use the Chinese remainder theorem. Also, -Understand basic facts about prime numbers and irreducible polynomials as contained in the lecture notes. -Understand the proof of the theorem on unique factorization of integers and polynomials. -Understand the proof of the Chinese remainder theorem. Some questions to think about: How is Bezout s lemma used in the proof of the unique factorization theorem? Why is the HCF of two polynomials defined to be a monic polynomial? What are the invertible elements in the ring of polynomials over a field k? What are the invertible elements in Z? What are the invertible elements in Q? What are the irreducible elements in C[x]? Find irreducible elements of degrees 2, 3, and 4 in F 2 [x]and F 3 [x]. What is the basic theorem that helps to compute powers modulo a prime? How is the Chinese remainder theorem helpful in computing powers modulo a composite number, in Z/39, for example? How would you solve the equation 5x 4 mod 12? or other similar equations? What is the role of Bezout s lemma? Does 45x + 75y = 60 have a solution (x, y) in integers? Does 45x + 75y = 100 have a solution (x, y) in integers? Can you give a nice description of all solutions (in integers, of course) to For what kind of pairs a and b does the equation have solutions no matter what m is? 12x + 18y = 30? ax + by = m II. This is a good point at which to review all the basic facts from the previous course, as contained in lectures 8-10 of the notes. Especially: 1

(0) Notion of basis and dimension. (1) How to compute the matrix of a linear map with respect to a basis. (2) Rank-nullity formula. (3) The characteristic polynomial of a linear map. After that you should understand the basics of diagonalization, especially the equivalence L : V V is diagonalizable V has a basis consisting entirely of eigenvectors for L the minimal polynomial of L factors entirely into distinct linear factors. In particular, you need to understand what the minimal polynomial is, how it relates to the characteristic polynomial, and how to compute it. The next step is to analyze endomorphisms that are not diagonalizable. This involves using generalized eigenspaces instead of eigenspaces. If {λ 1,..., λ s } are the distinct eigenvalues of L and t i is the multiplicity of λ i in the minimal polynomial m L (x), then where V = V t1 (λ 1 ) V t2 (λ 2 ) V ts (λ s ) V ti (λ i ) is the t i -th generalized eigenspace for L. Of course you need to understand the meaning of the various terms, and the proof of this decomposition (Primary Decomposition). In the process we encountered the important notion of a Jordan basis and the associated notion of a Jordan canonical form for an endomorphism. You should understand how the form of the Jordan basis relates to the generalized eigenspaces. (That is, the meaning of columns and rows when we represent the Jordan basis as a stack.) Also, make sure you can compute the Jordan canonical form. Look at the examples in the supplementary material on the course web page concerned with the Jordan canonical form and Jordan bases. Questions: What is the dimension of C as an R-vector space? What is the dimension of C as a C-vector space? What is the dimension of Q as a Q-vector space? What is the dimension of R as a Q-vector space? Consider the space M n (C) of n n complex matrices as a C-vector space. What is its dimension? What is a basis for M n (C)? In order to find a matrix representation of a linear map, what is the first piece of data you need? Let ( ) 0 1 A = 1 0 and let L A : M 2 (C) M 2 (C) be the linear map that multiplies each matrix on the left by A. Find a matrix representation for L A. What is the determinant of L A? Consider the map T : R 2 R 2 that rotates each vector by π/2 in the counter clockwise direction. Find a matrix representation. -What is the determinant of the previous map? Having found a matrix representative, regard it now as a complex matrix. Find a diagonalization. -Can T be diagonalized over R? 2

Let V = C[x] 5 the vector space of polynomials with complex coefficients of degree at most 5. Let D : V V be the linear map that takes a polynomial f to its derivative f. Compute the Jordan canonical form and a Jordan basis for D. How many linearly independent eigenvectors does D have? How do you compute the HCF of a whole collection of polynomials? How does Bezout s lemma generalize to this situation? What does the previous question have to do with primary decomposition? True or false: The Jordan normal form of a linear map is completely determined by its characteristic polynomial and minimal polynomial. True or false: The Jordan normal form of a 6 6 matrix is completely determined by its characteristic polynomial and minimal polynomial. Suppose L is a linear map with a single eigenvalue l. What information about the Jordan normal form of L do you get from the dimension of the l-eigenspace? Let L be a linear map with a single eigenvalue 1. Suppose there exists a vector v such that (L 1) 100 v = 0, (L 1) 99 v 0. Prove that there exists a vector w such that (L 1) 2 w = 0 and (L 1)w 0. Suppose L is a linear map with a single eigenvalue l. What information about the Jordan normal form of L do you get from the degree of the minimal polynomial? III. We look at bilinear forms for a few reasons. (1) A positive-definite symmetric bilinear form on a real vector space allows us to measure length of vectors and gives a notion of orthogonality. This will be discussed below. (2) The quadratic form associated to a symmetric bilinear form comes up in the study of quadratic equations and normal forms for functions near critical points. (3) Alternating bilinear forms occur in differential geometry and classical mechanics, but were not discussed in this course. The main emphasis in (2) was the method of simplifying symmetric bilinear forms by diagonalization, using double operations. Make sure you know how to do this efficiently and correctly. It s easy to make mistakes (as I did in class) if you don t write things down, so be careful. Also, you should know: -How to compute the matrix of a bilinear form with respect to a basis. -The proof of the theorem on diagonalization. -How to find the change of basis matrix that gives you a diagonal form. -How to recover a symmetric bilinear form from the associated quadratic form. Note that this is necessary in order to move to the diagonalization. -The real and complex canonical forms, and how to compute them. Note that the theory of the real and complex canonical forms gives a complete classification of equivalence classes of quadratic forms for real and complex vector spaces. Questions: Consider R as an R-vector space and the bilinear map given by multiplication R R R (a, b) ab Let B be the basis {2}. What is the matrix of the bilinear form with respect to this basis? What is the real canonical form of the previous bilinear form? On C considered as an R-vector space consider the bilinear forms f(z, w) = R(zw) and g(z, w) = Im(zw) 3

Are f or g symmetric? If not, what property does either have? Let T : M 2 (R) M 2 (R) R be the bilinear form defined by T(A, B) = Tr(AB) Is T symmetric? Find a matrix representative for T. What are the real and complex canonical forms for T? Consider the bilinear form P : R 3 R 3 R that takes (v, w) to t (v w), where is the cross-product of vectors, is the dot product, and t is the vector (1, 1, 1) T. Check that P is bilinear. Is P symmetric? Find a matrix representative for P. Is the geometry of the curve x 2 + 2xy + 2y 2 = 1 in R 2 more similar to a circle or a hyperbola? Is the geometry of the curve x 2 + 4xy + 3y 2 = 1 more similar to a circle or a hyperbola? What is a positive definite blinear form? What is the real canonical form of a positive definite bilinear form? IV. Inner product spaces An inner product <, > on a vector space V is a special case of a quadratic form in the case of real vector spaces. But for complex vector spaces, the inner product is not linear in the second variable. Rather, it is conjugate linear i.e., < v, aw >= ā < v, w > for all v, w V, and a C. The motivation for this is that the natural inner product on C n that is used to measure lengths is given by < z, w >= Σz i w i For example, on C-itself, since it is R 2 as a real vector space, we know that the natural length-squared is < a + ib, a + ib >= a 2 + b 2. But this is exactly (a + ib)(a + ib). What are some examples of other inner products on R n or C n? The most important property to remember in both the real and complex case is that the product is positive definite: < v, v >> 0 for all v 0 in V. The inner product gives us the extra structure necessary to isolate a special class of bases, namely, the orthonormal bases. You should know the definition of an orthonormal basis, and some examples. Any inner product space has an orthonormal basis that you can construct starting from any basis using the Gram-Schmidt orthonormalization process. Be sure to review this procedure. The inner product allows us to carry over to an inner product space notions of Euclidean geometry, and many theorems also carry over, such as the Cauchy-Schwartz inequality and the triangle inequality. Review the proof of these inequalities. One can then investigate the interaction between the structure of an endomorphism and the inner product. In particular, we studied at a superficial level the notions of a self-adjoint map and an isometry. You should know the proof of the fact that given a self-adjoint map L : V V, V admits an orthonormal basis of eigenvectors for L. 4

Questions: What are some examples of self-adjoint maps? On C n? On R n? What are some examples of isometries on R 2, R 3 and, R 4? Can you describe all isometries from C to C (as a C vector space with the standard inner product)? Can you describe all isometries from R to R (as an R vector space with the standard inner product)? Let L : V V be an isometry. Show that V admits an orthonormal basis of eigenvectors for L. What is special about the eigenvalues of a self-adjoint map? Can you prove this? True or false: a matrix in M n (C) can be diagonalized if and only if it is self-adjoint. True or false: a symmetric matrix in M n (R) is self-adjoint with respect to any inner product on R n. Illustrate your answer to the previous question with some examples. Let L : R 3 R 3 be an isometry. True or false: If A is a matrix representative for L with respect to any basis, then A T A = I True or false: If A is any diagonalizable n n real matrix, then there is an orthogonal matrix P such that P 1 AP is diagonal. What is special about the eigenvalues of an isometry on a real inner product space? What is special about the eigenvalues of an isometry on a complex inner product space? Some important theorems, propositions, corollaries,... 1.1.4, 1.1.8, 1.2.12, 1.2.14, 1.2.15, 1.3.21, 1.3.22, 2.1.29, 2.1.36, 2.2.42, 2.2.47, 2.2.51, 3.1.56, 3.2.57, 3.2.60, 3.2.61, 3.2.64, 3.3.67, 3.3.69, 3.3.72, 3.3.73, 3.4.79, 3.4.82, 3.5.87, 3.6.92, 3.9.95, 4.1.101, 4.2.105, 4.3.110, 4.3.112, 4.4.114, 4.6.127, 5.1.137, 5.1.138, 5.2.145, 5.2.147, 5.3.149, 5.4.150, 5.4.152, 5.5.157, 5.5.159, 5.5.160. Needless to say, it is assumed that you will have a full understanding of the material surrounding the results listed above, especially the definitions and the examples. 5