$x=(x_n)$ satisfy $sum x_k y_k lt infty$ for all $yin c_0$












-1












$begingroup$


So , I know that $c_0^*$ and $ell_1$ are isomorphic and I guess I need to use it(or the ideas in the proof) in order to solve the following question :



Let $x= (x_n)$ be a sequence s.t for all $y in c_0$ , $sum x_ky_k$ is finite.



I need to prove that $xin ell_1$ .



So $x$ defines a functional -$phi_x$ - on $c_0$, taking $y$ to $sum x_ky_k$.



In order to imitate the proof that $c_0^*$ isomorphic to $ell_1$ I need to use a bounded functional(in order to bound the sum of absolute values of the $x_n$'s) , and im not sure if $phi_x$
is bounded (if so ,how to show it? )



Any ideas?



Thanks for helping!






functional-analysis







share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    This is actually easy to do without $c_0*=l^1.$
    $endgroup$
    – zhw.
    Dec 9 '18 at 21:49










  • $begingroup$
    Can you explain? @zhw.
    $endgroup$
    – user123
    Dec 9 '18 at 21:50
















-1












$begingroup$


So , I know that $c_0^*$ and $ell_1$ are isomorphic and I guess I need to use it(or the ideas in the proof) in order to solve the following question :



Let $x= (x_n)$ be a sequence s.t for all $y in c_0$ , $sum x_ky_k$ is finite.



I need to prove that $xin ell_1$ .



So $x$ defines a functional -$phi_x$ - on $c_0$, taking $y$ to $sum x_ky_k$.



In order to imitate the proof that $c_0^*$ isomorphic to $ell_1$ I need to use a bounded functional(in order to bound the sum of absolute values of the $x_n$'s) , and im not sure if $phi_x$
is bounded (if so ,how to show it? )



Any ideas?



Thanks for helping!






functional-analysis







share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    This is actually easy to do without $c_0*=l^1.$
    $endgroup$
    – zhw.
    Dec 9 '18 at 21:49










  • $begingroup$
    Can you explain? @zhw.
    $endgroup$
    – user123
    Dec 9 '18 at 21:50














-1












-1








-1





$begingroup$


So , I know that $c_0^*$ and $ell_1$ are isomorphic and I guess I need to use it(or the ideas in the proof) in order to solve the following question :



Let $x= (x_n)$ be a sequence s.t for all $y in c_0$ , $sum x_ky_k$ is finite.



I need to prove that $xin ell_1$ .



So $x$ defines a functional -$phi_x$ - on $c_0$, taking $y$ to $sum x_ky_k$.



In order to imitate the proof that $c_0^*$ isomorphic to $ell_1$ I need to use a bounded functional(in order to bound the sum of absolute values of the $x_n$'s) , and im not sure if $phi_x$
is bounded (if so ,how to show it? )



Any ideas?



Thanks for helping!






functional-analysis







share|cite|improve this question









$endgroup$




So , I know that $c_0^*$ and $ell_1$ are isomorphic and I guess I need to use it(or the ideas in the proof) in order to solve the following question :



Let $x= (x_n)$ be a sequence s.t for all $y in c_0$ , $sum x_ky_k$ is finite.



I need to prove that $xin ell_1$ .



So $x$ defines a functional -$phi_x$ - on $c_0$, taking $y$ to $sum x_ky_k$.



In order to imitate the proof that $c_0^*$ isomorphic to $ell_1$ I need to use a bounded functional(in order to bound the sum of absolute values of the $x_n$'s) , and im not sure if $phi_x$
is bounded (if so ,how to show it? )



Any ideas?



Thanks for helping!






functional-analysis




functional-analysis






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 9 '18 at 21:37









user123user123

1,306316




1,306316








  • 1




    $begingroup$
    This is actually easy to do without $c_0*=l^1.$
    $endgroup$
    – zhw.
    Dec 9 '18 at 21:49










  • $begingroup$
    Can you explain? @zhw.
    $endgroup$
    – user123
    Dec 9 '18 at 21:50














  • 1




    $begingroup$
    This is actually easy to do without $c_0*=l^1.$
    $endgroup$
    – zhw.
    Dec 9 '18 at 21:49










  • $begingroup$
    Can you explain? @zhw.
    $endgroup$
    – user123
    Dec 9 '18 at 21:50








1




1




$begingroup$
This is actually easy to do without $c_0*=l^1.$
$endgroup$
– zhw.
Dec 9 '18 at 21:49




$begingroup$
This is actually easy to do without $c_0*=l^1.$
$endgroup$
– zhw.
Dec 9 '18 at 21:49












$begingroup$
Can you explain? @zhw.
$endgroup$
– user123
Dec 9 '18 at 21:50




$begingroup$
Can you explain? @zhw.
$endgroup$
– user123
Dec 9 '18 at 21:50










2 Answers
2






active

oldest

votes


















0












$begingroup$

If ${T_n}$ is a sequence of bounded linear functionals from one Banach space $X$ to another Banach space $Y$ such that $Tx=lim_n T_n x$ exists for every $x$ then $T$ is necessarily a bounded linear functional. This is a consequence of Banach - Steinhaus Theorem (which is also known as Uniform Boundedness Principle) : just note that there is a finite constant $M$ such that $|T_n| leq M$ for all $n$ and so $|Tx|leq M|x|$.



It follows that $phi_x$ is a continuous linear functional from which it is easy to see (using $c_0^{*}=ell^{1})$ that $x in ell^{1}$.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    Nice. Just to make sure - your $T_n$'s are $T_n(y) = sum_{k=1}^n y_kx_k$ ?
    $endgroup$
    – user123
    Dec 10 '18 at 10:14










  • $begingroup$
    @Liad You are right; we apply the theorem to this sequence.
    $endgroup$
    – Kavi Rama Murthy
    Dec 10 '18 at 10:17










  • $begingroup$
    Very nice. Thank you!
    $endgroup$
    – user123
    Dec 10 '18 at 10:18



















0












$begingroup$

Sketch: Suppose $sum |x_n|=infty.$ Then ${1,2,dots}$ can be partitioned into consecutive blocks of integers $B_1 < B_2 <cdots$ such that



$$sum_{nin B_k}|x_n| > 1,,,k=1,2,dots$$



For $k=1,2,dots $ and $nin B_k,$ set $y_n=(text {sgn } x_n)/k.$ Then $(y_n)in c_0,$  and



$$sum_{n=1}^{infty}x_ny_n = infty.$$






share|cite|improve this answer









$endgroup$













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


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3033056%2fx-x-n-satisfy-sum-x-k-y-k-lt-infty-for-all-y-in-c-0%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









    0












    $begingroup$

    If ${T_n}$ is a sequence of bounded linear functionals from one Banach space $X$ to another Banach space $Y$ such that $Tx=lim_n T_n x$ exists for every $x$ then $T$ is necessarily a bounded linear functional. This is a consequence of Banach - Steinhaus Theorem (which is also known as Uniform Boundedness Principle) : just note that there is a finite constant $M$ such that $|T_n| leq M$ for all $n$ and so $|Tx|leq M|x|$.



    It follows that $phi_x$ is a continuous linear functional from which it is easy to see (using $c_0^{*}=ell^{1})$ that $x in ell^{1}$.






    share|cite|improve this answer











    $endgroup$













    • $begingroup$
      Nice. Just to make sure - your $T_n$'s are $T_n(y) = sum_{k=1}^n y_kx_k$ ?
      $endgroup$
      – user123
      Dec 10 '18 at 10:14










    • $begingroup$
      @Liad You are right; we apply the theorem to this sequence.
      $endgroup$
      – Kavi Rama Murthy
      Dec 10 '18 at 10:17










    • $begingroup$
      Very nice. Thank you!
      $endgroup$
      – user123
      Dec 10 '18 at 10:18
















    0












    $begingroup$

    If ${T_n}$ is a sequence of bounded linear functionals from one Banach space $X$ to another Banach space $Y$ such that $Tx=lim_n T_n x$ exists for every $x$ then $T$ is necessarily a bounded linear functional. This is a consequence of Banach - Steinhaus Theorem (which is also known as Uniform Boundedness Principle) : just note that there is a finite constant $M$ such that $|T_n| leq M$ for all $n$ and so $|Tx|leq M|x|$.



    It follows that $phi_x$ is a continuous linear functional from which it is easy to see (using $c_0^{*}=ell^{1})$ that $x in ell^{1}$.






    share|cite|improve this answer











    $endgroup$













    • $begingroup$
      Nice. Just to make sure - your $T_n$'s are $T_n(y) = sum_{k=1}^n y_kx_k$ ?
      $endgroup$
      – user123
      Dec 10 '18 at 10:14










    • $begingroup$
      @Liad You are right; we apply the theorem to this sequence.
      $endgroup$
      – Kavi Rama Murthy
      Dec 10 '18 at 10:17










    • $begingroup$
      Very nice. Thank you!
      $endgroup$
      – user123
      Dec 10 '18 at 10:18














    0












    0








    0





    $begingroup$

    If ${T_n}$ is a sequence of bounded linear functionals from one Banach space $X$ to another Banach space $Y$ such that $Tx=lim_n T_n x$ exists for every $x$ then $T$ is necessarily a bounded linear functional. This is a consequence of Banach - Steinhaus Theorem (which is also known as Uniform Boundedness Principle) : just note that there is a finite constant $M$ such that $|T_n| leq M$ for all $n$ and so $|Tx|leq M|x|$.



    It follows that $phi_x$ is a continuous linear functional from which it is easy to see (using $c_0^{*}=ell^{1})$ that $x in ell^{1}$.






    share|cite|improve this answer











    $endgroup$



    If ${T_n}$ is a sequence of bounded linear functionals from one Banach space $X$ to another Banach space $Y$ such that $Tx=lim_n T_n x$ exists for every $x$ then $T$ is necessarily a bounded linear functional. This is a consequence of Banach - Steinhaus Theorem (which is also known as Uniform Boundedness Principle) : just note that there is a finite constant $M$ such that $|T_n| leq M$ for all $n$ and so $|Tx|leq M|x|$.



    It follows that $phi_x$ is a continuous linear functional from which it is easy to see (using $c_0^{*}=ell^{1})$ that $x in ell^{1}$.







    share|cite|improve this answer














    share|cite|improve this answer



    share|cite|improve this answer








    edited Dec 9 '18 at 23:47

























    answered Dec 9 '18 at 23:41









    Kavi Rama MurthyKavi Rama Murthy

    57.9k42160




    57.9k42160












    • $begingroup$
      Nice. Just to make sure - your $T_n$'s are $T_n(y) = sum_{k=1}^n y_kx_k$ ?
      $endgroup$
      – user123
      Dec 10 '18 at 10:14










    • $begingroup$
      @Liad You are right; we apply the theorem to this sequence.
      $endgroup$
      – Kavi Rama Murthy
      Dec 10 '18 at 10:17










    • $begingroup$
      Very nice. Thank you!
      $endgroup$
      – user123
      Dec 10 '18 at 10:18


















    • $begingroup$
      Nice. Just to make sure - your $T_n$'s are $T_n(y) = sum_{k=1}^n y_kx_k$ ?
      $endgroup$
      – user123
      Dec 10 '18 at 10:14










    • $begingroup$
      @Liad You are right; we apply the theorem to this sequence.
      $endgroup$
      – Kavi Rama Murthy
      Dec 10 '18 at 10:17










    • $begingroup$
      Very nice. Thank you!
      $endgroup$
      – user123
      Dec 10 '18 at 10:18
















    $begingroup$
    Nice. Just to make sure - your $T_n$'s are $T_n(y) = sum_{k=1}^n y_kx_k$ ?
    $endgroup$
    – user123
    Dec 10 '18 at 10:14




    $begingroup$
    Nice. Just to make sure - your $T_n$'s are $T_n(y) = sum_{k=1}^n y_kx_k$ ?
    $endgroup$
    – user123
    Dec 10 '18 at 10:14












    $begingroup$
    @Liad You are right; we apply the theorem to this sequence.
    $endgroup$
    – Kavi Rama Murthy
    Dec 10 '18 at 10:17




    $begingroup$
    @Liad You are right; we apply the theorem to this sequence.
    $endgroup$
    – Kavi Rama Murthy
    Dec 10 '18 at 10:17












    $begingroup$
    Very nice. Thank you!
    $endgroup$
    – user123
    Dec 10 '18 at 10:18




    $begingroup$
    Very nice. Thank you!
    $endgroup$
    – user123
    Dec 10 '18 at 10:18











    0












    $begingroup$

    Sketch: Suppose $sum |x_n|=infty.$ Then ${1,2,dots}$ can be partitioned into consecutive blocks of integers $B_1 < B_2 <cdots$ such that



    $$sum_{nin B_k}|x_n| > 1,,,k=1,2,dots$$



    For $k=1,2,dots $ and $nin B_k,$ set $y_n=(text {sgn } x_n)/k.$ Then $(y_n)in c_0,$  and



    $$sum_{n=1}^{infty}x_ny_n = infty.$$






    share|cite|improve this answer









    $endgroup$


















      0












      $begingroup$

      Sketch: Suppose $sum |x_n|=infty.$ Then ${1,2,dots}$ can be partitioned into consecutive blocks of integers $B_1 < B_2 <cdots$ such that



      $$sum_{nin B_k}|x_n| > 1,,,k=1,2,dots$$



      For $k=1,2,dots $ and $nin B_k,$ set $y_n=(text {sgn } x_n)/k.$ Then $(y_n)in c_0,$  and



      $$sum_{n=1}^{infty}x_ny_n = infty.$$






      share|cite|improve this answer









      $endgroup$
















        0












        0








        0





        $begingroup$

        Sketch: Suppose $sum |x_n|=infty.$ Then ${1,2,dots}$ can be partitioned into consecutive blocks of integers $B_1 < B_2 <cdots$ such that



        $$sum_{nin B_k}|x_n| > 1,,,k=1,2,dots$$



        For $k=1,2,dots $ and $nin B_k,$ set $y_n=(text {sgn } x_n)/k.$ Then $(y_n)in c_0,$  and



        $$sum_{n=1}^{infty}x_ny_n = infty.$$






        share|cite|improve this answer









        $endgroup$



        Sketch: Suppose $sum |x_n|=infty.$ Then ${1,2,dots}$ can be partitioned into consecutive blocks of integers $B_1 < B_2 <cdots$ such that



        $$sum_{nin B_k}|x_n| > 1,,,k=1,2,dots$$



        For $k=1,2,dots $ and $nin B_k,$ set $y_n=(text {sgn } x_n)/k.$ Then $(y_n)in c_0,$  and



        $$sum_{n=1}^{infty}x_ny_n = infty.$$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Dec 9 '18 at 23:35









        zhw.zhw.

        72.6k43175




        72.6k43175






























            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.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3033056%2fx-x-n-satisfy-sum-x-k-y-k-lt-infty-for-all-y-in-c-0%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

            How do I know what Microsoft account the skydrive app is syncing to?

            Image
            up vote 4 down vote favorite 1 Some time ago, I set up skydrive for my wife on her mac. But now she wants to access the files online, I cannot remember what Microsoft account I setup and linked her skydive app to and nor can I see anything in the skydrive app settings to tell me either? How can I see the name of the Microsoft account the skydive app is currently linked to? I would like to know this for skydrive app for Mac and PC onedrive share | improve this question asked Feb 25 '13 at 4:52 Gary Barrett 260 2 5 12
            Read more

            Grease: Live!

            Image
            A tradução deste artigo está abaixo da qualidade média aceitável. É possível que tenha sido feita por um tradutor automático ou por alguém que não conhece bem o português ou a língua original do texto. Caso queira colaborar com a Wikipédia, tente encontrar a página original e melhore este verbete conforme o guia de tradução. Grease: Live! Grease: Live!  (PRT/BRA)  Estados Unidos 2016 •   cor •   130 min. min   Direção Thomas Kail Alex Rudzinski Produção Marc Platt Adam Siegel Roteiro Allan Carr Robert Cary Warren Casey Jim Jacobs Jonathan Tolins Bronte Woodard Baseado em Grease (musical) Grease (filme) Elenco Julianne Hough Aaron Tveit Vanessa Hudgens Carlos Pena Jr. Keke Palmer Carly Rae Jepsen Kether Donohue Jordan Fisher David Del Rio Andrew Call Gênero Musical Música Tom Kitt Figurino William Ivey Long Companhia(s) produtora(s) Warner Bros. Studios Distribuição Fox Lançamento 31 de Janei
            Read more

            When does type information flow backwards in C++?

            Image
            up vote 62 down vote favorite 19 I just watched Stephan T. Lavavej talk at CppCon 2018 on "Class Template Argument Deduction", where at some point he incidentally says: In C++ type information almost never flows backwards ... I had to say "almost" because there's one or two cases, possibly more but very few . Despite trying to figure out which cases he might be referring to, I couldn't come up with anything. Hence the question: In which cases the C++17 standard mandates that type information propagate backwards? c++ language-lawyer c++17 share | improve this question edited 7 hours ago scohe0
            Read more