I have another eigenvector problem, where the transformation is given by T(f(x))= xf'(x) + f(2)x + f(3) . I haven't slightest clue how to represent this transformation with a matrix, and as such am completely stumped.
Thanks!
I have another eigenvector problem, where the transformation is given by T(f(x))= xf'(x) + f(2)x + f(3) . I haven't slightest clue how to represent this transformation with a matrix, and as such am completely stumped.
Thanks!
You haven't said what the vector space is- what kinds of functions f(x) can be. The most general would be "the space of all differentiable functions" but that is an infinite dimensional vector space and T cannot be represented by a matrix.
It is impossible to represent T as a matrix until we know what the vector space is! Please state the entire problem.
So V is the set of polynomials of degree 2 or less over the real numbers.
In order to represent a linear transformation as a matrix you have to first have a basis and the standard basis for this space is . Apply the linear transformation to each vector in the basis in turn and write the result in terms of the basis. The coefficients in that linear combination form one column of the basis.
Here, T(f(x))= xf'+ f(2)x+ f(3) so T(1)= x(0)+ 1x+ 1= 1+ x. Since that is , the first column of the matrix is .
and the second column of the matrix is .
Finally, so the third column of the matrix is .
The matrix representation of this linear transformation is .
But you shouldn't have to write a linear transformation as a matrix to find eigenvalues- eigenvalue problems show up in many fields of mathematics, often in "function spaces" of infinite dimension where the transformations cannot be written as matrices.
Here, any "vector" is of the form and so , f(2)= 4a+ 2b+ c, and f(3)= 9a+ 3b+ c.
so, comparing "like" coefficients, we must have , , and .
The first equation, is the same as so that either a= 0 or the eigenvalue is 2.
Set a= 0 to find other eigenvalues.