Finding Inverse of a Transformation

TranscendArcu
Messages
277
Reaction score
0

Homework Statement



Skjermbilde_2012_03_11_kl_11_55_44_AM.png


The Attempt at a Solution


Suppose we take an arbitrary polynomial in P_2 (R), call this a_0 + a_1 x + a_2 x^2

T(a_0 + a_1 x + a_2 x^2) = (a_0, a_0 + a_1 + a_2, a_0 - a_1 + a_2)

Now, I was under the impression that I could construct a matrix for T by showing what T does to each of the standard basis vectors of P_2 (R), these being the set 1,x,x^2.

Doing some mapping: T(1 + 0x + 0x^2) = (1,1,1), T(0 + 1x + 0x^2) = (0,1,-1), T(0+0x+1x^2) = (0,1,1).

Thus my matrix for T has these outputs as its columns. Via some elementary row reduction I concluded that the matrix (with semicolons indicating the end of a row) [1 0 0;0 1/2 1/2;-1 1/2 -1/2] is the inverse of T, call it S.

Moreover, it can be checked that T*S = I, which leads me to suspect that I have the write answer. Does this look about right?
 
Physics news on Phys.org
Yes it does
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top