Simple function formula











up vote
0
down vote

favorite












Let $f$ be a simple function in $(mathbb{R},B(mathbb{R}),mu)$.



Can we write $f=sum_{k=0}^nalpha_k.1_{[a_k,b_k]}$ instead of $f=sum_{k=0}^nalpha_k.1_{A_k}$ with $A_kin B(mathbb{R})$?










share|cite|improve this question






















  • Not in general. There are Borel sets which are not intervals. Take for instance the Cantor set (which is closed, hence Borel). How would you decompose it into closed intervals?
    – Federico
    Nov 20 at 13:36










  • I see, but in the proof of Reimann Lebesgue Lemma. they choosed a simple function but they wrote it with intervals instead of just measurable sets
    – Anas BOUALII
    Nov 20 at 13:39










  • Functions of the form $f=sum_{k=0}^n c_k 1_{[a_k,b_k]}$ are usually called step functions, as opposed to simple functions. Depending on the applications, it might be sufficient to consider only them.
    – Federico
    Nov 20 at 13:40










  • So using the approximation theorm in $L^1$. there exists a step function $f_k$ such that the limit is $fin L^1$. ?
    – Anas BOUALII
    Nov 20 at 13:43

















up vote
0
down vote

favorite












Let $f$ be a simple function in $(mathbb{R},B(mathbb{R}),mu)$.



Can we write $f=sum_{k=0}^nalpha_k.1_{[a_k,b_k]}$ instead of $f=sum_{k=0}^nalpha_k.1_{A_k}$ with $A_kin B(mathbb{R})$?










share|cite|improve this question






















  • Not in general. There are Borel sets which are not intervals. Take for instance the Cantor set (which is closed, hence Borel). How would you decompose it into closed intervals?
    – Federico
    Nov 20 at 13:36










  • I see, but in the proof of Reimann Lebesgue Lemma. they choosed a simple function but they wrote it with intervals instead of just measurable sets
    – Anas BOUALII
    Nov 20 at 13:39










  • Functions of the form $f=sum_{k=0}^n c_k 1_{[a_k,b_k]}$ are usually called step functions, as opposed to simple functions. Depending on the applications, it might be sufficient to consider only them.
    – Federico
    Nov 20 at 13:40










  • So using the approximation theorm in $L^1$. there exists a step function $f_k$ such that the limit is $fin L^1$. ?
    – Anas BOUALII
    Nov 20 at 13:43















up vote
0
down vote

favorite









up vote
0
down vote

favorite











Let $f$ be a simple function in $(mathbb{R},B(mathbb{R}),mu)$.



Can we write $f=sum_{k=0}^nalpha_k.1_{[a_k,b_k]}$ instead of $f=sum_{k=0}^nalpha_k.1_{A_k}$ with $A_kin B(mathbb{R})$?










share|cite|improve this question













Let $f$ be a simple function in $(mathbb{R},B(mathbb{R}),mu)$.



Can we write $f=sum_{k=0}^nalpha_k.1_{[a_k,b_k]}$ instead of $f=sum_{k=0}^nalpha_k.1_{A_k}$ with $A_kin B(mathbb{R})$?







integration lebesgue-integral lebesgue-measure borel-sets






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 20 at 13:32









Anas BOUALII

253




253












  • Not in general. There are Borel sets which are not intervals. Take for instance the Cantor set (which is closed, hence Borel). How would you decompose it into closed intervals?
    – Federico
    Nov 20 at 13:36










  • I see, but in the proof of Reimann Lebesgue Lemma. they choosed a simple function but they wrote it with intervals instead of just measurable sets
    – Anas BOUALII
    Nov 20 at 13:39










  • Functions of the form $f=sum_{k=0}^n c_k 1_{[a_k,b_k]}$ are usually called step functions, as opposed to simple functions. Depending on the applications, it might be sufficient to consider only them.
    – Federico
    Nov 20 at 13:40










  • So using the approximation theorm in $L^1$. there exists a step function $f_k$ such that the limit is $fin L^1$. ?
    – Anas BOUALII
    Nov 20 at 13:43




















  • Not in general. There are Borel sets which are not intervals. Take for instance the Cantor set (which is closed, hence Borel). How would you decompose it into closed intervals?
    – Federico
    Nov 20 at 13:36










  • I see, but in the proof of Reimann Lebesgue Lemma. they choosed a simple function but they wrote it with intervals instead of just measurable sets
    – Anas BOUALII
    Nov 20 at 13:39










  • Functions of the form $f=sum_{k=0}^n c_k 1_{[a_k,b_k]}$ are usually called step functions, as opposed to simple functions. Depending on the applications, it might be sufficient to consider only them.
    – Federico
    Nov 20 at 13:40










  • So using the approximation theorm in $L^1$. there exists a step function $f_k$ such that the limit is $fin L^1$. ?
    – Anas BOUALII
    Nov 20 at 13:43


















Not in general. There are Borel sets which are not intervals. Take for instance the Cantor set (which is closed, hence Borel). How would you decompose it into closed intervals?
– Federico
Nov 20 at 13:36




Not in general. There are Borel sets which are not intervals. Take for instance the Cantor set (which is closed, hence Borel). How would you decompose it into closed intervals?
– Federico
Nov 20 at 13:36












I see, but in the proof of Reimann Lebesgue Lemma. they choosed a simple function but they wrote it with intervals instead of just measurable sets
– Anas BOUALII
Nov 20 at 13:39




I see, but in the proof of Reimann Lebesgue Lemma. they choosed a simple function but they wrote it with intervals instead of just measurable sets
– Anas BOUALII
Nov 20 at 13:39












Functions of the form $f=sum_{k=0}^n c_k 1_{[a_k,b_k]}$ are usually called step functions, as opposed to simple functions. Depending on the applications, it might be sufficient to consider only them.
– Federico
Nov 20 at 13:40




Functions of the form $f=sum_{k=0}^n c_k 1_{[a_k,b_k]}$ are usually called step functions, as opposed to simple functions. Depending on the applications, it might be sufficient to consider only them.
– Federico
Nov 20 at 13:40












So using the approximation theorm in $L^1$. there exists a step function $f_k$ such that the limit is $fin L^1$. ?
– Anas BOUALII
Nov 20 at 13:43






So using the approximation theorm in $L^1$. there exists a step function $f_k$ such that the limit is $fin L^1$. ?
– Anas BOUALII
Nov 20 at 13:43












1 Answer
1






active

oldest

votes

















up vote
0
down vote













No. Let $A_0=mathbb Z$. Then $f=1_{A_0}$ has no representation of the form $f=sum_{k=0}^n c_k 1_{[a_k,b_k]}$.






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%2f3006304%2fsimple-function-formula%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








    up vote
    0
    down vote













    No. Let $A_0=mathbb Z$. Then $f=1_{A_0}$ has no representation of the form $f=sum_{k=0}^n c_k 1_{[a_k,b_k]}$.






    share|cite|improve this answer

























      up vote
      0
      down vote













      No. Let $A_0=mathbb Z$. Then $f=1_{A_0}$ has no representation of the form $f=sum_{k=0}^n c_k 1_{[a_k,b_k]}$.






      share|cite|improve this answer























        up vote
        0
        down vote










        up vote
        0
        down vote









        No. Let $A_0=mathbb Z$. Then $f=1_{A_0}$ has no representation of the form $f=sum_{k=0}^n c_k 1_{[a_k,b_k]}$.






        share|cite|improve this answer












        No. Let $A_0=mathbb Z$. Then $f=1_{A_0}$ has no representation of the form $f=sum_{k=0}^n c_k 1_{[a_k,b_k]}$.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Nov 20 at 13:39









        Federico

        2,629510




        2,629510






























            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%2f3006304%2fsimple-function-formula%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

            Willebadessen

            Ida-Boy-Ed-Garten

            Residenzschloss Arolsen