HMPARTICLE said:
suppose that f and g are functions such that f:X -> Y and g:X -> Y, then f = g if for each x in X and y in Y, f(x) = g(x) = y.
That sounds about right... i think. so if f and g are equal, each element in the domain of f and g get mapped to the same element in the co-domain by f and g.
There's no need to involve a second variable (the y in your statement) but you seem to have understand f=g correctly. It means that f and g have the same domain, and that f(x)=g(x) for all x in that domain. In the problem you're working out, all functions have domain ##\mathbb R##, so if you want to check that two polynomials f and g are equal, you have to check if f(x)=g(x) for all real numbers x.
So how do you check if ##t(c_0)=c_0##? If you prefer to use the book's notation, ##\mathbf 0## instead of ##c_0##, that's fine. So how do you check if ##t(\mathbf 0)=\mathbf 0##?
HMPARTICLE said:
Ahh i see, i knew that p(x) is a number and that p is a function, my silly excuse of notation.
I think that a lot of problems are very hard to work out when you don't distinguish between f and f(x), but I don't think you could have been expected to pick the best notation from the start. The difference between f and f(x), and the difference between "is a function" and "is a function of", are both not explained well in math books or by math teachers. Even the actual problem statement fails to make the distinction between f and f(x). It says that t takes p(x) to p(x)+p(2), but what they mean is that we have ##t(p)(x)=p(x)+p(2)## for all ##p\in P_3## and all ##x\in\mathbb R##. The right-hand side is equal to ##(p+c_{p(2)})(x)##, so t is actually taking each p to ##p+c_{p(2)}##. (Note that I'm using the definition of addition of functions, which says that for all X and all ##f,g:X\to\mathbb R##, (f+g)(x)=f(x)+g(x) for all ##x\in X##).
It's not necessary to use the notation for constant functions that I suggested in my previous post. If it doesn't confuse you, you can just write ##r## instead of ##c_r##. This is standard. In this notation, we have ##t(p)(x)=p(x)+p(2)=p(x)+p(2)(x)=(p+p(2))(x)## for all p and all x, and therefore ##t(p)=p+p(2)## for all p. However, I think it would be a bit confusing to denote the zero polynomial by 0, so I would prefer to use a notation like z for it. The book uses ##\mathbf 0##. That's OK too. Just don't use a plain (not bold) ##0##.
HMPARTICLE said:
Ahh i see, i knew that p(x) is a number and that p is a function, my silly excuse of notation.
The solution adds that the zero element of P_3 is p(x) = 0.
If I didn't already know what the zero element of ##P_3## is, I wouldn't have been able to make sense of that sentence. The zero element of ##P_3## is a polynomial, but you wrote down an equality between two numbers. What you should be saying is that the zero element in ##P_3## is the ##p\in P_3## such that ##p(x)=0## for all ##x\in\mathbb R##. If we denote it by z (just because it's easier to type than ##\mathbf 0##), then we have ##p+z=z+p=p## for all ##p\in P_3##. Since these are equalities between functions with domain ##\mathbb R##, this means that ##(p+z)(x)=(z+p)(x)=p(x)## for all ##x\in\mathbb R##. By definition of the addition operation on ##P_3## (the sum of two functions), this means that ##p(x)+z(x)=z(x)+p(x)=p(x)## for all ##x\in\mathbb R##. We know that these equalities hold because ##z(x)=0## for all ##x\in\mathbb R##.
HMPARTICLE said:
what my solution to this was;
t(0) = 0 + p(2)
Why is there a p on the right-hand side?
HMPARTICLE said:
That t is a function that maps polynomials to polynomials. specifically that t maps polynomials of greatest power 2 to themselves plus p(2).
That's correct, but I was hoping that you would say that this means that ##t(p)=p+p(2)## for all ##p\in P_3##, and that this means that ##t(p)(x)=(p+p(2))(x)=p(x)+p(2)## for all ##p\in P_3## and all ##x\in\mathbb R##. Then you can use this to evaluate things like ##t(\mathbf 0)##.