Counting problem: proving












1












$begingroup$


Consider an antireflexive, symmetric relation "is a friend of". Proof that in a group of $n$ people, there will always be an even number of people with an odd number of friends.



What I've already tried:



Suppose $A$ is the set of people with $|A| = n$. Consider the function $f: A to mathbb{N}_{<n}$ that maps a person to the number of friends he/she has ($<n$ because the relation we're looking at is antireflexive). The codomain of $f$ has exactly $n$ elements. $A$ and $mathbb{N}_{<n}$ have the same number of elements and therefor we can always find a bijection, and thus a surjection, between the two sets. If $n$ is even, we can map all people to $n-1$, meaning everybody is everybody's friend. If $n$ is odd, we randomly take $(n-1)/2$ people and map them to $n-2$; the other half of the people can be mapped to $0$. This completes the proof.



I don't know if this is the correct way of proving these type of questions. Does anyone have other methods/ideas? Is my proof correct?



Thanks.






combinatorics discrete-mathematics







share|cite|improve this question









$endgroup$








  • 3




    $begingroup$
    This is a graph theory problem.
    $endgroup$
    – Lord Shark the Unknown
    Jan 27 at 9:49






  • 2




    $begingroup$
    handshaking lemma is not it?
    $endgroup$
    – Bijayan Ray
    Jan 27 at 9:50






  • 2




    $begingroup$
    You seem to be deciding who should be friends with each other. You should accept that they have already decided who are friends already.
    $endgroup$
    – Lord Shark the Unknown
    Jan 27 at 9:51
















1












$begingroup$


Consider an antireflexive, symmetric relation "is a friend of". Proof that in a group of $n$ people, there will always be an even number of people with an odd number of friends.



What I've already tried:



Suppose $A$ is the set of people with $|A| = n$. Consider the function $f: A to mathbb{N}_{<n}$ that maps a person to the number of friends he/she has ($<n$ because the relation we're looking at is antireflexive). The codomain of $f$ has exactly $n$ elements. $A$ and $mathbb{N}_{<n}$ have the same number of elements and therefor we can always find a bijection, and thus a surjection, between the two sets. If $n$ is even, we can map all people to $n-1$, meaning everybody is everybody's friend. If $n$ is odd, we randomly take $(n-1)/2$ people and map them to $n-2$; the other half of the people can be mapped to $0$. This completes the proof.



I don't know if this is the correct way of proving these type of questions. Does anyone have other methods/ideas? Is my proof correct?



Thanks.






combinatorics discrete-mathematics







share|cite|improve this question









$endgroup$








  • 3




    $begingroup$
    This is a graph theory problem.
    $endgroup$
    – Lord Shark the Unknown
    Jan 27 at 9:49






  • 2




    $begingroup$
    handshaking lemma is not it?
    $endgroup$
    – Bijayan Ray
    Jan 27 at 9:50






  • 2




    $begingroup$
    You seem to be deciding who should be friends with each other. You should accept that they have already decided who are friends already.
    $endgroup$
    – Lord Shark the Unknown
    Jan 27 at 9:51














1












1








1





$begingroup$


Consider an antireflexive, symmetric relation "is a friend of". Proof that in a group of $n$ people, there will always be an even number of people with an odd number of friends.



What I've already tried:



Suppose $A$ is the set of people with $|A| = n$. Consider the function $f: A to mathbb{N}_{<n}$ that maps a person to the number of friends he/she has ($<n$ because the relation we're looking at is antireflexive). The codomain of $f$ has exactly $n$ elements. $A$ and $mathbb{N}_{<n}$ have the same number of elements and therefor we can always find a bijection, and thus a surjection, between the two sets. If $n$ is even, we can map all people to $n-1$, meaning everybody is everybody's friend. If $n$ is odd, we randomly take $(n-1)/2$ people and map them to $n-2$; the other half of the people can be mapped to $0$. This completes the proof.



I don't know if this is the correct way of proving these type of questions. Does anyone have other methods/ideas? Is my proof correct?



Thanks.






combinatorics discrete-mathematics







share|cite|improve this question









$endgroup$




Consider an antireflexive, symmetric relation "is a friend of". Proof that in a group of $n$ people, there will always be an even number of people with an odd number of friends.



What I've already tried:



Suppose $A$ is the set of people with $|A| = n$. Consider the function $f: A to mathbb{N}_{<n}$ that maps a person to the number of friends he/she has ($<n$ because the relation we're looking at is antireflexive). The codomain of $f$ has exactly $n$ elements. $A$ and $mathbb{N}_{<n}$ have the same number of elements and therefor we can always find a bijection, and thus a surjection, between the two sets. If $n$ is even, we can map all people to $n-1$, meaning everybody is everybody's friend. If $n$ is odd, we randomly take $(n-1)/2$ people and map them to $n-2$; the other half of the people can be mapped to $0$. This completes the proof.



I don't know if this is the correct way of proving these type of questions. Does anyone have other methods/ideas? Is my proof correct?



Thanks.






combinatorics discrete-mathematics




combinatorics discrete-mathematics






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Jan 27 at 9:47









ZacharyZachary

1919




1919








  • 3




    $begingroup$
    This is a graph theory problem.
    $endgroup$
    – Lord Shark the Unknown
    Jan 27 at 9:49






  • 2




    $begingroup$
    handshaking lemma is not it?
    $endgroup$
    – Bijayan Ray
    Jan 27 at 9:50






  • 2




    $begingroup$
    You seem to be deciding who should be friends with each other. You should accept that they have already decided who are friends already.
    $endgroup$
    – Lord Shark the Unknown
    Jan 27 at 9:51














  • 3




    $begingroup$
    This is a graph theory problem.
    $endgroup$
    – Lord Shark the Unknown
    Jan 27 at 9:49






  • 2




    $begingroup$
    handshaking lemma is not it?
    $endgroup$
    – Bijayan Ray
    Jan 27 at 9:50






  • 2




    $begingroup$
    You seem to be deciding who should be friends with each other. You should accept that they have already decided who are friends already.
    $endgroup$
    – Lord Shark the Unknown
    Jan 27 at 9:51








3




3




$begingroup$
This is a graph theory problem.
$endgroup$
– Lord Shark the Unknown
Jan 27 at 9:49




$begingroup$
This is a graph theory problem.
$endgroup$
– Lord Shark the Unknown
Jan 27 at 9:49




2




2




$begingroup$
handshaking lemma is not it?
$endgroup$
– Bijayan Ray
Jan 27 at 9:50




$begingroup$
handshaking lemma is not it?
$endgroup$
– Bijayan Ray
Jan 27 at 9:50




2




2




$begingroup$
You seem to be deciding who should be friends with each other. You should accept that they have already decided who are friends already.
$endgroup$
– Lord Shark the Unknown
Jan 27 at 9:51




$begingroup$
You seem to be deciding who should be friends with each other. You should accept that they have already decided who are friends already.
$endgroup$
– Lord Shark the Unknown
Jan 27 at 9:51










2 Answers
2






active

oldest

votes


















1












$begingroup$

Consider the $v_k$ denote a person observe that the total number of 'is friend of' is even because $v_x$ 'is friend of' $v_y$ implies the converse too. So now if number of people with odd number of friend is odd the "the total number of 'is friend of'" would be odd too hence contradiction which proves the assertion (you may also refer Wikipedia "handshaking lemma " for general graph theoretic proof)






share|cite|improve this answer









$endgroup$





















    0












    $begingroup$

    Assume there are an odd number of people with an odd number of friends. Then the total number of friendship is $frac{text{odd*odd+even*even}}{2}$ which is not an integer. This is a contradiction.






    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%2f3089346%2fcounting-problem-proving%23new-answer', 'question_page');
      }
      );

      Post as a guest















      Required, but never shown

























      2 Answers
      2






      active

      oldest

      votes








      2 Answers
      2






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      1












      $begingroup$

      Consider the $v_k$ denote a person observe that the total number of 'is friend of' is even because $v_x$ 'is friend of' $v_y$ implies the converse too. So now if number of people with odd number of friend is odd the "the total number of 'is friend of'" would be odd too hence contradiction which proves the assertion (you may also refer Wikipedia "handshaking lemma " for general graph theoretic proof)






      share|cite|improve this answer









      $endgroup$


















        1












        $begingroup$

        Consider the $v_k$ denote a person observe that the total number of 'is friend of' is even because $v_x$ 'is friend of' $v_y$ implies the converse too. So now if number of people with odd number of friend is odd the "the total number of 'is friend of'" would be odd too hence contradiction which proves the assertion (you may also refer Wikipedia "handshaking lemma " for general graph theoretic proof)






        share|cite|improve this answer









        $endgroup$
















          1












          1








          1





          $begingroup$

          Consider the $v_k$ denote a person observe that the total number of 'is friend of' is even because $v_x$ 'is friend of' $v_y$ implies the converse too. So now if number of people with odd number of friend is odd the "the total number of 'is friend of'" would be odd too hence contradiction which proves the assertion (you may also refer Wikipedia "handshaking lemma " for general graph theoretic proof)






          share|cite|improve this answer









          $endgroup$



          Consider the $v_k$ denote a person observe that the total number of 'is friend of' is even because $v_x$ 'is friend of' $v_y$ implies the converse too. So now if number of people with odd number of friend is odd the "the total number of 'is friend of'" would be odd too hence contradiction which proves the assertion (you may also refer Wikipedia "handshaking lemma " for general graph theoretic proof)







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Jan 27 at 9:57









          Bijayan RayBijayan Ray

          136112




          136112























              0












              $begingroup$

              Assume there are an odd number of people with an odd number of friends. Then the total number of friendship is $frac{text{odd*odd+even*even}}{2}$ which is not an integer. This is a contradiction.






              share|cite|improve this answer









              $endgroup$


















                0












                $begingroup$

                Assume there are an odd number of people with an odd number of friends. Then the total number of friendship is $frac{text{odd*odd+even*even}}{2}$ which is not an integer. This is a contradiction.






                share|cite|improve this answer









                $endgroup$
















                  0












                  0








                  0





                  $begingroup$

                  Assume there are an odd number of people with an odd number of friends. Then the total number of friendship is $frac{text{odd*odd+even*even}}{2}$ which is not an integer. This is a contradiction.






                  share|cite|improve this answer









                  $endgroup$



                  Assume there are an odd number of people with an odd number of friends. Then the total number of friendship is $frac{text{odd*odd+even*even}}{2}$ which is not an integer. This is a contradiction.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Jan 27 at 10:05









                  abc...abc...

                  3,237738




                  3,237738






























                      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%2f3089346%2fcounting-problem-proving%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

                      Can a sorcerer learn a 5th-level spell early by creating spell slots using the Font of Magic feature?

                      Image
                      28 6 $begingroup$ Per the Font of Magic feature, sorcerer can use Flexible Casting to create 5th-level spell slots at level 7, even though they are not typically available until level 9. You can transform unexpended sorcery points into one spell slot as a bonus action on your turn. The Creating Spell Slots table shows the cost of creating a spell slot of [5th level is 7] If such a sorcerer levels up while still having this 5th-level spell slot, can they choose a 5th-level spell as the spell they gain upon levelling up? The Spellcasting feature states: Additionally, when you gain a level in this class, you can choose one of the sorcerer spells you know and replace it with another spell from the sorcerer spell list, which also must be of a level for which you have spell slots.
                      Read more

                      Does disintegrating a polymorphed enemy still kill it after the 2018 errata?

                      Image
                      up vote 13 down vote favorite 1 After the 2018 errata, the disintegrate spell description now reads: A creature targeted by this spell must make a Dexterity saving throw. On a failed save, the target takes 10d6 + 40 force damage. The target is disintegrated if this damage leaves it with 0 hit points. If you were to polymorph an enemy into a rat and then disintegrate it, would the enemy be disintegrated or would it just return to its original form? I know that for Druids, it’s not an instant kill anymore, but is this the case for polymorph as well? dnd-5e spells polymorph errata share | improve this question edited 18 hours ago
                      Read more

                      A Topological Invariant for $pi_3(U(n))$

                      Image
                      3 3 $begingroup$ Recently, I saw a construction of topological invariant for $pi_3(U(n))$ with $ngeq 2$ : $$ N=frac{1}{24pi^2}int_{S^3} d^3x epsilon^{ijk} Tr[(U^{-1}partial_{x_i}U)(U^{-1}partial_{x_j}U)(U^{-1}partial_{x_k}U)] , $$ where $Uin U(n)$ depends on $boldsymbol{x}=(x_1,x_2,x_3)in S^3$ , $epsilon^{ijk}$ is the Levi-Civita symbol, $i,j,k=1,2,3$ , and the duplicated indexes are summed over. It is claimed that $N$ is an integer, but why? Update 02/02/2019 I think I got an argument for $n=2$ . In this case, $U=e^{i varphi} q$ with $qin SU(2)$ . Due to the trace and the Levi-Civita symbol in $N$ , $varphi$ does not contribute to $N$ . As $Tr[q^{dagger}partial_i q]=0$ and $(q^{dagger}partial_i q)^{dagger}=-q^{dagger}partial_i q$ , $q^{dagger}partial_i q$ in geneeral has the form $q^{dagger}partia
                      Read more