Any countable set of real numbers is set of discontinuities of some monotone function.











up vote
4
down vote

favorite












I am studying for a final exam and have come across the following old exam question:
Prove that any countable set of real numbers is the set of points of discontinuity of some monotone function.



The proof I gave is as follows:



Let $X$ be a countable set of real numbers.
Let ${r_n}_{n in mathbb{N}}$ be an enumeration of $X$, such that $r_n < r_{n+1}$. Define $$f(x) = begin{cases} r_n & x in [r_n, r_{n+1}) \ x & (x<r_1) text{ or } (r_n < x forall n).end{cases}$$ Then for all real $x not in X$, $f$ is continuous at $x$ and discontinuous at $r_n$. Moreover, it is clear that $f$ is monotone by our choice of enumeration of $X$. Q.E.D.



After looking online to confirm my answer, I came across two things which left me confused. First, this StackExchange post: Can I always order a countable set of numbers.
This post seems to say "I am given an enumeration, and I would like to order it" which is shown to be impossible. I believe this contrasts to my approach because I am taking an enumeration which is already ordered, instead of taking an arbitrary enumeration which is then ordered. But I could see the argument to be made that since the ordered enumeration is a permutation of any other enumeration that they are the same thing, and thus a well-ordering of $X$ is not guaranteed to exist. I think that is wrong because $X subseteq mathbb{R}$ so there is at least the well-ordering induced by $mathbb{R}$. Is anyone able to confirm/deny this logic?



Second, I came across Froda's theorem. I think that the question statement is the converse of Froda's theorem, but I am unsure if it is the converse or if it is the same statement in disguise. I realize that it is kind of a dumb question to ask, but what is the relationship between Froda's theorem and this question?



Thanks for any help!










share|cite|improve this question






















  • Your enumeration of X fails for Q.
    – William Elliot
    Nov 18 at 2:13










  • Although $X$ can be well-ordered, there is no guarantee that such a well-ordering will coincide with the usual ordering of $X$ as a subset of $mathbb{R}$. Take for instance $X = {1, 1/2, 1/3, ldots}$: then $r_1 = 1/k$ for some $k in mathbb{N}$, and by your construction $r_n geqslant r_1 > 1/(k + 1)$ for all $n$, so you have not enumerated $X$.
    – Calum Gilhooley
    Nov 18 at 2:15












  • Don't forget the case where the set is finite, unless "countable" means "countably infinite" (which sometimes it does, but not always --- the meaning of "countable" varies among authors).
    – Dave L. Renfro
    Nov 18 at 8:09










  • D'oh! It took me a mere two days to remember having once contributed to a thread on essentially the same question: Remark 4.31 in Baby Rudin: How to verify these points?.
    – Calum Gilhooley
    Nov 20 at 23:00















up vote
4
down vote

favorite












I am studying for a final exam and have come across the following old exam question:
Prove that any countable set of real numbers is the set of points of discontinuity of some monotone function.



The proof I gave is as follows:



Let $X$ be a countable set of real numbers.
Let ${r_n}_{n in mathbb{N}}$ be an enumeration of $X$, such that $r_n < r_{n+1}$. Define $$f(x) = begin{cases} r_n & x in [r_n, r_{n+1}) \ x & (x<r_1) text{ or } (r_n < x forall n).end{cases}$$ Then for all real $x not in X$, $f$ is continuous at $x$ and discontinuous at $r_n$. Moreover, it is clear that $f$ is monotone by our choice of enumeration of $X$. Q.E.D.



After looking online to confirm my answer, I came across two things which left me confused. First, this StackExchange post: Can I always order a countable set of numbers.
This post seems to say "I am given an enumeration, and I would like to order it" which is shown to be impossible. I believe this contrasts to my approach because I am taking an enumeration which is already ordered, instead of taking an arbitrary enumeration which is then ordered. But I could see the argument to be made that since the ordered enumeration is a permutation of any other enumeration that they are the same thing, and thus a well-ordering of $X$ is not guaranteed to exist. I think that is wrong because $X subseteq mathbb{R}$ so there is at least the well-ordering induced by $mathbb{R}$. Is anyone able to confirm/deny this logic?



Second, I came across Froda's theorem. I think that the question statement is the converse of Froda's theorem, but I am unsure if it is the converse or if it is the same statement in disguise. I realize that it is kind of a dumb question to ask, but what is the relationship between Froda's theorem and this question?



Thanks for any help!










share|cite|improve this question






















  • Your enumeration of X fails for Q.
    – William Elliot
    Nov 18 at 2:13










  • Although $X$ can be well-ordered, there is no guarantee that such a well-ordering will coincide with the usual ordering of $X$ as a subset of $mathbb{R}$. Take for instance $X = {1, 1/2, 1/3, ldots}$: then $r_1 = 1/k$ for some $k in mathbb{N}$, and by your construction $r_n geqslant r_1 > 1/(k + 1)$ for all $n$, so you have not enumerated $X$.
    – Calum Gilhooley
    Nov 18 at 2:15












  • Don't forget the case where the set is finite, unless "countable" means "countably infinite" (which sometimes it does, but not always --- the meaning of "countable" varies among authors).
    – Dave L. Renfro
    Nov 18 at 8:09










  • D'oh! It took me a mere two days to remember having once contributed to a thread on essentially the same question: Remark 4.31 in Baby Rudin: How to verify these points?.
    – Calum Gilhooley
    Nov 20 at 23:00













up vote
4
down vote

favorite









up vote
4
down vote

favorite











I am studying for a final exam and have come across the following old exam question:
Prove that any countable set of real numbers is the set of points of discontinuity of some monotone function.



The proof I gave is as follows:



Let $X$ be a countable set of real numbers.
Let ${r_n}_{n in mathbb{N}}$ be an enumeration of $X$, such that $r_n < r_{n+1}$. Define $$f(x) = begin{cases} r_n & x in [r_n, r_{n+1}) \ x & (x<r_1) text{ or } (r_n < x forall n).end{cases}$$ Then for all real $x not in X$, $f$ is continuous at $x$ and discontinuous at $r_n$. Moreover, it is clear that $f$ is monotone by our choice of enumeration of $X$. Q.E.D.



After looking online to confirm my answer, I came across two things which left me confused. First, this StackExchange post: Can I always order a countable set of numbers.
This post seems to say "I am given an enumeration, and I would like to order it" which is shown to be impossible. I believe this contrasts to my approach because I am taking an enumeration which is already ordered, instead of taking an arbitrary enumeration which is then ordered. But I could see the argument to be made that since the ordered enumeration is a permutation of any other enumeration that they are the same thing, and thus a well-ordering of $X$ is not guaranteed to exist. I think that is wrong because $X subseteq mathbb{R}$ so there is at least the well-ordering induced by $mathbb{R}$. Is anyone able to confirm/deny this logic?



Second, I came across Froda's theorem. I think that the question statement is the converse of Froda's theorem, but I am unsure if it is the converse or if it is the same statement in disguise. I realize that it is kind of a dumb question to ask, but what is the relationship between Froda's theorem and this question?



Thanks for any help!










share|cite|improve this question













I am studying for a final exam and have come across the following old exam question:
Prove that any countable set of real numbers is the set of points of discontinuity of some monotone function.



The proof I gave is as follows:



Let $X$ be a countable set of real numbers.
Let ${r_n}_{n in mathbb{N}}$ be an enumeration of $X$, such that $r_n < r_{n+1}$. Define $$f(x) = begin{cases} r_n & x in [r_n, r_{n+1}) \ x & (x<r_1) text{ or } (r_n < x forall n).end{cases}$$ Then for all real $x not in X$, $f$ is continuous at $x$ and discontinuous at $r_n$. Moreover, it is clear that $f$ is monotone by our choice of enumeration of $X$. Q.E.D.



After looking online to confirm my answer, I came across two things which left me confused. First, this StackExchange post: Can I always order a countable set of numbers.
This post seems to say "I am given an enumeration, and I would like to order it" which is shown to be impossible. I believe this contrasts to my approach because I am taking an enumeration which is already ordered, instead of taking an arbitrary enumeration which is then ordered. But I could see the argument to be made that since the ordered enumeration is a permutation of any other enumeration that they are the same thing, and thus a well-ordering of $X$ is not guaranteed to exist. I think that is wrong because $X subseteq mathbb{R}$ so there is at least the well-ordering induced by $mathbb{R}$. Is anyone able to confirm/deny this logic?



Second, I came across Froda's theorem. I think that the question statement is the converse of Froda's theorem, but I am unsure if it is the converse or if it is the same statement in disguise. I realize that it is kind of a dumb question to ask, but what is the relationship between Froda's theorem and this question?



Thanks for any help!







real-analysis continuity monotone-functions discontinuous-functions






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 18 at 1:58









tekay-squared

625




625












  • Your enumeration of X fails for Q.
    – William Elliot
    Nov 18 at 2:13










  • Although $X$ can be well-ordered, there is no guarantee that such a well-ordering will coincide with the usual ordering of $X$ as a subset of $mathbb{R}$. Take for instance $X = {1, 1/2, 1/3, ldots}$: then $r_1 = 1/k$ for some $k in mathbb{N}$, and by your construction $r_n geqslant r_1 > 1/(k + 1)$ for all $n$, so you have not enumerated $X$.
    – Calum Gilhooley
    Nov 18 at 2:15












  • Don't forget the case where the set is finite, unless "countable" means "countably infinite" (which sometimes it does, but not always --- the meaning of "countable" varies among authors).
    – Dave L. Renfro
    Nov 18 at 8:09










  • D'oh! It took me a mere two days to remember having once contributed to a thread on essentially the same question: Remark 4.31 in Baby Rudin: How to verify these points?.
    – Calum Gilhooley
    Nov 20 at 23:00


















  • Your enumeration of X fails for Q.
    – William Elliot
    Nov 18 at 2:13










  • Although $X$ can be well-ordered, there is no guarantee that such a well-ordering will coincide with the usual ordering of $X$ as a subset of $mathbb{R}$. Take for instance $X = {1, 1/2, 1/3, ldots}$: then $r_1 = 1/k$ for some $k in mathbb{N}$, and by your construction $r_n geqslant r_1 > 1/(k + 1)$ for all $n$, so you have not enumerated $X$.
    – Calum Gilhooley
    Nov 18 at 2:15












  • Don't forget the case where the set is finite, unless "countable" means "countably infinite" (which sometimes it does, but not always --- the meaning of "countable" varies among authors).
    – Dave L. Renfro
    Nov 18 at 8:09










  • D'oh! It took me a mere two days to remember having once contributed to a thread on essentially the same question: Remark 4.31 in Baby Rudin: How to verify these points?.
    – Calum Gilhooley
    Nov 20 at 23:00
















Your enumeration of X fails for Q.
– William Elliot
Nov 18 at 2:13




Your enumeration of X fails for Q.
– William Elliot
Nov 18 at 2:13












Although $X$ can be well-ordered, there is no guarantee that such a well-ordering will coincide with the usual ordering of $X$ as a subset of $mathbb{R}$. Take for instance $X = {1, 1/2, 1/3, ldots}$: then $r_1 = 1/k$ for some $k in mathbb{N}$, and by your construction $r_n geqslant r_1 > 1/(k + 1)$ for all $n$, so you have not enumerated $X$.
– Calum Gilhooley
Nov 18 at 2:15






Although $X$ can be well-ordered, there is no guarantee that such a well-ordering will coincide with the usual ordering of $X$ as a subset of $mathbb{R}$. Take for instance $X = {1, 1/2, 1/3, ldots}$: then $r_1 = 1/k$ for some $k in mathbb{N}$, and by your construction $r_n geqslant r_1 > 1/(k + 1)$ for all $n$, so you have not enumerated $X$.
– Calum Gilhooley
Nov 18 at 2:15














Don't forget the case where the set is finite, unless "countable" means "countably infinite" (which sometimes it does, but not always --- the meaning of "countable" varies among authors).
– Dave L. Renfro
Nov 18 at 8:09




Don't forget the case where the set is finite, unless "countable" means "countably infinite" (which sometimes it does, but not always --- the meaning of "countable" varies among authors).
– Dave L. Renfro
Nov 18 at 8:09












D'oh! It took me a mere two days to remember having once contributed to a thread on essentially the same question: Remark 4.31 in Baby Rudin: How to verify these points?.
– Calum Gilhooley
Nov 20 at 23:00




D'oh! It took me a mere two days to remember having once contributed to a thread on essentially the same question: Remark 4.31 in Baby Rudin: How to verify these points?.
– Calum Gilhooley
Nov 20 at 23:00










2 Answers
2






active

oldest

votes

















up vote
5
down vote



accepted










Froda's theorem is indeed the converse of what you are trying to do.



Froda's theorem says "Monotone function on interval" implies "set of discontinuities is countable".



Your task is "Countable set" implies "there is a monotone function whose set of discontinuities is this set".



So Froda's theorem takes a function and gives the set of discontinuities. You have the set of discontinuities, and you have to find the function itself.





Since most other comments have focused on the task of well-ordering, I will focus on tackling the main question, since it has been pointed out that the answer is wrong.



For your task, rather than going to enumerations of the countable set, we can use the fact that there are countably many elements, to create a step function with jumps at the points in the countable set.



For this, let us first consider the set itself, which we write as ${r_n}$ . This can be done because a countable set is in bijection with $mathbb N$, so choosing any such bijection , we let $r_n$ be the image of $n$ under the bijection(So, no ordering is assumed). Simply define :
$$
f(x) = sum_{n : r_n < x} frac 1{n^2}
$$



That is to say, given $x in mathbb R$, we find all $n$ such that $r_n < x$, and take the sum of reciprocals of the squares of these $n$.



This is well defined, since $0 leq f(x) leq frac{pi^2}{6}$ for all $x$, and the set under which summation occurs is well defined. $f$ is also monotone, clearly.



Pick $r_N$, a point in the countable set. Then, for all $x > r_N$, note that $$f(x) = sum_{n : x > r_n} frac 1{n^2} = f(r_N) + sum_{n : x > r_n geq r_N} frac 1{n^2} geq f(r_N) + frac 1{N^2}$$



Therefore, we have $lim_{x to r_N^+} f(x) geq f(r_N) + frac 1{N^2} > f(r_N)$, which contradicts the definition of continuity. Hence, discontinuity at these points holds.



For continuity of $f$ at points outside ${r_n}$, we use the fact that the tail of the series can be made as small as desired. To do this, let $s notin {r_n}$, and $epsilon > 0$. Pick $N$ large enough, so that $sum_{n=N+1}^infty frac 1{n^2} < epsilon$. Now, since ${r_1,...,r_N}$ is a finite set, we can find an interval around $s$, say $I=(s-delta,s+delta)$, which is such that $r_i notin I$ for all $i leq N$. This can be done because a finite set is closed, so its complement is open.



Finally, note that $f(s+delta) - f(s-delta) = sum_{n : s-delta leq r_n < s+ delta} frac 1{N^2} < epsilon$ by the choice of $delta$. By the monotonicity of $f$, we conclude that $f(x)-f(y) < epsilon$ for all $x,y in (s-delta,s+delta)$. You can use this to see that continuity holds at $s$.



Thus, without enumeration, it is possible to construct such a function, by inducing jumps at the right places.



EDIT : The above works for ${r_n}$ being "at most countable" i.e. either finite or countable.






share|cite|improve this answer























  • Very nice and simple example. +1
    – Paramanand Singh
    Nov 18 at 9:44










  • Thank you. I got the idea from a similar exercise which I had attempted a few months ago, with "any countable set" replaced by the rationals @ParamanandSingh
    – астон вілла олоф мэллбэрг
    Nov 18 at 12:36


















up vote
0
down vote













Yes, the fact that every countable set of real numbers is the set of discontinuities of a monotone function is the converse of the fact that the set of discontinuities of a monotone function is countable. (I didn't know that the latter fact was called "Froda's theorem".)



Your proof is fine as far as it goes, but it only covers the case of a countable set which can be enumerated in increasing order, e.g., the set of positive integers. Not every countable set can be enumerated in increasing order, for example, the set $mathbb {Z} $ of all integers, positive, negative, or zero. You won't have much trouble adapting your proof to get a function whose set of discontinuities is $mathbb Z$, but you will have to think a little bit harder to get a function whose set of discontinuities is the set $mathbb Q$ of all rational numbers.






share|cite|improve this answer























    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',
    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
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3003058%2fany-countable-set-of-real-numbers-is-set-of-discontinuities-of-some-monotone-fun%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    2 Answers
    2






    active

    oldest

    votes








    2 Answers
    2






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    5
    down vote



    accepted










    Froda's theorem is indeed the converse of what you are trying to do.



    Froda's theorem says "Monotone function on interval" implies "set of discontinuities is countable".



    Your task is "Countable set" implies "there is a monotone function whose set of discontinuities is this set".



    So Froda's theorem takes a function and gives the set of discontinuities. You have the set of discontinuities, and you have to find the function itself.





    Since most other comments have focused on the task of well-ordering, I will focus on tackling the main question, since it has been pointed out that the answer is wrong.



    For your task, rather than going to enumerations of the countable set, we can use the fact that there are countably many elements, to create a step function with jumps at the points in the countable set.



    For this, let us first consider the set itself, which we write as ${r_n}$ . This can be done because a countable set is in bijection with $mathbb N$, so choosing any such bijection , we let $r_n$ be the image of $n$ under the bijection(So, no ordering is assumed). Simply define :
    $$
    f(x) = sum_{n : r_n < x} frac 1{n^2}
    $$



    That is to say, given $x in mathbb R$, we find all $n$ such that $r_n < x$, and take the sum of reciprocals of the squares of these $n$.



    This is well defined, since $0 leq f(x) leq frac{pi^2}{6}$ for all $x$, and the set under which summation occurs is well defined. $f$ is also monotone, clearly.



    Pick $r_N$, a point in the countable set. Then, for all $x > r_N$, note that $$f(x) = sum_{n : x > r_n} frac 1{n^2} = f(r_N) + sum_{n : x > r_n geq r_N} frac 1{n^2} geq f(r_N) + frac 1{N^2}$$



    Therefore, we have $lim_{x to r_N^+} f(x) geq f(r_N) + frac 1{N^2} > f(r_N)$, which contradicts the definition of continuity. Hence, discontinuity at these points holds.



    For continuity of $f$ at points outside ${r_n}$, we use the fact that the tail of the series can be made as small as desired. To do this, let $s notin {r_n}$, and $epsilon > 0$. Pick $N$ large enough, so that $sum_{n=N+1}^infty frac 1{n^2} < epsilon$. Now, since ${r_1,...,r_N}$ is a finite set, we can find an interval around $s$, say $I=(s-delta,s+delta)$, which is such that $r_i notin I$ for all $i leq N$. This can be done because a finite set is closed, so its complement is open.



    Finally, note that $f(s+delta) - f(s-delta) = sum_{n : s-delta leq r_n < s+ delta} frac 1{N^2} < epsilon$ by the choice of $delta$. By the monotonicity of $f$, we conclude that $f(x)-f(y) < epsilon$ for all $x,y in (s-delta,s+delta)$. You can use this to see that continuity holds at $s$.



    Thus, without enumeration, it is possible to construct such a function, by inducing jumps at the right places.



    EDIT : The above works for ${r_n}$ being "at most countable" i.e. either finite or countable.






    share|cite|improve this answer























    • Very nice and simple example. +1
      – Paramanand Singh
      Nov 18 at 9:44










    • Thank you. I got the idea from a similar exercise which I had attempted a few months ago, with "any countable set" replaced by the rationals @ParamanandSingh
      – астон вілла олоф мэллбэрг
      Nov 18 at 12:36















    up vote
    5
    down vote



    accepted










    Froda's theorem is indeed the converse of what you are trying to do.



    Froda's theorem says "Monotone function on interval" implies "set of discontinuities is countable".



    Your task is "Countable set" implies "there is a monotone function whose set of discontinuities is this set".



    So Froda's theorem takes a function and gives the set of discontinuities. You have the set of discontinuities, and you have to find the function itself.





    Since most other comments have focused on the task of well-ordering, I will focus on tackling the main question, since it has been pointed out that the answer is wrong.



    For your task, rather than going to enumerations of the countable set, we can use the fact that there are countably many elements, to create a step function with jumps at the points in the countable set.



    For this, let us first consider the set itself, which we write as ${r_n}$ . This can be done because a countable set is in bijection with $mathbb N$, so choosing any such bijection , we let $r_n$ be the image of $n$ under the bijection(So, no ordering is assumed). Simply define :
    $$
    f(x) = sum_{n : r_n < x} frac 1{n^2}
    $$



    That is to say, given $x in mathbb R$, we find all $n$ such that $r_n < x$, and take the sum of reciprocals of the squares of these $n$.



    This is well defined, since $0 leq f(x) leq frac{pi^2}{6}$ for all $x$, and the set under which summation occurs is well defined. $f$ is also monotone, clearly.



    Pick $r_N$, a point in the countable set. Then, for all $x > r_N$, note that $$f(x) = sum_{n : x > r_n} frac 1{n^2} = f(r_N) + sum_{n : x > r_n geq r_N} frac 1{n^2} geq f(r_N) + frac 1{N^2}$$



    Therefore, we have $lim_{x to r_N^+} f(x) geq f(r_N) + frac 1{N^2} > f(r_N)$, which contradicts the definition of continuity. Hence, discontinuity at these points holds.



    For continuity of $f$ at points outside ${r_n}$, we use the fact that the tail of the series can be made as small as desired. To do this, let $s notin {r_n}$, and $epsilon > 0$. Pick $N$ large enough, so that $sum_{n=N+1}^infty frac 1{n^2} < epsilon$. Now, since ${r_1,...,r_N}$ is a finite set, we can find an interval around $s$, say $I=(s-delta,s+delta)$, which is such that $r_i notin I$ for all $i leq N$. This can be done because a finite set is closed, so its complement is open.



    Finally, note that $f(s+delta) - f(s-delta) = sum_{n : s-delta leq r_n < s+ delta} frac 1{N^2} < epsilon$ by the choice of $delta$. By the monotonicity of $f$, we conclude that $f(x)-f(y) < epsilon$ for all $x,y in (s-delta,s+delta)$. You can use this to see that continuity holds at $s$.



    Thus, without enumeration, it is possible to construct such a function, by inducing jumps at the right places.



    EDIT : The above works for ${r_n}$ being "at most countable" i.e. either finite or countable.






    share|cite|improve this answer























    • Very nice and simple example. +1
      – Paramanand Singh
      Nov 18 at 9:44










    • Thank you. I got the idea from a similar exercise which I had attempted a few months ago, with "any countable set" replaced by the rationals @ParamanandSingh
      – астон вілла олоф мэллбэрг
      Nov 18 at 12:36













    up vote
    5
    down vote



    accepted







    up vote
    5
    down vote



    accepted






    Froda's theorem is indeed the converse of what you are trying to do.



    Froda's theorem says "Monotone function on interval" implies "set of discontinuities is countable".



    Your task is "Countable set" implies "there is a monotone function whose set of discontinuities is this set".



    So Froda's theorem takes a function and gives the set of discontinuities. You have the set of discontinuities, and you have to find the function itself.





    Since most other comments have focused on the task of well-ordering, I will focus on tackling the main question, since it has been pointed out that the answer is wrong.



    For your task, rather than going to enumerations of the countable set, we can use the fact that there are countably many elements, to create a step function with jumps at the points in the countable set.



    For this, let us first consider the set itself, which we write as ${r_n}$ . This can be done because a countable set is in bijection with $mathbb N$, so choosing any such bijection , we let $r_n$ be the image of $n$ under the bijection(So, no ordering is assumed). Simply define :
    $$
    f(x) = sum_{n : r_n < x} frac 1{n^2}
    $$



    That is to say, given $x in mathbb R$, we find all $n$ such that $r_n < x$, and take the sum of reciprocals of the squares of these $n$.



    This is well defined, since $0 leq f(x) leq frac{pi^2}{6}$ for all $x$, and the set under which summation occurs is well defined. $f$ is also monotone, clearly.



    Pick $r_N$, a point in the countable set. Then, for all $x > r_N$, note that $$f(x) = sum_{n : x > r_n} frac 1{n^2} = f(r_N) + sum_{n : x > r_n geq r_N} frac 1{n^2} geq f(r_N) + frac 1{N^2}$$



    Therefore, we have $lim_{x to r_N^+} f(x) geq f(r_N) + frac 1{N^2} > f(r_N)$, which contradicts the definition of continuity. Hence, discontinuity at these points holds.



    For continuity of $f$ at points outside ${r_n}$, we use the fact that the tail of the series can be made as small as desired. To do this, let $s notin {r_n}$, and $epsilon > 0$. Pick $N$ large enough, so that $sum_{n=N+1}^infty frac 1{n^2} < epsilon$. Now, since ${r_1,...,r_N}$ is a finite set, we can find an interval around $s$, say $I=(s-delta,s+delta)$, which is such that $r_i notin I$ for all $i leq N$. This can be done because a finite set is closed, so its complement is open.



    Finally, note that $f(s+delta) - f(s-delta) = sum_{n : s-delta leq r_n < s+ delta} frac 1{N^2} < epsilon$ by the choice of $delta$. By the monotonicity of $f$, we conclude that $f(x)-f(y) < epsilon$ for all $x,y in (s-delta,s+delta)$. You can use this to see that continuity holds at $s$.



    Thus, without enumeration, it is possible to construct such a function, by inducing jumps at the right places.



    EDIT : The above works for ${r_n}$ being "at most countable" i.e. either finite or countable.






    share|cite|improve this answer














    Froda's theorem is indeed the converse of what you are trying to do.



    Froda's theorem says "Monotone function on interval" implies "set of discontinuities is countable".



    Your task is "Countable set" implies "there is a monotone function whose set of discontinuities is this set".



    So Froda's theorem takes a function and gives the set of discontinuities. You have the set of discontinuities, and you have to find the function itself.





    Since most other comments have focused on the task of well-ordering, I will focus on tackling the main question, since it has been pointed out that the answer is wrong.



    For your task, rather than going to enumerations of the countable set, we can use the fact that there are countably many elements, to create a step function with jumps at the points in the countable set.



    For this, let us first consider the set itself, which we write as ${r_n}$ . This can be done because a countable set is in bijection with $mathbb N$, so choosing any such bijection , we let $r_n$ be the image of $n$ under the bijection(So, no ordering is assumed). Simply define :
    $$
    f(x) = sum_{n : r_n < x} frac 1{n^2}
    $$



    That is to say, given $x in mathbb R$, we find all $n$ such that $r_n < x$, and take the sum of reciprocals of the squares of these $n$.



    This is well defined, since $0 leq f(x) leq frac{pi^2}{6}$ for all $x$, and the set under which summation occurs is well defined. $f$ is also monotone, clearly.



    Pick $r_N$, a point in the countable set. Then, for all $x > r_N$, note that $$f(x) = sum_{n : x > r_n} frac 1{n^2} = f(r_N) + sum_{n : x > r_n geq r_N} frac 1{n^2} geq f(r_N) + frac 1{N^2}$$



    Therefore, we have $lim_{x to r_N^+} f(x) geq f(r_N) + frac 1{N^2} > f(r_N)$, which contradicts the definition of continuity. Hence, discontinuity at these points holds.



    For continuity of $f$ at points outside ${r_n}$, we use the fact that the tail of the series can be made as small as desired. To do this, let $s notin {r_n}$, and $epsilon > 0$. Pick $N$ large enough, so that $sum_{n=N+1}^infty frac 1{n^2} < epsilon$. Now, since ${r_1,...,r_N}$ is a finite set, we can find an interval around $s$, say $I=(s-delta,s+delta)$, which is such that $r_i notin I$ for all $i leq N$. This can be done because a finite set is closed, so its complement is open.



    Finally, note that $f(s+delta) - f(s-delta) = sum_{n : s-delta leq r_n < s+ delta} frac 1{N^2} < epsilon$ by the choice of $delta$. By the monotonicity of $f$, we conclude that $f(x)-f(y) < epsilon$ for all $x,y in (s-delta,s+delta)$. You can use this to see that continuity holds at $s$.



    Thus, without enumeration, it is possible to construct such a function, by inducing jumps at the right places.



    EDIT : The above works for ${r_n}$ being "at most countable" i.e. either finite or countable.







    share|cite|improve this answer














    share|cite|improve this answer



    share|cite|improve this answer








    edited Nov 19 at 2:20

























    answered Nov 18 at 2:34









    астон вілла олоф мэллбэрг

    36.8k33376




    36.8k33376












    • Very nice and simple example. +1
      – Paramanand Singh
      Nov 18 at 9:44










    • Thank you. I got the idea from a similar exercise which I had attempted a few months ago, with "any countable set" replaced by the rationals @ParamanandSingh
      – астон вілла олоф мэллбэрг
      Nov 18 at 12:36


















    • Very nice and simple example. +1
      – Paramanand Singh
      Nov 18 at 9:44










    • Thank you. I got the idea from a similar exercise which I had attempted a few months ago, with "any countable set" replaced by the rationals @ParamanandSingh
      – астон вілла олоф мэллбэрг
      Nov 18 at 12:36
















    Very nice and simple example. +1
    – Paramanand Singh
    Nov 18 at 9:44




    Very nice and simple example. +1
    – Paramanand Singh
    Nov 18 at 9:44












    Thank you. I got the idea from a similar exercise which I had attempted a few months ago, with "any countable set" replaced by the rationals @ParamanandSingh
    – астон вілла олоф мэллбэрг
    Nov 18 at 12:36




    Thank you. I got the idea from a similar exercise which I had attempted a few months ago, with "any countable set" replaced by the rationals @ParamanandSingh
    – астон вілла олоф мэллбэрг
    Nov 18 at 12:36










    up vote
    0
    down vote













    Yes, the fact that every countable set of real numbers is the set of discontinuities of a monotone function is the converse of the fact that the set of discontinuities of a monotone function is countable. (I didn't know that the latter fact was called "Froda's theorem".)



    Your proof is fine as far as it goes, but it only covers the case of a countable set which can be enumerated in increasing order, e.g., the set of positive integers. Not every countable set can be enumerated in increasing order, for example, the set $mathbb {Z} $ of all integers, positive, negative, or zero. You won't have much trouble adapting your proof to get a function whose set of discontinuities is $mathbb Z$, but you will have to think a little bit harder to get a function whose set of discontinuities is the set $mathbb Q$ of all rational numbers.






    share|cite|improve this answer



























      up vote
      0
      down vote













      Yes, the fact that every countable set of real numbers is the set of discontinuities of a monotone function is the converse of the fact that the set of discontinuities of a monotone function is countable. (I didn't know that the latter fact was called "Froda's theorem".)



      Your proof is fine as far as it goes, but it only covers the case of a countable set which can be enumerated in increasing order, e.g., the set of positive integers. Not every countable set can be enumerated in increasing order, for example, the set $mathbb {Z} $ of all integers, positive, negative, or zero. You won't have much trouble adapting your proof to get a function whose set of discontinuities is $mathbb Z$, but you will have to think a little bit harder to get a function whose set of discontinuities is the set $mathbb Q$ of all rational numbers.






      share|cite|improve this answer

























        up vote
        0
        down vote










        up vote
        0
        down vote









        Yes, the fact that every countable set of real numbers is the set of discontinuities of a monotone function is the converse of the fact that the set of discontinuities of a monotone function is countable. (I didn't know that the latter fact was called "Froda's theorem".)



        Your proof is fine as far as it goes, but it only covers the case of a countable set which can be enumerated in increasing order, e.g., the set of positive integers. Not every countable set can be enumerated in increasing order, for example, the set $mathbb {Z} $ of all integers, positive, negative, or zero. You won't have much trouble adapting your proof to get a function whose set of discontinuities is $mathbb Z$, but you will have to think a little bit harder to get a function whose set of discontinuities is the set $mathbb Q$ of all rational numbers.






        share|cite|improve this answer














        Yes, the fact that every countable set of real numbers is the set of discontinuities of a monotone function is the converse of the fact that the set of discontinuities of a monotone function is countable. (I didn't know that the latter fact was called "Froda's theorem".)



        Your proof is fine as far as it goes, but it only covers the case of a countable set which can be enumerated in increasing order, e.g., the set of positive integers. Not every countable set can be enumerated in increasing order, for example, the set $mathbb {Z} $ of all integers, positive, negative, or zero. You won't have much trouble adapting your proof to get a function whose set of discontinuities is $mathbb Z$, but you will have to think a little bit harder to get a function whose set of discontinuities is the set $mathbb Q$ of all rational numbers.







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Nov 18 at 13:28









        Paramanand Singh

        48.4k555156




        48.4k555156










        answered Nov 18 at 2:16









        bof

        49k452116




        49k452116






























            draft saved

            draft discarded




















































            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.





            Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


            Please pay close attention to the following guidance:


            • 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.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3003058%2fany-countable-set-of-real-numbers-is-set-of-discontinuities-of-some-monotone-fun%23new-answer', 'question_page');
            }
            );

            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







            Popular posts from this blog

            AnyDesk - Fatal Program Failure

            How to calibrate 16:9 built-in touch-screen to a 4:3 resolution?

            QoS: MAC-Priority for clients behind a repeater