Interesting linear transformation, kerT, imT question

Click For Summary

Homework Help Overview

The discussion revolves around a linear transformation T from R^n to R^n and the relationship between its kernel and image, specifically examining the claim that if T(u) · v = 0 for every u in R^n and v in kerT, then KerT = (ImT)^{\perp}.

Discussion Character

  • Conceptual clarification, Assumption checking, Mixed

Approaches and Questions Raised

  • Participants explore the implications of the condition T(u) · v = 0, questioning whether the claim about the relationship between the kernel and image is true or false. Some provide examples to illustrate their points, while others seek clarification on the reasoning behind the relationships discussed.

Discussion Status

The discussion is ongoing, with participants providing examples and questioning the validity of the original claim. Some guidance has been offered regarding proving the one-to-one mapping of kerT^\perp onto imT, and there is an acknowledgment of differing interpretations of the relationships involved.

Contextual Notes

Participants express concern about the implications of the claim for their grades and the necessity of understanding the material, indicating a mix of urgency and uncertainty regarding the topic.

mystmyst
Messages
57
Reaction score
0

Homework Statement



Prove or dispove

T:R^n \rightarrow R^n is a linear transformation

if for every u \in R^n and for every v \in kerT,
T(u) \cdot v=0

then KerT = (ImT)^{\perp}

The Attempt at a Solution



True.

since it was given T(u) \cdot v=0 and we are dealing with all of R^n then either:
1. kerT=0, imT=R^n
or
2. kerT=R^n, imT=0

since how else can T(u) \cdot v=0 ?

and in both those cases kerT=(imT)^{\perp}

Does anybody see a mistake here? Is the claim really false? Or is the claim true for a different reason?

Thanks!
 
Physics news on Phys.org
First of all take R^2 and consider T given by the matrix

T=\begin{pmatrix}1&0\\0&0\end{pmatrix}

Its kernel are vectors

\begin{pmatrix}0\\x\end{pmatrix}

Its image are vectors

\begin{pmatrix}x\\0\end{pmatrix}

Evidently its kernel is the orthogonal complement to its image.

From your equation:

<br /> T(u) \cdot v=0<br />

It follows immediately that the image is contained in the orthogonal complement of the kernel - do you see it? So, what remains is to prove or disprove that it is exactly the orthogonal complement. For this show that T maps kerT^\perp onto imT in a one-to-one way (this is the key). So, kerT^\perp and imT must have the same dimension.
 
Last edited:
arkajad said:
First of all take R^2 and consider T given by the matrix

T=\begin{pmatrix}1&amp;0\\0&amp;0\end{pmatrix}

Its kernel are vectors

\begin{pmatrix}0\\x\end{pmatrix}

Its image are vectors

\begin{pmatrix}x\\0\end{pmatrix}

Evidently its kernel is the orthogonal complement to its image.

Great example. So you disproved my reasoning but not my claim.

From your equation:

<br /> T(u) \cdot v=0<br />

It follows immediately that the image is contained in the orthogonal complement of the kernel - do you see it?

I see that now but why are we concerned with the orthogonal complement of the kernel?

hm...can we say since the image is contained in the orthogonal complement of the kernel, then the kernel must be contained (actually equal to) in the orthogonal complement of the image?

So, what remains is to prove or disprove that it is exactly the orthogonal complement. For this show that T maps kerT^\perp onto imT in a one-to-one way (this is the key). So, kerT^\perp and imT must have the same dimension.

**I sort of get it. How can you show that it maps it in a one-to-one way?

So what was your conclusion? Is the claim true or false? (I have 12 points relying on this...and since my proof was not totally correct, i'll get at least 6 points off ):, and if the answer is false, i'll get everything off :( )
 
mystmyst said:
hm...can we say since the image is contained in the orthogonal complement of the kernel, then the kernel must be contained (actually equal to) in the orthogonal complement of the image?

Yes, for two subspaces U,V we have that U\subset V^\perp is equivalent to V\subset U^\perp. Prove it for yourself and keep in mind.

How can you show that it maps it in a one-to-one way?

Show that if T(u)=T(u&#039;) then u=u&#039;. How? Suppose u,u&#039;\in kerT^\perp. We have T(u-u&#039;)=0. Therefore u-u&#039;\in kerT. But, on the other hand u-u&#039;\in kerT^\perp (because kerT^\perp is a linear subspace). Now, if a vector belong to a subspace and is orthogonal to this subspace, then it is orthogonal to itself, therefore it is zero.

and if the answer is false, i'll get everything off :( )

Do not worry. Next time you will do better, I am sure!
 
Last edited:
So basically, the answer is True?
 
Basically you need to finish now the exercise. Otherwise you will not learn!
 
haha! I don't want to learn. I just had an entire semester of learning linear algebra (: I just want to know if I'm getting around a 94 or around 88 (:

but thanks for your help!
 
Well, that's your choice, but I hope there will be others reading this thread that will learn something.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 6 ·
Replies
6
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 16 ·
Replies
16
Views
2K