Linear Transformation Question

Click For Summary

Homework Help Overview

The problem involves linear maps S and T on a finite-dimensional vector space V = F^n, where the goal is to show that the equation ST - TS = I cannot hold. Participants are exploring the implications of this equation and its relationship to the properties of linear transformations in finite-dimensional spaces.

Discussion Character

  • Exploratory, Conceptual clarification, Assumption checking

Approaches and Questions Raised

  • Some participants discuss using induction to derive relationships between the maps S and T, specifically ST^n - T^nS = nT^{n-1}. Others question the rationale behind focusing on T^n and express uncertainty about how to leverage these results to reach a contradiction regarding the finite dimensionality of the space.

Discussion Status

Participants are actively engaging with hints provided, such as considering the characteristic polynomial and the trace of matrices. Some express clarity on the approach after discussing the trace, while others note potential complications depending on the field F being used.

Contextual Notes

There are mentions of constraints related to the characteristics of the field F, particularly in the context of finite fields and their properties affecting the trace and characteristic polynomial. Participants are navigating these nuances as they seek to understand the implications of their findings.

HarryHumpo
Messages
4
Reaction score
0

Homework Statement



Let V = F^n
for some n ≥ 1. Show that there do not exist linear maps
S, T : V → V such that ST − T S = I.

The Attempt at a Solution



I used induction to prove that ST^n-T^nS = nT^n-1 and that S^nT-TS^n=nS^n-1, and I know I'm supposed to use that to come up with a contradiction to the fact that the space is finite dimensional, but I'm not sure how to approach that part of the problem.
Any help is appreciated
 
Physics news on Phys.org
HarryHumpo said:

Homework Statement



Let V = F^n
for some n ≥ 1. Show that there do not exist linear maps
S, T : V → V such that ST − T S = I.

The Attempt at a Solution



I used induction to prove that ST^n-T^nS = nT^n-1 and that S^nT-TS^n=nS^n-1
I don't understand why you're doing this; i.e., looking at Tn.

V is an n-dimensional vector space over some field F - that's what Fn means.

It seems to me that the most obvious way to approach this problem is to assume that there are linear maps from V to V such that ST - TS = I. If you get a contradiction, and you should, you can conclude that no such maps exist.
HarryHumpo said:
, and I know I'm supposed to use that to come up with a contradiction to the fact that the space is finite dimensional, but I'm not sure how to approach that part of the problem.
Any help is appreciated
 
The hint that was given was to prove that ST^n-T^nS = nT^n-1 (which I did) and see how it bring about a contradiction, but I don't see how the second part works.
 
HarryHumpo said:
The hint that was given was to prove that ST^n-T^nS = nT^n-1 (which I did) and see how it bring about a contradiction, but I don't see how the second part works.

You know every matrix satisfies its characteristic polynomial. Try working with that. The easy alternate way to do it is to take the trace of both sides. I think both might get into trouble if the field has finite characteristic. Can it?
 
Looking at the trace it seems so obvious now, thank you!
 
HarryHumpo said:
Looking at the trace it seems so obvious now, thank you!

That has some qualifications depending on what F is. In some finite fields, trace(I) is zero. You can also argue using the hint and the characteristic polynomial, but I think that has the same qualification. If the field is such that 1+1+...+1 (n times) isn't equal to zero, then it should work.
 

Similar threads

  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 24 ·
Replies
24
Views
4K
Replies
34
Views
4K
  • · Replies 7 ·
Replies
7
Views
1K
Replies
15
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K