Skip to content
Hub Nexus

No author yetClaim it

Version 1Updated 2 min read

Support

This section uses material from three optional subsections: Direct Sum, Determinants Exist, and Other Formulas for the Determinant.

The chapter on linear maps shows that every h : V → W can
be represented by a partial-identity matrix with respect to some
bases B ⊂ V and D ⊂ W.
This chapter revisits this issue in the special case that the map is a
linear transformation t : V → V.
Of course, the general result still applies
but with the codomain and domain equal
we naturally ask about having the two bases also be equal.
That is, we want a canonical form to represent transformations
as {R e p}_{B , B} ( t ).

After a brief review section, we began
by noting that a block partial identity form matrix
is not always obtainable in this B , B case.
We therefore considered the natural generalization, diagonal matrices, and
showed that if its eigenvalues are distinct then
a map or matrix can be diagonalized.
But we also gave an example of a matrix that cannot be diagonalized and
in the section prior to this one we developed that example.
We showed that
a linear map is nilpotent— if we take higher and higher powers of the
map or matrix then we eventually get the zero map or matrix— if and only
if there is a basis on which it acts via disjoint strings.
That led to a canonical form for nilpotent matrices.

Now, this section concludes the chapter.
We will show that the two cases we've studied are exhaustive
in that for any linear transformation there is
a basis such that the matrix representation {R e p}_{B , B} ( t ) is the sum of a
diagonal matrix and a nilpotent matrix in its canonical form.

Where this page came from

This page was imported from Wikibooks. From “Linear Algebra” on Wikibooks, by its contributors, under CC BY-SA 4.0. Changed here: set as a page; navigation and edit links left out; each image under its own licence, credited in its caption.

Nobody has written it yet — it is the source material at a new address, which is why search engines are asked to skip it and why no one earns from it. It is up for grabs: take it on, and it is yours to rewrite and to earn from.

Comments

Spinner Logo

Next in Linear Algebra

CC BY-SA 4.0
Recall that the set of square matrices is a vector space under entry-by-entry addition and scalar multiplication and that this space ${ℳ}_{n \ × \ n}$ has dimension ${n}^{2}$. Thus, for any $n \ × \ n$ matrix T the ${n}^{2} + 1$-member set $\{ I , T , {T}^{2} , … , {T}^{{n}^{2}} \}$ is linearly depe
CC BY-SA 4.0
This subsection moves from the canonical form for nilpotent matrices to the one for all matrices. We have shown that if a map is nilpotent then all of its eigenvalues are zero. We can now prove the converse. Lemma 2.1 A linear transformation whose only eigenvalue is zero is nilpotent.
CC BY-SA 4.0
--Refer to Topic on Geometry of Linear Transformations--- The characterization of linear transformations in terms of the elementary operations is nice in some ways (for instance, we can easily see that lines are mapped to lines because each of the operations of projection, dilation, reflection, and
CC BY-SA 4.0
In practice, calculating eigenvalues and eigenvectors is a difficult problem. Finding, and solving, the characteristic polynomial of the large matrices often encountered in applications is too slow and too hard. Other techniques, indirect ones that avoid the characteristic polynomial, are used. Here
CC BY-SA 4.0
Imagine a reserve park with animals from a species that we are trying to protect. The park doesn't have a fence and so animals cross the boundary, both from the inside out and in the other direction. Every year, 10% of the animals from inside of the park leave, and 1% of the animals from the outside
CC BY-SA 4.0
In 1202 Leonardo of Pisa, also known as Fibonacci, posed this problem. A certain man put a pair of rabbits in a place surrounded on all sides by a wall. How many pairs of rabbits can be produced from that pair in a year if it is supposed that every month each pair begets a new pair which from the se