Function with uniformly but non absolutely convergent Fourier series The Next CEO of Stack OverflowPointwise but not uniform convergence of a Fourier seriesA function whose derivatives always have a convergent fourier seriesProve that the Fourier series of $dfrac1f$ is absolutely convergent.Absolutely convergent but not convergentAbsolute convergence of fourier seriesAbsolutely but not uniformly convergentconditionally convergent but not absolutely convergent seriesConvergent Fourier series of continuous functionevery absolutely convergence in interval of convergence is uniformlyContinuous periodic function with Fourier series behaving like $1/n$?
Can you teleport closer to a creature you are Frightened of?
How to show a landlord what we have in savings?
My ex-girlfriend uses my Apple ID to login to her iPad, do I have to give her my Apple ID password to reset it?
Why can't we say "I have been having a dog"?
Does the Idaho Potato Commission associate potato skins with healthy eating?
Man transported from Alternate World into ours by a Neutrino Detector
What difference does it make matching a word with/without a trailing whitespace?
How does a dynamic QR code work?
Read/write a pipe-delimited file line by line with some simple text manipulation
How to pronounce fünf in 45
Small nick on power cord from an electric alarm clock, and copper wiring exposed but intact
Why did the Drakh emissary look so blurred in S04:E11 "Lines of Communication"?
MT "will strike" & LXX "will watch carefully" (Gen 3:15)?
Raspberry pi 3 B with Ubuntu 18.04 server arm64: what pi version
Creating a script with console commands
Are British MPs missing the point, with these 'Indicative Votes'?
Ising model simulation
Is it possible to make a 9x9 table fit within the default margins?
Does Germany produce more waste than the US?
Why did Batya get tzaraat?
pgfplots: How to draw a tangent graph below two others?
How do I secure a TV wall mount?
Calculate the Mean mean of two numbers
Car headlights in a world without electricity
Function with uniformly but non absolutely convergent Fourier series
The Next CEO of Stack OverflowPointwise but not uniform convergence of a Fourier seriesA function whose derivatives always have a convergent fourier seriesProve that the Fourier series of $dfrac1f$ is absolutely convergent.Absolutely convergent but not convergentAbsolute convergence of fourier seriesAbsolutely but not uniformly convergentconditionally convergent but not absolutely convergent seriesConvergent Fourier series of continuous functionevery absolutely convergence in interval of convergence is uniformlyContinuous periodic function with Fourier series behaving like $1/n$?
$begingroup$
Is there an example of a periodic continuous function on $mathbbR$ such that its Fourier series is uniformly convergent (to $f$), but it is not absolutely convergent ?
real-analysis sequences-and-series fourier-analysis
$endgroup$
add a comment |
$begingroup$
Is there an example of a periodic continuous function on $mathbbR$ such that its Fourier series is uniformly convergent (to $f$), but it is not absolutely convergent ?
real-analysis sequences-and-series fourier-analysis
$endgroup$
add a comment |
$begingroup$
Is there an example of a periodic continuous function on $mathbbR$ such that its Fourier series is uniformly convergent (to $f$), but it is not absolutely convergent ?
real-analysis sequences-and-series fourier-analysis
$endgroup$
Is there an example of a periodic continuous function on $mathbbR$ such that its Fourier series is uniformly convergent (to $f$), but it is not absolutely convergent ?
real-analysis sequences-and-series fourier-analysis
real-analysis sequences-and-series fourier-analysis
asked Mar 28 at 9:19
Phil-WPhil-W
32818
32818
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
$sum frac sin (nx) nlog , n$ is such a series. The proof is not obvious but it is a well known result. See Edwards, Fourier Series. p. 166.
$endgroup$
$begingroup$
If you assume the well-known fact that $sum frac sin (nx) n$ has partial sums that are uniformly bounded, the proof is immediate with a summation by parts. With oscillating coefficients we can construct examples for which $a_n$ ~ $n^-a, a > frac12$ and even $a_n$ ~ $n^-frac12(log n)^-1-b, b>0$ which is best we can do since by Plancherel we know that $Sigma^2 < infty$ when the Fourier series converges uniformly, so in particular we get examples of continuos functions with Fourier series for which $Sigma = infty$ for any $b>0$
$endgroup$
– Conrad
Mar 28 at 12:31
$begingroup$
Use $Sigmafrac 1 nlog , n = infty$ and $x=fracpi2$ and the absolute sum is the odd part of $Sigmafrac 1 nlog , n$
$endgroup$
– Conrad
Mar 28 at 12:47
$begingroup$
@Conrad You are right.
$endgroup$
– Kavi Rama Murthy
Mar 28 at 13:00
$begingroup$
The tricky part is uniform convergence near $0$ and for that some subtle result or method is needed since the result is not true for cosine series where full period interval pointwise, uniform and absolute convergence are obviously equivalent when the coefficients are positive
$endgroup$
– Conrad
Mar 28 at 14:12
$begingroup$
@Conrad In the book I have referred to it is shown that if $(a_n)$ decreases to $0$ then $sum a_n sin(nx)$ is uniformly convergent iff $na_n to 0$.
$endgroup$
– Kavi Rama Murthy
Mar 28 at 23:21
|
show 1 more comment
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%2f3165664%2ffunction-with-uniformly-but-non-absolutely-convergent-fourier-series%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$
$sum frac sin (nx) nlog , n$ is such a series. The proof is not obvious but it is a well known result. See Edwards, Fourier Series. p. 166.
$endgroup$
$begingroup$
If you assume the well-known fact that $sum frac sin (nx) n$ has partial sums that are uniformly bounded, the proof is immediate with a summation by parts. With oscillating coefficients we can construct examples for which $a_n$ ~ $n^-a, a > frac12$ and even $a_n$ ~ $n^-frac12(log n)^-1-b, b>0$ which is best we can do since by Plancherel we know that $Sigma^2 < infty$ when the Fourier series converges uniformly, so in particular we get examples of continuos functions with Fourier series for which $Sigma = infty$ for any $b>0$
$endgroup$
– Conrad
Mar 28 at 12:31
$begingroup$
Use $Sigmafrac 1 nlog , n = infty$ and $x=fracpi2$ and the absolute sum is the odd part of $Sigmafrac 1 nlog , n$
$endgroup$
– Conrad
Mar 28 at 12:47
$begingroup$
@Conrad You are right.
$endgroup$
– Kavi Rama Murthy
Mar 28 at 13:00
$begingroup$
The tricky part is uniform convergence near $0$ and for that some subtle result or method is needed since the result is not true for cosine series where full period interval pointwise, uniform and absolute convergence are obviously equivalent when the coefficients are positive
$endgroup$
– Conrad
Mar 28 at 14:12
$begingroup$
@Conrad In the book I have referred to it is shown that if $(a_n)$ decreases to $0$ then $sum a_n sin(nx)$ is uniformly convergent iff $na_n to 0$.
$endgroup$
– Kavi Rama Murthy
Mar 28 at 23:21
|
show 1 more comment
$begingroup$
$sum frac sin (nx) nlog , n$ is such a series. The proof is not obvious but it is a well known result. See Edwards, Fourier Series. p. 166.
$endgroup$
$begingroup$
If you assume the well-known fact that $sum frac sin (nx) n$ has partial sums that are uniformly bounded, the proof is immediate with a summation by parts. With oscillating coefficients we can construct examples for which $a_n$ ~ $n^-a, a > frac12$ and even $a_n$ ~ $n^-frac12(log n)^-1-b, b>0$ which is best we can do since by Plancherel we know that $Sigma^2 < infty$ when the Fourier series converges uniformly, so in particular we get examples of continuos functions with Fourier series for which $Sigma = infty$ for any $b>0$
$endgroup$
– Conrad
Mar 28 at 12:31
$begingroup$
Use $Sigmafrac 1 nlog , n = infty$ and $x=fracpi2$ and the absolute sum is the odd part of $Sigmafrac 1 nlog , n$
$endgroup$
– Conrad
Mar 28 at 12:47
$begingroup$
@Conrad You are right.
$endgroup$
– Kavi Rama Murthy
Mar 28 at 13:00
$begingroup$
The tricky part is uniform convergence near $0$ and for that some subtle result or method is needed since the result is not true for cosine series where full period interval pointwise, uniform and absolute convergence are obviously equivalent when the coefficients are positive
$endgroup$
– Conrad
Mar 28 at 14:12
$begingroup$
@Conrad In the book I have referred to it is shown that if $(a_n)$ decreases to $0$ then $sum a_n sin(nx)$ is uniformly convergent iff $na_n to 0$.
$endgroup$
– Kavi Rama Murthy
Mar 28 at 23:21
|
show 1 more comment
$begingroup$
$sum frac sin (nx) nlog , n$ is such a series. The proof is not obvious but it is a well known result. See Edwards, Fourier Series. p. 166.
$endgroup$
$sum frac sin (nx) nlog , n$ is such a series. The proof is not obvious but it is a well known result. See Edwards, Fourier Series. p. 166.
answered Mar 28 at 9:25
Kavi Rama MurthyKavi Rama Murthy
71.5k53170
71.5k53170
$begingroup$
If you assume the well-known fact that $sum frac sin (nx) n$ has partial sums that are uniformly bounded, the proof is immediate with a summation by parts. With oscillating coefficients we can construct examples for which $a_n$ ~ $n^-a, a > frac12$ and even $a_n$ ~ $n^-frac12(log n)^-1-b, b>0$ which is best we can do since by Plancherel we know that $Sigma^2 < infty$ when the Fourier series converges uniformly, so in particular we get examples of continuos functions with Fourier series for which $Sigma = infty$ for any $b>0$
$endgroup$
– Conrad
Mar 28 at 12:31
$begingroup$
Use $Sigmafrac 1 nlog , n = infty$ and $x=fracpi2$ and the absolute sum is the odd part of $Sigmafrac 1 nlog , n$
$endgroup$
– Conrad
Mar 28 at 12:47
$begingroup$
@Conrad You are right.
$endgroup$
– Kavi Rama Murthy
Mar 28 at 13:00
$begingroup$
The tricky part is uniform convergence near $0$ and for that some subtle result or method is needed since the result is not true for cosine series where full period interval pointwise, uniform and absolute convergence are obviously equivalent when the coefficients are positive
$endgroup$
– Conrad
Mar 28 at 14:12
$begingroup$
@Conrad In the book I have referred to it is shown that if $(a_n)$ decreases to $0$ then $sum a_n sin(nx)$ is uniformly convergent iff $na_n to 0$.
$endgroup$
– Kavi Rama Murthy
Mar 28 at 23:21
|
show 1 more comment
$begingroup$
If you assume the well-known fact that $sum frac sin (nx) n$ has partial sums that are uniformly bounded, the proof is immediate with a summation by parts. With oscillating coefficients we can construct examples for which $a_n$ ~ $n^-a, a > frac12$ and even $a_n$ ~ $n^-frac12(log n)^-1-b, b>0$ which is best we can do since by Plancherel we know that $Sigma^2 < infty$ when the Fourier series converges uniformly, so in particular we get examples of continuos functions with Fourier series for which $Sigma = infty$ for any $b>0$
$endgroup$
– Conrad
Mar 28 at 12:31
$begingroup$
Use $Sigmafrac 1 nlog , n = infty$ and $x=fracpi2$ and the absolute sum is the odd part of $Sigmafrac 1 nlog , n$
$endgroup$
– Conrad
Mar 28 at 12:47
$begingroup$
@Conrad You are right.
$endgroup$
– Kavi Rama Murthy
Mar 28 at 13:00
$begingroup$
The tricky part is uniform convergence near $0$ and for that some subtle result or method is needed since the result is not true for cosine series where full period interval pointwise, uniform and absolute convergence are obviously equivalent when the coefficients are positive
$endgroup$
– Conrad
Mar 28 at 14:12
$begingroup$
@Conrad In the book I have referred to it is shown that if $(a_n)$ decreases to $0$ then $sum a_n sin(nx)$ is uniformly convergent iff $na_n to 0$.
$endgroup$
– Kavi Rama Murthy
Mar 28 at 23:21
$begingroup$
If you assume the well-known fact that $sum frac sin (nx) n$ has partial sums that are uniformly bounded, the proof is immediate with a summation by parts. With oscillating coefficients we can construct examples for which $a_n$ ~ $n^-a, a > frac12$ and even $a_n$ ~ $n^-frac12(log n)^-1-b, b>0$ which is best we can do since by Plancherel we know that $Sigma^2 < infty$ when the Fourier series converges uniformly, so in particular we get examples of continuos functions with Fourier series for which $Sigma = infty$ for any $b>0$
$endgroup$
– Conrad
Mar 28 at 12:31
$begingroup$
If you assume the well-known fact that $sum frac sin (nx) n$ has partial sums that are uniformly bounded, the proof is immediate with a summation by parts. With oscillating coefficients we can construct examples for which $a_n$ ~ $n^-a, a > frac12$ and even $a_n$ ~ $n^-frac12(log n)^-1-b, b>0$ which is best we can do since by Plancherel we know that $Sigma^2 < infty$ when the Fourier series converges uniformly, so in particular we get examples of continuos functions with Fourier series for which $Sigma = infty$ for any $b>0$
$endgroup$
– Conrad
Mar 28 at 12:31
$begingroup$
Use $Sigmafrac 1 nlog , n = infty$ and $x=fracpi2$ and the absolute sum is the odd part of $Sigmafrac 1 nlog , n$
$endgroup$
– Conrad
Mar 28 at 12:47
$begingroup$
Use $Sigmafrac 1 nlog , n = infty$ and $x=fracpi2$ and the absolute sum is the odd part of $Sigmafrac 1 nlog , n$
$endgroup$
– Conrad
Mar 28 at 12:47
$begingroup$
@Conrad You are right.
$endgroup$
– Kavi Rama Murthy
Mar 28 at 13:00
$begingroup$
@Conrad You are right.
$endgroup$
– Kavi Rama Murthy
Mar 28 at 13:00
$begingroup$
The tricky part is uniform convergence near $0$ and for that some subtle result or method is needed since the result is not true for cosine series where full period interval pointwise, uniform and absolute convergence are obviously equivalent when the coefficients are positive
$endgroup$
– Conrad
Mar 28 at 14:12
$begingroup$
The tricky part is uniform convergence near $0$ and for that some subtle result or method is needed since the result is not true for cosine series where full period interval pointwise, uniform and absolute convergence are obviously equivalent when the coefficients are positive
$endgroup$
– Conrad
Mar 28 at 14:12
$begingroup$
@Conrad In the book I have referred to it is shown that if $(a_n)$ decreases to $0$ then $sum a_n sin(nx)$ is uniformly convergent iff $na_n to 0$.
$endgroup$
– Kavi Rama Murthy
Mar 28 at 23:21
$begingroup$
@Conrad In the book I have referred to it is shown that if $(a_n)$ decreases to $0$ then $sum a_n sin(nx)$ is uniformly convergent iff $na_n to 0$.
$endgroup$
– Kavi Rama Murthy
Mar 28 at 23:21
|
show 1 more 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%2f3165664%2ffunction-with-uniformly-but-non-absolutely-convergent-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