Let R be an equivalence relation on a set A. Prove each of the statements in 36-41 directly from the definitions of equivalence relation and equivalenve class without using the results of Lemma 8.3.2, Lemma 8.3.3, or Theorem 8.3.4.
For every , and x in A, if and
For all a, b, and x in A, if a R b and x ∈ [ a ], then x ∈ [ b ].
Let R be an equivalence relation on a set A.
R is an equivalence relation on a set A.
By the definition of
Since R is an equivalence relation, R is reflexive, symmetric and transitive
Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!Get Started