The symmetric closure of a binary relation R is R∪R−1, where (x,y)∈R−1 means (y,x)∈R. Every symmetric relation containing R contains all these reversed pairs, proving minimality.
Ancestors (7)
- Binary relation
- Finitary relation
- Set theory
- Foundations of mathematics
- Area of mathematics
- Mathematics
- Home
Incoming links (22)
- Equivalence class
- Equivalence relation
- Past exam of the mathematics course of the University of Cambridge / 2006 / ia / Paper 4 / 5E / i / Solution
- Past exam of the mathematics course of the University of Cambridge / 2009 / ia / Paper 4 / 1E / Solution
- Past exam of the mathematics course of the University of Cambridge / 2011 / ia / Paper 4 / 2E / Solution
- Past exam of the mathematics course of the University of Cambridge / 2012 / ia / Paper 4 / 2D / Solution
- Past exam of the mathematics course of the University of Cambridge / 2017 / ia / Paper 4 / 2D / a / Solution
- Past exam of the mathematics course of the University of Cambridge / 2017 / ia / Paper 4 / 2D / b / ii / Solution
- Past exam of the mathematics course of the University of Cambridge / 2017 / ia / Paper 4 / 2D / b / i / Solution
- Past exam of the mathematics course of the University of Cambridge / 2022 / ia / Paper 4 / 7F / a / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2003 / Calculus, probability, linear algebra, discrete mathematics, logic and proof, and models of computation / 6 / b / iii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2003 / Calculus, probability, linear algebra, discrete mathematics, logic and proof, and models of computation / 6 / b / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2003 / Calculus, probability, linear algebra, discrete mathematics, logic and proof, and models of computation / 6 / b / i / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2013 / Discrete mathematics, probability and continuous mathematics / 3 / d / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2013 / Discrete mathematics, probability and continuous mathematics / 3 / e / i / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2013 / Discrete mathematics, probability and continuous mathematics / 3 / f / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Discrete mathematics, continuous mathematics, and probability (resit) / 2 / d
- Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Discrete mathematics, continuous mathematics, and probability (resit) / 2 / d / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2018 / Discrete mathematics, continuous mathematics, and probability / 1 / c / iii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Discrete mathematics, continuous mathematics, and probability / Discrete mathematics / 3 / a / ii / Solution
- Symmetric closure
- Zeroth law of thermodynamics
Synonyms (2)
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.