Set invariant under the map $x mapsto -x$ that is a translation of symmetric sets












0












$begingroup$


Let $F subset mathbb{R}^n$ be an open bounded (non empty) convex set and assume that it is invariant under the map $x mapsto -x$ (which means that $F= { x : x in F } = { -x : x in F} = -F$).



Now assume that for any unit vector $nu in mathbb{R}^n$ there exists $d_{nu} in mathbb{R}$ such that $F= d_{nu} nu + E_{nu}$, where $E_{nu}$ is a set symmetric with respect to the hyperplane $nu^{perp}$. This fact means that for any direction $nu$ the set $F$ is the translation in the $nu$ direction of a set that is symmetric with respect to $nu^{perp}$.



I have to prove that $d_{nu}=0$ for each unit vector $nu in mathbb{R}^n$. That is, I have to prove that this set is invariant under reflection with respect to any hyperplane $nu^{perp}$.



MY IDEA: Fix an unit vector $nu in mathbb{R}^n$. Since $F=-F$ we have
$$ d_{nu} nu + E_{nu} = -( d_{nu} nu + E_{nu}) = - d_{nu} nu - E_{nu},$$
hence
$$E_{nu}= - E_{nu} - 2 d_{nu} nu .$$
This equality implies that, given $x in E_{nu}$ there exists $ y in E_{nu}$ such that $ x = -y -2 d_{nu} nu$, i.e. $y = -x - 2 d_{nu} nu.$ Since $ y in E_{nu}$ we have $ -x - 2 d_{nu} nu in E_{nu}$.



Thus for all $x in E_{nu}$ it holds $ -x - 2 d_{nu} nu in E_{nu}$. But now how can I infer that $d_{nu}=0$?



I think I should use the symmetry of $E_{nu}$ but I'm not sure and I don't know how to proceed!



EDIT: I have just noticed that since $F=-F$ and $F$ is convex then $0 in F$. Does this help? Moreover I've found this question: Set in $mathbb R^²$ with an axis of symmetry in every direction and I think that maybe we could extend the proof presented by zuggg in the case of a n-dimensional set (since we are assuming that $F$ is bounded).



Any advice would be really appreciated!










share|cite|improve this question











$endgroup$

















    0












    $begingroup$


    Let $F subset mathbb{R}^n$ be an open bounded (non empty) convex set and assume that it is invariant under the map $x mapsto -x$ (which means that $F= { x : x in F } = { -x : x in F} = -F$).



    Now assume that for any unit vector $nu in mathbb{R}^n$ there exists $d_{nu} in mathbb{R}$ such that $F= d_{nu} nu + E_{nu}$, where $E_{nu}$ is a set symmetric with respect to the hyperplane $nu^{perp}$. This fact means that for any direction $nu$ the set $F$ is the translation in the $nu$ direction of a set that is symmetric with respect to $nu^{perp}$.



    I have to prove that $d_{nu}=0$ for each unit vector $nu in mathbb{R}^n$. That is, I have to prove that this set is invariant under reflection with respect to any hyperplane $nu^{perp}$.



    MY IDEA: Fix an unit vector $nu in mathbb{R}^n$. Since $F=-F$ we have
    $$ d_{nu} nu + E_{nu} = -( d_{nu} nu + E_{nu}) = - d_{nu} nu - E_{nu},$$
    hence
    $$E_{nu}= - E_{nu} - 2 d_{nu} nu .$$
    This equality implies that, given $x in E_{nu}$ there exists $ y in E_{nu}$ such that $ x = -y -2 d_{nu} nu$, i.e. $y = -x - 2 d_{nu} nu.$ Since $ y in E_{nu}$ we have $ -x - 2 d_{nu} nu in E_{nu}$.



    Thus for all $x in E_{nu}$ it holds $ -x - 2 d_{nu} nu in E_{nu}$. But now how can I infer that $d_{nu}=0$?



    I think I should use the symmetry of $E_{nu}$ but I'm not sure and I don't know how to proceed!



    EDIT: I have just noticed that since $F=-F$ and $F$ is convex then $0 in F$. Does this help? Moreover I've found this question: Set in $mathbb R^²$ with an axis of symmetry in every direction and I think that maybe we could extend the proof presented by zuggg in the case of a n-dimensional set (since we are assuming that $F$ is bounded).



    Any advice would be really appreciated!










    share|cite|improve this question











    $endgroup$















      0












      0








      0





      $begingroup$


      Let $F subset mathbb{R}^n$ be an open bounded (non empty) convex set and assume that it is invariant under the map $x mapsto -x$ (which means that $F= { x : x in F } = { -x : x in F} = -F$).



      Now assume that for any unit vector $nu in mathbb{R}^n$ there exists $d_{nu} in mathbb{R}$ such that $F= d_{nu} nu + E_{nu}$, where $E_{nu}$ is a set symmetric with respect to the hyperplane $nu^{perp}$. This fact means that for any direction $nu$ the set $F$ is the translation in the $nu$ direction of a set that is symmetric with respect to $nu^{perp}$.



      I have to prove that $d_{nu}=0$ for each unit vector $nu in mathbb{R}^n$. That is, I have to prove that this set is invariant under reflection with respect to any hyperplane $nu^{perp}$.



      MY IDEA: Fix an unit vector $nu in mathbb{R}^n$. Since $F=-F$ we have
      $$ d_{nu} nu + E_{nu} = -( d_{nu} nu + E_{nu}) = - d_{nu} nu - E_{nu},$$
      hence
      $$E_{nu}= - E_{nu} - 2 d_{nu} nu .$$
      This equality implies that, given $x in E_{nu}$ there exists $ y in E_{nu}$ such that $ x = -y -2 d_{nu} nu$, i.e. $y = -x - 2 d_{nu} nu.$ Since $ y in E_{nu}$ we have $ -x - 2 d_{nu} nu in E_{nu}$.



      Thus for all $x in E_{nu}$ it holds $ -x - 2 d_{nu} nu in E_{nu}$. But now how can I infer that $d_{nu}=0$?



      I think I should use the symmetry of $E_{nu}$ but I'm not sure and I don't know how to proceed!



      EDIT: I have just noticed that since $F=-F$ and $F$ is convex then $0 in F$. Does this help? Moreover I've found this question: Set in $mathbb R^²$ with an axis of symmetry in every direction and I think that maybe we could extend the proof presented by zuggg in the case of a n-dimensional set (since we are assuming that $F$ is bounded).



      Any advice would be really appreciated!










      share|cite|improve this question











      $endgroup$




      Let $F subset mathbb{R}^n$ be an open bounded (non empty) convex set and assume that it is invariant under the map $x mapsto -x$ (which means that $F= { x : x in F } = { -x : x in F} = -F$).



      Now assume that for any unit vector $nu in mathbb{R}^n$ there exists $d_{nu} in mathbb{R}$ such that $F= d_{nu} nu + E_{nu}$, where $E_{nu}$ is a set symmetric with respect to the hyperplane $nu^{perp}$. This fact means that for any direction $nu$ the set $F$ is the translation in the $nu$ direction of a set that is symmetric with respect to $nu^{perp}$.



      I have to prove that $d_{nu}=0$ for each unit vector $nu in mathbb{R}^n$. That is, I have to prove that this set is invariant under reflection with respect to any hyperplane $nu^{perp}$.



      MY IDEA: Fix an unit vector $nu in mathbb{R}^n$. Since $F=-F$ we have
      $$ d_{nu} nu + E_{nu} = -( d_{nu} nu + E_{nu}) = - d_{nu} nu - E_{nu},$$
      hence
      $$E_{nu}= - E_{nu} - 2 d_{nu} nu .$$
      This equality implies that, given $x in E_{nu}$ there exists $ y in E_{nu}$ such that $ x = -y -2 d_{nu} nu$, i.e. $y = -x - 2 d_{nu} nu.$ Since $ y in E_{nu}$ we have $ -x - 2 d_{nu} nu in E_{nu}$.



      Thus for all $x in E_{nu}$ it holds $ -x - 2 d_{nu} nu in E_{nu}$. But now how can I infer that $d_{nu}=0$?



      I think I should use the symmetry of $E_{nu}$ but I'm not sure and I don't know how to proceed!



      EDIT: I have just noticed that since $F=-F$ and $F$ is convex then $0 in F$. Does this help? Moreover I've found this question: Set in $mathbb R^²$ with an axis of symmetry in every direction and I think that maybe we could extend the proof presented by zuggg in the case of a n-dimensional set (since we are assuming that $F$ is bounded).



      Any advice would be really appreciated!







      geometry euclidean-geometry symmetry invariance






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Dec 5 '18 at 13:28







      Hermione

















      asked Dec 4 '18 at 20:10









      HermioneHermione

      19619




      19619






















          0






          active

          oldest

          votes











          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%2f3026092%2fset-invariant-under-the-map-x-mapsto-x-that-is-a-translation-of-symmetric-se%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown

























          0






          active

          oldest

          votes








          0






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes
















          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%2f3026092%2fset-invariant-under-the-map-x-mapsto-x-that-is-a-translation-of-symmetric-se%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

          Probability when a professor distributes a quiz and homework assignment to a class of n students.

          Aardman Animations

          Are they similar matrix