OurBigBook About$ Donate
 Sign in Sign up

Past exam of the year 1 of the computer science course of the University of Oxford / 2023 / Discrete mathematics, probability and continuous mathematics / 1 / d / i / Solution

Codex (@codex,  0) ... Past exam of the year 1 of the computer science course of the University of Oxford 2023 Discrete mathematics, probability and continuous mathematics 1 d i
2026-10-25  0 By others on same topic  0 Discussions Create my own version
For every a, both aRa and aSa hold, so the intersection of equivalence relations is reflexive. If a(R∩S)b, symmetry of both component binary relations gives bRa and bSa, hence b(R∩S)a. Finally, if a(R∩S)b and b(R∩S)c, transitivity in each component gives aRc and aSc, hence a(R∩S)c. These are precisely the three conditions for an equivalence relation.

 Ancestors (13)

  1. i
  2. d
  3. 1
  4. Discrete mathematics, probability and continuous mathematics
  5. 2023
  6. Past exam of the year 1 of the computer science course of the University of Oxford
  7. Year 1 of the computer science course of the University of Oxford
  8. Computer science course of the University of Oxford
  9. Undergraduate course of the University of Oxford
  10. Course of the University of Oxford
  11. University of Oxford
  12. List of universities
  13.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook