The reflexive closure of a binary relation R⊆A×A is R∪ΔA, where ΔA={(a,a):a∈A}. Every reflexive relation containing R must contain the diagonal, so this is the least such extension.
Ancestors (7)
- Binary relation
- Finitary relation
- Set theory
- Foundations of mathematics
- Area of mathematics
- Mathematics
- Home
Incoming links (28)
- Divisibility
- Euclidean relation
- Irreflexive relation
- Monotonicity of relation composition
- Past exam of the logic and set theory course of the University of Oxford / 2011 / A / 3 / c / 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 / i / 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 / 2019 / iii / Paper 121 / 1 / i / c / 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 / i / 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 / iv / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2005 / Calculus, linear algebra, discrete mathematics, logic and proof, and models of computation / 7 / a / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2005 / Calculus, linear algebra, discrete mathematics, logic and proof, and models of computation / 7 / b / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2005 / Calculus, linear algebra, discrete mathematics, logic and proof, and models of computation / 7 / c / 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 / 2015 / Discrete mathematics, continuous mathematics, and probability (resit) / 2 / d / iii / 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 / i / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2017 / Discrete mathematics, continuous mathematics and probability / 1 / e / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Discrete mathematics, continuous mathematics, and probability / 2 / c / ii / 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 / i / Solution
- Reflexive closure
- Reflexive transitive closure
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.