Find $a_{0}, a_{1}, a_{2}, a_{3} in mathbb C$ for which $f^{*}=a_{0}p_{0}^{*}+ a_{1}p_{1}^{*}+a_{2}p_{2}^{*}+...
$begingroup$
In the linear space $mathbb C[x]_{3}$ is a basis: $p_{0}(x)=1$, $p_{1}(x)=x$, $p_{2}(x)=x(x-i)$, $p_{3}(x)=x(x-i)(x-1)$.
$(p_{0}^{*}, p_{1}^{*}, p_{2}^{*}, p_{3}^{*})$ is a basis of space $(mathbb C[x]_{3})^{*}$ which is dual for a basis $(p_{0}, p_{1}, p_{2}, p_{3})$.
Functional $f^{*} in (mathbb C[x]_{3})^{*}$ is such that $f^{*}(p)=p(-i)$.
Find $a_{0}, a_{1}, a_{2}, a_{3} in mathbb C$ for which $f^{*}=a_{0}p_{0}^{*}+ a_{1}p_{1}^{*}+a_{2}p_{2}^{*}+ a_{3}p_{3}^{*}$.
Can you get me some tips to this question? I never had similar task and I do not even know what to look for to start this task. I'm weak from line functionalities and it's too hard for me.
linear-algebra
$endgroup$
add a comment |
$begingroup$
In the linear space $mathbb C[x]_{3}$ is a basis: $p_{0}(x)=1$, $p_{1}(x)=x$, $p_{2}(x)=x(x-i)$, $p_{3}(x)=x(x-i)(x-1)$.
$(p_{0}^{*}, p_{1}^{*}, p_{2}^{*}, p_{3}^{*})$ is a basis of space $(mathbb C[x]_{3})^{*}$ which is dual for a basis $(p_{0}, p_{1}, p_{2}, p_{3})$.
Functional $f^{*} in (mathbb C[x]_{3})^{*}$ is such that $f^{*}(p)=p(-i)$.
Find $a_{0}, a_{1}, a_{2}, a_{3} in mathbb C$ for which $f^{*}=a_{0}p_{0}^{*}+ a_{1}p_{1}^{*}+a_{2}p_{2}^{*}+ a_{3}p_{3}^{*}$.
Can you get me some tips to this question? I never had similar task and I do not even know what to look for to start this task. I'm weak from line functionalities and it's too hard for me.
linear-algebra
$endgroup$
add a comment |
$begingroup$
In the linear space $mathbb C[x]_{3}$ is a basis: $p_{0}(x)=1$, $p_{1}(x)=x$, $p_{2}(x)=x(x-i)$, $p_{3}(x)=x(x-i)(x-1)$.
$(p_{0}^{*}, p_{1}^{*}, p_{2}^{*}, p_{3}^{*})$ is a basis of space $(mathbb C[x]_{3})^{*}$ which is dual for a basis $(p_{0}, p_{1}, p_{2}, p_{3})$.
Functional $f^{*} in (mathbb C[x]_{3})^{*}$ is such that $f^{*}(p)=p(-i)$.
Find $a_{0}, a_{1}, a_{2}, a_{3} in mathbb C$ for which $f^{*}=a_{0}p_{0}^{*}+ a_{1}p_{1}^{*}+a_{2}p_{2}^{*}+ a_{3}p_{3}^{*}$.
Can you get me some tips to this question? I never had similar task and I do not even know what to look for to start this task. I'm weak from line functionalities and it's too hard for me.
linear-algebra
$endgroup$
In the linear space $mathbb C[x]_{3}$ is a basis: $p_{0}(x)=1$, $p_{1}(x)=x$, $p_{2}(x)=x(x-i)$, $p_{3}(x)=x(x-i)(x-1)$.
$(p_{0}^{*}, p_{1}^{*}, p_{2}^{*}, p_{3}^{*})$ is a basis of space $(mathbb C[x]_{3})^{*}$ which is dual for a basis $(p_{0}, p_{1}, p_{2}, p_{3})$.
Functional $f^{*} in (mathbb C[x]_{3})^{*}$ is such that $f^{*}(p)=p(-i)$.
Find $a_{0}, a_{1}, a_{2}, a_{3} in mathbb C$ for which $f^{*}=a_{0}p_{0}^{*}+ a_{1}p_{1}^{*}+a_{2}p_{2}^{*}+ a_{3}p_{3}^{*}$.
Can you get me some tips to this question? I never had similar task and I do not even know what to look for to start this task. I'm weak from line functionalities and it's too hard for me.
linear-algebra
linear-algebra
edited Feb 2 at 23:17
VirtualUser
asked Feb 2 at 19:04
VirtualUserVirtualUser
1,321317
1,321317
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Note that by the definition of the dual basis,
$$p_j^*(p_i) = begin{cases}0 & i ne j\1 & i = jend{cases}$$
So if $$f^* = a_0p_0^* + a_1p_1^* + a_2p_2^* + a_3p_3^*$$ then
$$f^*(p_i) = a_i$$
for all $i$
And since $f^*(P) = P(-i)$ for any polynomial $P$, you can calculate $f^*(p_i)$ easily.
$endgroup$
add a comment |
Your Answer
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3097663%2ffind-a-0-a-1-a-2-a-3-in-mathbb-c-for-which-f-a-0p-0%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Note that by the definition of the dual basis,
$$p_j^*(p_i) = begin{cases}0 & i ne j\1 & i = jend{cases}$$
So if $$f^* = a_0p_0^* + a_1p_1^* + a_2p_2^* + a_3p_3^*$$ then
$$f^*(p_i) = a_i$$
for all $i$
And since $f^*(P) = P(-i)$ for any polynomial $P$, you can calculate $f^*(p_i)$ easily.
$endgroup$
add a comment |
$begingroup$
Note that by the definition of the dual basis,
$$p_j^*(p_i) = begin{cases}0 & i ne j\1 & i = jend{cases}$$
So if $$f^* = a_0p_0^* + a_1p_1^* + a_2p_2^* + a_3p_3^*$$ then
$$f^*(p_i) = a_i$$
for all $i$
And since $f^*(P) = P(-i)$ for any polynomial $P$, you can calculate $f^*(p_i)$ easily.
$endgroup$
add a comment |
$begingroup$
Note that by the definition of the dual basis,
$$p_j^*(p_i) = begin{cases}0 & i ne j\1 & i = jend{cases}$$
So if $$f^* = a_0p_0^* + a_1p_1^* + a_2p_2^* + a_3p_3^*$$ then
$$f^*(p_i) = a_i$$
for all $i$
And since $f^*(P) = P(-i)$ for any polynomial $P$, you can calculate $f^*(p_i)$ easily.
$endgroup$
Note that by the definition of the dual basis,
$$p_j^*(p_i) = begin{cases}0 & i ne j\1 & i = jend{cases}$$
So if $$f^* = a_0p_0^* + a_1p_1^* + a_2p_2^* + a_3p_3^*$$ then
$$f^*(p_i) = a_i$$
for all $i$
And since $f^*(P) = P(-i)$ for any polynomial $P$, you can calculate $f^*(p_i)$ easily.
answered Feb 3 at 4:35


Paul SinclairPaul Sinclair
20.9k21543
20.9k21543
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3097663%2ffind-a-0-a-1-a-2-a-3-in-mathbb-c-for-which-f-a-0p-0%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown