Professional Documents
Culture Documents
Massoud Malek
Instead of finding the transition matrix M 1,2 directly, it is easier to follow the following steps :
Step 1. Find the transition matrix M 1,0 from B 1 to B 0 and the transition matrix M 2,0 from B 2
to B 0 .
Step 2. Find the the transition matrix M 0,2 from B 0 to B 2 , by finding the inverse of the matrix
M 2,0 .
Step 3. Use the following diagram :
M 1,2
B1 B2
M 1,0 M 0,2 = M −1
2,0
B0
Step 4. w = ( β 1 , β 2 , . . . , β n ) t = M −1 t
2,0 M 1,0 ( α 1 , α 2 , . . . , α n ) .
Linear Algebra Change of Basis 2
A 0,0 = [ T ( e 1 ) , T ( e 2 ) , . . . , T ( e k ) , . . . , T ( e n ) ]
Step 2. Find the transition matrix M 1,0 from B 1 to B 0 and the transition matrix M 2,0 from B 2
to B 0 .
Step 3. Find the the transition matrix M 0,2 from B 0 to B 2 , by finding the inverse of the matrix
M 2,0 .
Step 4. Use the following diagram :
A 1,2
B 1 (V 1 ) B 2 (V 2 )
A 1,0 A 0,2
M 1,0 M 0,2 = M −1
2,0
A 0,0
B 0 (V 1 ) B 0 (V 2 )
Linear Algebra Change of Basis 3
Step 5. A 1,2 = M −1
2,0 A 0,0 M 1,0 .
Notice that the diagram also shows how to find
Let B 1 and B 2 be the bases defined in example 1; then find the matrix representation of T from
B 1 to B 2 ; from B 0 to B 2 ; and from B 1 to B 0 .
Solution: We have
3 2 1
A 0,0 = [ T (e1 ), T (e2 ), T (e3 ) ] = 4 3 4 .
1 −2 −3
From Step 5, we have
1 −1 −1 3 2 1 1 1 1 −1 −3 −1
A 1,2 = M 0,2 A 0,0 M 1,0 = −1 2 −1 4 3 4 1 −1 1 = 2 0 8 0 .
0 0 1 1 −2 −3 1 1 −1 −4 0 2
1 −1 −1 3 2 1 −2 1 0
A 0,2 = M 0,2 A 0,0 = −1 2 −1 4 3 4 = 4 6 1 0 .
0 0 1 1 −2 −3 1 −2 −3
3 2 1 1 1 1 6 2 4
A 1,0 = A 0,0 M 1,0 = 4 3 4 1 −1 1 1 1
= 5 3 .
1 −2 −3 1 1 −1 −4 0 2
Matrix Similarity. Similar matrices represent the same linear transformation after a change of
basis.
Suppose V 1 = V 2 = V and also the basis B 1 = B 2 = B . Then the matrix representation A 0,0 of a
linear transformation T : V 7→ V is similar to A 1,2 . We write P −1 A P = B . The matrix P is the
transition matrix from B 1 to B 0 and the matrix P −1 is the transition matrix from B 0 to B 2 .
Both matrices A and B have the same set of eigenvalues and algebraic multiplicities and geometric
multiplicities of eigenvalues but not necessary the same eigenvectors. They also have the same rank,
characteristic polynomial, minimal polynomial, determinant, and trace.
In the definition of similarity, if the matrix P can be chosen to be a permutation matrix then A
and B are permutation-similar; if P can be chosen to be a unitary matrix then A and B are
unitarily equivalent. The spectral theorem says that every normal matrix is unitarily equivalent to
some diagonal matrix.
To diagonalize a matrix, we must find a basis B from its set of linearly independent eigenvectors and
make a change of basis. The Jordan canonical form of a matrix A is obtain from changing the basis,
where P comprises of linearly independent eigenvectors and generalized eigenvectors of A .
Linear Algebra Change of Basis 4
1
1 1 5 0 −1
Example 3. Consider the basis B = 1 , −1 , 1 and let A = 1 4 −1 be the
1 1 −1 −1 0 5
matrix representing a linear transformation T with respect to the standard basis. Find the matrix
B , representing T with respect to the basis B .
1 1 1 0 1 1
1
Solution : Let P = 1 −1 1 . Then by finding P −1 = 1 −1 0 , we may now find a
2
1 1 −1 1 0 −1
similar matrix to A as follows :
0 1 1 5 0 −1 1 1 1 4 0 0
1
B = P −1 A P = 1 −1 0 1 4 −1 1 −1 1 = 0 4 0
2
1 0 −1 −1 0 5 1 1 −1 0 0 6