Suppose → is a binary relation on A, i.e, →⊆A×A.
- The reflexive closure of → is the smallest relation that contains → but also satisfies a→a for every a∈A.
- The symmetric closure of → is the smallest relation that contains → but also satisfies a→b whenever b→a hold for some a,b∈A.
- The transitive closure of → is the smallest relation that containts rightarrow but also satisfies a→c whenever a→b and b→c hold for some a,b,c∈A.
Prove or disprove: The Symmetric closure of the reflexive closure of the transitive closure of any relation → is an equivalence relation.
This problem is a part of Tessellate S.T.E.M.S (2019)
#ComputerScience
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
There are no comments in this discussion.