Prove: Linear Algebra - R(T) a Subset of N(T)

wheezyg
Messages
5
Reaction score
0

Homework Statement


Let V be a vector space, and let T:V->V be linear. Prove that T2=T0 if and only if R(T) is a subset of N(T)

Homework Equations


I brainstormed everything I know while looking through my textbook and compiled the following which I use within my proof.

I'm letting beta be a basis for V and beta be composed of {x1,...,xn}

T2(x)=TT(x)=T(T(x)) /forall X /in V
T0(x)=0 and since T is linear, T(0)=0

N(T)={xi \in V : T(xi)=0} (1<i<n)
R(T)={T(xi): xi \in V} (1<i<n)

The Attempt at a Solution


TT(x1,...,xn)
= T(T(x1,...,xn))
= T( T(x1),...,T(xn))
=T(R(T))
=0 when R(T)={0}

so R(T) must be a subset of N(T)

So my question... I am worried that I have made too many leaps or assumptions that I am not allowed. This is my first semester writing proofs so I would not appreciate a full proof from someone else (which is against the rules anyways right?) but rather, I think I would benefit if people could point out flaws in my "proof," point out any steps that are illogical, etc.

So basically, point out what I can't do or what is vague so I can scour my book and notes and fix it.

thanks ahead of time to anyone that can help.
 
Physics news on Phys.org
wheezyg said:

Homework Statement


Let V be a vector space, and let T:V->V be linear. Prove that T2=T0 if and only if R(T) is a subset of N(T)

Homework Equations


I brainstormed everything I know while looking through my textbook and compiled the following which I use within my proof.

I'm letting beta be a basis for V and beta be composed of {x1,...,xn}

T2(x)=TT(x)=T(T(x)) /forall X /in V
T0(x)=0 and since T is linear, T(0)=0

N(T)={xi \in V : T(xi)=0} (1<i<n)
R(T)={T(xi): xi \in V} (1<i<n)

The Attempt at a Solution


TT(x1,...,xn)
= T(T(x1,...,xn))
= T( T(x1),...,T(xn))
=T(R(T))
=0 when R(T)={0}
No...[/color]
First, we won't need to consider a basis...

First direction: Suppose T^2(x) = T_0(x) = 0 for all x\in V. We want to show R(T) \subseteq N(T).

To show that R(T) \subseteq N(T), since an element of R(T) is of the form T(x) for some x in V, we let T(x)\in R(T) and we wish to show that T(T(x)) = 0, so that T(x) \in N(T) (cf. T(v)=0 means v\in N(T)).

Continue...

For the second direction: begin by writing what we want to show (as we did for the first direction). Then see how you go!

You will notice that after writing out what is required of us to show, the actual effort to carry it out is almost trivial!
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top