Maths Presentation

Madhav Institute Of
Technology And Science

MATHS PRESENTATION
GROUP MEMBERS
DEEPAK CHIRAG ANSHUMAN

ADITYA SINGH
KATARE SHARMA SINGH SISODIA
DEEKSHANT ADITYA RAMKRISHNA

KRISHNA SONI
MOORJANI RANGWANI DWEVEDI
Topic
Cayley Eigen value
Hamilton and Eigen
Theorem vector
 According to the Cayley Hamilton theorem, a
square matrix will satisfy its own characteristic
WHAT IS
polynomial equation. A characteristic polynomial
is associated with the determinant of a matrix and
CAYLEY the eigenvalues of the matrix will be the roots of
this polynomial. Suppose a square matrix A is
HAMILTON given with n rows and n columns. The
THEOREM characteristic polynomial of this matrix is given

as det(λIn−A)(λIn−A). Here, InIn is the identity
matrix, λλ is a scalar quantity and det signifies
the determinant operation.
 The Cayley Hamilton theorem states that the characteristic polynomial expression of a real
or complex square matrix will be equal to the zero matrix. The characteristic polynomial
p(λλ) = det(λIn−A)(λIn−A) can be decomposed as p(λλ) = anλn+an−1λn−1+...
Cayley +a1λ+a0λ0anλn+an−1λn−1+...+a1λ+a0λ0. This is a monic polynomial where the leading

coefficient, i.e, the coefficient of the highest degree variable, will be equal to 1.
Hamilton Thus, anan = 1. Here, an−1an−1,...,a1a1, a0a0 are coefficients of the

variables λn−1λn−1,..., λ1λ1, λ0λ0 respectively.
Theorem  We have p(λλ) = anλn+an−1λn−1+...+a1λ+a0λ0anλn+an−1λn−1+...+a1λ+a0λ0
Statement  p(λλ) = λn+an−1λn−1+...+a1λ+a0λn+an−1λn−1+...+a1λ+a0

 On replacing λλ with the matrix, A, the polynomial can be written as follows:
 p(A) = An+an−1An−1+...+a1A+a0InAn+an−1An−1+...+a1A+a0In
 Now according to the Cayley Hamilton Theorem, this polynomial will be 0.
 Thus, p(A) = An+an−1An−1+...+a1A+a0InAn+an−1An−1+...+a1A+a0In = 0 or p(A) = 0
 The Cayley Hamilton theorem formula is extremely
useful is performing complicated calculations with speed
and accuracy. It can also be used to determine the inverse
of a matrix. The formula is given as follows:
Cayley  Suppose the characteristic polynomial of an n × n square
Hamilton matrix, A, is given as p(λλ) = λn+an−1λn−1+...
+a1λ+a0λn+an−1λn−1+...+a1λ+a0
Theorem  Then p(A) = An+an−1An−1+...
Formula +a1A+a0InAn+an−1An−1+...+a1A+a0In = 0
 Thus, p(A) = 0.
 To determine the inverse multiply this
equation with A-1.
Cayley  An−1+an−1An−2+...
Hamilton +a1In+a0A−1An−1+an−1An−2+...
Theorem +a1In+a0A−1 = 0
Inverse  A-1 = -(An−1+an−1An−2+...
Formula +a1Ina0An−1+an−1An−2+...
+a1Ina0)
 Hamilton theorem, p(A) = A2 − (a + d)A + (ad − bc)I = 0. The proof of this
theorem is given as follows:
 A2 = [a2+bcab+bdac+cdbc+d2][a2+bcab+bdac+cdbc+d2]
Cayley  (a + d)A = [a(a+d)b(a+d)c(a+d)d(a+d)]

[a(a+d)b(a+d)c(a+d)d(a+d)] = [a2+adba+bd)ca+cdda+d2]
Hamilton [a2+adba+bd)ca+cdda+d2]
 (ad − bc)I = [ad−bc00ad−bc][ad−bc00ad−bc]
Theorem Proof  A2 − (a + d)A + (ad − bc)I = [a2+bcab+bdac+cdbc+d2]
[a2+bcab+bdac+cdbc+d2] - [a2+adba+bd)ca+cdda+d2]
[a2+adba+bd)ca+cdda+d2] + [ad−bc00ad−bc][ad−bc00ad−bc]
 A2 − (a + d)A + (ad − bc)I = [0000][0000]
 Similarly, the Cayley Hamilton theorem proof can be given for higher order
square matrices.
 The Cayley Hamilton Theorem forms an important
concept that is widely used in the proofs of many
theorems in pure mathematics. Some of the important
applications of this theorem are listed below:
Cayley  The Cayley Hamilton Theorem is used to define vital

concepts in control theory such as the controllability of
Hamilton linear systems.
Theorem  In commutative algebra, Nakayama's lemma can be
Applications proved using a generalization of the Cayley Hamilton
Theorem.
 The Theorem of Jacobson can be proved using the Cayley
Hamilton Theorem.
 The Cayley Hamilton Theorem states that square
matrices (both real and complex) will satisfy their own
characteristic polynomial equation.
 Mathematically, the Cayley Hamilton theorem can be
expressed as p(A) = An+an−1An−1+...
Important Notes on +a1A+a0InAn+an−1An−1+...+a1A+a0In = 0 where A
Cayley Hamilton is an n × n square matrix.
Theorem  The characteristic equation for a 2 × 2 matrix is given

as B2−S1B+S0IB2−S1B+S0I = 0 and for a 3 × 3
matrix is written
as C3−T2C2+T1C−T0IC3−T2C2+T1C−T0I = 0.
Examples on Cayley Hamilton Theorem
 Example 1: Using the Cayley Hamilton Theorem find A4 if A = [122−1]
[122−1]
Solution: According to the Cayley Hamilton
Theorem B2−S1B+S0IB2−S1B+S0I = 0
S1S1 = 1 - 1 = 0, S0S0 = |A| = -1 - 4 = -5
Thus, the characteristic equation is p(A) = A2 - 5I = 0
A2 = 5I
Multiply A2 on both sides
A4 = A2(5I)
A4= (5I)(5I)
A4 = 25I = [25 0
 0 25] Answer
 Eigenvalues are associated with eigenvectors in
Linear algebra. Both terms are used in the analysis of
linear transformations. Eigenvalues are the special set
EEigenvalues of scalar values that is associated with the set of linear
and equations most probably in the matrix equations. The

eigenvectors are also termed as characteristic roots. It
Eigenvectors is a non-zero vector that can be changed at most by its
scalar factor after the application of linear
transformations. And the corresponding factor which
scales the eigenvectors is called an eigenvalue.
 Eigenvalues are the special set of scalars associated with
the system of linear equations. It is mostly used in matrix
equations. ‘Eigen’ is a German word that means ‘proper’
or ‘characteristic’. Therefore, the term eigenvalue can be
Eigenvalue
termed as characteristic value, characteristic root, proper
values or latent roots as well. In simple words, the
eigenvalue is a scalar that is used to transform the
eigenvector. The basic equation is
 Ax = λx
 The number or scalar value “λ” is an eigenvalue of A.
 Eigenvectors are the vectors (non-zero) that do not change the direction
when any linear transformation is applied. It changes by only a scalar
factor. In a brief, we can say, if A is a linear transformation from a vector
space V and x is a vector in V, which is not a zero vector, then v is an
eigenvector of A if A(X) is a scalar multiple of x.
 An Eigenspace of vector x consists of a set of all eigenvectors with the
equivalent eigenvalue collectively with the zero vector. Though, the zero
EigenVectors vector is not an eigenvector.

 Let us say A is an “n × n” matrix and λ is an eigenvalue of matrix A,
then x, a non-zero vector, is called as eigenvector if it satisfies the given
below expression;
 Ax = λx
 x is an eigenvector of A corresponding to eigenvalue, λ.
 Eigenvectors with Distinct Eigenvalues are Linearly Independent
 Singular Matrices have Zero Eigenvalues
 If A is a square matrix, then λ = 0 is not an eigenvalue of A
 For a scalar multiple of a matrix: If A is a square matrix and λ is an eigenvalue
of A. Then, aλ is an eigenvalue of aA.
Properties of  For Matrix powers: If A is square matrix and λ is an eigenvalue of A and n≥0 is
an integer, then λn is an eigenvalue of An.
Eigenvalues  For polynomials of matrix: If A is a square matrix, λ is an eigenvalue of A and

p(x) is a polynomial in variable x, then p(λ) is the eigenvalue of matrix p(A).
 Inverse Matrix: If A is a square matrix, λ is an eigenvalue of A, then λ-1 is an
eigenvalue of A-1
 Transpose matrix: If A is a square matrix, λ is an eigenvalue of A, then λ is an
eigenvalue of At
EigenValue Example
 In this shear mapping, the blue arrow

changes direction, whereas the pink
arrow does not. Here, the pink arrow is
an eigenvector because it does not
change direction. Also, the length of this
arrow is not changed; its eigenvalue is
1.
THANK YOU

Maths Presentation

Uploaded by

Copyright:

Available Formats

Maths Presentation

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Maths Presentation

Uploaded by

Copyright:

Available Formats

Madhav Institute Of

Technology And Science

DEEPAK CHIRAG ANSHUMAN

DEEKSHANT ADITYA RAMKRISHNA

THEOREM characteristic polynomial of this matrix is given

Cayley +a1λ+a0λ0anλn+an−1λn−1+...+a1λ+a0λ0. This is a monic polynomial where the leading

Hamilton Thus, anan = 1. Here, an−1an−1,...,a1a1, a0a0 are coefficients of the

Theorem  We have p(λλ) = anλn+an−1λn−1+...+a1λ+a0λ0anλn+an−1λn−1+...+a1λ+a0λ0

Statement  p(λλ) = λn+an−1λn−1+...+a1λ+a0λn+an−1λn−1+...+a1λ+a0

Cayley  (a + d)A = [a(a+d)b(a+d)c(a+d)d(a+d)]

Cayley  The Cayley Hamilton Theorem is used to define vital

Cayley Hamilton is an n × n square matrix.

Theorem  The characteristic equation for a 2 × 2 matrix is given

and equations most probably in the matrix equations. The

EigenVectors vector is not an eigenvector.

Eigenvalues  For polynomials of matrix: If A is a square matrix, λ is an eigenvalue of A and

 In this shear mapping, the blue arrow

You might also like