Permuations, Lecture Notes - Mathematics - 5, Study notes of Mathematics

Eigenvalues and Eigenvectors

Typology: Study notes

2010/2011

Uploaded on 09/09/2011

andreasphd
andreasphd 🇬🇧

4.7

(28)

287 documents

1 / 4

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Oxford University Mathematical Institute
Linear Algebra II for Mathematical Moderations
Lecture 5 (Tuesday 1 February 2011):
Eigenvalues and eigenvectors
The theory of eigenvalues and eigenvectors (to be defined shortly) applies equally
to square matrices and to endomorphisms of a finite-dimensional vector space V.
But we will, in fact, concentrate on matrices in the first instance.
Recall that the following three properties of an n×nmatrix Aare equivalent:
(1) Ais singular (in the sense that detA= 0 );
(2) Ais not invertible;
(3) there exists a non-zero column vector v= (x1, x2,...,xn)tr such that A v = 0.
Now we come to the main subject of the next few lectures.
Definition. Let AMn×n(R). The scalar λRis said to be an eigenvalue
of Aif there exists a non-zero column vector v= (x1, x2,...,xn)tr Rnsuch that
Av =λ v . The non-zero column vector v= (x1, x2,...,xn)tr Rnis said to be
an eigenvector of Aif there exists a scalar λRsuch that A v =λ v .
Similarly, for an endomorphism T:VVof a finite-dimensional real vector
space, the scalar λRis said to be an eigenvalue of Tif there exists vV\ {0}
such that T v =λ v ; and the non-zero vector vVis said to be an eigenvector of
Tif there exists a scalar λRsuch that T v =λ v .
Examples.
17
pf3
pf4

Partial preview of the text

Download Permuations, Lecture Notes - Mathematics - 5 and more Study notes Mathematics in PDF only on Docsity!

Oxford University Mathematical Institute

Linear Algebra II for Mathematical Moderations Lecture 5 (Tuesday 1 February 2011): Eigenvalues and eigenvectors

The theory of eigenvalues and eigenvectors (to be defined shortly) applies equally to square matrices and to endomorphisms of a finite-dimensional vector space V. But we will, in fact, concentrate on matrices in the first instance.

Recall that the following three properties of an n × n matrix A are equivalent:

(1) A is singular (in the sense that detA = 0); (2) A is not invertible; (3) there exists a non-zero column vector v = (x 1 , x 2 ,... , xn)tr^ such that Av = 0.

Now we come to the main subject of the next few lectures.

Definition. Let A ∈ Mn×n(R). The scalar λ ∈ R is said to be an eigenvalue of A if there exists a non-zero column vector v = (x 1 , x 2 ,... , xn)tr^ ∈ Rn^ such that

Av = λ v. The non-zero column vector v = (x 1 , x 2 ,... , xn)tr^ ∈ Rn^ is said to be an eigenvector of A if there exists a scalar λ ∈ R such that Av = λ v.

Similarly, for an endomorphism T : V → V of a finite-dimensional real vector space, the scalar λ ∈ R is said to be an eigenvalue of T if there exists v ∈ V \ { 0 } such that T v = λ v ; and the non-zero vector v ∈ V is said to be an eigenvector of T if there exists a scalar λ ∈ R such that T v = λ v.

Examples.

Theorem. If A ∈ Mn×n(R) and λ ∈ R then λ is an eigenvalue of A if and only if det(λIn − A) = 0.

Proof.

Definition. For an n×n matrix A the characteristic polynomial is defined by

χA(x) := det(xIn − A).

Thus λ is an eigenvalue of A if and only if χA(λ) = 0.

Recall: n × n matrices A, B are said to be similar if there exists an invertible n × n matrix P such that B = P −^1 AP.

Theorem. If A, B ∈ Mn×n(R) are similar then χA(x) = χB (x) and so A and B have the same eigenvalues.

Proof.

Probable end of Lecture 5