Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.3 4.3bsd-beta 6/6/85; site ucbvax.BERKELEY.EDU
Path: utzoo!watmath!clyde!burl!ulysses!ucbvax!brahms!totaro
From: totaro@brahms.BERKELEY.EDU (Burt Totaro)
Newsgroups: net.math
Subject: Re: White's problems
Message-ID: <11818@ucbvax.BERKELEY.EDU>
Date: Tue, 11-Feb-86 22:48:37 EST
Article-I.D.: ucbvax.11818
Posted: Tue Feb 11 22:48:37 1986
Date-Received: Thu, 13-Feb-86 01:02:45 EST
Sender: usenet@ucbvax.BERKELEY.EDU
Reply-To: totaro@brahms.BERKELEY.EDU (Burt Totaro)
Organization: University of California, Berkeley
Lines: 26

This note gives a counterexample to a problem proposed by Sam White
on net.math.

The problem was: Let M(n) be the algebra of n x n matrices over a field.
Let V be a linear subspace of M(n) consisting entirely of nilpotent matrices.
(A matrix A is nilpotent if A^m = 0 for some integer m.)
Show that V cannot generate M(n) as a ring.

For the counterexample, take the field to be the real or complex numbers,
and let V be spanned by the following two matrices:
	  0   0   0            0   1   0
    A =	  1   0   0      B =   0   0   1
	  0  -1   0            0   0   0
One finds that any matrix C which is a linear combination of these two
satisfies C^3=0, and hence is nilpotent. However, if you write out
the matrices 1,AB,BA; A,AA,AAB; B,BB,BBA; then you will see that the first
three span the diagonal matrices, the second three span the lower
triangular ones, etc. That is, V generates the ring of 3x3 matrices.

The problem was originally intended to help answer the question:
Given a linear subspace which generates the algebra M(n), can we find
upper and lower bounds for the number of multiplications we need to do
to get the whole algebra? That is, in the above example we needed only
products of at most three elements of the subspace (BBA, for instance.)

As far as I know, this broader question is still wide open.