A Proof of Fundamental Theorem of Algebra Through Linear Algebra due to Derksen. Anant R. Shastri. February 13, 2011
|
|
- Darleen Maxwell
- 5 years ago
- Views:
Transcription
1 A Proof of Fundamental Theorem of Algebra Through Linear Algebra due to Derksen February 13, 2011
2
3 MA106-Linear Algebra 2011
4 MA106-Linear Algebra 2011 We present a proof of the Fundamental Theorem of Algebra (FTA) Every non constant polynomial in one variable with coefficients in C has a root in C.
5 MA106-Linear Algebra 2011 We present a proof of the Fundamental Theorem of Algebra (FTA) Every non constant polynomial in one variable with coefficients in C has a root in C. through a sequence of easily do-able exercises. The proof uses elementary linear algebra except that we begin with the intermediate value theorem in proving that every odd degee real polynomial has a real root.
6 Based on an article in
7 Based on an article in Amer. Math. Monthly- 110,(2003), pp
8 Sketch of the Proof In what follows K will denote any field. However, we need worry about only two cases here: K is either R or C.
9 We begin with a basic result in real analysis:
10 We begin with a basic result in real analysis: Intermediate Value Theorem
11 We begin with a basic result in real analysis: Intermediate Value Theorem which immediately yields:
12 We begin with a basic result in real analysis: Intermediate Value Theorem which immediately yields: Every odd degree polynomial p(t) R[t] has a real root. It should be noted that there is no purely algebraic proof of FTA which does not use IVT. Indeed, all proofs of FTA use IVT explicitly or implicitly. The simple reason is that IVT is equivalent to any other axiom that is used in the construction of real numbers.
13 We begin with a basic result in real analysis: Intermediate Value Theorem which immediately yields: Every odd degree polynomial p(t) R[t] has a real root. It should be noted that there is no purely algebraic proof of FTA which does not use IVT. Indeed, all proofs of FTA use IVT explicitly or implicitly. The simple reason is that IVT is equivalent to any other axiom that is used in the construction of real numbers. From now onwards we only use linear algebra.
14 Sketch of the Proof Companion Matrix Let p(t) = t n + a 1 t n a n be a monic polynomial of degree n. Its companion matrix C p is defined to be the n n matrix C p = a n a n 1 a 1.
15 Sketch of the Proof Companion Matrix Let p(t) = t n + a 1 t n a n be a monic polynomial of degree n. Its companion matrix C p is defined to be the n n matrix C p = a n a n 1 a 1. Ex.1. Show that the characteristic polynomial of C p is p, i.e., det(c p ti n ) = ( 1) n p(t).
16 Ex. 2. Show that every non constant polynomial p(t) K[t] of degree n has a root in K iff every endomorphism K n K n has an eigenvalue in K
17 Ex. 2. Show that every non constant polynomial p(t) K[t] of degree n has a root in K iff every endomorphism K n K n has an eigenvalue in K iff every n n matrix over K has an eigenvalue in K.
18 Ex. 2. Show that every non constant polynomial p(t) K[t] of degree n has a root in K iff every endomorphism K n K n has an eigenvalue in K iff every n n matrix over K has an eigenvalue in K. Recall that by an endomorphism of a vector space V we mean a linear transformation V V.
19 Ex. 2. Show that every non constant polynomial p(t) K[t] of degree n has a root in K iff every endomorphism K n K n has an eigenvalue in K iff every n n matrix over K has an eigenvalue in K. Recall that by an endomorphism of a vector space V we mean a linear transformation V V. Ex. 3 Show that every R-linear map f : R 2n+1 R 2n+1 has a real eigenvalue.
20 Sketch of the Proof For positive integers r, let S 1 (K, r) denote the following statement: Every endomorphism A : K n K n has an eigenvector for all n not divisible by 2 r. Also let S 2 (K, r) denote the statement Any two commuting endomorphisms K n K n have a common eigenvector for all n not divisible by 2 r.
21 Sketch of the Proof For positive integers r, let S 1 (K, r) denote the following statement: Every endomorphism A : K n K n has an eigenvector for all n not divisible by 2 r. Also let S 2 (K, r) denote the statement Any two commuting endomorphisms K n K n have a common eigenvector for all n not divisible by 2 r. We shall prove one result over any field K and two special results for K = R and C.
22 Sketch of the Proof For positive integers r, let S 1 (K, r) denote the following statement: Every endomorphism A : K n K n has an eigenvector for all n not divisible by 2 r. Also let S 2 (K, r) denote the statement Any two commuting endomorphisms K n K n have a common eigenvector for all n not divisible by 2 r. We shall prove one result over any field K and two special results for K = R and C.
23 Sketch of Proof (a) S 1 (K, r) = S 2 (K, r), r 1.
24 Sketch of Proof (a) S 1 (K, r) = S 2 (K, r), r 1. (b) S 2 (R, 1) = S 1 (C, 1).
25 Sketch of Proof (a) S 1 (K, r) = S 2 (K, r), r 1. (b) S 2 (R, 1) = S 1 (C, 1). (c) S 1 (C, r) = S 1 (C, r + 1), r 1.
26 Sketch of Proof (a) S 1 (K, r) = S 2 (K, r), r 1. (b) S 2 (R, 1) = S 1 (C, 1). (c) S 1 (C, r) = S 1 (C, r + 1), r 1. Begin with IVT which is the same as S 1 (R, 1). Putting K = R in (a) we get S 2 (R, 1).Now (b) gives S 1 (C, 1) and repeated application of (c) gives S 1 (C, k) for all k 1.
27 Sketch of Proof (a) S 1 (K, r) = S 2 (K, r), r 1. (b) S 2 (R, 1) = S 1 (C, 1). (c) S 1 (C, r) = S 1 (C, r + 1), r 1. Begin with IVT which is the same as S 1 (R, 1). Putting K = R in (a) we get S 2 (R, 1).Now (b) gives S 1 (C, 1) and repeated application of (c) gives S 1 (C, k) for all k 1. Given n, write n = 2 k l where l is odd. Then S 1 (C, k + 1) implies that every polynomial of degree n has a root. And that completes the proof of FTA.
28 Ex. 4. Prove statement (a): S 1 (K, r) = S 2 (K, r).
29 Ex. 4. Prove statement (a): S 1 (K, r) = S 2 (K, r). We shall prove this by induction on the dimension n of the vector space.
30 Ex. 4. Prove statement (a): S 1 (K, r) = S 2 (K, r). We shall prove this by induction on the dimension n of the vector space. For n = 1 this is clear, since any non zero vector is an eigenvector for all endomorphisms.
31 Ex. 4. Prove statement (a): S 1 (K, r) = S 2 (K, r). We shall prove this by induction on the dimension n of the vector space. For n = 1 this is clear, since any non zero vector is an eigenvector for all endomorphisms. So assume that the statement is true for smaller values of n and let A, B be two commuting n n matrices over K, and n is not divisible by 2 r.
32 S 1 (K, r) implies S 2 (K, r) Let λ be an eigenvalue of A and put V 1 = N (A λ I ), V 2 = R(A λ I ). Since B commutes with A, it follows that B commutes with A λi ) also. Therefore B restricts to endomorphisms β : V 1 V 1 and β : V 2 V 2. (Refer: Tut. sheet 9.18.)
33 S 1 (K, r) implies S 2 (K, r) Let λ be an eigenvalue of A and put V 1 = N (A λ I ), V 2 = R(A λ I ). Since B commutes with A, it follows that B commutes with A λi ) also. Therefore B restricts to endomorphisms β : V 1 V 1 and β : V 2 V 2. (Refer: Tut. sheet 9.18.) By rank-nullity theorem, dim V 1 + dim V 2 = n and hence dim V 1 or dim V 2 is not divisible by 2 r.
34 S 1 (K, r) implies S 2 (K, r) Let λ be an eigenvalue of A and put V 1 = N (A λ I ), V 2 = R(A λ I ). Since B commutes with A, it follows that B commutes with A λi ) also. Therefore B restricts to endomorphisms β : V 1 V 1 and β : V 2 V 2. (Refer: Tut. sheet 9.18.) By rank-nullity theorem, dim V 1 + dim V 2 = n and hence dim V 1 or dim V 2 is not divisible by 2 r. If dim V 1 is not divisible by 2 r then β : V 1 V 1 has an eigenvector which is also the eigenvector for A.
35 S 1 (K, r) implies S 2 (K, r) Let λ be an eigenvalue of A and put V 1 = N (A λ I ), V 2 = R(A λ I ). Since B commutes with A, it follows that B commutes with A λi ) also. Therefore B restricts to endomorphisms β : V 1 V 1 and β : V 2 V 2. (Refer: Tut. sheet 9.18.) By rank-nullity theorem, dim V 1 + dim V 2 = n and hence dim V 1 or dim V 2 is not divisible by 2 r. If dim V 1 is not divisible by 2 r then β : V 1 V 1 has an eigenvector which is also the eigenvector for A. If not, then dim V 2 < n and not divisible by 2 r. Now we consider α, β : V 2 V 2 which are restrictions of A and B and hence are commuting endomorphisms. By induction we are through there is a common eigen vector v V 2 V for α and β which is then a common eigen vector for A and B as well.
36 Ex. 5 Show that the space HERM n (C) of all complex Hermitian n n matrices is a R vector space of dimension n 2.
37 Ex. 5 Show that the space HERM n (C) of all complex Hermitian n n matrices is a R vector space of dimension n 2. (Refer to Exercise 8.5 and a question in the Quiz.)
38 Ex. 5 Show that the space HERM n (C) of all complex Hermitian n n matrices is a R vector space of dimension n 2. (Refer to Exercise 8.5 and a question in the Quiz.) Recall that a matrix A is hermitian if it is equal to its transpose conjugate A. and the next one is from 8.6. Ex. 6 Given A M n (C), the mappings α A (B) = 1 2 (AB +BA ); β A (B) = 1 2ı (AB BA ) define R-linear maps HERM n (C) HERM n (C). Show that α A, β A commute with each other.
39 Answer: 4ıα A β A (B) = 2α A (AB BA ) = [A(AB BA ) + (AB BA )A ] = [A(AB + BA ) (AB + BA )A ] = 2ıβ A (AB + BA ) = 4ıβ A α A (B).
40 Ex. 7. If α A and β A have a common eigenvector then A has an eigenvalue in C.
41 Ex. 7. If α A and β A have a common eigenvector then A has an eigenvalue in C. Answer: If α A (B) = λb and β A (B) = µb then consider AB = (α A + ıβ A )(B) = (λ + ıµ)b.
42 Ex. 7. If α A and β A have a common eigenvector then A has an eigenvalue in C. Answer: If α A (B) = λb and β A (B) = µb then consider AB = (α A + ıβ A )(B) = (λ + ıµ)b. Since B is an eigenvector, at least one of the column vectors of B, say u 0.
43 Ex. 7. If α A and β A have a common eigenvector then A has an eigenvalue in C. Answer: If α A (B) = λb and β A (B) = µb then consider AB = (α A + ıβ A )(B) = (λ + ıµ)b. Since B is an eigenvector, at least one of the column vectors of B, say u 0. It follows that Au = (λ + ıµ)u and hence λ + ıµ is an eigenvalue for A.
44 Ex.8. Prove statement (b): S 2 (R, 1) = S 1 (C, 1). (Exercise 11.4)
45 Ex.8. Prove statement (b): S 2 (R, 1) = S 1 (C, 1). (Exercise 11.4) Solution: By Ex.6, given A M n (C), α A, β A : Herm n (C) Herm n (C) are two commuting endomorphisms of the real vector space Herm n which is of dimension n 2, by ex. 5.
46 Ex.8. Prove statement (b): S 2 (R, 1) = S 1 (C, 1). (Exercise 11.4) Solution: By Ex.6, given A M n (C), α A, β A : Herm n (C) Herm n (C) are two commuting endomorphisms of the real vector space Herm n which is of dimension n 2, by ex. 5. If n is odd, so is n 2.
47 Ex.8. Prove statement (b): S 2 (R, 1) = S 1 (C, 1). (Exercise 11.4) Solution: By Ex.6, given A M n (C), α A, β A : Herm n (C) Herm n (C) are two commuting endomorphisms of the real vector space Herm n which is of dimension n 2, by ex. 5. If n is odd, so is n 2. By Ex.4, it follows that α A, β A have a common eigenvector.
48 Ex.8. Prove statement (b): S 2 (R, 1) = S 1 (C, 1). (Exercise 11.4) Solution: By Ex.6, given A M n (C), α A, β A : Herm n (C) Herm n (C) are two commuting endomorphisms of the real vector space Herm n which is of dimension n 2, by ex. 5. If n is odd, so is n 2. By Ex.4, it follows that α A, β A have a common eigenvector. By Ex. 7, A has an eigenvalue.
49 Ex. 9. Show that the space Sym n (K) of symmetric n n matrices forms a subspace of dimension n(n + 1)/2 of M n (K). (Exercise 8.5)
50 Ex. 9. Show that the space Sym n (K) of symmetric n n matrices forms a subspace of dimension n(n + 1)/2 of M n (K). (Exercise 8.5) The next one is Ex
51 Ex. 9. Show that the space Sym n (K) of symmetric n n matrices forms a subspace of dimension n(n + 1)/2 of M n (K). (Exercise 8.5) The next one is Ex Ex. 10 Given A M n (K), show that φ A : B 1 2 (AB + BAt ); ψ A : B ABA t define two commuting endomorphisms of Sym n (K). Show that if B is a common eigenvector of φ A, ψ A, then (A 2 + aa + b I n )B = 0 for some a, b K; further if K = C, conclude that A has an eigenvalue.
52 Answer: The first part is easy.
53 Answer: The first part is easy. To see the second part, suppose and φ A (B) = AB + BA t = λb ψ A (B) = ABA t = µb
54 Answer: The first part is easy. To see the second part, suppose and φ A (B) = AB + BA t = λb ψ A (B) = ABA t = µb Multiply first relation by A on the left and use the second to obtain which is the same as A 2 B + µb λab = 0 (A 2 λa + µ I n )B = 0.
55 For the last part, first observe that since B is an eigenvector there is at least one column vector v which is non zero. Therefore (A 2 + aa + b I n )v = 0.
56 For the last part, first observe that since B is an eigenvector there is at least one column vector v which is non zero. Therefore (A 2 + aa + b I n )v = 0. Now write A 2 + aa + bi n = (A λ 1 I n )(A λ 2 I n ). If (A λ 2 I n )v = 0, then λ 2 is an eigenvalue of A and we are through.
57 For the last part, first observe that since B is an eigenvector there is at least one column vector v which is non zero. Therefore (A 2 + aa + b I n )v = 0. Now write A 2 + aa + bi n = (A λ 1 I n )(A λ 2 I n ). If (A λ 2 I n )v = 0, then λ 2 is an eigenvalue of A and we are through. Otherwise put u = (A λ 2 I n )v 0. Then (A λ 1 I n )u = 0 and hence λ 1 is an eigenvalue of A.
58 Ex. 11 Prove statement (c) S 1 (C, r) = S 1 (C, r + 1). Hence conclude that S 1 (C, r) is true for all r 1.
59 Ex. 11 Prove statement (c) S 1 (C, r) = S 1 (C, r + 1). Hence conclude that S 1 (C, r) is true for all r 1. Answer: Let n = 2 k l where 1 k r and l is odd. Let A M n (C). Then φ A, ψ A are two mutually commuting operators on Sym n (C) which is of dimension n(n + 1)/2 = 2 k 1 l(2 k l + 1) which is not divisible by 2 r.
60 Ex. 11 Prove statement (c) S 1 (C, r) = S 1 (C, r + 1). Hence conclude that S 1 (C, r) is true for all r 1. Answer: Let n = 2 k l where 1 k r and l is odd. Let A M n (C). Then φ A, ψ A are two mutually commuting operators on Sym n (C) which is of dimension n(n + 1)/2 = 2 k 1 l(2 k l + 1) which is not divisible by 2 r. By Ex. 10, with K = C along with the induction hypothesis, it follows that A has an eigenvalue.
61 We summerise what we did.
62 We summerise what we did. In order to prove that every non constant polynomial over complex numbers has a root we note that
63 We summerise what we did. In order to prove that every non constant polynomial over complex numbers has a root we note that by Ex.2, it is enough to show that every n n complex matrix has an eigenvalue.
64 We summerise what we did. In order to prove that every non constant polynomial over complex numbers has a root we note that by Ex.2, it is enough to show that every n n complex matrix has an eigenvalue. By Ex.8, this holds for odd n. This implies that S 1 (C, 1). By Ex. 11 applied repeatedly, we get S 1 (C, r) for all r. Given any polynomial of degree n, write n = 2 r l, where l is odd. Then S 1 (C, r + 1) implies that every polynomial of degree n has a root.
65 THANK YOU FOR YOUR ATTENTION
FUNDAMENTAL THEOREM of ALGEBRA through Linear Algebra. 18th August Anant R. Shastri I. I. T. Bombay
FUNDAMENTAL THEOREM of ALGEBRA through Linear Algebra Anant R. Shastri I. I. T. Bombay 18th August 2012 Teachers Enrichment Programme in Linear Algebra at IITB, Aug. 2012 Teachers Enrichment Programme
More informationQuantum Computing Lecture 2. Review of Linear Algebra
Quantum Computing Lecture 2 Review of Linear Algebra Maris Ozols Linear algebra States of a quantum system form a vector space and their transformations are described by linear operators Vector spaces
More informationSpectral Theorem for Self-adjoint Linear Operators
Notes for the undergraduate lecture by David Adams. (These are the notes I would write if I was teaching a course on this topic. I have included more material than I will cover in the 45 minute lecture;
More information6 Inner Product Spaces
Lectures 16,17,18 6 Inner Product Spaces 6.1 Basic Definition Parallelogram law, the ability to measure angle between two vectors and in particular, the concept of perpendicularity make the euclidean space
More 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 informationA = 3 1. We conclude that the algebraic multiplicity of the eigenvalues are both one, that is,
65 Diagonalizable Matrices It is useful to introduce few more concepts, that are common in the literature Definition 65 The characteristic polynomial of an n n matrix A is the function p(λ) det(a λi) Example
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 205 HOMEWORK #3 OFFICIAL SOLUTION. Problem 1: Find all eigenvalues and eigenvectors of the following linear transformations. (a) F = R, V = R 3,
MATH 205 HOMEWORK #3 OFFICIAL SOLUTION Problem 1: Find all eigenvalues and eigenvectors of the following linear transformations. a F = R, V = R 3, b F = R or C, V = F 2, T = T = 9 4 4 8 3 4 16 8 7 0 1
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 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 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 informationFoundations of Matrix Analysis
1 Foundations of Matrix Analysis In this chapter we recall the basic elements of linear algebra which will be employed in the remainder of the text For most of the proofs as well as for the details, the
More informationSymmetric and anti symmetric matrices
Symmetric and anti symmetric matrices In linear algebra, a symmetric matrix is a square matrix that is equal to its transpose. Formally, matrix A is symmetric if. A = A Because equal matrices have equal
More informationLinear Algebra using Dirac Notation: Pt. 2
Linear Algebra using Dirac Notation: Pt. 2 PHYS 476Q - Southern Illinois University February 6, 2018 PHYS 476Q - Southern Illinois University Linear Algebra using Dirac Notation: Pt. 2 February 6, 2018
More informationNotes on the matrix exponential
Notes on the matrix exponential Erik Wahlén erik.wahlen@math.lu.se February 14, 212 1 Introduction The purpose of these notes is to describe how one can compute the matrix exponential e A when A is not
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 informationZEROS OF POLYNOMIAL FUNCTIONS ALL I HAVE TO KNOW ABOUT POLYNOMIAL FUNCTIONS
ZEROS OF POLYNOMIAL FUNCTIONS ALL I HAVE TO KNOW ABOUT POLYNOMIAL FUNCTIONS TOOLS IN FINDING ZEROS OF POLYNOMIAL FUNCTIONS Synthetic Division and Remainder Theorem (Compressed Synthetic Division) Fundamental
More informationTHE MINIMAL POLYNOMIAL AND SOME APPLICATIONS
THE MINIMAL POLYNOMIAL AND SOME APPLICATIONS KEITH CONRAD. Introduction The easiest matrices to compute with are the diagonal ones. The sum and product of diagonal matrices can be computed componentwise
More informationMath 489AB Exercises for Chapter 2 Fall Section 2.3
Math 489AB Exercises for Chapter 2 Fall 2008 Section 2.3 2.3.3. Let A M n (R). Then the eigenvalues of A are the roots of the characteristic polynomial p A (t). Since A is real, p A (t) is a polynomial
More information4 Vector Spaces. 4.1 Basic Definition and Examples. Lecture 10
Lecture 10 4 Vector Spaces 4.1 Basic Definition and Examples Throughout mathematics we come across many types objects which can be added and multiplied by scalars to arrive at similar types of objects.
More informationLinear Algebra Practice Problems
Linear Algebra Practice Problems Math 24 Calculus III Summer 25, Session II. Determine whether the given set is a vector space. If not, give at least one axiom that is not satisfied. Unless otherwise stated,
More informationA linear algebra proof of the fundamental theorem of algebra
A linear algebra proof of the fundamental theorem of algebra Andrés E. Caicedo May 18, 2010 Abstract We present a recent proof due to Harm Derksen, that any linear operator in a complex finite dimensional
More informationA linear algebra proof of the fundamental theorem of algebra
A linear algebra proof of the fundamental theorem of algebra Andrés E. Caicedo May 18, 2010 Abstract We present a recent proof due to Harm Derksen, that any linear operator in a complex finite dimensional
More information1.4 Solvable Lie algebras
1.4. SOLVABLE LIE ALGEBRAS 17 1.4 Solvable Lie algebras 1.4.1 Derived series and solvable Lie algebras The derived series of a Lie algebra L is given by: L (0) = L, L (1) = [L, L],, L (2) = [L (1), L (1)
More informationLinear Algebra. Matrices Operations. Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0.
Matrices Operations Linear Algebra Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0 The rectangular array 1 2 1 4 3 4 2 6 1 3 2 1 in which the
More informationThe converse is clear, since
14. The minimal polynomial For an example of a matrix which cannot be diagonalised, consider the matrix ( ) 0 1 A =. 0 0 The characteristic polynomial is λ 2 = 0 so that the only eigenvalue is λ = 0. The
More informationProperties of Linear Transformations from R n to R m
Properties of Linear Transformations from R n to R m MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Topic Overview Relationship between the properties of a matrix transformation
More informationLINEAR ALGEBRA BOOT CAMP WEEK 2: LINEAR OPERATORS
LINEAR ALGEBRA BOOT CAMP WEEK 2: LINEAR OPERATORS Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F has characteristic zero. The following are facts
More informationOnline Exercises for Linear Algebra XM511
This document lists the online exercises for XM511. The section ( ) numbers refer to the textbook. TYPE I are True/False. Lecture 02 ( 1.1) Online Exercises for Linear Algebra XM511 1) The matrix [3 2
More informationMinimum Polynomials of Linear Transformations
Minimum Polynomials of Linear Transformations Spencer De Chenne University of Puget Sound 30 April 2014 Table of Contents Polynomial Basics Endomorphisms Minimum Polynomial Building Linear Transformations
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 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 informationMath 314H Solutions to Homework # 3
Math 34H Solutions to Homework # 3 Complete the exercises from the second maple assignment which can be downloaded from my linear algebra course web page Attach printouts of your work on this problem to
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 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 informationTopic 1: Matrix diagonalization
Topic : Matrix diagonalization Review of Matrices and Determinants Definition A matrix is a rectangular array of real numbers a a a m a A = a a m a n a n a nm The matrix is said to be of order n m if it
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 informationFirst we introduce the sets that are going to serve as the generalizations of the scalars.
Contents 1 Fields...................................... 2 2 Vector spaces.................................. 4 3 Matrices..................................... 7 4 Linear systems and matrices..........................
More informationMATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.
MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators. Adjoint operator and adjoint matrix Given a linear operator L on an inner product space V, the adjoint of L is a transformation
More informationLinear Algebra. Workbook
Linear Algebra Workbook Paul Yiu Department of Mathematics Florida Atlantic University Last Update: November 21 Student: Fall 2011 Checklist Name: A B C D E F F G H I J 1 2 3 4 5 6 7 8 9 10 xxx xxx xxx
More informationALGEBRA 8: Linear algebra: characteristic polynomial
ALGEBRA 8: Linear algebra: characteristic polynomial Characteristic polynomial Definition 8.1. Consider a linear operator A End V over a vector space V. Consider a vector v V such that A(v) = λv. This
More informationEquality: Two matrices A and B are equal, i.e., A = B if A and B have the same order and the entries of A and B are the same.
Introduction Matrix Operations Matrix: An m n matrix A is an m-by-n array of scalars from a field (for example real numbers) of the form a a a n a a a n A a m a m a mn The order (or size) of A is m n (read
More 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 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 informationMath 304 Fall 2018 Exam 3 Solutions 1. (18 Points, 3 Pts each part) Let A, B, C, D be square matrices of the same size such that
Math 304 Fall 2018 Exam 3 Solutions 1. (18 Points, 3 Pts each part) Let A, B, C, D be square matrices of the same size such that det(a) = 2, det(b) = 2, det(c) = 1, det(d) = 4. 2 (a) Compute det(ad)+det((b
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 informationMath 408 Advanced Linear Algebra
Math 408 Advanced Linear Algebra Chi-Kwong Li Chapter 4 Hermitian and symmetric matrices Basic properties Theorem Let A M n. The following are equivalent. Remark (a) A is Hermitian, i.e., A = A. (b) x
More informationMath Linear Algebra Final Exam Review Sheet
Math 15-1 Linear Algebra Final Exam Review Sheet Vector Operations Vector addition is a component-wise operation. Two vectors v and w may be added together as long as they contain the same number n of
More informationEigenvalues and Eigenvectors 7.2 Diagonalization
Eigenvalues and Eigenvectors 7.2 Diagonalization November 8 Goals Suppose A is square matrix of order n. Provide necessary and sufficient condition when there is an invertible matrix P such that P 1 AP
More informationNotes on basis changes and matrix diagonalization
Notes on basis changes and matrix diagonalization Howard E Haber Santa Cruz Institute for Particle Physics, University of California, Santa Cruz, CA 95064 April 17, 2017 1 Coordinates of vectors and matrix
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 informationEigenvectors. Prop-Defn
Eigenvectors Aim lecture: The simplest T -invariant subspaces are 1-dim & these give rise to the theory of eigenvectors. To compute these we introduce the similarity invariant, the characteristic polynomial.
More 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 informationJUST THE MATHS UNIT NUMBER 9.8. MATRICES 8 (Characteristic properties) & (Similarity transformations) A.J.Hobson
JUST THE MATHS UNIT NUMBER 9.8 MATRICES 8 (Characteristic properties) & (Similarity transformations) by A.J.Hobson 9.8. Properties of eigenvalues and eigenvectors 9.8. Similar matrices 9.8.3 Exercises
More informationHOMEWORK 7 solutions
Math 4377/6308 Advanced Linear Algebra I Dr. Vaughn Climenhaga, PGH 651A Fall 2013 HOMEWORK 7 solutions Due 4pm Wednesday, October 16. You will be graded not only on the correctness of your answers but
More informationGENERALIZED EIGENVECTORS, MINIMAL POLYNOMIALS AND THEOREM OF CAYLEY-HAMILTION
GENERALIZED EIGENVECTORS, MINIMAL POLYNOMIALS AND THEOREM OF CAYLEY-HAMILTION FRANZ LUEF Abstract. Our exposition is inspired by S. Axler s approach to linear algebra and follows largely his exposition
More informationChapter 5. Linear Algebra. A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form
Chapter 5. Linear Algebra A linear (algebraic) equation in n unknowns, x 1, x 2,..., x n, is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b where a 1, a 2,..., a n and b are real numbers. 1
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 informationSolutions to Exam I MATH 304, section 6
Solutions to Exam I MATH 304, section 6 YOU MUST SHOW ALL WORK TO GET CREDIT. Problem 1. Let A = 1 2 5 6 1 2 5 6 3 2 0 0 1 3 1 1 2 0 1 3, B =, C =, I = I 0 0 0 1 1 3 4 = 4 4 identity matrix. 3 1 2 6 0
More informationMathematical Methods wk 2: Linear Operators
John Magorrian, magog@thphysoxacuk These are work-in-progress notes for the second-year course on mathematical methods The most up-to-date version is available from http://www-thphysphysicsoxacuk/people/johnmagorrian/mm
More informationGROUPS. Chapter-1 EXAMPLES 1.1. INTRODUCTION 1.2. BINARY OPERATION
Chapter-1 GROUPS 1.1. INTRODUCTION The theory of groups arose from the theory of equations, during the nineteenth century. Originally, groups consisted only of transformations. The group of transformations
More information22.3. Repeated Eigenvalues and Symmetric Matrices. Introduction. Prerequisites. Learning Outcomes
Repeated Eigenvalues and Symmetric Matrices. Introduction In this Section we further develop the theory of eigenvalues and eigenvectors in two distinct directions. Firstly we look at matrices where one
More informationFinal A. Problem Points Score Total 100. Math115A Nadja Hempel 03/23/2017
Final A Math115A Nadja Hempel 03/23/2017 nadja@math.ucla.edu Name: UID: Problem Points Score 1 10 2 20 3 5 4 5 5 9 6 5 7 7 8 13 9 16 10 10 Total 100 1 2 Exercise 1. (10pt) Let T : V V be a linear transformation.
More informationTravis Schedler. Thurs, Oct 27, 2011 (version: Thurs, Oct 27, 1:00 PM)
Lecture 13: Proof of existence of upper-triangular matrices for complex linear transformations; invariant subspaces and block upper-triangular matrices for real linear transformations (1) Travis Schedler
More 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 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 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 informationMATRICES. knowledge on matrices Knowledge on matrix operations. Matrix as a tool of solving linear equations with two or three unknowns.
MATRICES After studying this chapter you will acquire the skills in knowledge on matrices Knowledge on matrix operations. Matrix as a tool of solving linear equations with two or three unknowns. List of
More informationLinear Algebra: Matrix Eigenvalue Problems
CHAPTER8 Linear Algebra: Matrix Eigenvalue Problems Chapter 8 p1 A matrix eigenvalue problem considers the vector equation (1) Ax = λx. 8.0 Linear Algebra: Matrix Eigenvalue Problems Here A is a given
More informationMATH 320: PRACTICE PROBLEMS FOR THE FINAL AND SOLUTIONS
MATH 320: PRACTICE PROBLEMS FOR THE FINAL AND SOLUTIONS There will be eight problems on the final. The following are sample problems. Problem 1. Let F be the vector space of all real valued functions on
More informationLinear Algebra Practice Problems
Math 7, Professor Ramras Linear Algebra Practice Problems () Consider the following system of linear equations in the variables x, y, and z, in which the constants a and b are real numbers. x y + z = a
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 511 ADVANCED LINEAR ALGEBRA SPRING 2006
MATH 511 ADVANCED LINEAR ALGEBRA SPRING 2006 Sherod Eubanks HOMEWORK 2 2.1 : 2, 5, 9, 12 2.3 : 3, 6 2.4 : 2, 4, 5, 9, 11 Section 2.1: Unitary Matrices Problem 2 If λ σ(u) and U M n is unitary, show that
More informationEXERCISES AND SOLUTIONS IN LINEAR ALGEBRA
EXERCISES AND SOLUTIONS IN LINEAR ALGEBRA Mahmut Kuzucuoğlu Middle East Technical University matmah@metu.edu.tr Ankara, TURKEY March 14, 015 ii TABLE OF CONTENTS CHAPTERS 0. PREFACE..................................................
More informationRepeated Eigenvalues and Symmetric Matrices
Repeated Eigenvalues and Symmetric Matrices. Introduction In this Section we further develop the theory of eigenvalues and eigenvectors in two distinct directions. Firstly we look at matrices where one
More informationLinear Algebra 1. M.T.Nair Department of Mathematics, IIT Madras. and in that case x is called an eigenvector of T corresponding to the eigenvalue λ.
Linear Algebra 1 M.T.Nair Department of Mathematics, IIT Madras 1 Eigenvalues and Eigenvectors 1.1 Definition and Examples Definition 1.1. Let V be a vector space (over a field F) and T : V V be a linear
More informationMATH 2331 Linear Algebra. Section 2.1 Matrix Operations. Definition: A : m n, B : n p. Example: Compute AB, if possible.
MATH 2331 Linear Algebra Section 2.1 Matrix Operations Definition: A : m n, B : n p ( 1 2 p ) ( 1 2 p ) AB = A b b b = Ab Ab Ab Example: Compute AB, if possible. 1 Row-column rule: i-j-th entry of AB:
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 informationLecture 2: Linear operators
Lecture 2: Linear operators Rajat Mittal IIT Kanpur The mathematical formulation of Quantum computing requires vector spaces and linear operators So, we need to be comfortable with linear algebra to study
More information3 Matrix Algebra. 3.1 Operations on matrices
3 Matrix Algebra A matrix is a rectangular array of numbers; it is of size m n if it has m rows and n columns. A 1 n matrix is a row vector; an m 1 matrix is a column vector. For example: 1 5 3 5 3 5 8
More informationFrom Lay, 5.4. If we always treat a matrix as defining a linear transformation, what role does diagonalisation play?
Overview Last week introduced the important Diagonalisation Theorem: An n n matrix A is diagonalisable if and only if there is a basis for R n consisting of eigenvectors of A. This week we ll continue
More informationMath 217: Eigenspaces and Characteristic Polynomials Professor Karen Smith
Math 217: Eigenspaces and Characteristic Polynomials Professor Karen Smith (c)2015 UM Math Dept licensed under a Creative Commons By-NC-SA 4.0 International License. Definition: Let V T V be a linear transformation.
More informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2016 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
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 informationAnnouncements Wednesday, November 01
Announcements Wednesday, November 01 WeBWorK 3.1, 3.2 are due today at 11:59pm. The quiz on Friday covers 3.1, 3.2. My office is Skiles 244. Rabinoffice hours are Monday, 1 3pm and Tuesday, 9 11am. Section
More informationThe Jordan Normal Form and its Applications
The and its Applications Jeremy IMPACT Brigham Young University A square matrix A is a linear operator on {R, C} n. A is diagonalizable if and only if it has n linearly independent eigenvectors. What happens
More information1. Foundations of Numerics from Advanced Mathematics. Linear Algebra
Foundations of Numerics from Advanced Mathematics Linear Algebra Linear Algebra, October 23, 22 Linear Algebra Mathematical Structures a mathematical structure consists of one or several sets and one or
More informationMath 346 Notes on Linear Algebra
Math 346 Notes on Linear Algebra Ethan Akin Mathematics Department Fall, 2014 1 Vector Spaces Anton Chapter 4, Section 4.1 You should recall the definition of a vector as an object with magnitude and direction
More informationMath 554 Qualifying Exam. You may use any theorems from the textbook. Any other claims must be proved in details.
Math 554 Qualifying Exam January, 2019 You may use any theorems from the textbook. Any other claims must be proved in details. 1. Let F be a field and m and n be positive integers. Prove the following.
More informationBASIC 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
BASIC ALGORITHMS IN LINEAR ALGEBRA STEVEN DALE CUTKOSKY Matrices and Applications of Gaussian Elimination Systems of Equations Suppose that A is an n n matrix with coefficents in a field F, and x = (x,,
More informationAssignment 1 Math 5341 Linear Algebra Review. Give complete answers to each of the following questions. Show all of your work.
Assignment 1 Math 5341 Linear Algebra Review Give complete answers to each of the following questions Show all of your work Note: You might struggle with some of these questions, either because it has
More informationA matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and
Section 5.5. Matrices and Vectors A matrix is a rectangular array of objects arranged in rows and columns. The objects are called the entries. A matrix with m rows and n columns is called an m n matrix.
More informationCSL361 Problem set 4: Basic linear algebra
CSL361 Problem set 4: Basic linear algebra February 21, 2017 [Note:] If the numerical matrix computations turn out to be tedious, you may use the function rref in Matlab. 1 Row-reduced echelon matrices
More informationMTH 464: Computational Linear Algebra
MTH 464: Computational Linear Algebra Lecture Outlines Exam 2 Material Prof. M. Beauregard Department of Mathematics & Statistics Stephen F. Austin State University March 2, 2018 Linear Algebra (MTH 464)
More informationGRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory.
GRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory. Linear Algebra Standard matrix manipulation to compute the kernel, intersection of subspaces, column spaces,
More informationMath 121 Practice Final Solutions
Math Practice Final Solutions December 9, 04 Email me at odorney@college.harvard.edu with any typos.. True or False. (a) If B is a 6 6 matrix with characteristic polynomial λ (λ ) (λ + ), then rank(b)
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 informationApplied Mathematics 205. Unit V: Eigenvalue Problems. Lecturer: Dr. David Knezevic
Applied Mathematics 205 Unit V: Eigenvalue Problems Lecturer: Dr. David Knezevic Unit V: Eigenvalue Problems Chapter V.2: Fundamentals 2 / 31 Eigenvalues and Eigenvectors Eigenvalues and eigenvectors of
More informationA matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and
Section 5.5. Matrices and Vectors A matrix is a rectangular array of objects arranged in rows and columns. The objects are called the entries. A matrix with m rows and n columns is called an m n matrix.
More informationEcon Slides from Lecture 7
Econ 205 Sobel Econ 205 - Slides from Lecture 7 Joel Sobel August 31, 2010 Linear Algebra: Main Theory A linear combination of a collection of vectors {x 1,..., x k } is a vector of the form k λ ix i for
More information