MHB Why Does the Matrix Calculation Not Match Expected Results in Linear Mapping?

Mathick
Messages
23
Reaction score
0
Hello!

I don't know exactly how to state my question so I'll show you what my problem is.

Ex. Let T : [math]R[x]_3 →R[/math] be the function defined by [math] T(p(x)) = p(−1) + \int_{0}^{1} p(x) \,dx [/math], where [math]R[x]_3[/math] is a vector space of polynomials with degree at most 3. Show that $T$ is a linear map; write down the matrix of $T$ with respect to the standard bases of [math]R[x]_3[/math] and [math]R[/math] (the latter basis is of course given by [math] \left\{(1)\right\}[/math], i.e. the set consisting of the column vector of length 1 with entry 1), and find a basis for the kernel of $T$.

I found this matrix. It's a row vector [math]A=(2 \quad -\frac{1}{2} \quad\quad \frac{4}{3} \quad -\frac{3}{4})[/math]. And then the kernel basis is [math]1+4x,2-3x^2,3+8x^3[/math].

But I don't understand it. I mean if I multiply the matrix [math]A[/math] by a standard vector [math](1 \quad x \quad x^2 \quad x^3) [/math] I won't get, for example, for [math] p(x)=x [/math] the value [math] -\frac{1}{2}[/math].

Please, help me find the point where I misunderstand something. I really want to know what I am doing. I don't want to do maths like a robot without understanding.
 
Last edited:
Physics news on Phys.org
Mathick said:
Hello!

I don't know exactly how to state my question so I'll show you what my problem is.

Ex. Let T : [math]R[x]_3 →R[/math] be the function defined by [math] T(p(x)) = p(−1) + \int_{0}^{1} p(x) \,dx [/math], where [math]R[x]_3[/math] is a vector space of polynomials with degree at most 3. Show that $T$ is a linear map; write down the matrix of $T$ with respect to the standard bases of [math]R[x]_3[/math] and [math]R[/math] (the latter basis is of course given by [math] \left\{(1)\right\}[/math], i.e. the set consisting of the column vector of length 1 with entry 1), and find a basis for the kernel of $T$.

I found this matrix. It's a row vector [math]A=(2 \quad -\frac{1}{2} \quad\quad \frac{4}{3} \quad -\frac{3}{4})[/math]. And then the kernel basis is [math]1+4x,2-3x^2,3+8x^3[/math].

But I don't understand it. I mean if I multiply the matrix [math]A[/math] by a standard vector [math](1 \quad x \quad x^2 \quad x^3) [/math] I won't get, for example, for [math] p(x)=x [/math] the value [math] -\frac{1}{2}[/math].

Please, help me find the point where I misunderstand something. I really want to know what I am doing. I don't want to do maths like a robot without understanding.
With respect to the standard basis $\{1,x,x^2,x^3\}$ of $R[x]_3$, the polynomial $p(x) = a + bx + cx^2 + dx^3$ is represented by the vector $V = \begin{bmatrix}a\\b\\c\\d\end{bmatrix},$ so that $$T(p(x)) = AV = \begin{bmatrix}2&-\tfrac12 & \tfrac43 & -\tfrac34\end{bmatrix} \begin{bmatrix}a\\b\\c\\d\end{bmatrix}.$$ In particular, if $p(x) = x$ then $V = \begin{bmatrix}0\\1\\0\\0\end{bmatrix}$ and $T(p(x)) = \begin{bmatrix}2&-\tfrac12 & \tfrac43 & -\tfrac34\end{bmatrix} \begin{bmatrix}0\\1\\0\\0\end{bmatrix} = -\frac12.$
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...

Similar threads

Replies
7
Views
2K
Replies
1
Views
3K
Replies
34
Views
2K
Replies
14
Views
2K
Replies
4
Views
2K
Back
Top