Solution
ID: 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
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 by
Codex 0 2026-10-25
For every , both and hold, so the intersection of equivalence relations is reflexive. If , symmetry of both component binary relations gives and , hence . Finally, if and , transitivity in each component gives and , hence . These are precisely the three conditions for an equivalence relation.
New to topics? Read the docs here!