$begingroup$
Let ${p_{n}}$ be a sequence of polynomials and $f$ a continuous function
on $[0,1]$ such that $intlimits_{0}^{1}|p_{n}(x)-f(x)|dxto 0$.
Let $c_{n,k}$ be the coefficient of $x^{k}$ in $p_{n}(x)$. Can we conclude
that $underset{nrightarrow infty }{lim }c_{n,k}$ exists for each $k$?.
What I know so far: if the degrees of $p_{n}^{prime }s$ are bounded then
this is true. In fact we can replace $L^{1}$ convergence by convergence in
any norm on $C[0,1]$; to see this we just have to note that for fixed $N$, $%
sum_{k=0}^{N}c_{i}x^{i}rightarrow (c_{0},c_{1},...,c_{N})$ is a
linear map on a finite dimensional subspace and hence it is continuous. My
guess is that the result fails when there is no restriction on the degrees.
But if $p_{n}(z)$ converges uniformly in some disk around $0$ in the complex
plane then the conclusion holds. To construct a counterexample we have to
avoid this situation. May be there is a very simple example but I haven't been
to find one. Thank you for investing your time on this.
functional-analysis
$endgroup$
add a comment |
$begingroup$
Let ${p_{n}}$ be a sequence of polynomials and $f$ a continuous function
on $[0,1]$ such that $intlimits_{0}^{1}|p_{n}(x)-f(x)|dxto 0$.
Let $c_{n,k}$ be the coefficient of $x^{k}$ in $p_{n}(x)$. Can we conclude
that $underset{nrightarrow infty }{lim }c_{n,k}$ exists for each $k$?.
What I know so far: if the degrees of $p_{n}^{prime }s$ are bounded then
this is true. In fact we can replace $L^{1}$ convergence by convergence in
any norm on $C[0,1]$; to see this we just have to note that for fixed $N$, $%
sum_{k=0}^{N}c_{i}x^{i}rightarrow (c_{0},c_{1},...,c_{N})$ is a
linear map on a finite dimensional subspace and hence it is continuous. My
guess is that the result fails when there is no restriction on the degrees.
But if $p_{n}(z)$ converges uniformly in some disk around $0$ in the complex
plane then the conclusion holds. To construct a counterexample we have to
avoid this situation. May be there is a very simple example but I haven't been
to find one. Thank you for investing your time on this.
functional-analysis
$endgroup$
add a comment |
$begingroup$
Let ${p_{n}}$ be a sequence of polynomials and $f$ a continuous function
on $[0,1]$ such that $intlimits_{0}^{1}|p_{n}(x)-f(x)|dxto 0$.
Let $c_{n,k}$ be the coefficient of $x^{k}$ in $p_{n}(x)$. Can we conclude
that $underset{nrightarrow infty }{lim }c_{n,k}$ exists for each $k$?.
What I know so far: if the degrees of $p_{n}^{prime }s$ are bounded then
this is true. In fact we can replace $L^{1}$ convergence by convergence in
any norm on $C[0,1]$; to see this we just have to note that for fixed $N$, $%
sum_{k=0}^{N}c_{i}x^{i}rightarrow (c_{0},c_{1},...,c_{N})$ is a
linear map on a finite dimensional subspace and hence it is continuous. My
guess is that the result fails when there is no restriction on the degrees.
But if $p_{n}(z)$ converges uniformly in some disk around $0$ in the complex
plane then the conclusion holds. To construct a counterexample we have to
avoid this situation. May be there is a very simple example but I haven't been
to find one. Thank you for investing your time on this.
functional-analysis
$endgroup$
Let ${p_{n}}$ be a sequence of polynomials and $f$ a continuous function
on $[0,1]$ such that $intlimits_{0}^{1}|p_{n}(x)-f(x)|dxto 0$.
Let $c_{n,k}$ be the coefficient of $x^{k}$ in $p_{n}(x)$. Can we conclude
that $underset{nrightarrow infty }{lim }c_{n,k}$ exists for each $k$?.
What I know so far: if the degrees of $p_{n}^{prime }s$ are bounded then
this is true. In fact we can replace $L^{1}$ convergence by convergence in
any norm on $C[0,1]$; to see this we just have to note that for fixed $N$, $%
sum_{k=0}^{N}c_{i}x^{i}rightarrow (c_{0},c_{1},...,c_{N})$ is a
linear map on a finite dimensional subspace and hence it is continuous. My
guess is that the result fails when there is no restriction on the degrees.
But if $p_{n}(z)$ converges uniformly in some disk around $0$ in the complex
plane then the conclusion holds. To construct a counterexample we have to
avoid this situation. May be there is a very simple example but I haven't been
to find one. Thank you for investing your time on this.
functional-analysis
functional-analysis
edited 25 mins ago
Bernard
123k741116
123k741116
asked 3 hours ago


Kavi Rama MurthyKavi Rama Murthy
68k53067
68k53067
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Consider the sequence of polynomials
$$
p_n(x)=left{
begin{array}{@{}ll@{}}
(1-x)^n, & text{if} nequiv 0 mod 2 \
x^n, & text{if} nequiv 1 mod 2
end{array}right.
$$
Then $p_n(x)$ converges to $0$ but the constant term is oscillating.
$endgroup$
2
$begingroup$
Thanks. I just noticed that teh conclusion fails even with uniform convergence. Consider $x(1-x)p_n(x)$ with the $p_n$' you have defined and look at the coefficient of $x$.
$endgroup$
– Kavi Rama Murthy
2 hours ago
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
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%2f3152512%2fdoes-convergence-of-polynomials-imply-that-of-its-coefficients%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$
Consider the sequence of polynomials
$$
p_n(x)=left{
begin{array}{@{}ll@{}}
(1-x)^n, & text{if} nequiv 0 mod 2 \
x^n, & text{if} nequiv 1 mod 2
end{array}right.
$$
Then $p_n(x)$ converges to $0$ but the constant term is oscillating.
$endgroup$
2
$begingroup$
Thanks. I just noticed that teh conclusion fails even with uniform convergence. Consider $x(1-x)p_n(x)$ with the $p_n$' you have defined and look at the coefficient of $x$.
$endgroup$
– Kavi Rama Murthy
2 hours ago
add a comment |
$begingroup$
Consider the sequence of polynomials
$$
p_n(x)=left{
begin{array}{@{}ll@{}}
(1-x)^n, & text{if} nequiv 0 mod 2 \
x^n, & text{if} nequiv 1 mod 2
end{array}right.
$$
Then $p_n(x)$ converges to $0$ but the constant term is oscillating.
$endgroup$
2
$begingroup$
Thanks. I just noticed that teh conclusion fails even with uniform convergence. Consider $x(1-x)p_n(x)$ with the $p_n$' you have defined and look at the coefficient of $x$.
$endgroup$
– Kavi Rama Murthy
2 hours ago
add a comment |
$begingroup$
Consider the sequence of polynomials
$$
p_n(x)=left{
begin{array}{@{}ll@{}}
(1-x)^n, & text{if} nequiv 0 mod 2 \
x^n, & text{if} nequiv 1 mod 2
end{array}right.
$$
Then $p_n(x)$ converges to $0$ but the constant term is oscillating.
$endgroup$
Consider the sequence of polynomials
$$
p_n(x)=left{
begin{array}{@{}ll@{}}
(1-x)^n, & text{if} nequiv 0 mod 2 \
x^n, & text{if} nequiv 1 mod 2
end{array}right.
$$
Then $p_n(x)$ converges to $0$ but the constant term is oscillating.
answered 2 hours ago


ChronusZedChronusZed
811415
811415
2
$begingroup$
Thanks. I just noticed that teh conclusion fails even with uniform convergence. Consider $x(1-x)p_n(x)$ with the $p_n$' you have defined and look at the coefficient of $x$.
$endgroup$
– Kavi Rama Murthy
2 hours ago
add a comment |
2
$begingroup$
Thanks. I just noticed that teh conclusion fails even with uniform convergence. Consider $x(1-x)p_n(x)$ with the $p_n$' you have defined and look at the coefficient of $x$.
$endgroup$
– Kavi Rama Murthy
2 hours ago
2
2
$begingroup$
Thanks. I just noticed that teh conclusion fails even with uniform convergence. Consider $x(1-x)p_n(x)$ with the $p_n$' you have defined and look at the coefficient of $x$.
$endgroup$
– Kavi Rama Murthy
2 hours ago
$begingroup$
Thanks. I just noticed that teh conclusion fails even with uniform convergence. Consider $x(1-x)p_n(x)$ with the $p_n$' you have defined and look at the coefficient of $x$.
$endgroup$
– Kavi Rama Murthy
2 hours ago
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%2f3152512%2fdoes-convergence-of-polynomials-imply-that-of-its-coefficients%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