Inequality of fourier series
$begingroup$
Let $a_n$ and $b_n$ the fourier coefficient of a $2pi-$ periodic functions $f$ we assume the regularity as we want to obtain the convergence of the series ( for example $f$ is $C^2$)
How can i prove the inequality (if it's true)
$$sum_{k=2}^{infty} (a_{k}^{2}+b_{k}^{2}) le C sum_{k=2}^{infty}(k^{2}-1) (a_{k}^{2}+b_{k}^{2}) $$
and what is the best constant $Cin mathbb{R}_{+}$
inequality fourier-series
$endgroup$
add a comment |
$begingroup$
Let $a_n$ and $b_n$ the fourier coefficient of a $2pi-$ periodic functions $f$ we assume the regularity as we want to obtain the convergence of the series ( for example $f$ is $C^2$)
How can i prove the inequality (if it's true)
$$sum_{k=2}^{infty} (a_{k}^{2}+b_{k}^{2}) le C sum_{k=2}^{infty}(k^{2}-1) (a_{k}^{2}+b_{k}^{2}) $$
and what is the best constant $Cin mathbb{R}_{+}$
inequality fourier-series
$endgroup$
1
$begingroup$
don't you have $k^2-1 > 1$ for any $k>2$ ?
$endgroup$
– J.F
Jan 19 at 17:43
$begingroup$
thanks , it's arrive to me to ask stupid question :) .
$endgroup$
– T A R I K
Jan 19 at 17:50
add a comment |
$begingroup$
Let $a_n$ and $b_n$ the fourier coefficient of a $2pi-$ periodic functions $f$ we assume the regularity as we want to obtain the convergence of the series ( for example $f$ is $C^2$)
How can i prove the inequality (if it's true)
$$sum_{k=2}^{infty} (a_{k}^{2}+b_{k}^{2}) le C sum_{k=2}^{infty}(k^{2}-1) (a_{k}^{2}+b_{k}^{2}) $$
and what is the best constant $Cin mathbb{R}_{+}$
inequality fourier-series
$endgroup$
Let $a_n$ and $b_n$ the fourier coefficient of a $2pi-$ periodic functions $f$ we assume the regularity as we want to obtain the convergence of the series ( for example $f$ is $C^2$)
How can i prove the inequality (if it's true)
$$sum_{k=2}^{infty} (a_{k}^{2}+b_{k}^{2}) le C sum_{k=2}^{infty}(k^{2}-1) (a_{k}^{2}+b_{k}^{2}) $$
and what is the best constant $Cin mathbb{R}_{+}$
inequality fourier-series
inequality fourier-series
asked Jan 19 at 17:41


T A R I KT A R I K
297
297
1
$begingroup$
don't you have $k^2-1 > 1$ for any $k>2$ ?
$endgroup$
– J.F
Jan 19 at 17:43
$begingroup$
thanks , it's arrive to me to ask stupid question :) .
$endgroup$
– T A R I K
Jan 19 at 17:50
add a comment |
1
$begingroup$
don't you have $k^2-1 > 1$ for any $k>2$ ?
$endgroup$
– J.F
Jan 19 at 17:43
$begingroup$
thanks , it's arrive to me to ask stupid question :) .
$endgroup$
– T A R I K
Jan 19 at 17:50
1
1
$begingroup$
don't you have $k^2-1 > 1$ for any $k>2$ ?
$endgroup$
– J.F
Jan 19 at 17:43
$begingroup$
don't you have $k^2-1 > 1$ for any $k>2$ ?
$endgroup$
– J.F
Jan 19 at 17:43
$begingroup$
thanks , it's arrive to me to ask stupid question :) .
$endgroup$
– T A R I K
Jan 19 at 17:50
$begingroup$
thanks , it's arrive to me to ask stupid question :) .
$endgroup$
– T A R I K
Jan 19 at 17:50
add a comment |
0
active
oldest
votes
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%2f3079609%2finequality-of-fourier-series%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f3079609%2finequality-of-fourier-series%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
1
$begingroup$
don't you have $k^2-1 > 1$ for any $k>2$ ?
$endgroup$
– J.F
Jan 19 at 17:43
$begingroup$
thanks , it's arrive to me to ask stupid question :) .
$endgroup$
– T A R I K
Jan 19 at 17:50