FUNDAMENTAL THEOREM of ALGEBRA through Linear Algebra. 18th August Anant R. Shastri I. I. T. Bombay
|
|
- Cecil Berry
- 5 years ago
- Views:
Transcription
1 FUNDAMENTAL THEOREM of ALGEBRA through Linear Algebra Anant R. Shastri I. I. T. Bombay 18th August 2012
2
3 Teachers Enrichment Programme in Linear Algebra at IITB, Aug. 2012
4 Teachers Enrichment Programme in Linear Algebra at IITB, Aug We present a proof of Fundamental Theorem of Algebra through a sequence of easily do-able exercises in Linear Algebra except one single result in elementary real anaylsis, viz., the intermediate value theorem.
5 Based on an article in
6 Based on an article in Amer. Math. Monthly- 110,(2003), pp by Derksen, a German Mathematician.
7 In what follows K will denote any field. However, we need to take K to be either R or C.
8 Ex. 1 Show that every odd degree polynomial P(t) R[t] has a real root.
9 Ex. 1 Show that every odd degree polynomial P(t) R[t] has a real root. This is where Intermediate Value Theorem is used.
10 Ex. 1 Show that every odd degree polynomial P(t) R[t] has a real root. This is where Intermediate Value Theorem is used. We may assume P(t) = t n + a 1 t n 1 + and see that as t +, p(t) +, and
11 Ex. 1 Show that every odd degree polynomial P(t) R[t] has a real root. This is where Intermediate Value Theorem is used. We may assume P(t) = t n + a 1 t n 1 + and see that as t +, p(t) +, and As t, P(t). It follows that there exist t 0 R such that P(t 0 ) = 0.
12 Ex. 1 Show that every odd degree polynomial P(t) R[t] has a real root. This is where Intermediate Value Theorem is used. We may assume P(t) = t n + a 1 t n 1 + and see that as t +, p(t) +, and As t, P(t). It follows that there exist t 0 R such that P(t 0 ) = 0. From now onwards we only use linear algebra.
13 Companion Matrix Let P(t) = t n + a 1 t n a n be a monic polynominal of degree n. Its companian matrix C P is defined to be the n n matrix C P = a n a n 1 a 1.
14 Companion Matrix Let P(t) = t n + a 1 t n a n be a monic polynominal of degree n. Its companian matrix C P is defined to be the n n matrix C P = a n a n 1 a 1 Ex. 2 Show that det(ti n C P ) = P(t)..
15 Ex. 3 Show that every non constant polynomial P(t) K[t] of degree n has a root in K iff every linear map K n K n has an eigen value in K.
16 Ex. 4 Show that every R-linear map f : R 2n+1 R 2n+1 has real eigen value.
17 Ex. 5 Show that the space HERM n (C) of all complex Hermitian n n matrices (i.e., all A such that A = A) is a R-vector space of dimension n 2.
18 Ex. 5 Show that the space HERM n (C) of all complex Hermitian n n matrices (i.e., all A such that A = A) is a R-vector space of dimension n 2. 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.
19 Answer: α A β A (B) = 1 4ı α A(AB BA ) = 1 4ı [A(AB BA ) + (AB BA )A ] = 1 4ı [A(AB + BA ) (AB + BA )A ] = 1 4ı β A α A (B).
20 Ex. 7 If α A and β A have a common eigen vector then A has an eigen value in C.
21 Ex. 7 If α A and β A have a common eigen vector then A has an eigen value in C. Answer: If α A (B) = λb and β A (B) = µb then consider AB = (α A + ıβ A )(B) = (λ + ıµ)b.
22 Ex. 7 If α A and β A have a common eigen vector then A has an eigen value in C. Answer: If α A (B) = λb and β A (B) = µb then consider AB = (α A + ıβ A )(B) = (λ + ıµ)b. Since B is an eigen vector, at least one of the column vectors, say u 0.
23 Ex. 7 If α A and β A have a common eigen vector then A has an eigen value in C. Answer: If α A (B) = λb and β A (B) = µb then consider AB = (α A + ıβ A )(B) = (λ + ıµ)b. Since B is an eigen vector, at least one of the column vectors, say u 0. It follows that Au = (λ + ıµ)u and hence λ + ıµ is an eigen value for A.
24 Ex. 8 Show that any two commuting linear maps α, β : R 2n+1 R 2n+1 have a common eigen vector.
25 Ex. 8 Show that any two commuting linear maps α, β : R 2n+1 R 2n+1 have a common eigen vector. Answer: Use induction and subspaces kernel and image of α λi n where λ is an eigen value of α.
26 Put Ker α λi n = V, and Range(α λi n ) = W.
27 Put Ker α λi n = V, and Range(α λi n ) = W. Then β(v ) V and β(w ) W. Also α(v ) V ; α(w ) W.
28 Put Ker α λi n = V, and Range(α λi n ) = W. Then β(v ) V and β(w ) W. Also α(v ) V ; α(w ) W. If V is of odd dimension then any eigen vector of β will do.
29 Put Ker α λi n = V, and Range(α λi n ) = W. Then β(v ) V and β(w ) W. Also α(v ) V ; α(w ) W. If V is of odd dimension then any eigen vector of β will do. Otherwise W is odd dimension strictly less than 2n + 1. So induction works for α, β : W W.
30 Ex. 9 Every C-linear map A : C 2n+1 C 2n+1 has an eigen value.
31 Ex. 9 Every C-linear map A : C 2n+1 C 2n+1 has an eigen value. Solution: By Ex. 5 and Ex. 8, α A, β A : Herm 2n+1 Herm 2n+1 have a common eigenvector.
32 Ex. 9 Every C-linear map A : C 2n+1 C 2n+1 has an eigen value. Solution: By Ex. 5 and Ex. 8, α A, β A : Herm 2n+1 Herm 2n+1 have a common eigenvector. By Ex. 7, A has an eigenvalue.
33 Ex. 10 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).
34 Ex. 10 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). Ex. 11 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 eigen vector of φ A, ψ A then (A 2 + aa + bid)b = 0 for some a, b K. Further if K = C, conclude that A has an eigen value.
35 Answer: The first part is easy.
36 Answer: The first part is easy. To see the second part, suppose and φ A (B) = AB + BA t = λb ψ A (B) = ABA t = µb
37 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 + µid)b = 0.
38 For the last part, first observe that since B is an eigen vector there is atleast one column vector v which is non zero. Therefore (A 2 + aa + b)v = 0.
39 For the last part, first observe that since B is an eigen vector there is atleast one column vector v which is non zero. Therefore (A 2 + aa + b)v = 0. Now write A 2 + aa + bid = (A λ 1 Id)(A λ 2 Id). If (A λ 2 Id)v = 0 then λ 2 is an eigen value of A. and we are through.
40 For the last part, first observe that since B is an eigen vector there is atleast one column vector v which is non zero. Therefore (A 2 + aa + b)v = 0. Now write A 2 + aa + bid = (A λ 1 Id)(A λ 2 Id). If (A λ 2 Id)v = 0 then λ 2 is an eigen value of A. and we are through. Otherwise u = (A λ 2 Id) 0 and (A λ 1 Id)u = 0 and hence λ 1 is an eigen value of A.
41 Let S 1 (K, r) denote the following statement: Any endomorphism A : K n K n has an eigen value for all n not divisible by 2 r. Let S 2 (K, r) denote the statement: Any two commuting endomorphisms A 1, A 2 : K n K n have a common eigen vector for all n not divisible by 2 r.
42 Let S 1 (K, r) denote the following statement: Any endomorphism A : K n K n has an eigen value for all n not divisible by 2 r. Let S 2 (K, r) denote the statement: Any two commuting endomorphisms A 1, A 2 : K n K n have a common eigen vector for all n not divisible by 2 r. Ex. 12 Prove that S 1 (K, r) = S 2 (K, r).
43 Let S 1 (K, r) denote the following statement: Any endomorphism A : K n K n has an eigen value for all n not divisible by 2 r. Let S 2 (K, r) denote the statement: Any two commuting endomorphisms A 1, A 2 : K n K n have a common eigen vector for all n not divisible by 2 r. Ex. 12 Prove that S 1 (K, r) = S 2 (K, r). Answer: Exactly as in Ex. 8.
44 Ex. 13 Prove that S 1 (C, r) = S 1 (C, r + 1).
45 Ex. 13 Prove that S 1 (C, r) = S 1 (C, r + 1). Answer: Let n = 2 k m where m is odd and k r. 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 m(2 k m + 1) which is not divisible by 2 r.
46 Ex. 13 Prove that S 1 (C, r) = S 1 (C, r + 1). Answer: Let n = 2 k m where m is odd and k r. 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 m(2 k m + 1) which is not divisible by 2 r. Therefore S 1 (C, r) together with Ex. 12 implies that φ A, ψ A have a common eigen vector.
47 Ex. 13 Prove that S 1 (C, r) = S 1 (C, r + 1). Answer: Let n = 2 k m where m is odd and k r. 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 m(2 k m + 1) which is not divisible by 2 r. Therefore S 1 (C, r) together with Ex. 12 implies that φ A, ψ A have a common eigen vector. By Ex. 11, this implies A has an eigen value in C.
48 Ex. 14 Conclude that every non constant polynomial over complex numbers has a root.
49 Ex. 14 Conclude that every non constant polynomial over complex numbers has a root. Answer:
50 Ex. 14 Conclude that every non constant polynomial over complex numbers has a root. Answer: By Ex.3, it is enough to show that every n n complex matrix has an eigen value.
51 Ex. 14 Conclude that every non constant polynomial over complex numbers has a root. Answer: By Ex.3, it is enough to show that every n n complex matrix has an eigen value. By Ex.9 this holds for odd n. This implies S 1 (C, 1). By Ex. 13 applied repeatedly, we get S 1 (C, r) for all r. Write n = 2 r m where m is odd. Then S 1 (C, r + 1) implies every endomorphism A : C n C n has an eigenvalue.
52 THANK YOU FOR YOUR ATTENTION
A Proof of Fundamental Theorem of Algebra Through Linear Algebra due to Derksen. Anant R. Shastri. February 13, 2011
A Proof of Fundamental Theorem of Algebra Through Linear Algebra due to Derksen February 13, 2011 MA106-Linear Algebra 2011 MA106-Linear Algebra 2011 We present a proof of the Fundamental Theorem of Algebra
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 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 informationA proof of the Jordan normal form theorem
A proof of the Jordan normal form theorem Jordan normal form theorem states that any matrix is similar to a blockdiagonal matrix with Jordan blocks on the diagonal. To prove it, we first reformulate it
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 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 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 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 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 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 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 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 informationMAS4107 Linear Algebra 2
General Prerequisites MAS4107 Linear Algebra 2 Peter Sin University of Florida email: sin@math.ufl.edu Familiarity with the notion of mathematical proof and some experience in reading and writing proofs.
More informationDiagonalization of Matrix
of Matrix King Saud University August 29, 2018 of Matrix Table of contents 1 2 of Matrix Definition If A M n (R) and λ R. We say that λ is an eigenvalue of the matrix A if there is X R n \ {0} such that
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 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 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 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 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 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 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 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 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 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 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 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 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 informationUnit 5: Matrix diagonalization
Unit 5: Matrix diagonalization Juan Luis Melero and Eduardo Eyras October 2018 1 Contents 1 Matrix diagonalization 3 1.1 Definitions............................. 3 1.1.1 Similar matrix.......................
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 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 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 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 information0.1 Diagonalization and its Applications
.. DIAGONALIZATION AND ITS APPLICATIONS. Diagonalization and its Applications Exercise.. Let A be a -matrix whose characteristic polynomial is A (t) = t t + t +. a) Express A in term of powers A, A, and
More informationExample: Filter output power. maximization. Definition. Eigenvalues, eigenvectors and similarity. Example: Stability of linear systems.
Lecture 2: Eigenvalues, eigenvectors and similarity The single most important concept in matrix theory. German word eigen means proper or characteristic. KTH Signal Processing 1 Magnus Jansson/Emil Björnson
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.1 Eigenvalues and Eigenvecto
7.1 November 6 7.1 Eigenvalues and Eigenvecto Goals Suppose A is square matrix of order n. Eigenvalues of A will be defined. Eigenvectors of A, corresponding to each eigenvalue, will be defined. Eigenspaces
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 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 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 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 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 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 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 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 informationRemark By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.
Sec 6 Eigenvalues and Eigenvectors Definition An eigenvector of an n n matrix A is a nonzero vector x such that A x λ x for some scalar λ A scalar λ is called an eigenvalue of A if there is a nontrivial
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 informationHomework For each of the following matrices, find the minimal polynomial and determine whether the matrix is diagonalizable.
Math 5327 Fall 2018 Homework 7 1. For each of the following matrices, find the minimal polynomial and determine whether the matrix is diagonalizable. 3 1 0 (a) A = 1 2 0 1 1 0 x 3 1 0 Solution: 1 x 2 0
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 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 informationOn common eigenbases of commuting operators
On common eigenbases of commuting operators Paolo Glorioso In this note we try to answer the question: Given two commuting Hermitian operators A and B, is each eigenbasis of A also an eigenbasis of B?
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 informationMatrix Theory, Math6304 Lecture Notes from September 27, 2012 taken by Tasadduk Chowdhury
Matrix Theory, Math634 Lecture Notes from September 27, 212 taken by Tasadduk Chowdhury Last Time (9/25/12): QR factorization: any matrix A M n has a QR factorization: A = QR, whereq is unitary and R is
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 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 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 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 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 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 2018 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
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 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 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 informationTherefore, A and B have the same characteristic polynomial and hence, the same eigenvalues.
Similar Matrices and Diagonalization Page 1 Theorem If A and B are n n matrices, which are similar, then they have the same characteristic equation and hence the same eigenvalues. Proof Let A and B be
More informationProblem # Max points possible Actual score Total 120
FINAL EXAMINATION - MATH 2121, FALL 2017. Name: ID#: Email: Lecture & Tutorial: Problem # Max points possible Actual score 1 15 2 15 3 10 4 15 5 15 6 15 7 10 8 10 9 15 Total 120 You have 180 minutes to
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 informationMath 113 Homework 5. Bowei Liu, Chao Li. Fall 2013
Math 113 Homework 5 Bowei Liu, Chao Li Fall 2013 This homework is due Thursday November 7th at the start of class. Remember to write clearly, and justify your solutions. Please make sure to put your name
More informationMath Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88
Math Camp 2010 Lecture 4: Linear Algebra Xiao Yu Wang MIT Aug 2010 Xiao Yu Wang (MIT) Math Camp 2010 08/10 1 / 88 Linear Algebra Game Plan Vector Spaces Linear Transformations and Matrices Determinant
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 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 informationSolution for Homework 5
Solution for Homework 5 ME243A/ECE23A Fall 27 Exercise 1 The computation of the reachable subspace in continuous time can be handled easily introducing the concepts of inner product, orthogonal complement
More informationJordan blocks. Defn. Let λ F, n Z +. The size n Jordan block with e-value λ is the n n upper triangular matrix. J n (λ) =
Jordan blocks Aim lecture: Even over F = C, endomorphisms cannot always be represented by a diagonal matrix. We give Jordan s answer, to what is the best form of the representing matrix. Defn Let λ F,
More informationFurther linear algebra. Chapter IV. Jordan normal form.
Further linear algebra. Chapter IV. Jordan normal form. Andrei Yafaev In what follows V is a vector space of dimension n and B is a basis of V. In this chapter we are concerned with linear maps T : V V.
More informationRemark 1 By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.
Sec 5 Eigenvectors and Eigenvalues In this chapter, vector means column vector Definition An eigenvector of an n n matrix A is a nonzero vector x such that A x λ x for some scalar λ A scalar λ is called
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 informationLinear algebra and differential equations (Math 54): Lecture 13
Linear algebra and differential equations (Math 54): Lecture 13 Vivek Shende March 3, 016 Hello and welcome to class! Last time We discussed change of basis. This time We will introduce the notions of
More informationJUST THE MATHS SLIDES NUMBER 9.6. MATRICES 6 (Eigenvalues and eigenvectors) A.J.Hobson
JUST THE MATHS SLIDES NUMBER 96 MATRICES 6 (Eigenvalues and eigenvectors) by AJHobson 96 The statement of the problem 962 The solution of the problem UNIT 96 - MATRICES 6 EIGENVALUES AND EIGENVECTORS 96
More informationEigenvalues and Eigenvectors
Eigenvalues and Eigenvectors week -2 Fall 26 Eigenvalues and eigenvectors The most simple linear transformation from R n to R n may be the transformation of the form: T (x,,, x n ) (λ x, λ 2,, λ n x n
More informationM3/4/5P12 PROBLEM SHEET 1
M3/4/5P12 PROBLEM SHEET 1 Please send any corrections or queries to jnewton@imperialacuk Exercise 1 (1) Let G C 4 C 2 s, t : s 4 t 2 e, st ts Let V C 2 with the stard basis Consider the linear transformations
More informationMTH 102: Linear Algebra Department of Mathematics and Statistics Indian Institute of Technology - Kanpur. Problem Set
MTH 102: Linear Algebra Department of Mathematics and Statistics Indian Institute of Technology - Kanpur Problem Set 6 Problems marked (T) are for discussions in Tutorial sessions. 1. Find the eigenvalues
More informationSUPPLEMENT TO CHAPTERS VII/VIII
SUPPLEMENT TO CHAPTERS VII/VIII The characteristic polynomial of an operator Let A M n,n (F ) be an n n-matrix Then the characteristic polynomial of A is defined by: C A (x) = det(xi A) where I denotes
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 informationMATH 304 Linear Algebra Lecture 34: Review for Test 2.
MATH 304 Linear Algebra Lecture 34: Review for Test 2. Topics for Test 2 Linear transformations (Leon 4.1 4.3) Matrix transformations Matrix of a linear mapping Similar matrices Orthogonality (Leon 5.1
More informationand let s calculate the image of some vectors under the transformation T.
Chapter 5 Eigenvalues and Eigenvectors 5. Eigenvalues and Eigenvectors Let T : R n R n be a linear transformation. Then T can be represented by a matrix (the standard matrix), and we can write T ( v) =
More informationAlgebra I Fall 2007
MIT OpenCourseWare http://ocw.mit.edu 18.701 Algebra I Fall 007 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.701 007 Geometry of the Special Unitary
More informationMath Ordinary Differential Equations
Math 411 - Ordinary Differential Equations Review Notes - 1 1 - Basic Theory A first order ordinary differential equation has the form x = f(t, x) (11) Here x = dx/dt Given an initial data x(t 0 ) = x
More informationDefinition 3 A Hamel basis (often just called a basis) of a vector space X is a linearly independent set of vectors in X that spans X.
Economics 04 Summer/Fall 011 Lecture 8 Wednesday August 3, 011 Chapter 3. Linear Algebra Section 3.1. Bases Definition 1 Let X be a vector space over a field F. A linear combination of x 1,..., x n X is
More 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 informationVector Spaces and Linear Maps
Vector Spaces and Linear Maps Garrett Thomas August 14, 2018 1 About This document is part of a series of notes about math and machine learning. You are free to distribute it as you wish. The latest version
More informationSymmetric and self-adjoint matrices
Symmetric and self-adjoint matrices A matrix A in M n (F) is called symmetric if A T = A, ie A ij = A ji for each i, j; and self-adjoint if A = A, ie A ij = A ji or each i, j Note for A in M n (R) that
More informationSchur s Triangularization Theorem. Math 422
Schur s Triangularization Theorem Math 4 The characteristic polynomial p (t) of a square complex matrix A splits as a product of linear factors of the form (t λ) m Of course, finding these factors is a
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 informationLinear and Bilinear Algebra (2WF04) Jan Draisma
Linear and Bilinear Algebra (2WF04) Jan Draisma CHAPTER 3 The minimal polynomial and nilpotent maps 3.1. Minimal polynomial Throughout this chapter, V is a finite-dimensional vector space of dimension
More informationChapter 4 Vector Spaces And Modules
Chapter 4 Vector Spaces And Modules Up to this point we have been introduced to groups and to rings; the former has its motivation in the set of one-to-one mappings of a set onto itself, the latter, in
More informationJordan normal form notes (version date: 11/21/07)
Jordan normal form notes (version date: /2/7) If A has an eigenbasis {u,, u n }, ie a basis made up of eigenvectors, so that Au j = λ j u j, then A is diagonal with respect to that basis To see this, let
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 informationEigenpairs and Diagonalizability Math 401, Spring 2010, Professor David Levermore
Eigenpairs and Diagonalizability Math 40, Spring 200, Professor David Levermore Eigenpairs Let A be an n n matrix A number λ possibly complex even when A is real is an eigenvalue of A if there exists a
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 informationLinear Algebra Review
Chapter 1 Linear Algebra Review It is assumed that you have had a course in linear algebra, and are familiar with matrix multiplication, eigenvectors, etc. I will review some of these terms here, but quite
More informationPrecalculus Chapter P.1 Part 2 of 3. Mr. Chapman Manchester High School
Precalculus Chapter P.1 Part of 3 Mr. Chapman Manchester High School Algebraic Expressions Evaluating Algebraic Expressions Using the Basic Rules and Properties of Algebra Definition of an Algebraic Expression:
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 information