1.
The following makes assumption that f and g are both linear......
f o g (v) = f(g(v))
if f(g(v)) is one to one
>> f(g(v)) = 0 if g(v) = 0 and there is only 1 v such that g(v) = 0
>> v = 0 only.
Therefore, g is one-to-one because g(v) = 0 iff v=0
2.
This is actually a corollary. Again, the assumption is f is liinear.
if f is one-to-one
>> ker(f) = {0}
>> Nullity(f) + Rank(f) = dim(A)
>> Rank(f) = dim(A) = dim(B)
>> Range(f) is a subset of A with the same dimension.
>> Range(f) = B
>> we prove if it's one-to-one, then it's onto
if f is onto
>>Range(f) = B
>>Rank(f) = dim(B)
>>Nullity(f) + dim(B) = dim(A) = dim(B)
>>Nullity(f) = 0. ie. ker(f) = {0}
>>f is one-to-one
Hence, this prove if and only if.
The following makes assumption that f and g are both linear......
f o g (v) = f(g(v))
if f(g(v)) is one to one
>> f(g(v)) = 0 if g(v) = 0 and there is only 1 v such that g(v) = 0
>> v = 0 only.
Therefore, g is one-to-one because g(v) = 0 iff v=0
2.
This is actually a corollary. Again, the assumption is f is liinear.
if f is one-to-one
>> ker(f) = {0}
>> Nullity(f) + Rank(f) = dim(A)
>> Rank(f) = dim(A) = dim(B)
>> Range(f) is a subset of A with the same dimension.
>> Range(f) = B
>> we prove if it's one-to-one, then it's onto
if f is onto
>>Range(f) = B
>>Rank(f) = dim(B)
>>Nullity(f) + dim(B) = dim(A) = dim(B)
>>Nullity(f) = 0. ie. ker(f) = {0}
>>f is one-to-one
Hence, this prove if and only if.