You are not logged in.
Pages: 1
hey... Suppose a linear transformation T is defined by a 4x3 matrix, can T be onto?
Offline
I think you were trying to ask... can T be one to one?
One to one, after a quick googling, means injective. That means if your mapping is from V to W and v and u are both elements of V, then
in otherwords, if the input values are unequal, then the output values are unequal, and vice versa. This is what one to one means. The more formal term for this type of mapping is 'injective'
Assume the mapping is injective.
suppose we consider the natural basis elements of V
applying the properties of a linear transformation, this means
since T is injective, we must have that
BUT
Therefore, the mapping cannot be injective, or 'one to one'.
Last edited by mikau (2008-04-26 08:38:30)
A logarithm is just a misspelled algorithm.
Offline
Mikau, you didnt answered the actual question: Can T be onto (i.e. surjective)? In any case, your analysis is wrong: T is a mapping from
to , not the other way round.There do indeed exist injective linear transformations defined by 4×3 matrices. For example
is injective. The transformation matrix is
Now try and prove that no linear mapping from
to can be surjective.Offline
I think you could define a surjective map with a 4x3 matrix as long as the domain and codomain were appropriate. Say,
, for example.(I'm not sure if that one actually works, but something like it would.)
Why did the vector cross the road?
It wanted to be normal.
Offline
I think not!
Definition: If V and W are vector spaces over the same field, a mapping T:V→W is called a linear transformation iff for all vectors u, v in V and all scalars a, b, T(au+bv) = aT(u)+bT(v).
The image of V under the linear transformation T, T(V), is a subspace of W.
Theorem: dim(T(V)) ≤ dim(V).
Proof. Let dim(V) = n and suppose w[sub]1[/sub], , w[sub]n[/sub], w[sub]n+1[/sub] are n+1 vectors in T(V). Then there are vectors v[sub]1[/sub], , v[sub]n[/sub], v[sub]n+1[/sub] in V such that T(v[sub]i[/sub]) = w[sub]i[/sub], i = 1, , n+1. Since the v[sub]i[/sub]s are linearly dependent, one of them is a linear combination of the others, say v[sub]n+1[/sub]. It follows that w[sub]n+1[/sub] = T(v[sub]n+1[/sub]) is a linear combination of the other w[sub]i[/sub]s; hence the w[sub]i[/sub]s are linearly dependent. So any set of n+1 vectors in T(V) are linearly dependent; therefore dim(T(V)) < n+1.
By the way,
is not a vector space.Last edited by JaneFairfax (2008-04-26 12:43:38)
Offline
Here is the answer to Janiffers question in less abstract verbiage.
Offline
Thanks a lot guys;))
Offline
Oh, I didn't realise linear transformations were restricted to being on vector spaces.
In that case, what about:
Why did the vector cross the road?
It wanted to be normal.
Offline
Yup, thats a linear transformation. If V and W are nontrivial vector spaces (i.e. not {0}) there are always at least two linear transformations between them: the identity map, and the one that maps everything in V to 0[sub]W[/sub].
Offline
Mikau, you didnt answered the actual question: Can T be onto (i.e. surjective)? In any case, your analysis is wrong: T is a mapping from
to , not the other way round.
wow! I didn't even see this until just now.
argh! Row major format, of course! *face slap* silly me!
but I've never heard the term 'onto' to mean surjective. Thats weird!
A logarithm is just a misspelled algorithm.
Offline
Pages: 1