Matrix representation of linear transformation

Click For Summary
The discussion focuses on the matrix representation of a linear transformation T between finite-dimensional vector spaces V and W. It establishes that a vector v in V is in the kernel of T if and only if its coordinate vector [v]B is in the nullspace of the matrix [T]C B. Additionally, it asserts that a vector w in W is in the range of T if and only if its coordinate vector [w]C is in the column space of the matrix [T]C B. The process of constructing the matrix representation involves applying T to each basis vector in B and expressing the results as linear combinations of the basis vectors in C. This relationship highlights the correspondence between the linear transformation and its matrix representation.
toni07
Messages
24
Reaction score
0
Let V and W be two finite-dimensional vector spaces over the field F. Let B be a basis of V, and let C be a basis of W. For any v 2 V write [v]B for the coordinate vector of v with respect to B, and similarly [w]C for w in W. Let T : V -> W be a linear map, and write [T]C B for the matrix representing T with respect to B and C.
a) Prove that a vector v in V is in the kernel of the linear map T if and only if the vector [v]B in F^dimV is in the nullspace of the matrix [T]C B.
b) Prove that a vector w in W is in the range of the linear map T if and only if the vector [w]C in F^dimW is in the column space of the matrix [T]C B.
I don't know how to go about this question, any guidelines would really help.
 
Physics news on Phys.org
Given an ordered basis, B, for V and an ordered basis, C, for W. We write the matrix representation for T: V-> W by applying T to each vector in B, in turn, then writing the result as a linear combination of the vectors in C. The coefficients form the columns of [T]C B. That is because the first vector in B would be represented by \begin{bmatrix}1 \\ 0 \\ 0 \\ ... \\ 0\end{bmatrix}, the second by \begin{bmatrix}0 \\ 1 \\ 0 \\ ... \\ 0\end{bmatrix}, etc. Then
\begin{bmatrix}a & b & c \\ d & e & f\\ h & i & j\end{bmatrix}\begin{bmatrix}1 \\ 0 \\ 0 \end{bmatrix}= \begin{bmatrix}a \\ d \\ h\end{bmatrix}
That is, multiplying the matrix representation of T by the matrix representation of each basis vector in B gives a column of the matrix, the matrix representation of the corresponding basis vector in C.

A vector, v, is in the kernel of T if and only if Tv= 0 which would be written, in terms of basis C, as the number 0 times each vector in C. That would be represented by the matrix \begin{bmatrix} 0 \\ 0 \\ 0 \end{bmatrix} so that the representation of v in B is in the nullspace of [T]C B.

Similarly, since the columns of [T]C B give the coefficients of the linear combinations of basis vectors in C, there is a one to one correspondence between the range of T and the linear combinations of the columns.
 
Question: A clock's minute hand has length 4 and its hour hand has length 3. What is the distance between the tips at the moment when it is increasing most rapidly?(Putnam Exam Question) Answer: Making assumption that both the hands moves at constant angular velocities, the answer is ## \sqrt{7} .## But don't you think this assumption is somewhat doubtful and wrong?

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
Replies
15
Views
2K
Replies
1
Views
1K
Replies
8
Views
2K
Replies
5
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K