Yes, it is very easy to show this, or rather the correct statement when e is the minimal positive integer such that N^e=0, so try it.
#3
Treadstone 71
275
0
I got it. It's part of a much larger proof. Thanks.
#4
wangchong
7
0
Yes it's true. If V were represented via its "basis" as R^n, (n=dim V) then, N can be represented as a nilpotent matrix. We knew that with appropriate representation, N is a strictly upper triangular (diagonal and lower triangular elements are all zeroes) matrix. And now we just have to show that a strictly upper triangular matrix the property that N^n is always zero. (Sorry, I use N (the operator, as the matrix).
It is well known that a vector space always admits an algebraic (Hamel) basis. This is a theorem that follows from Zorn's lemma based on the Axiom of Choice (AC).
Now consider any specific instance of vector space. Since the AC axiom may or may not be included in the underlying set theory, might there be examples of vector spaces in which an Hamel basis actually doesn't exist ?