Why is a symmetric relation defined: $forall xforall y( xRyimplies yRx)$ and not $forall xforall y (xRyiff yRx)$?How to prove relation is asymmetric if it is both anti-symmetric and irreflexiveIs an Anti-Symmetric Relation also Reflexive?Graph, Relation $xRy Leftrightarrow$ There is a path between $x$ and $y$ - symmetryCan someone explain antisymmetric versus symmetric relation of sets?Define symmetric relation R on set SProve that if $R$ is a symmetric, transitive relation on $A$ and the domain of $R$ is $A$, then $R$ is reflexive on $A$.If R is symmetric, must $S= (X,Y)in P(A)times P(A) $ be symmetric?Given set A, is the relation A x A always anti symmetric?Definition of symmetric relationCan a relation be transitive when it is symmetric but not reflexive?

Is the U.S. Code copyrighted by the Government?

What does routing an IP address mean?

Electoral considerations aside, what are potential benefits, for the US, of policy changes proposed by the tweet recognizing Golan annexation?

Are the IPv6 address space and IPv4 address space completely disjoint?

How to explain what's wrong with this application of the chain rule?

How to indicate a cut out for a product window

If a character has darkvision, can they see through an area of nonmagical darkness filled with lightly obscuring gas?

Added a new user on Ubuntu, set password not working?

What should you do if you miss a job interview (deliberately)?

Pre-modern battle - command it, or fight in it?

What is this called? Old film camera viewer?

Why does the Sun have different day lengths, but not the gas giants?

How to create ADT in Haskell?

Removing files under particular conditions (number of files, file age)

Not using 's' for he/she/it

When were female captains banned from Starfleet?

Did arcade monitors have same pixel aspect ratio as TV sets?

Fear of getting stuck on one programming language / technology that is not used in my country

How do I color the graph in datavisualization?

If infinitesimal transformations commute why dont the generators of the Lorentz group commute?

2.8 Why are collections grayed out? How can I open them?

Does an advisor owe his/her student anything? Will an advisor keep a PhD student only out of pity?

What is Cash Advance APR?

New brakes for 90s road bike



Why is a symmetric relation defined: $forall xforall y( xRyimplies yRx)$ and not $forall xforall y (xRyiff yRx)$?


How to prove relation is asymmetric if it is both anti-symmetric and irreflexiveIs an Anti-Symmetric Relation also Reflexive?Graph, Relation $xRy Leftrightarrow$ There is a path between $x$ and $y$ - symmetryCan someone explain antisymmetric versus symmetric relation of sets?Define symmetric relation R on set SProve that if $R$ is a symmetric, transitive relation on $A$ and the domain of $R$ is $A$, then $R$ is reflexive on $A$.If R is symmetric, must $S=forall xin X exists yin Y (xRy) $ be symmetric?Given set A, is the relation A x A always anti symmetric?Definition of symmetric relationCan a relation be transitive when it is symmetric but not reflexive?













5












$begingroup$


Why is a symmetric relation defined by $forallxforally(xRy implies yRx)$ and not $forallxforally(xRy iff yRx)$?
(I have only found a couple of sources that defines it with a biconditional)



For example, according to Wolfram:




A relation $R$ on a set $S$ is symmetric provided that for every $x$ and $y$ in $S$ we have $xRy iff yRx$.




But the majority of books defines it the other way.
And I think I agree with the second definition.



Because if we use the first definition with "$implies$", we know the truth table of the implication in particular $P implies Q$ is true when $P$ is false and $Q$ is true. That means in the context of symmetric relation that $(x,y) notin R implies (y,x) in R$ is true.



And the example $A = 1,2,3,4$ with relation $R = (2,1),(3,1),(4,1)$ satisfies the definition because $(x,y) notin R implies (y,x) in R$ is true.



And for me it's weird that this case is considered symmetric.
Or maybe I have a profound confusion with the concept.
I would like that you guys help me clarify. *Sorry for my grammar I'm not a native english speaker.










share|cite|improve this question











$endgroup$











  • $begingroup$
    Sorry i will correct it
    $endgroup$
    – Rodrigo Sango
    6 hours ago










  • $begingroup$
    It's for ALL x, y. In your example $(2,1)in R not implies (1,2)in R$. But given $A=1,2,3$ and $R=(1,2),(2,1)$ we have $(1,3)in R implies (3,1)in R$ etc.
    $endgroup$
    – fleablood
    6 hours ago






  • 1




    $begingroup$
    "That means in the context of symmetric relation that (x,y)∉ R ⟹ (y,x)∈ R is true" Only if $x,y$ is actually in $R$. $(2,1)not in R implies (1,2)in R$ is a true statement. But $(3,2)not in R implies (2,3)in R$ is a false statement.
    $endgroup$
    – fleablood
    6 hours ago






  • 2




    $begingroup$
    The definitions are equivalent.
    $endgroup$
    – PyRulez
    2 hours ago















5












$begingroup$


Why is a symmetric relation defined by $forallxforally(xRy implies yRx)$ and not $forallxforally(xRy iff yRx)$?
(I have only found a couple of sources that defines it with a biconditional)



For example, according to Wolfram:




A relation $R$ on a set $S$ is symmetric provided that for every $x$ and $y$ in $S$ we have $xRy iff yRx$.




But the majority of books defines it the other way.
And I think I agree with the second definition.



Because if we use the first definition with "$implies$", we know the truth table of the implication in particular $P implies Q$ is true when $P$ is false and $Q$ is true. That means in the context of symmetric relation that $(x,y) notin R implies (y,x) in R$ is true.



And the example $A = 1,2,3,4$ with relation $R = (2,1),(3,1),(4,1)$ satisfies the definition because $(x,y) notin R implies (y,x) in R$ is true.



And for me it's weird that this case is considered symmetric.
Or maybe I have a profound confusion with the concept.
I would like that you guys help me clarify. *Sorry for my grammar I'm not a native english speaker.










share|cite|improve this question











$endgroup$











  • $begingroup$
    Sorry i will correct it
    $endgroup$
    – Rodrigo Sango
    6 hours ago










  • $begingroup$
    It's for ALL x, y. In your example $(2,1)in R not implies (1,2)in R$. But given $A=1,2,3$ and $R=(1,2),(2,1)$ we have $(1,3)in R implies (3,1)in R$ etc.
    $endgroup$
    – fleablood
    6 hours ago






  • 1




    $begingroup$
    "That means in the context of symmetric relation that (x,y)∉ R ⟹ (y,x)∈ R is true" Only if $x,y$ is actually in $R$. $(2,1)not in R implies (1,2)in R$ is a true statement. But $(3,2)not in R implies (2,3)in R$ is a false statement.
    $endgroup$
    – fleablood
    6 hours ago






  • 2




    $begingroup$
    The definitions are equivalent.
    $endgroup$
    – PyRulez
    2 hours ago













5












5








5


2



$begingroup$


Why is a symmetric relation defined by $forallxforally(xRy implies yRx)$ and not $forallxforally(xRy iff yRx)$?
(I have only found a couple of sources that defines it with a biconditional)



For example, according to Wolfram:




A relation $R$ on a set $S$ is symmetric provided that for every $x$ and $y$ in $S$ we have $xRy iff yRx$.




But the majority of books defines it the other way.
And I think I agree with the second definition.



Because if we use the first definition with "$implies$", we know the truth table of the implication in particular $P implies Q$ is true when $P$ is false and $Q$ is true. That means in the context of symmetric relation that $(x,y) notin R implies (y,x) in R$ is true.



And the example $A = 1,2,3,4$ with relation $R = (2,1),(3,1),(4,1)$ satisfies the definition because $(x,y) notin R implies (y,x) in R$ is true.



And for me it's weird that this case is considered symmetric.
Or maybe I have a profound confusion with the concept.
I would like that you guys help me clarify. *Sorry for my grammar I'm not a native english speaker.










share|cite|improve this question











$endgroup$




Why is a symmetric relation defined by $forallxforally(xRy implies yRx)$ and not $forallxforally(xRy iff yRx)$?
(I have only found a couple of sources that defines it with a biconditional)



For example, according to Wolfram:




A relation $R$ on a set $S$ is symmetric provided that for every $x$ and $y$ in $S$ we have $xRy iff yRx$.




But the majority of books defines it the other way.
And I think I agree with the second definition.



Because if we use the first definition with "$implies$", we know the truth table of the implication in particular $P implies Q$ is true when $P$ is false and $Q$ is true. That means in the context of symmetric relation that $(x,y) notin R implies (y,x) in R$ is true.



And the example $A = 1,2,3,4$ with relation $R = (2,1),(3,1),(4,1)$ satisfies the definition because $(x,y) notin R implies (y,x) in R$ is true.



And for me it's weird that this case is considered symmetric.
Or maybe I have a profound confusion with the concept.
I would like that you guys help me clarify. *Sorry for my grammar I'm not a native english speaker.







discrete-mathematics logic definition relations






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 8 mins ago









Asaf Karagila

307k33438769




307k33438769










asked 6 hours ago









Rodrigo SangoRodrigo Sango

1276




1276











  • $begingroup$
    Sorry i will correct it
    $endgroup$
    – Rodrigo Sango
    6 hours ago










  • $begingroup$
    It's for ALL x, y. In your example $(2,1)in R not implies (1,2)in R$. But given $A=1,2,3$ and $R=(1,2),(2,1)$ we have $(1,3)in R implies (3,1)in R$ etc.
    $endgroup$
    – fleablood
    6 hours ago






  • 1




    $begingroup$
    "That means in the context of symmetric relation that (x,y)∉ R ⟹ (y,x)∈ R is true" Only if $x,y$ is actually in $R$. $(2,1)not in R implies (1,2)in R$ is a true statement. But $(3,2)not in R implies (2,3)in R$ is a false statement.
    $endgroup$
    – fleablood
    6 hours ago






  • 2




    $begingroup$
    The definitions are equivalent.
    $endgroup$
    – PyRulez
    2 hours ago
















  • $begingroup$
    Sorry i will correct it
    $endgroup$
    – Rodrigo Sango
    6 hours ago










  • $begingroup$
    It's for ALL x, y. In your example $(2,1)in R not implies (1,2)in R$. But given $A=1,2,3$ and $R=(1,2),(2,1)$ we have $(1,3)in R implies (3,1)in R$ etc.
    $endgroup$
    – fleablood
    6 hours ago






  • 1




    $begingroup$
    "That means in the context of symmetric relation that (x,y)∉ R ⟹ (y,x)∈ R is true" Only if $x,y$ is actually in $R$. $(2,1)not in R implies (1,2)in R$ is a true statement. But $(3,2)not in R implies (2,3)in R$ is a false statement.
    $endgroup$
    – fleablood
    6 hours ago






  • 2




    $begingroup$
    The definitions are equivalent.
    $endgroup$
    – PyRulez
    2 hours ago















$begingroup$
Sorry i will correct it
$endgroup$
– Rodrigo Sango
6 hours ago




$begingroup$
Sorry i will correct it
$endgroup$
– Rodrigo Sango
6 hours ago












$begingroup$
It's for ALL x, y. In your example $(2,1)in R not implies (1,2)in R$. But given $A=1,2,3$ and $R=(1,2),(2,1)$ we have $(1,3)in R implies (3,1)in R$ etc.
$endgroup$
– fleablood
6 hours ago




$begingroup$
It's for ALL x, y. In your example $(2,1)in R not implies (1,2)in R$. But given $A=1,2,3$ and $R=(1,2),(2,1)$ we have $(1,3)in R implies (3,1)in R$ etc.
$endgroup$
– fleablood
6 hours ago




1




1




$begingroup$
"That means in the context of symmetric relation that (x,y)∉ R ⟹ (y,x)∈ R is true" Only if $x,y$ is actually in $R$. $(2,1)not in R implies (1,2)in R$ is a true statement. But $(3,2)not in R implies (2,3)in R$ is a false statement.
$endgroup$
– fleablood
6 hours ago




$begingroup$
"That means in the context of symmetric relation that (x,y)∉ R ⟹ (y,x)∈ R is true" Only if $x,y$ is actually in $R$. $(2,1)not in R implies (1,2)in R$ is a true statement. But $(3,2)not in R implies (2,3)in R$ is a false statement.
$endgroup$
– fleablood
6 hours ago




2




2




$begingroup$
The definitions are equivalent.
$endgroup$
– PyRulez
2 hours ago




$begingroup$
The definitions are equivalent.
$endgroup$
– PyRulez
2 hours ago










4 Answers
4






active

oldest

votes


















7












$begingroup$

For all $x$ and all $y$ make the if and only if unnecessary (albeit perfectly acceptable).



1) $(x,y) in R implies (y,x) in R$ for ALL $x,y in A$



And the statement 2) $(x,y) in R iff (y,x) in R$ are equivalent statements.



If 1) is true and $(x,y) not in R$ then although $(x,y)in Rimplies (y,x)in R$ or $F implies (y,x)in R$ is true, it does not tell us any thing about whether or not $(y,x) in R$. However $(y,x) in R implies (x,y) in Y$ tells us that $(y,x) not in R$. Because $(y,x) in R implies (x,y) in R$ means $(y,x) in R implies F$. An the only thing that implies a false statement is a false statement. So we must have $(y,x) not in R$.



So in your example you have $(1,2)in Rimplies (2,1)in R$ is true but you don't have $(2,1) in R implies (1,2) in R$ as true.



So it isn't symmetric.



=====



Another way to look at it:



If $A = 1,2,3$



Then we will have 9 statments.



By 1) the nine statements are:



$(1,1)in Rimplies (1,1) in R$



$(1,2) in R implies (2,1) in R$



$(1,3) in R implies (3,1) in R$



$(2,1) in R implies (1,2) in R$



... etc... all nine are needed.



With 2) we also have nine statements:



$(1,1)in Riff (1,1) in R$



$(1,2) in R iff (2,1) in R$



$(1,3) in R iff (3,1) in R$



$(2,1) in R iff (1,2) in R$



...etc....



$(1,2) in R iff (2,1) in R$ and $(2,1) in R iff (1,2)in R$ is redundant.



So aesthetically, using definition 2) is .... inefficient.






share|cite|improve this answer









$endgroup$












  • $begingroup$
    Got it. Thank you, fleablood.
    $endgroup$
    – Rodrigo Sango
    5 hours ago






  • 1




    $begingroup$
    "all nine are needed" ... except the three that are tautologies, of course. But it would be more work and less clear to exclude them than to tolerate them.
    $endgroup$
    – Henning Makholm
    2 hours ago


















9












$begingroup$

If $A$ is a set and $R$ is a binary relation defined on $A$ (that is, $R$ is a subset of $Atimes A$), then the usual definition of symmetry (as far as $R$ is concerned) is$$(forall xin A)(forall yin A):xmathrel Ryimplies ymathrel Rx.tag1$$And this is equivalent to$$(forall xin A)(forall yin A):xmathrel Ryiff ymathrel Rx.tag2$$So, why do we choose $(1)$ instead of $(2)$ in general? Because, in general (although not in this case) it is easier to verify the assertion $Aimplies B$ than $Aiff B$. And (again, in general), when we choose between two distinct but equivalent definitions, we usually choose the one which is easier to verify that it holds.






share|cite|improve this answer









$endgroup$




















    3












    $begingroup$

    If $xRy implies yRx$ for all $x$ and all $y$, then we can choose $x := tildey$ and $y := tildex$ and get $tildeyRtildex implies tildexRtildey$ or, equivalently, $yRx implies xRy$, which is $impliedby$.



    In conclusion, since the implication should hold for all $x,y$, the equivalence already holds.






    share|cite|improve this answer









    $endgroup$




















      1












      $begingroup$

      Let it be that $R$ is a symmetric relation.



      This according to the first mentioned definition:$$forall xforall y[xRyimplies yRx]tag1$$



      Now let it be that $aRb$.



      Then we are allowed to conclude that $bRa$.



      On the other hand if $bRa$ then also we are conclude that $aRb$.



      So apparantly we have:$$aRbiff bRa$$



      Proved is now that for a symmetric relation $R$ (based on definition $(1)$) we have:$$forall xforall y[xRyiff yRx]tag2$$



      So $(2)$ is a necessary condition for $(1)$.



      Next to that it is obvious that $(2)$ is also a sufficient condition for $(1)$ so actually the statements are equivalent.



      Both can be used as definition then, but in cases that like that it is good custom to go for the one with less implications.






      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%2f3159427%2fwhy-is-a-symmetric-relation-defined-forall-x-forall-y-xry-implies-yrx-and%23new-answer', 'question_page');

        );

        Post as a guest















        Required, but never shown

























        4 Answers
        4






        active

        oldest

        votes








        4 Answers
        4






        active

        oldest

        votes









        active

        oldest

        votes






        active

        oldest

        votes









        7












        $begingroup$

        For all $x$ and all $y$ make the if and only if unnecessary (albeit perfectly acceptable).



        1) $(x,y) in R implies (y,x) in R$ for ALL $x,y in A$



        And the statement 2) $(x,y) in R iff (y,x) in R$ are equivalent statements.



        If 1) is true and $(x,y) not in R$ then although $(x,y)in Rimplies (y,x)in R$ or $F implies (y,x)in R$ is true, it does not tell us any thing about whether or not $(y,x) in R$. However $(y,x) in R implies (x,y) in Y$ tells us that $(y,x) not in R$. Because $(y,x) in R implies (x,y) in R$ means $(y,x) in R implies F$. An the only thing that implies a false statement is a false statement. So we must have $(y,x) not in R$.



        So in your example you have $(1,2)in Rimplies (2,1)in R$ is true but you don't have $(2,1) in R implies (1,2) in R$ as true.



        So it isn't symmetric.



        =====



        Another way to look at it:



        If $A = 1,2,3$



        Then we will have 9 statments.



        By 1) the nine statements are:



        $(1,1)in Rimplies (1,1) in R$



        $(1,2) in R implies (2,1) in R$



        $(1,3) in R implies (3,1) in R$



        $(2,1) in R implies (1,2) in R$



        ... etc... all nine are needed.



        With 2) we also have nine statements:



        $(1,1)in Riff (1,1) in R$



        $(1,2) in R iff (2,1) in R$



        $(1,3) in R iff (3,1) in R$



        $(2,1) in R iff (1,2) in R$



        ...etc....



        $(1,2) in R iff (2,1) in R$ and $(2,1) in R iff (1,2)in R$ is redundant.



        So aesthetically, using definition 2) is .... inefficient.






        share|cite|improve this answer









        $endgroup$












        • $begingroup$
          Got it. Thank you, fleablood.
          $endgroup$
          – Rodrigo Sango
          5 hours ago






        • 1




          $begingroup$
          "all nine are needed" ... except the three that are tautologies, of course. But it would be more work and less clear to exclude them than to tolerate them.
          $endgroup$
          – Henning Makholm
          2 hours ago















        7












        $begingroup$

        For all $x$ and all $y$ make the if and only if unnecessary (albeit perfectly acceptable).



        1) $(x,y) in R implies (y,x) in R$ for ALL $x,y in A$



        And the statement 2) $(x,y) in R iff (y,x) in R$ are equivalent statements.



        If 1) is true and $(x,y) not in R$ then although $(x,y)in Rimplies (y,x)in R$ or $F implies (y,x)in R$ is true, it does not tell us any thing about whether or not $(y,x) in R$. However $(y,x) in R implies (x,y) in Y$ tells us that $(y,x) not in R$. Because $(y,x) in R implies (x,y) in R$ means $(y,x) in R implies F$. An the only thing that implies a false statement is a false statement. So we must have $(y,x) not in R$.



        So in your example you have $(1,2)in Rimplies (2,1)in R$ is true but you don't have $(2,1) in R implies (1,2) in R$ as true.



        So it isn't symmetric.



        =====



        Another way to look at it:



        If $A = 1,2,3$



        Then we will have 9 statments.



        By 1) the nine statements are:



        $(1,1)in Rimplies (1,1) in R$



        $(1,2) in R implies (2,1) in R$



        $(1,3) in R implies (3,1) in R$



        $(2,1) in R implies (1,2) in R$



        ... etc... all nine are needed.



        With 2) we also have nine statements:



        $(1,1)in Riff (1,1) in R$



        $(1,2) in R iff (2,1) in R$



        $(1,3) in R iff (3,1) in R$



        $(2,1) in R iff (1,2) in R$



        ...etc....



        $(1,2) in R iff (2,1) in R$ and $(2,1) in R iff (1,2)in R$ is redundant.



        So aesthetically, using definition 2) is .... inefficient.






        share|cite|improve this answer









        $endgroup$












        • $begingroup$
          Got it. Thank you, fleablood.
          $endgroup$
          – Rodrigo Sango
          5 hours ago






        • 1




          $begingroup$
          "all nine are needed" ... except the three that are tautologies, of course. But it would be more work and less clear to exclude them than to tolerate them.
          $endgroup$
          – Henning Makholm
          2 hours ago













        7












        7








        7





        $begingroup$

        For all $x$ and all $y$ make the if and only if unnecessary (albeit perfectly acceptable).



        1) $(x,y) in R implies (y,x) in R$ for ALL $x,y in A$



        And the statement 2) $(x,y) in R iff (y,x) in R$ are equivalent statements.



        If 1) is true and $(x,y) not in R$ then although $(x,y)in Rimplies (y,x)in R$ or $F implies (y,x)in R$ is true, it does not tell us any thing about whether or not $(y,x) in R$. However $(y,x) in R implies (x,y) in Y$ tells us that $(y,x) not in R$. Because $(y,x) in R implies (x,y) in R$ means $(y,x) in R implies F$. An the only thing that implies a false statement is a false statement. So we must have $(y,x) not in R$.



        So in your example you have $(1,2)in Rimplies (2,1)in R$ is true but you don't have $(2,1) in R implies (1,2) in R$ as true.



        So it isn't symmetric.



        =====



        Another way to look at it:



        If $A = 1,2,3$



        Then we will have 9 statments.



        By 1) the nine statements are:



        $(1,1)in Rimplies (1,1) in R$



        $(1,2) in R implies (2,1) in R$



        $(1,3) in R implies (3,1) in R$



        $(2,1) in R implies (1,2) in R$



        ... etc... all nine are needed.



        With 2) we also have nine statements:



        $(1,1)in Riff (1,1) in R$



        $(1,2) in R iff (2,1) in R$



        $(1,3) in R iff (3,1) in R$



        $(2,1) in R iff (1,2) in R$



        ...etc....



        $(1,2) in R iff (2,1) in R$ and $(2,1) in R iff (1,2)in R$ is redundant.



        So aesthetically, using definition 2) is .... inefficient.






        share|cite|improve this answer









        $endgroup$



        For all $x$ and all $y$ make the if and only if unnecessary (albeit perfectly acceptable).



        1) $(x,y) in R implies (y,x) in R$ for ALL $x,y in A$



        And the statement 2) $(x,y) in R iff (y,x) in R$ are equivalent statements.



        If 1) is true and $(x,y) not in R$ then although $(x,y)in Rimplies (y,x)in R$ or $F implies (y,x)in R$ is true, it does not tell us any thing about whether or not $(y,x) in R$. However $(y,x) in R implies (x,y) in Y$ tells us that $(y,x) not in R$. Because $(y,x) in R implies (x,y) in R$ means $(y,x) in R implies F$. An the only thing that implies a false statement is a false statement. So we must have $(y,x) not in R$.



        So in your example you have $(1,2)in Rimplies (2,1)in R$ is true but you don't have $(2,1) in R implies (1,2) in R$ as true.



        So it isn't symmetric.



        =====



        Another way to look at it:



        If $A = 1,2,3$



        Then we will have 9 statments.



        By 1) the nine statements are:



        $(1,1)in Rimplies (1,1) in R$



        $(1,2) in R implies (2,1) in R$



        $(1,3) in R implies (3,1) in R$



        $(2,1) in R implies (1,2) in R$



        ... etc... all nine are needed.



        With 2) we also have nine statements:



        $(1,1)in Riff (1,1) in R$



        $(1,2) in R iff (2,1) in R$



        $(1,3) in R iff (3,1) in R$



        $(2,1) in R iff (1,2) in R$



        ...etc....



        $(1,2) in R iff (2,1) in R$ and $(2,1) in R iff (1,2)in R$ is redundant.



        So aesthetically, using definition 2) is .... inefficient.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered 5 hours ago









        fleabloodfleablood

        73k22789




        73k22789











        • $begingroup$
          Got it. Thank you, fleablood.
          $endgroup$
          – Rodrigo Sango
          5 hours ago






        • 1




          $begingroup$
          "all nine are needed" ... except the three that are tautologies, of course. But it would be more work and less clear to exclude them than to tolerate them.
          $endgroup$
          – Henning Makholm
          2 hours ago
















        • $begingroup$
          Got it. Thank you, fleablood.
          $endgroup$
          – Rodrigo Sango
          5 hours ago






        • 1




          $begingroup$
          "all nine are needed" ... except the three that are tautologies, of course. But it would be more work and less clear to exclude them than to tolerate them.
          $endgroup$
          – Henning Makholm
          2 hours ago















        $begingroup$
        Got it. Thank you, fleablood.
        $endgroup$
        – Rodrigo Sango
        5 hours ago




        $begingroup$
        Got it. Thank you, fleablood.
        $endgroup$
        – Rodrigo Sango
        5 hours ago




        1




        1




        $begingroup$
        "all nine are needed" ... except the three that are tautologies, of course. But it would be more work and less clear to exclude them than to tolerate them.
        $endgroup$
        – Henning Makholm
        2 hours ago




        $begingroup$
        "all nine are needed" ... except the three that are tautologies, of course. But it would be more work and less clear to exclude them than to tolerate them.
        $endgroup$
        – Henning Makholm
        2 hours ago











        9












        $begingroup$

        If $A$ is a set and $R$ is a binary relation defined on $A$ (that is, $R$ is a subset of $Atimes A$), then the usual definition of symmetry (as far as $R$ is concerned) is$$(forall xin A)(forall yin A):xmathrel Ryimplies ymathrel Rx.tag1$$And this is equivalent to$$(forall xin A)(forall yin A):xmathrel Ryiff ymathrel Rx.tag2$$So, why do we choose $(1)$ instead of $(2)$ in general? Because, in general (although not in this case) it is easier to verify the assertion $Aimplies B$ than $Aiff B$. And (again, in general), when we choose between two distinct but equivalent definitions, we usually choose the one which is easier to verify that it holds.






        share|cite|improve this answer









        $endgroup$

















          9












          $begingroup$

          If $A$ is a set and $R$ is a binary relation defined on $A$ (that is, $R$ is a subset of $Atimes A$), then the usual definition of symmetry (as far as $R$ is concerned) is$$(forall xin A)(forall yin A):xmathrel Ryimplies ymathrel Rx.tag1$$And this is equivalent to$$(forall xin A)(forall yin A):xmathrel Ryiff ymathrel Rx.tag2$$So, why do we choose $(1)$ instead of $(2)$ in general? Because, in general (although not in this case) it is easier to verify the assertion $Aimplies B$ than $Aiff B$. And (again, in general), when we choose between two distinct but equivalent definitions, we usually choose the one which is easier to verify that it holds.






          share|cite|improve this answer









          $endgroup$















            9












            9








            9





            $begingroup$

            If $A$ is a set and $R$ is a binary relation defined on $A$ (that is, $R$ is a subset of $Atimes A$), then the usual definition of symmetry (as far as $R$ is concerned) is$$(forall xin A)(forall yin A):xmathrel Ryimplies ymathrel Rx.tag1$$And this is equivalent to$$(forall xin A)(forall yin A):xmathrel Ryiff ymathrel Rx.tag2$$So, why do we choose $(1)$ instead of $(2)$ in general? Because, in general (although not in this case) it is easier to verify the assertion $Aimplies B$ than $Aiff B$. And (again, in general), when we choose between two distinct but equivalent definitions, we usually choose the one which is easier to verify that it holds.






            share|cite|improve this answer









            $endgroup$



            If $A$ is a set and $R$ is a binary relation defined on $A$ (that is, $R$ is a subset of $Atimes A$), then the usual definition of symmetry (as far as $R$ is concerned) is$$(forall xin A)(forall yin A):xmathrel Ryimplies ymathrel Rx.tag1$$And this is equivalent to$$(forall xin A)(forall yin A):xmathrel Ryiff ymathrel Rx.tag2$$So, why do we choose $(1)$ instead of $(2)$ in general? Because, in general (although not in this case) it is easier to verify the assertion $Aimplies B$ than $Aiff B$. And (again, in general), when we choose between two distinct but equivalent definitions, we usually choose the one which is easier to verify that it holds.







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered 6 hours ago









            José Carlos SantosJosé Carlos Santos

            169k23132237




            169k23132237





















                3












                $begingroup$

                If $xRy implies yRx$ for all $x$ and all $y$, then we can choose $x := tildey$ and $y := tildex$ and get $tildeyRtildex implies tildexRtildey$ or, equivalently, $yRx implies xRy$, which is $impliedby$.



                In conclusion, since the implication should hold for all $x,y$, the equivalence already holds.






                share|cite|improve this answer









                $endgroup$

















                  3












                  $begingroup$

                  If $xRy implies yRx$ for all $x$ and all $y$, then we can choose $x := tildey$ and $y := tildex$ and get $tildeyRtildex implies tildexRtildey$ or, equivalently, $yRx implies xRy$, which is $impliedby$.



                  In conclusion, since the implication should hold for all $x,y$, the equivalence already holds.






                  share|cite|improve this answer









                  $endgroup$















                    3












                    3








                    3





                    $begingroup$

                    If $xRy implies yRx$ for all $x$ and all $y$, then we can choose $x := tildey$ and $y := tildex$ and get $tildeyRtildex implies tildexRtildey$ or, equivalently, $yRx implies xRy$, which is $impliedby$.



                    In conclusion, since the implication should hold for all $x,y$, the equivalence already holds.






                    share|cite|improve this answer









                    $endgroup$



                    If $xRy implies yRx$ for all $x$ and all $y$, then we can choose $x := tildey$ and $y := tildex$ and get $tildeyRtildex implies tildexRtildey$ or, equivalently, $yRx implies xRy$, which is $impliedby$.



                    In conclusion, since the implication should hold for all $x,y$, the equivalence already holds.







                    share|cite|improve this answer












                    share|cite|improve this answer



                    share|cite|improve this answer










                    answered 6 hours ago









                    Viktor GlombikViktor Glombik

                    1,2352528




                    1,2352528





















                        1












                        $begingroup$

                        Let it be that $R$ is a symmetric relation.



                        This according to the first mentioned definition:$$forall xforall y[xRyimplies yRx]tag1$$



                        Now let it be that $aRb$.



                        Then we are allowed to conclude that $bRa$.



                        On the other hand if $bRa$ then also we are conclude that $aRb$.



                        So apparantly we have:$$aRbiff bRa$$



                        Proved is now that for a symmetric relation $R$ (based on definition $(1)$) we have:$$forall xforall y[xRyiff yRx]tag2$$



                        So $(2)$ is a necessary condition for $(1)$.



                        Next to that it is obvious that $(2)$ is also a sufficient condition for $(1)$ so actually the statements are equivalent.



                        Both can be used as definition then, but in cases that like that it is good custom to go for the one with less implications.






                        share|cite|improve this answer









                        $endgroup$

















                          1












                          $begingroup$

                          Let it be that $R$ is a symmetric relation.



                          This according to the first mentioned definition:$$forall xforall y[xRyimplies yRx]tag1$$



                          Now let it be that $aRb$.



                          Then we are allowed to conclude that $bRa$.



                          On the other hand if $bRa$ then also we are conclude that $aRb$.



                          So apparantly we have:$$aRbiff bRa$$



                          Proved is now that for a symmetric relation $R$ (based on definition $(1)$) we have:$$forall xforall y[xRyiff yRx]tag2$$



                          So $(2)$ is a necessary condition for $(1)$.



                          Next to that it is obvious that $(2)$ is also a sufficient condition for $(1)$ so actually the statements are equivalent.



                          Both can be used as definition then, but in cases that like that it is good custom to go for the one with less implications.






                          share|cite|improve this answer









                          $endgroup$















                            1












                            1








                            1





                            $begingroup$

                            Let it be that $R$ is a symmetric relation.



                            This according to the first mentioned definition:$$forall xforall y[xRyimplies yRx]tag1$$



                            Now let it be that $aRb$.



                            Then we are allowed to conclude that $bRa$.



                            On the other hand if $bRa$ then also we are conclude that $aRb$.



                            So apparantly we have:$$aRbiff bRa$$



                            Proved is now that for a symmetric relation $R$ (based on definition $(1)$) we have:$$forall xforall y[xRyiff yRx]tag2$$



                            So $(2)$ is a necessary condition for $(1)$.



                            Next to that it is obvious that $(2)$ is also a sufficient condition for $(1)$ so actually the statements are equivalent.



                            Both can be used as definition then, but in cases that like that it is good custom to go for the one with less implications.






                            share|cite|improve this answer









                            $endgroup$



                            Let it be that $R$ is a symmetric relation.



                            This according to the first mentioned definition:$$forall xforall y[xRyimplies yRx]tag1$$



                            Now let it be that $aRb$.



                            Then we are allowed to conclude that $bRa$.



                            On the other hand if $bRa$ then also we are conclude that $aRb$.



                            So apparantly we have:$$aRbiff bRa$$



                            Proved is now that for a symmetric relation $R$ (based on definition $(1)$) we have:$$forall xforall y[xRyiff yRx]tag2$$



                            So $(2)$ is a necessary condition for $(1)$.



                            Next to that it is obvious that $(2)$ is also a sufficient condition for $(1)$ so actually the statements are equivalent.



                            Both can be used as definition then, but in cases that like that it is good custom to go for the one with less implications.







                            share|cite|improve this answer












                            share|cite|improve this answer



                            share|cite|improve this answer










                            answered 6 hours ago









                            drhabdrhab

                            103k545136




                            103k545136



























                                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%2f3159427%2fwhy-is-a-symmetric-relation-defined-forall-x-forall-y-xry-implies-yrx-and%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

                                acmart: Multiple authors: all with same affiliation, one author an additional affiliationHow to Write Names of Multiple Authors with Shared Affiliation in ACM 2017 Template?Multiple authors with different primary affiliation, but same additional affiliationSame affiliation for all authors without extra packagesIOS-Book-Article.cls: one author with multiple affiliationacmart: Shared Author AffiliationMultiple authors with different primary affiliation, but same additional affiliationAuthor affiliation with only 1 authorAdding Multiple Authors with Different Affiliation in LaTeX ArticleLaTeX: Multiple authors stays on same lineHow to Label Multiple Authors with Same DescriptionHow to make two authors use the same affiliationTwo authors with same affiliation on finished front page

                                How to write “ä” and other umlauts and accented letters in bibliography?Accents in BibTeXSorting references with special characters alphabeticallyUse ae ligature in bibliographyEastern European nameInverted circumflex in BibTexBibTex, non-ascii initials and nameptr fproblems with accent in LatexHow to add a Ø to my bibliography from Jabref?References without accentsTroubles when trying to cite St“omer-Verlet in ”title" field of a bib entryComprehensive list of accented charactersHow to type the letter “i” with two dots (diaeresis) in math mode?Problem with glossary text and accented lettersSpecial character in bibliographyAccented letters, Unicode and LaTeX accentsHow to stop natbib from modifying bibliography styleCitation of a paper with non-standard characters by BibtexWrite accented characters to file using writeHow to group the bibliography alphabetically, if some surnames start with “accented” characters?How can I automatically capitalize significant words in my bibliography?

                                How to force a table into page width?How to make table spanning textwidthMaking table width fit into text widthTable with tabular, column type p grabbing available spaceMaking widths of tables equal to width of textblocklatex tabular width the same as the textwidthMake tabular span textwidth exactlySet width of table to be the whole line or a given portion of itIs the tabu package obsolete?What is the difference between tabular, tabular* and tabularx environments?How can i set the width of a table?Making table width fit into text widthTabular and grid typesettingMake table use page widthTable exceeds page widthtable width automatically to page widthHow to shrink table to page widthForce table column to be zero widthTable width exceeds the page widthTable extending beyond the page widthforce longtable to text width