Scribd
Upload
18 views2 pages

1 Minimal Polynomial of A Vector: 2 K 1 K K K 1

This document discusses minimal polynomials of vectors and vector spaces under linear transformations. It defines a minimal polynomial as a monic polynomial of lowest degree that annihilates a vector or vector space. It provides examples of computing minimal polynomials for individual vectors and cyclic subspaces. It also outlines algorithms for finding the minimal polynomial of a vector space by taking the least common multiple of minimal polynomials of a basis and describes the Euclidean division algorithm used to compute greatest common divisors and least common multiples of polynomials.

Uploaded by

2023cs04002
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
18 views2 pages

1 Minimal Polynomial of A Vector: 2 K 1 K K K 1

This document discusses minimal polynomials of vectors and vector spaces under linear transformations. It defines a minimal polynomial as a monic polynomial of lowest degree that annihilates a vector or vector space. It provides examples of computing minimal polynomials for individual vectors and cyclic subspaces. It also outlines algorithms for finding the minimal polynomial of a vector space by taking the least common multiple of minimal polynomials of a basis and describes the Euclidean division algorithm used to compute greatest common divisors and least common multiples of polynomials.

Uploaded by

2023cs04002
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

EE 601 Statistical Signal Analysis 24/09/2010

Prof. S. D. Agashe Scribe: Ramachandran C A, Prajith R G,Vivek Deulkar, Deepak Patil

1 Minimal Polynomial of a Vector


A minimal degree monic polynomial anhilating the vector v under linear transformation T is Minimal
Polynomial of that vector. If vector space V is finite dimensional then the chain,
v −→ T v −→ T 2 v −→ . . . −→ T k−1 v −→ T k v
is also finite. Also T k v is linearly dependent on v, T v, . . . , T k−1 v with the following linear combi-
nation.
T k v + αk−1 T k−1 v + αk−2 T k−2 v + . . . + α1 T v + α0 v = 0V
So, the minimal polynomial of vector v under T is
pk + αk−1 pk−1 + αk−2 pk−2 + . . . + α1 p + α0
The degree of minimal polynomial k ≤ dimV .

Also sp{v, T v, T 2 v, . . . , T k−1 v} is cyclic subspace of dimension k invariant under the transfor-
mation T denoted cycl(v, T).

For example:
 
−2 1 −3 −2 −2

 0 −1 1 0 0 
A=
 1 0 1 1 1 
 1 0 1 1 1 
1 0 1 1 1
The cyclic chains for vectors e1 , e2 , e3 , e4 , e5 under the action of A respectively are as follows:

e1 −→ Ae1 −→ A2 e1 −→ 05
e2 −→ Ae2 −→ A2 e2 −→ 05
e3 −→ Ae3 −→ 05
e4 −→ Ae4 −→ A2 e4 −→ 05
e5 −→ Ae5 −→ A2 e5 −→ 05
The minimal polynomials of e1 , e2 , e3 , e4 , e5 are p3 , p3 , p2 , p3 , p3 respectively.

The cyclic subspaces invariant under A are


V1 = sp{e1 , Ae1 , A2 e1 }
V2 = sp{e2 , Ae2 , A2 e2 }
V3 = sp{e3 , Ae3 }
V4 = sp{e4 , Ae4 , A2 e4 }
V5 = sp{e5 , Ae5 , A2 e5 }

14 - 1
2 Minimal polynomial of a Vector space
A minimal degree monic polynomial anhilating all the vectors of the vector space under linear trans-
formation T is Minimal Polynomial of that vector space. Minimal Polynomail of a zero vector is 1.
Minimal Polynomial of any vector in a vector space is a factor of Minimal polynomial that vector
space

2.1 Algorithm for computing the minimal polynomial of a vector space


1. Choose any basis.

2. Find the minimal polynomial of each vector in basis.

3. Find the L.C.M. of all minimal polynomials thus found.

2.2 Algorithm to compute L.C.M. of two polynomials without factorization


1. Find the product of two given polynomials.

2. Find the G.C.D. by Euclidean division algorithm.

3. Divide the product by G.C.D. and the Quotient gives the L.C.M.

2.3 Euclidean Division Algorithm


1. Let F = f and G = g be two polynomials.

2. Use synthetic division to compute polynomials q, r , with deg r ≤ deg G , such that F = qG + r

3. If r = 0 then we stop: G = g is a greatest common divisor.

4. If r 6= 0 then replace F by G and G by r and go to (2)

14 - 2

You might also like