The
categorical cafe has a guest post by Tom
Leinster Linear Algebra Done
Right on the book with the same title by
Sheldon Axler. I haven’t read the
book but glanced through his online paper Down with
determinants!. Here is ‘his’ proof of
the fact that any n by n matrix A has at least one eigenvector. Take a
vector
, then as the collection of
vectors
must be linearly
dependent, there are complex numbers
such that
But then as
is algebraically closed the polynomial on the
left factors into linear factors
and
therefore as
from which it follows that at least one of the linear
transformations
has a non-trivial
kernel, whence A has an eigenvector with eigenvalue
.
Okay, fine, nice even, but does this simple minded observation
warrant the extreme conclusion of his paper (on page 18)
?
As mathematicians, we often read a nice new
proof of a known theorem, enjoy the different approach, but continue
to derive our internal understanding from the method we originally
learned. This paper aims to change drastically the way mathematicians
think about and teach crucial aspects of linear algebra.
The
simple proof of the existence of eigenvalues given in Theorem 2.1
should be the one imprinted in our minds, written on our
blackboards, and published in our textbooks. Generalized eigenvectors
should become a central tool for the understanding of linear
operators. As we have seen, their use leads to natural definitions
of multiplicity and the characteristic polynomial. Every
mathematician and every linear algebra student should at least
remember that the generalized eigenvectors of an operator always
span the domain (Proposition 3.4)—this crucial result leads to easy
proofs of upper-triangular form (Theorem 6.2) and the Spectral
Theorem (Theorems 7.5 and 8.3).
Determinants appear in
many proofs not discussed here. If you scrutinize such proofs,
you’ll often discover better alternatives without determinants. Down
with Determinants!
I welcome all new proofs
of known results as they allow instructors to choose the one best suited
to their students (and preferable giving more than one proof showing
that there is no such thing as ‘the best way’ to prove a mathematical
result). What worries me is Axler’s attitude shared by extremists and
dogmatics world-wide : they are so blinded by their own right that they
impoverish their own lifes (and if they had their way, also that of
others) by not willing to consider other alternatives. A few
other comments : 1. I would be far more impressed if he had given
a short argument for the one line he skates over in his proof, that of

being algebraically closed. Does anyone give a
proof of this fact anymore or is this one of the few facts we expect
first year students to accept on faith? 2. I dont understand this
aversity to the determinant (probably because of its nonlinear
character) but at the same time not having any problems with successive
powers of matrices. Surely he knows that the determinant is a fixed

-polynomial in the traces (which are linear!) of
powers of the matrix. 3. The essense of linear algebra is that by
choosing a basis cleverly one can express a linear operator in a
extremely nice matrix form (a canonical form) so that all computations
become much more easy. This crucial idea of considering different bases
and their basechange seems to be missing from Axler’s approach.
Moreover, I would have thought that everyone would know these days that
‘linear algebra done right’ is a well developed topic called
‘representation theory of quivers’ but I realize this might be viewed
as a dogmatic statement. Fortunately someone else is giving the basic
linear algebra courses here in Antwerp so students are spared my private
obsessions (at least the first few years…). In [his
post](http://golem.ph.utexas.edu/category/2007/05/
linearalgebra
doneright.html) Leistner askes “What are determinants
good for?” I cannot resist mentioning a trivial observation I made last
week when thinking once again about
THE rationality
problem and which may be well
known to others. Recall from the previous post that rationality
of the quotient variety of matrix-couples

under
simultaneous conjugation is a very hard problem. On the other hand,
the ‘near miss’ problem of the quotient variety of
matrix-couples

is completely trivial. It is rational for all n. Here
is a one-line proof. Consider the quiver
![\xymatrix{\vtx{}
\ar@/^2ex/[rr] & & \vtx{} \ar@(ur,dr)
\ar@/^2ex/[ll]} \xymatrix{\vtx{}
\ar@/^2ex/[rr] & & \vtx{} \ar@(ur,dr)
\ar@/^2ex/[ll]}](/latexrender/pictures/7ef9ef034bb9eda1e7a631aa8f597346.gif)
then the dimension vector (n-1,n) is a
Schur root and the first fundamental theorem of

(see for
example Hanspeter Krafts excellent book on invariant theory) asserts
that the corresponding quotient variety is the one above. The result
then follows from Aidan Schofield’s paper
Birational classification of
moduli spaces of representations of
quivers. Btw. in this
special case one does not have to use the full force of Aidan’s result.
Zinovy Reichstein, who keeps me
updated on events in
Atlanta, emailed the
following elegant short proof Here is an outline of a geometric
proof. Let

and

. Applying the no-name
lemma to the

-equivariant dominant rational map

given by

(which makes X into a vector bundle over a
dense open

-invariant subset of Y), we see that

is rational over

On the other hand,

is an affine space. Thus

is
rational. The moment I read this I knew how to do this
quiver-wise and that it is just another Brauer-Severi type argument so
completely inadequate to help settling the genuine
matrix-problem. Update on the
paper by Esther
Beneish : Esther did submit the
paper in february.