Proof of Lemma preceding Principle of Condensation of Singularities The Next CEO of Stack OverflowThe Principle of Condensation of SingularitiesUniform boundedness principle statementThe Principle of Condensation of SingularitiesRequirements for the principle of uniform boundednessImportance of the uniform boundedness principleWhy is this “proof” of the Uniform Boundedness Principle via the contrapositive erroneous?Is the uniform boundedness principle not trivially obvious?Alternative proof of Uniform Boundedness PrincipleDirect proof of Closed Graph Theorem (or Bounded Inverse Theorem) from Uniform Boundedness PrincipleUniform boundedness principle and closed graph TheoremRephrasing the “if” part of the statement of the Principle of Uniform Boundedness

Why did we only see the N-1 starfighters in one film?

Text adventure game code

Term for the "extreme-extension" version of a straw man fallacy?

How to make a software documentation "officially" citable?

How to make a variable always equal to the result of some calculations?

% symbol leads to superlong (forever?) compilations

What does "Its cash flow is deeply negative" mean?

Can a caster that cast Polymorph on themselves stop concentrating at any point even if their Int is low?

How to get regions to plot as graphics

What is the point of a new vote on May's deal when the indicative votes suggest she will not win?

Fastest way to shutdown Ubuntu Mate 18.10

How to Reset Passwords on Multiple Websites Easily?

Grabbing quick drinks

Can I equip Skullclamp on a creature I am sacrificing?

How to write papers efficiently when English isn't my first language?

If I blow insulation everywhere in my attic except the door trap, will heat escape through it?

Need some help with wall behind rangetop

How to safely derail a train during transit?

How to be diplomatic in refusing to write code that breaches the privacy of our users

Customer Requests (Sometimes) Drive Me Bonkers!

How do I go from 300 unfinished/half written blog posts, to published posts?

Why here is plural "We went to the movies last night."

Natural language into sentence logic

If the heap is initialized for security, then why is the stack uninitialized?



Proof of Lemma preceding Principle of Condensation of Singularities



The Next CEO of Stack OverflowThe Principle of Condensation of SingularitiesUniform boundedness principle statementThe Principle of Condensation of SingularitiesRequirements for the principle of uniform boundednessImportance of the uniform boundedness principleWhy is this “proof” of the Uniform Boundedness Principle via the contrapositive erroneous?Is the uniform boundedness principle not trivially obvious?Alternative proof of Uniform Boundedness PrincipleDirect proof of Closed Graph Theorem (or Bounded Inverse Theorem) from Uniform Boundedness PrincipleUniform boundedness principle and closed graph TheoremRephrasing the “if” part of the statement of the Principle of Uniform Boundedness










0












$begingroup$


Under the Wikipedia page for the Principle of Uniform Boundedness, we have the Corollaries of the Uniform Boundedness Principle. The third of these relates to the Principle of Condensation of Singularities (a question on which was asked here), however, the following Lemma is given as part of a motivation to achieving that result:




[Let $X,Y$ be Banach Spaces and] Let $L(X, Y)$ denote the continuous operators from $X$ to $Y$, with the operator norm. If the collection $F$ is unbounded in $L(X, Y)$, then by the uniform boundedness principle we have:
$$R = x ∈ X : sup_ T ∈ F ‖ T x ‖_Y = ∞ ≠ ∅$$




I'm just wondering how exactly the Principle of Uniform Boundedness is being applied here; I was thinking to try and prove the result by contradiction and invoking PUB, but I don't see a way to do this without needing to make two deliberate incorrect hypotheses - in particular to assume that what we want to show holds for all $xin X$ and to assume that for these $x$ we have that $sup_ T ∈ F ‖ T x ‖_Y < ∞$. However, that would only tell us that either one of the hypotheses were wrong.



I wonder if instead one should work directly from Baire Category theory to prove the result - and indeed, perhaps, if that is what is meant by saying that UBP ensures this.



Could somebody give me a hint to set me on the right path to proving this result - as to whether I should use PUB directly, or work from Baire?










share|cite|improve this question









$endgroup$
















    0












    $begingroup$


    Under the Wikipedia page for the Principle of Uniform Boundedness, we have the Corollaries of the Uniform Boundedness Principle. The third of these relates to the Principle of Condensation of Singularities (a question on which was asked here), however, the following Lemma is given as part of a motivation to achieving that result:




    [Let $X,Y$ be Banach Spaces and] Let $L(X, Y)$ denote the continuous operators from $X$ to $Y$, with the operator norm. If the collection $F$ is unbounded in $L(X, Y)$, then by the uniform boundedness principle we have:
    $$R = x ∈ X : sup_ T ∈ F ‖ T x ‖_Y = ∞ ≠ ∅$$




    I'm just wondering how exactly the Principle of Uniform Boundedness is being applied here; I was thinking to try and prove the result by contradiction and invoking PUB, but I don't see a way to do this without needing to make two deliberate incorrect hypotheses - in particular to assume that what we want to show holds for all $xin X$ and to assume that for these $x$ we have that $sup_ T ∈ F ‖ T x ‖_Y < ∞$. However, that would only tell us that either one of the hypotheses were wrong.



    I wonder if instead one should work directly from Baire Category theory to prove the result - and indeed, perhaps, if that is what is meant by saying that UBP ensures this.



    Could somebody give me a hint to set me on the right path to proving this result - as to whether I should use PUB directly, or work from Baire?










    share|cite|improve this question









    $endgroup$














      0












      0








      0





      $begingroup$


      Under the Wikipedia page for the Principle of Uniform Boundedness, we have the Corollaries of the Uniform Boundedness Principle. The third of these relates to the Principle of Condensation of Singularities (a question on which was asked here), however, the following Lemma is given as part of a motivation to achieving that result:




      [Let $X,Y$ be Banach Spaces and] Let $L(X, Y)$ denote the continuous operators from $X$ to $Y$, with the operator norm. If the collection $F$ is unbounded in $L(X, Y)$, then by the uniform boundedness principle we have:
      $$R = x ∈ X : sup_ T ∈ F ‖ T x ‖_Y = ∞ ≠ ∅$$




      I'm just wondering how exactly the Principle of Uniform Boundedness is being applied here; I was thinking to try and prove the result by contradiction and invoking PUB, but I don't see a way to do this without needing to make two deliberate incorrect hypotheses - in particular to assume that what we want to show holds for all $xin X$ and to assume that for these $x$ we have that $sup_ T ∈ F ‖ T x ‖_Y < ∞$. However, that would only tell us that either one of the hypotheses were wrong.



      I wonder if instead one should work directly from Baire Category theory to prove the result - and indeed, perhaps, if that is what is meant by saying that UBP ensures this.



      Could somebody give me a hint to set me on the right path to proving this result - as to whether I should use PUB directly, or work from Baire?










      share|cite|improve this question









      $endgroup$




      Under the Wikipedia page for the Principle of Uniform Boundedness, we have the Corollaries of the Uniform Boundedness Principle. The third of these relates to the Principle of Condensation of Singularities (a question on which was asked here), however, the following Lemma is given as part of a motivation to achieving that result:




      [Let $X,Y$ be Banach Spaces and] Let $L(X, Y)$ denote the continuous operators from $X$ to $Y$, with the operator norm. If the collection $F$ is unbounded in $L(X, Y)$, then by the uniform boundedness principle we have:
      $$R = x ∈ X : sup_ T ∈ F ‖ T x ‖_Y = ∞ ≠ ∅$$




      I'm just wondering how exactly the Principle of Uniform Boundedness is being applied here; I was thinking to try and prove the result by contradiction and invoking PUB, but I don't see a way to do this without needing to make two deliberate incorrect hypotheses - in particular to assume that what we want to show holds for all $xin X$ and to assume that for these $x$ we have that $sup_ T ∈ F ‖ T x ‖_Y < ∞$. However, that would only tell us that either one of the hypotheses were wrong.



      I wonder if instead one should work directly from Baire Category theory to prove the result - and indeed, perhaps, if that is what is meant by saying that UBP ensures this.



      Could somebody give me a hint to set me on the right path to proving this result - as to whether I should use PUB directly, or work from Baire?







      functional-analysis operator-theory banach-spaces baire-category






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Mar 18 at 12:20









      Jeremy Jeffrey JamesJeremy Jeffrey James

      1,055717




      1,055717




















          1 Answer
          1






          active

          oldest

          votes


















          2












          $begingroup$

          Suppose that $R =emptyset.$



          If $x in X$, then $x notin R$, hence there is $c_x ge 0$ such that



          $||Tx||_Y le c_x$ for all $T in F.$



          The $PUB$ gives that $$ is bounded, a contradiction.






          share|cite|improve this answer









          $endgroup$












          • $begingroup$
            I see now how silly my question was ... my thanks
            $endgroup$
            – Jeremy Jeffrey James
            Mar 18 at 12:39











          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%2f3152721%2fproof-of-lemma-preceding-principle-of-condensation-of-singularities%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









          2












          $begingroup$

          Suppose that $R =emptyset.$



          If $x in X$, then $x notin R$, hence there is $c_x ge 0$ such that



          $||Tx||_Y le c_x$ for all $T in F.$



          The $PUB$ gives that $$ is bounded, a contradiction.






          share|cite|improve this answer









          $endgroup$












          • $begingroup$
            I see now how silly my question was ... my thanks
            $endgroup$
            – Jeremy Jeffrey James
            Mar 18 at 12:39















          2












          $begingroup$

          Suppose that $R =emptyset.$



          If $x in X$, then $x notin R$, hence there is $c_x ge 0$ such that



          $||Tx||_Y le c_x$ for all $T in F.$



          The $PUB$ gives that $$ is bounded, a contradiction.






          share|cite|improve this answer









          $endgroup$












          • $begingroup$
            I see now how silly my question was ... my thanks
            $endgroup$
            – Jeremy Jeffrey James
            Mar 18 at 12:39













          2












          2








          2





          $begingroup$

          Suppose that $R =emptyset.$



          If $x in X$, then $x notin R$, hence there is $c_x ge 0$ such that



          $||Tx||_Y le c_x$ for all $T in F.$



          The $PUB$ gives that $$ is bounded, a contradiction.






          share|cite|improve this answer









          $endgroup$



          Suppose that $R =emptyset.$



          If $x in X$, then $x notin R$, hence there is $c_x ge 0$ such that



          $||Tx||_Y le c_x$ for all $T in F.$



          The $PUB$ gives that $$ is bounded, a contradiction.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Mar 18 at 12:36









          FredFred

          48.8k11849




          48.8k11849











          • $begingroup$
            I see now how silly my question was ... my thanks
            $endgroup$
            – Jeremy Jeffrey James
            Mar 18 at 12:39
















          • $begingroup$
            I see now how silly my question was ... my thanks
            $endgroup$
            – Jeremy Jeffrey James
            Mar 18 at 12:39















          $begingroup$
          I see now how silly my question was ... my thanks
          $endgroup$
          – Jeremy Jeffrey James
          Mar 18 at 12:39




          $begingroup$
          I see now how silly my question was ... my thanks
          $endgroup$
          – Jeremy Jeffrey James
          Mar 18 at 12:39

















          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%2f3152721%2fproof-of-lemma-preceding-principle-of-condensation-of-singularities%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

          Solar Wings Breeze Design and development Specifications (Breeze) References Navigation menu1368-485X"Hang glider: Breeze (Solar Wings)"e

          Kathakali Contents Etymology and nomenclature History Repertoire Songs and musical instruments Traditional plays Styles: Sampradayam Training centers and awards Relationship to other dance forms See also Notes References External links Navigation menueThe Illustrated Encyclopedia of Hinduism: A-MSouth Asian Folklore: An EncyclopediaRoutledge International Encyclopedia of Women: Global Women's Issues and KnowledgeKathakali Dance-drama: Where Gods and Demons Come to PlayKathakali Dance-drama: Where Gods and Demons Come to PlayKathakali Dance-drama: Where Gods and Demons Come to Play10.1353/atj.2005.0004The Illustrated Encyclopedia of Hinduism: A-MEncyclopedia of HinduismKathakali Dance-drama: Where Gods and Demons Come to PlaySonic Liturgy: Ritual and Music in Hindu Tradition"The Mirror of Gesture"Kathakali Dance-drama: Where Gods and Demons Come to Play"Kathakali"Indian Theatre: Traditions of PerformanceIndian Theatre: Traditions of PerformanceIndian Theatre: Traditions of PerformanceIndian Theatre: Traditions of PerformanceMedieval Indian Literature: An AnthologyThe Oxford Companion to Indian TheatreSouth Asian Folklore: An Encyclopedia : Afghanistan, Bangladesh, India, Nepal, Pakistan, Sri LankaThe Rise of Performance Studies: Rethinking Richard Schechner's Broad SpectrumIndian Theatre: Traditions of PerformanceModern Asian Theatre and Performance 1900-2000Critical Theory and PerformanceBetween Theater and AnthropologyKathakali603847011Indian Theatre: Traditions of PerformanceIndian Theatre: Traditions of PerformanceIndian Theatre: Traditions of PerformanceBetween Theater and AnthropologyBetween Theater and AnthropologyNambeesan Smaraka AwardsArchivedThe Cambridge Guide to TheatreRoutledge International Encyclopedia of Women: Global Women's Issues and KnowledgeThe Garland Encyclopedia of World Music: South Asia : the Indian subcontinentThe Ethos of Noh: Actors and Their Art10.2307/1145740By Means of Performance: Intercultural Studies of Theatre and Ritual10.1017/s204912550000100xReconceiving the Renaissance: A Critical ReaderPerformance TheoryListening to Theatre: The Aural Dimension of Beijing Opera10.2307/1146013Kathakali: The Art of the Non-WorldlyOn KathakaliKathakali, the dance theatreThe Kathakali Complex: Performance & StructureKathakali Dance-Drama: Where Gods and Demons Come to Play10.1093/obo/9780195399318-0071Drama and Ritual of Early Hinduism"In the Shadow of Hollywood Orientalism: Authentic East Indian Dancing"10.1080/08949460490274013Sanskrit Play Production in Ancient IndiaIndian Music: History and StructureBharata, the Nāṭyaśāstra233639306Table of Contents2238067286469807Dance In Indian Painting10.2307/32047833204783Kathakali Dance-Theatre: A Visual Narrative of Sacred Indian MimeIndian Classical Dance: The Renaissance and BeyondKathakali: an indigenous art-form of Keralaeee

          Method to test if a number is a perfect power? Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Detecting perfect squares faster than by extracting square rooteffective way to get the integer sequence A181392 from oeisA rarely mentioned fact about perfect powersHow many numbers such $n$ are there that $n<100,lfloorsqrtn rfloor mid n$Check perfect squareness by modulo division against multiple basesFor what pair of integers $(a,b)$ is $3^a + 7^b$ a perfect square.Do there exist any positive integers $n$ such that $lfloore^nrfloor$ is a perfect power? What is the probability that one exists?finding perfect power factors of an integerProve that the sequence contains a perfect square for any natural number $m $ in the domain of $f$ .Counting Perfect Powers