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$ - symmetryDefine 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 relationName for relation property: If $xRy$ and $xRz$ and $x not =y$, then $yRz$.Can a relation be transitive when it is symmetric but not reflexive?

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

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

How do you respond to a colleague from another team when they're wrongly expecting that you'll help them?

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

What was the exact wording from Ivanhoe of this advice on how to free yourself from slavery?

lightning-datatable row number error

On a tidally locked planet, would time be quantized?

How do I color the graph in datavisualization?

C++ debug of nlohmann json using GDB

Can I sign legal documents with a smiley face?

Does the Location of Line-Dash-Wedge Notations Matter?

Store Credit Card Information in Password Manager?

Not using 's' for he/she/it

What is the evidence for the "tyranny of the majority problem" in a direct democracy context?

How could a planet have erratic days?

Are paving bricks differently sized for sand bedding vs mortar bedding?

Why is so much work done on numerical verification of the Riemann Hypothesis?

What was this official D&D 3.5e Lovecraft-flavored rulebook?

Is it safe to use olive oil to clean the ear wax?

The screen of my macbook suddenly broken down how can I do to recover

What does "Scientists rise up against statistical significance" mean? (Comment in Nature)

A social experiment. What is the worst that can happen?

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

250 Floor Tower



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$ - symmetryDefine 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 relationName for relation property: If $xRy$ and $xRz$ and $x not =y$, then $yRz$.Can 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
    3 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
    3 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 24 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
    3 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
    3 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
3 hours ago




$begingroup$
The definitions are equivalent.
$endgroup$
– PyRulez
3 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
    3 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
          3 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
          3 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
          3 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
          3 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
        3 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
        3 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

                                Благоевград Съдържание География | История | Население | Политика | Икономика и инфрастуктура | Здравеопазване | Образование и наука | Култура и забавления | Забележителности | Личности | Литература | Външни препратки | Бележки | Навигация42°01′18.99″ с. ш. 23°05′51″ и. д. / 42.021944° с. ш. 23.0975° и. д.*БлагоевградразширитередактиранеОфициален уебсайт на община БлагоевградНовинарски портал на Благоевград – blagoevgrad.euСайтове за БлагоевградНационален статистически институтdariknews.bgГригоровичъ, Викторъ. „Очеркъ путешествія по Европейской Турціи“. Москва, 1877.Стрезов, Георги. Два санджака от Източна Македония. Периодично списание на Българското книжовно дружество в Средец, кн. XXXVII и XXXVIII, 1891, стр. 18 – 19.Македония. Етнография и статистикаГаджанов, Димитър Г. Мюсюлманското население в Новоосвободените земи, в: Научна експедиция в Македония и Поморавието 1916, Военноиздателски комплекс „Св. Георги Победоносец“, Университетско издателство „Св. Климент Охридски“, София, 1993, стр. 244.паметник на незнайния четник&cd=18&hl=en&ct=clnk&client=firefox-a „История на днешен Благоевград“, взето от www.museumblg.com на 16 март 2010 г.„Справка за населението на град Благоевград, община Благоевград, област Благоевград, НСИ“„The population of all towns and villages in Blagoevgrad Province with 50 inhabitants or more according to census results and latest official estimates“„Ethnic composition, all places: 2011 census“История на Неврокопска епархия.Национален статистически институтМюсюлманско изповедание. Главно мюфтийствоНационален публичен регистър на храмовете в БългарияМюсюлманско изповедание. Главно мюфтийствоwww.dnes.bg Джамията в Благоевград не била паленаwww.sesc-bg.orgСписък на побратимени градовеТехническо побратимяванеГУМ грейва в цветовете на нощен Лас Вегас под името „Largo“, „МОЛ Благоевград“..., в. „Струма“grabo.bgwww.cinemaxbg.comррр4238731-067cad53a-0546-417b-a3d3-51e49b1d2232147736077147736077

                                What is the best defense strategy for Survival in Grand Theft Auto Online?What is JP used for in Grand Theft Auto Online?How do I setup a Crew HQ in Grand Theft Auto Online?How does stealth work in Grand Theft Auto Online?Is it possible to own more than 10 cars in Grand Theft Auto online?Where to find truck/trailers in Grand Theft Auto OnlineWhat are some of the best missions to do on Grand Theft Auto 5 onlineFastest Car in Grand Theft Auto V PCHow to setup a Crew vs Crew online session in Grand Theft Auto Online?Grand theft auto 5 crossplayingRestart Grand Theft Auto V Online?

                                How does Billy Russo acquire his 'Jigsaw' mask? Unicorn Meta Zoo #1: Why another podcast? Announcing the arrival of Valued Associate #679: Cesar Manara Favourite questions and answers from the 1st quarter of 2019Why does Bane wear the mask?Why does Kylo Ren wear a mask?Why did Captain America remove his mask while fighting Batroc the Leaper?How did the OA acquire her wisdom?Is Billy Breckenridge gay?How does Adrian Toomes hide his earnings from the IRS?What is the state of affairs on Nootka Sound by the end of season 1?How did Tia Dalma acquire Captain Barbossa's body?How is one “Deemed Worthy”, to acquire the Greatsword “Dawn”?How did Karen acquire the handgun?