0

Let $ E $ be a vector space of dimension $ n $, and let $ f \in \mathcal{L}(E)$ be a linear operator such that $ f^n = 0 $ and $f^{n-1} \neq 0 \ $.

From previous question i was able to prove that the family $ \big(x, f(x), \ldots, f^{n-1}(x)\big) $ is a basis of $E $.

Now here is where got stuck :

  1. Let $ g \in \mathcal{L}(E) \ $. Prove that $ g $ commutes with $ f $ (i.e. $ f \circ g = g \circ f $) if and only if $ g \in \text{span}\big(\text{Id} , f, \ldots, f^{n-1}\big) $

Now the $"\Leftarrow"$ (if $ g $ in the span then $ g $ commutes with f) is easy but the other direction $"\Rightarrow"$ is what got me, I would appreciate if anyone can help me.

nour Mis
  • 53
  • 5
  • Can you make explicit which direction you're asking about? The way I read your arrow, you're asking about the easier direction. You just got an answer to both directions, so there might be some confusion. – SometimesBlind Apr 02 '25 at 20:53
  • @SometimesBlind I want to prove if gf = fg then g is in the span . – nour Mis Apr 02 '25 at 21:03
  • this is more or less a duplicate of https://math.stackexchange.com/questions/57308/commutation-when-minimal-and-characteristic-polynomial-agree/ . Technically you are only asking about a special case here though I'm not convinced the responses below are easier than what is in the link. The highly upvoted hint answer given in the link more or less tells you the next step for your proof. – user8675309 Apr 03 '25 at 16:18

2 Answers2

2

Hint: Show that the matrix representation of $f$ relative to the basis $(x, f(x), \dots,f^{n-1}(x))$ is given by $$ A = \begin{pmatrix} 0 & & & \cdots& 0 \\ 1 & 0 & & & \vdots\\ 0 & 1 & \ddots & & \\ \vdots & \ddots & \ddots & & \\ 0 & \cdots& 0 & 1 & 0 \end{pmatrix} $$ (using the basis in its reverse order also works and produces the transpose of this matrix and changes the rest of the approach correspondingly)

What does the matrix of $f^k$ (i.e. $A^k$) look like? Now, show that if $B$ is a matrix such that $AB = BA$, then $B$ must be of the form $$ B = \pmatrix{b_0 \\ b_1 & b_0\\ \vdots & \ddots & \ddots\\ b_n & \cdots & b_1 & b_0}, $$ where the unwritten entires are zero. That is, $B$ must be lower-triangular and Toeplitz. Once you know what the matrix of $A^k$ looks like, it should be easy to see that $B$ can be written as a linear combination of the powers of $A$, which is to say it can be written in the form $B = p(A)$ for some polynomial $p$, so that we correspondingly have $g = p(f)$.


Here's a proof for the what the powers of $A$ look like

Claim: $$ [A^k]_{i,j} = \begin{cases} 1 & i-j = k\\0 & \text{otherwise} \end{cases} $$ where $[M]_{i,j}$ denotes the $i,j$ entry of $M$.

Proof: The base case ($k=0$) holds because $A^0 = I$. For the inductive step: we note that if $i,j$ are between $1$ and $n+1$ $$ [A^{k+1}]_{i,j} = [A A^{k}]_{i,j} = \sum_{p=1}^{n+1} A_{ip}[A^k]_{pj} $$ We note that $A_{ip}[A^k]_{pj}$ is only non-zero if $A_{ip} \neq 0$ and $[A^k]_{pj} \neq 0$. By our definition of $A$, $A_{ip}$ will only be non-zero if $p = i-1$. On the other hand: by our inductive hypothesis, $[A^k]_{pj}$ will only be non-zero if $p = j+k$. These can only be simultaneously true if $i-1 = j+k$, which is to say that $i-j = k+1$. Thus, we conclude that $[A^{k+1}]_{i,j} = 0$ whenever $i-j \neq k+1$.

Whenever $i-j = k+1$, we compute $$ [A^{k+1}]_{i,j} = \sum_{p=1}^{n+1} A_{ip}[A^k]_{pj} = A_{i,(i-1)}[A^k]_{(j+k),j} = 1 \cdot 1 = 1 $$ The conclusion follows.

Ben Grossmann
  • 234,171
  • 12
  • 184
  • 355
-2

Case $\impliedby$: Suppose $g \in \mathrm{span} (\mathrm{Id}, f, \dots, f^{n-1})$. That is $$g = a_0 \mathrm{Id} + a_i f + \cdots + a_{n-1} f^{n-1}$$ for constants $a_i$.

Then, for any $x \in E$, \begin{align*} (f \circ g)(x) &= f \left( a_0 \mathrm{Id}(x) + a_i f(x) + \cdots + a_{n-1} f^{n-1}(x) \right) \\ &= a_0 (f \circ \mathrm{Id})(x) + a_i (f \circ f)(x) + \cdots + a_{n-1} (f \circ f^{n-1})(x) \\ &= a_0 (\mathrm{Id} \circ f)(x) + a_i (f \circ f)(x) + \cdots + a_{n-1} (f^{n-1} \circ f)(x) \\ &= \left( (a_0 \mathrm{Id} + a_i f + \cdots + a_{n-1} f^{n-1}) \circ f \right)(x) \\ &= (g \circ f)(x) \text{.} \end{align*} Therefore, $f \circ g = g \circ f$.

(In short: turn $g$ into a linear combination of compositions of $f$, then use that a composition of $f$s can absorb a leading $f$ and emit a trailing $f$ (with the usual fact the identity commutes with everything).)

Case $\implies$: Suppose $g$ commutes with $f$ and let $e \in E$. We know $B = (e, f(e), \dots, f^{n-1}(e))$ is a basis of $E$, so it is sufficient to study $g$ on this basis. We find \begin{align*} g(e) &= \beta_0 \mathrm{Id}(e) + \beta_1 f(e) + \cdots + \beta_{n-1}f^{n-1}(e) \\ &\therefore \quad \left. g \right|_{\mathrm{span}\left( e \right)} \in \left. \mathrm{span} (\mathrm{Id}, f, \dots, f^{n-1}\;) \right|_{\mathrm{span}\left( e \right)} \text{,} \end{align*} for constants $\beta_i$. Then \begin{align*} (g \circ f)(e) &= (f \circ g)(e) \\ &= f(\beta_0 \mathrm{Id}(e) + \beta_1 f(e) + \cdots + \beta_{n-1}f^{n-1}(e)) \\ &= \beta_0 f(e) + \beta_1 f^2(e) + \cdots \beta_{n-1}f^{n-1}(e) + 0 \\ &\therefore \quad \left. g \right|_{\mathrm{span}\left( e, f(e) \right)} \in \left. \mathrm{span} (\mathrm{Id}, f, \dots, f^{n-1}\;) \right|_{\mathrm{span}\left( e \right)} \text{,} \\ (g \circ f^2)(e) &= (f^2 \circ g)(e) \\ &= \beta_0 f^2(e) + \beta_1 f^3(e) + \cdots + \beta_{n-1}f^{n-1}(e) + 0 + 0 \\ &\therefore \quad \left. g \right|_{\mathrm{span}\left( e, f(e), f^2(e) \right)} \in \left. \mathrm{span} (\mathrm{Id}, f, \dots, f^{n-1}\;) \right|_{\mathrm{span}\left( e \right)} \text{,} \\ &\vdots \\ (g \circ f^{n-1})(e) &= (f^{n-1} \circ g)(e) \\ &= \beta_0 f^{n-1}(e) + 0 + \cdots + 0 + 0 + 0 \\ &\therefore \quad \left. g \right|_{\mathrm{span}\left( e, f(e), f^2(e), \dots, f^{n-1}\;(e) \right)} \in \left. \mathrm{span} (\mathrm{Id}, f, \dots, f^{n-1}\;) \right|_{\mathrm{span}\left( e \right)} \text{.} \end{align*}

So $g$ restricted to a basis of $E$ is in $\mathrm{span} (\mathrm{Id}, f, \dots, f^{n-1}\;)$; therefore, $g \in \mathrm{span} (\mathrm{Id}, f, \dots, f^{n-1})$.

Eric Towers
  • 70,953
  • What do you mean when you say that $(g \circ f)(e) \in \text{span}(\text{Id}, f, \dots, f^{n-1})$? How is a vector within the span of a set of operators? – Ben Grossmann Apr 02 '25 at 22:12
  • @BenGrossmann : Ah. That's a splice (that was replicated by copy-paste). Fixed. – Eric Towers Apr 03 '25 at 13:46
  • 1
    you wrote "Suppose $g$ commutes with $f$ and let $e \in E$. We know $B = (e, f(e), \dots, f^{n-1}(e))$ is a basis of $E$" which is obviously false in general. E.g. suppose $n\geq 3$, I choose $e\in \ker f$ – user8675309 Apr 03 '25 at 16:16
  • @user8675309 : Take it up with the questioner's "From previous question i was able to prove that the family (x,f(x),…,fn−1(x)) is a basis of E." – Eric Towers Apr 03 '25 at 16:18
  • so it is not "let $e \in E...$ but instead to choose a particular $e\in E$ such that $B = (e, f(e), \dots, f^{n-1}(e))$ is a basis of $E$ – user8675309 Apr 03 '25 at 16:21
  • @user8675309 : No. You have not correctly parsed the Question's claim about a prior problem. – Eric Towers Apr 03 '25 at 16:22
  • I want to clarify your position here. It is your belief that (i.) the statement by the OP that $\big(x, f(x), \ldots, f^{n-1}(x)\big)$ is a basis of E was meant for arbitrary $x \in E$ not for a particular smart choice of $x$ and (ii.) that this “result” is fine to use in your proof even though it is obviously false. Is that accurate? – user8675309 Apr 03 '25 at 16:42
  • I am sorry but I don't think this answers the question, and so I have to downvote this answer. I believe what you need to show is that if $g$ commutes with $f$, then there are scalars $\beta_0, \ldots, \beta_{n-1}$ such that $g(e) = \sum_{i=0}^{n-1} \beta_i f^i(e)$ [with the convention $f^0(e)=e$ for all $e \in E$]... for all $e \in E$. So, one set of scalars $\beta_0, \ldots, \beta_{n-1}$ that work for every $e \in E$. And this does not do this I think. – Mike Apr 03 '25 at 17:14
  • thanks for answering , but can you explain what you did in the last part ? what " g restricted to a basis of E" means ? – nour Mis Apr 03 '25 at 21:06
  • 1
    And yes indeed, as pointed already by @user8675309 we know that there in fact, certainly are nonzero $e \in E$ such that $f(e)=0$, and so $e,f(e), \ldots, f^{n-1}(e)$ do not form a basis,. That $x,f(x), \ldots, f^{n-1}(x)$ form a basis of $E$ for some $x$, needs both (a) and (b) stated next: (a) $x$ is such that $f^{n-1}(x) \not = 0$ and that there is indeed an $x \in E$ s.t. $f^{n-1}(x) \not = 0$. (b) the equation dim$(E) =n$ [where $n$ is the smallest s.t $f^n=0$ is true. In fact, the above is not an answer, so you really should delete this, until you correct the mistakes. – Mike Apr 03 '25 at 22:04
  • To see that there are nonzero $e$ s.t. $f(e)=0$ take for instance $e=f^{n-1}(x)$ where $x$ is in the previous comment. Anyway, -1 and Vote-To-Delete. – Mike Apr 03 '25 at 22:05
  • @user8675309 : Re: "I want to clarify your position here." The Question contains the statement "From previous question i was able to prove that the family (x,f(x),…,fn−1(x)) is a basis of E." in which $x$ is unquantified and consequently implicitly universally quantified. Since the Question places itself in a Universe in which that implicitly quantified statement is true, use of that statement in an Answer is valid. Does that Universe suffer from the principle of explosion? -- not the Answer's problem. – Eric Towers Apr 05 '25 at 19:59
  • @Mike : As I just explained this exactly answers the (Closed) Question that was asked. It may not answer the question that should have been asked, but if you are unhappy with the Question, comments on the Answers are not an effective mechanism for correcting the Question. – Eric Towers Apr 05 '25 at 20:00
  • @nourMis : Having proven that $g$, applied to each element of a basis of $E$, is in the span of the compositions of $f$, the smallest step forward is that $g$ restricted to a basis of $E$ is in that span. Of course, since $g$ restricted to a basis of $E$ is $g$ restricted to $E$ is $g$, we get the last line. – Eric Towers Apr 05 '25 at 20:03