Equivalence relation generated by a relation: concrete characterization












0












$begingroup$


Let $R$ be a relation on a set $X$. The equivalence relation $sim_R$ generated by $R$ is defined as $bigcap A$ for $A$ being the set of all equivalence relations containing $R$ ($A$ is not empty as $Xtimes X in A$).



Different sources claim that it's possible to give a concrete definition of two elements $x$ and $y$ being in relation $sim_R$ to each other:




For any $x,y in X, x sim_R y$ if and only if there is a $n in mathbb{N}_{>0}$ and $x_1,...,x_n in X$ so that




  • $x_1 = x$,


  • $x_n = y$,


  • for any $1 leq k < n$ we have either $(x_k,x_{k+1}) in R$ or $(x_{k+1},x_k) in R$.





The "only if" part of the proof is carefully explained in this answer. However, I can't understand why having $n in mathbb{N}_{>0}$ and $x_1,...,x_n in X$ so that $x_1 = x, x_n = y$ and for any $1 leq k < n$ having either $(x_k,x_{k+1}) in R$ or $(x_{k+1},x_k) in R$ implies that $(x,y) in {sim_R}$.






elementary-set-theory equivalence-relations







share|cite|improve this question









$endgroup$

















    0












    $begingroup$


    Let $R$ be a relation on a set $X$. The equivalence relation $sim_R$ generated by $R$ is defined as $bigcap A$ for $A$ being the set of all equivalence relations containing $R$ ($A$ is not empty as $Xtimes X in A$).



    Different sources claim that it's possible to give a concrete definition of two elements $x$ and $y$ being in relation $sim_R$ to each other:




    For any $x,y in X, x sim_R y$ if and only if there is a $n in mathbb{N}_{>0}$ and $x_1,...,x_n in X$ so that




    • $x_1 = x$,


    • $x_n = y$,


    • for any $1 leq k < n$ we have either $(x_k,x_{k+1}) in R$ or $(x_{k+1},x_k) in R$.





    The "only if" part of the proof is carefully explained in this answer. However, I can't understand why having $n in mathbb{N}_{>0}$ and $x_1,...,x_n in X$ so that $x_1 = x, x_n = y$ and for any $1 leq k < n$ having either $(x_k,x_{k+1}) in R$ or $(x_{k+1},x_k) in R$ implies that $(x,y) in {sim_R}$.






    elementary-set-theory equivalence-relations







    share|cite|improve this question









    $endgroup$















      0












      0








      0





      $begingroup$


      Let $R$ be a relation on a set $X$. The equivalence relation $sim_R$ generated by $R$ is defined as $bigcap A$ for $A$ being the set of all equivalence relations containing $R$ ($A$ is not empty as $Xtimes X in A$).



      Different sources claim that it's possible to give a concrete definition of two elements $x$ and $y$ being in relation $sim_R$ to each other:




      For any $x,y in X, x sim_R y$ if and only if there is a $n in mathbb{N}_{>0}$ and $x_1,...,x_n in X$ so that




      • $x_1 = x$,


      • $x_n = y$,


      • for any $1 leq k < n$ we have either $(x_k,x_{k+1}) in R$ or $(x_{k+1},x_k) in R$.





      The "only if" part of the proof is carefully explained in this answer. However, I can't understand why having $n in mathbb{N}_{>0}$ and $x_1,...,x_n in X$ so that $x_1 = x, x_n = y$ and for any $1 leq k < n$ having either $(x_k,x_{k+1}) in R$ or $(x_{k+1},x_k) in R$ implies that $(x,y) in {sim_R}$.






      elementary-set-theory equivalence-relations







      share|cite|improve this question









      $endgroup$




      Let $R$ be a relation on a set $X$. The equivalence relation $sim_R$ generated by $R$ is defined as $bigcap A$ for $A$ being the set of all equivalence relations containing $R$ ($A$ is not empty as $Xtimes X in A$).



      Different sources claim that it's possible to give a concrete definition of two elements $x$ and $y$ being in relation $sim_R$ to each other:




      For any $x,y in X, x sim_R y$ if and only if there is a $n in mathbb{N}_{>0}$ and $x_1,...,x_n in X$ so that




      • $x_1 = x$,


      • $x_n = y$,


      • for any $1 leq k < n$ we have either $(x_k,x_{k+1}) in R$ or $(x_{k+1},x_k) in R$.





      The "only if" part of the proof is carefully explained in this answer. However, I can't understand why having $n in mathbb{N}_{>0}$ and $x_1,...,x_n in X$ so that $x_1 = x, x_n = y$ and for any $1 leq k < n$ having either $(x_k,x_{k+1}) in R$ or $(x_{k+1},x_k) in R$ implies that $(x,y) in {sim_R}$.






      elementary-set-theory equivalence-relations




      elementary-set-theory equivalence-relations






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Nov 27 '18 at 15:22









      Jxt921Jxt921

      976618




      976618






















          1 Answer
          1






          active

          oldest

          votes


















          2





          +150







          $begingroup$


          Why having $n in mathbb{N}_{>0}$ and $x_1,...,x_n in X$ so that $x_1 = x, x_n = y$ and for any $1 leq k < n$ having either $(x_k,x_{k+1}) in R$ or $(x_{k+1},x_k) in R$ implies that $(x,y) in {sim_R}$.




          This is easy. It suffices to show that $(x,y) in A$ for any all equivalence relation $A$ containing $R$. We have $(x_k,x_{k+1}) in A$ for any $1 leq k < n$, so $(x,y)=(x_1,x_n)in A$ by transitivity of $A$.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            But the problem is that it's not $(x_k,x_{k+1})$ for any $1 leq k < n$ and it's not $(x_{k+1},x_k)$ for any $1 leq k < n$, but it's $(x_k,x_{k+1})$ or $(x_{k+1},x_k)$ for any $1 leq k < n$.
            $endgroup$
            – Jxt921
            Nov 30 '18 at 8:46






          • 1




            $begingroup$
            This is not a problem, because $A$ is symmetric. That is, if $(x_{k+1},x_k)in R$ then $(x_{k+1},x_k)in A$ and $(x_{k},x_{k+1})in A$.
            $endgroup$
            – Alex Ravsky
            Nov 30 '18 at 14:47












          • $begingroup$
            You are right, I'm sorry.
            $endgroup$
            – Jxt921
            Nov 30 '18 at 17:53











          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%2f3015900%2fequivalence-relation-generated-by-a-relation-concrete-characterization%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





          +150







          $begingroup$


          Why having $n in mathbb{N}_{>0}$ and $x_1,...,x_n in X$ so that $x_1 = x, x_n = y$ and for any $1 leq k < n$ having either $(x_k,x_{k+1}) in R$ or $(x_{k+1},x_k) in R$ implies that $(x,y) in {sim_R}$.




          This is easy. It suffices to show that $(x,y) in A$ for any all equivalence relation $A$ containing $R$. We have $(x_k,x_{k+1}) in A$ for any $1 leq k < n$, so $(x,y)=(x_1,x_n)in A$ by transitivity of $A$.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            But the problem is that it's not $(x_k,x_{k+1})$ for any $1 leq k < n$ and it's not $(x_{k+1},x_k)$ for any $1 leq k < n$, but it's $(x_k,x_{k+1})$ or $(x_{k+1},x_k)$ for any $1 leq k < n$.
            $endgroup$
            – Jxt921
            Nov 30 '18 at 8:46






          • 1




            $begingroup$
            This is not a problem, because $A$ is symmetric. That is, if $(x_{k+1},x_k)in R$ then $(x_{k+1},x_k)in A$ and $(x_{k},x_{k+1})in A$.
            $endgroup$
            – Alex Ravsky
            Nov 30 '18 at 14:47












          • $begingroup$
            You are right, I'm sorry.
            $endgroup$
            – Jxt921
            Nov 30 '18 at 17:53
















          2





          +150







          $begingroup$


          Why having $n in mathbb{N}_{>0}$ and $x_1,...,x_n in X$ so that $x_1 = x, x_n = y$ and for any $1 leq k < n$ having either $(x_k,x_{k+1}) in R$ or $(x_{k+1},x_k) in R$ implies that $(x,y) in {sim_R}$.




          This is easy. It suffices to show that $(x,y) in A$ for any all equivalence relation $A$ containing $R$. We have $(x_k,x_{k+1}) in A$ for any $1 leq k < n$, so $(x,y)=(x_1,x_n)in A$ by transitivity of $A$.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            But the problem is that it's not $(x_k,x_{k+1})$ for any $1 leq k < n$ and it's not $(x_{k+1},x_k)$ for any $1 leq k < n$, but it's $(x_k,x_{k+1})$ or $(x_{k+1},x_k)$ for any $1 leq k < n$.
            $endgroup$
            – Jxt921
            Nov 30 '18 at 8:46






          • 1




            $begingroup$
            This is not a problem, because $A$ is symmetric. That is, if $(x_{k+1},x_k)in R$ then $(x_{k+1},x_k)in A$ and $(x_{k},x_{k+1})in A$.
            $endgroup$
            – Alex Ravsky
            Nov 30 '18 at 14:47












          • $begingroup$
            You are right, I'm sorry.
            $endgroup$
            – Jxt921
            Nov 30 '18 at 17:53














          2





          +150







          2





          +150



          2




          +150



          $begingroup$


          Why having $n in mathbb{N}_{>0}$ and $x_1,...,x_n in X$ so that $x_1 = x, x_n = y$ and for any $1 leq k < n$ having either $(x_k,x_{k+1}) in R$ or $(x_{k+1},x_k) in R$ implies that $(x,y) in {sim_R}$.




          This is easy. It suffices to show that $(x,y) in A$ for any all equivalence relation $A$ containing $R$. We have $(x_k,x_{k+1}) in A$ for any $1 leq k < n$, so $(x,y)=(x_1,x_n)in A$ by transitivity of $A$.






          share|cite|improve this answer









          $endgroup$




          Why having $n in mathbb{N}_{>0}$ and $x_1,...,x_n in X$ so that $x_1 = x, x_n = y$ and for any $1 leq k < n$ having either $(x_k,x_{k+1}) in R$ or $(x_{k+1},x_k) in R$ implies that $(x,y) in {sim_R}$.




          This is easy. It suffices to show that $(x,y) in A$ for any all equivalence relation $A$ containing $R$. We have $(x_k,x_{k+1}) in A$ for any $1 leq k < n$, so $(x,y)=(x_1,x_n)in A$ by transitivity of $A$.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Nov 30 '18 at 7:21









          Alex RavskyAlex Ravsky

          40.4k32282




          40.4k32282












          • $begingroup$
            But the problem is that it's not $(x_k,x_{k+1})$ for any $1 leq k < n$ and it's not $(x_{k+1},x_k)$ for any $1 leq k < n$, but it's $(x_k,x_{k+1})$ or $(x_{k+1},x_k)$ for any $1 leq k < n$.
            $endgroup$
            – Jxt921
            Nov 30 '18 at 8:46






          • 1




            $begingroup$
            This is not a problem, because $A$ is symmetric. That is, if $(x_{k+1},x_k)in R$ then $(x_{k+1},x_k)in A$ and $(x_{k},x_{k+1})in A$.
            $endgroup$
            – Alex Ravsky
            Nov 30 '18 at 14:47












          • $begingroup$
            You are right, I'm sorry.
            $endgroup$
            – Jxt921
            Nov 30 '18 at 17:53


















          • $begingroup$
            But the problem is that it's not $(x_k,x_{k+1})$ for any $1 leq k < n$ and it's not $(x_{k+1},x_k)$ for any $1 leq k < n$, but it's $(x_k,x_{k+1})$ or $(x_{k+1},x_k)$ for any $1 leq k < n$.
            $endgroup$
            – Jxt921
            Nov 30 '18 at 8:46






          • 1




            $begingroup$
            This is not a problem, because $A$ is symmetric. That is, if $(x_{k+1},x_k)in R$ then $(x_{k+1},x_k)in A$ and $(x_{k},x_{k+1})in A$.
            $endgroup$
            – Alex Ravsky
            Nov 30 '18 at 14:47












          • $begingroup$
            You are right, I'm sorry.
            $endgroup$
            – Jxt921
            Nov 30 '18 at 17:53
















          $begingroup$
          But the problem is that it's not $(x_k,x_{k+1})$ for any $1 leq k < n$ and it's not $(x_{k+1},x_k)$ for any $1 leq k < n$, but it's $(x_k,x_{k+1})$ or $(x_{k+1},x_k)$ for any $1 leq k < n$.
          $endgroup$
          – Jxt921
          Nov 30 '18 at 8:46




          $begingroup$
          But the problem is that it's not $(x_k,x_{k+1})$ for any $1 leq k < n$ and it's not $(x_{k+1},x_k)$ for any $1 leq k < n$, but it's $(x_k,x_{k+1})$ or $(x_{k+1},x_k)$ for any $1 leq k < n$.
          $endgroup$
          – Jxt921
          Nov 30 '18 at 8:46




          1




          1




          $begingroup$
          This is not a problem, because $A$ is symmetric. That is, if $(x_{k+1},x_k)in R$ then $(x_{k+1},x_k)in A$ and $(x_{k},x_{k+1})in A$.
          $endgroup$
          – Alex Ravsky
          Nov 30 '18 at 14:47






          $begingroup$
          This is not a problem, because $A$ is symmetric. That is, if $(x_{k+1},x_k)in R$ then $(x_{k+1},x_k)in A$ and $(x_{k},x_{k+1})in A$.
          $endgroup$
          – Alex Ravsky
          Nov 30 '18 at 14:47














          $begingroup$
          You are right, I'm sorry.
          $endgroup$
          – Jxt921
          Nov 30 '18 at 17:53




          $begingroup$
          You are right, I'm sorry.
          $endgroup$
          – Jxt921
          Nov 30 '18 at 17:53


















          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%2f3015900%2fequivalence-relation-generated-by-a-relation-concrete-characterization%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

          mysqli_query(): Empty query in /home/lucindabrummitt/public_html/blog/wp-includes/wp-db.php on line 1924

          Image
          0 I just uploaded a new plugin to my wordpress site and I got this warning: mysqli_query(): Empty query in /home/lucindabrummitt/public_html/blog/wp-includes/wp-db.php on line 1924 Usually if I have a problem, I can find answers on google but this one seems pretty particular and I'm not finding any info on it except for this forum. I'm not terribly techie but if someone can tell me how to read this and how to change it I can follow directions pretty well. Thanks All! PS If I don't have the proper tags here could someone add the appropriate tags? php mysql wordpress share | improve this question asked Nov 16 '18 at 20:41 ...
          Read more

          How to change which sound is reproduced for terminal bell?

          Image
          3 Recently upgrade to 18.10 from 18.04, and using the terminal is becoming annoying: the new alert sound is a drip ( /usr/share/sounds/gnome/default/alerts/drip.ogg ), and the previous one is still located at ( /usr/share/sounds/ubuntu/stereo/bell.ogg ). My issue is that at the gnome-terminal, when autocompleting or pressing left BOTH sounds are reproduced, at the same time. I want to just have ubuntu/stereo/bell.ogg active, not both . At the moment I have been only able to reduce the volume of the alerts (but still both are played), or turn the alerts down (but I dislike both "solutions"). gnome-terminal 18.10 teminal-bell share | improve this question ...
          Read more

          Can I use Tabulator js library in my java Spring + Thymeleaf project?

          Image
          0 I want to add Tabulator js to my java project. I added tabulator.min.js, tabulator.min.css to resources folder. After that added to my html page these dependencies as recommending in readme.md. <link rel="stylesheet" th:href="@{/css/tabulator.min.css}"> <script type="text/javascript" th:src="@{/js/tabulator.min.js}"></script> Now my tables view all elements, that I have in the html page, but not correct. In the documentation of Tabulator is example how to create header and table, var table = new Tabulator("#example-table", { columns:[ {title:"Name", field:"name", sorter:"string", width:200, editor:true}, {title:"Age", field:"age", sorter:"...
          Read more