Proof that $H(X) leq log(|A|)$ (Shannon entropy)











up vote
0
down vote

favorite












The full question states:



"Show that $$H(X) leq log(|A|)$$
with equality if and only if $P_X$ is uniform. Hint: use the Gibbs or log-sum inequality "



I used "$A$" as the alphabet in here. My lecturer is using curly "X" which I don't know how to type in MathJax.



The equality part is rather straight forward.



Suppose $A={1,...,m}$ and $P_X(x)=frac{1}{m} forall x$. Then of course $|A|=m$
And $$H(X)=-sum_{x=1}^m frac{1}{m}log(frac{1}{m})=-log(frac{1}{m})=log(m)=log(|A|)$$



It is the inequality part that I am not sure how to show. Thanks for any help










share|cite|improve this question




























    up vote
    0
    down vote

    favorite












    The full question states:



    "Show that $$H(X) leq log(|A|)$$
    with equality if and only if $P_X$ is uniform. Hint: use the Gibbs or log-sum inequality "



    I used "$A$" as the alphabet in here. My lecturer is using curly "X" which I don't know how to type in MathJax.



    The equality part is rather straight forward.



    Suppose $A={1,...,m}$ and $P_X(x)=frac{1}{m} forall x$. Then of course $|A|=m$
    And $$H(X)=-sum_{x=1}^m frac{1}{m}log(frac{1}{m})=-log(frac{1}{m})=log(m)=log(|A|)$$



    It is the inequality part that I am not sure how to show. Thanks for any help










    share|cite|improve this question


























      up vote
      0
      down vote

      favorite









      up vote
      0
      down vote

      favorite











      The full question states:



      "Show that $$H(X) leq log(|A|)$$
      with equality if and only if $P_X$ is uniform. Hint: use the Gibbs or log-sum inequality "



      I used "$A$" as the alphabet in here. My lecturer is using curly "X" which I don't know how to type in MathJax.



      The equality part is rather straight forward.



      Suppose $A={1,...,m}$ and $P_X(x)=frac{1}{m} forall x$. Then of course $|A|=m$
      And $$H(X)=-sum_{x=1}^m frac{1}{m}log(frac{1}{m})=-log(frac{1}{m})=log(m)=log(|A|)$$



      It is the inequality part that I am not sure how to show. Thanks for any help










      share|cite|improve this question















      The full question states:



      "Show that $$H(X) leq log(|A|)$$
      with equality if and only if $P_X$ is uniform. Hint: use the Gibbs or log-sum inequality "



      I used "$A$" as the alphabet in here. My lecturer is using curly "X" which I don't know how to type in MathJax.



      The equality part is rather straight forward.



      Suppose $A={1,...,m}$ and $P_X(x)=frac{1}{m} forall x$. Then of course $|A|=m$
      And $$H(X)=-sum_{x=1}^m frac{1}{m}log(frac{1}{m})=-log(frac{1}{m})=log(m)=log(|A|)$$



      It is the inequality part that I am not sure how to show. Thanks for any help







      probability logarithms information-theory entropy






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Nov 21 at 15:38









      Bernard

      117k637109




      117k637109










      asked Nov 21 at 15:34









      Kudera Sebastian

      525216




      525216






















          2 Answers
          2






          active

          oldest

          votes

















          up vote
          1
          down vote



          accepted










          For any probability distributions $p, q$ on $A$, Gibbs inequality states that
          $$
          H(p)=-sum_{kin A} p(k)log p(k)leq -sum_{kin A} p(k)log q(k)
          $$

          with equality iff $p=q$. Take $q$ to correspond to a uniform distribution on $A$. Then
          $$
          H(p)leq -sum_{kin A} p(k)log frac{1}{|A|}=log|A|
          $$

          with equality iff $p$ is a uniform distribution as desired.






          share|cite|improve this answer




























            up vote
            0
            down vote













            Let $p_i$s be the corresponding probabilities of the source $X$ and $q_i={1over |A|}$ for $i=1,2,cdots , |A|$ . Therefore using Gibbs' inequality we obtain:$$H(X)=-sum p_ilog p_ile -sum p_ilog q_i=-log {1over |A|}sum p_i=log |A|$$



            For further reading, you can refer to https://en.wikipedia.org/wiki/Gibbs%27_inequality






            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%2f3007877%2fproof-that-hx-leq-loga-shannon-entropy%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
              1
              down vote



              accepted










              For any probability distributions $p, q$ on $A$, Gibbs inequality states that
              $$
              H(p)=-sum_{kin A} p(k)log p(k)leq -sum_{kin A} p(k)log q(k)
              $$

              with equality iff $p=q$. Take $q$ to correspond to a uniform distribution on $A$. Then
              $$
              H(p)leq -sum_{kin A} p(k)log frac{1}{|A|}=log|A|
              $$

              with equality iff $p$ is a uniform distribution as desired.






              share|cite|improve this answer

























                up vote
                1
                down vote



                accepted










                For any probability distributions $p, q$ on $A$, Gibbs inequality states that
                $$
                H(p)=-sum_{kin A} p(k)log p(k)leq -sum_{kin A} p(k)log q(k)
                $$

                with equality iff $p=q$. Take $q$ to correspond to a uniform distribution on $A$. Then
                $$
                H(p)leq -sum_{kin A} p(k)log frac{1}{|A|}=log|A|
                $$

                with equality iff $p$ is a uniform distribution as desired.






                share|cite|improve this answer























                  up vote
                  1
                  down vote



                  accepted







                  up vote
                  1
                  down vote



                  accepted






                  For any probability distributions $p, q$ on $A$, Gibbs inequality states that
                  $$
                  H(p)=-sum_{kin A} p(k)log p(k)leq -sum_{kin A} p(k)log q(k)
                  $$

                  with equality iff $p=q$. Take $q$ to correspond to a uniform distribution on $A$. Then
                  $$
                  H(p)leq -sum_{kin A} p(k)log frac{1}{|A|}=log|A|
                  $$

                  with equality iff $p$ is a uniform distribution as desired.






                  share|cite|improve this answer












                  For any probability distributions $p, q$ on $A$, Gibbs inequality states that
                  $$
                  H(p)=-sum_{kin A} p(k)log p(k)leq -sum_{kin A} p(k)log q(k)
                  $$

                  with equality iff $p=q$. Take $q$ to correspond to a uniform distribution on $A$. Then
                  $$
                  H(p)leq -sum_{kin A} p(k)log frac{1}{|A|}=log|A|
                  $$

                  with equality iff $p$ is a uniform distribution as desired.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Nov 21 at 16:02









                  Foobaz John

                  20.3k41250




                  20.3k41250






















                      up vote
                      0
                      down vote













                      Let $p_i$s be the corresponding probabilities of the source $X$ and $q_i={1over |A|}$ for $i=1,2,cdots , |A|$ . Therefore using Gibbs' inequality we obtain:$$H(X)=-sum p_ilog p_ile -sum p_ilog q_i=-log {1over |A|}sum p_i=log |A|$$



                      For further reading, you can refer to https://en.wikipedia.org/wiki/Gibbs%27_inequality






                      share|cite|improve this answer

























                        up vote
                        0
                        down vote













                        Let $p_i$s be the corresponding probabilities of the source $X$ and $q_i={1over |A|}$ for $i=1,2,cdots , |A|$ . Therefore using Gibbs' inequality we obtain:$$H(X)=-sum p_ilog p_ile -sum p_ilog q_i=-log {1over |A|}sum p_i=log |A|$$



                        For further reading, you can refer to https://en.wikipedia.org/wiki/Gibbs%27_inequality






                        share|cite|improve this answer























                          up vote
                          0
                          down vote










                          up vote
                          0
                          down vote









                          Let $p_i$s be the corresponding probabilities of the source $X$ and $q_i={1over |A|}$ for $i=1,2,cdots , |A|$ . Therefore using Gibbs' inequality we obtain:$$H(X)=-sum p_ilog p_ile -sum p_ilog q_i=-log {1over |A|}sum p_i=log |A|$$



                          For further reading, you can refer to https://en.wikipedia.org/wiki/Gibbs%27_inequality






                          share|cite|improve this answer












                          Let $p_i$s be the corresponding probabilities of the source $X$ and $q_i={1over |A|}$ for $i=1,2,cdots , |A|$ . Therefore using Gibbs' inequality we obtain:$$H(X)=-sum p_ilog p_ile -sum p_ilog q_i=-log {1over |A|}sum p_i=log |A|$$



                          For further reading, you can refer to https://en.wikipedia.org/wiki/Gibbs%27_inequality







                          share|cite|improve this answer












                          share|cite|improve this answer



                          share|cite|improve this answer










                          answered Nov 21 at 17:15









                          Mostafa Ayaz

                          13.5k3836




                          13.5k3836






























                              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%2f3007877%2fproof-that-hx-leq-loga-shannon-entropy%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

                              Quarter-circle Tiles

                              build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

                              Mont Emei