## Related questions with answers

Define three equivalence relations on the set of students in your discrete mathematics class different from the relations discussed in the text. Determine the equivalence classes for each of these equivalence relations.

Solution

VerifiedDEFINITIONS

A relation $R$ is an $\textbf{equivalence relation}$ if the relation $R$ is transitive, symmetric and reflexive.

A relation $R$ on a set $A$ is $\textbf{reflexive}$ if $(a,a)\in R$ for every element $a\in A$.

A relation $R$ on a set $A$ is $\textbf{symmetric}$ if $(b,a)\in R$ whenever $(a,b) \in R$

A relation $R$ on a set $A$ is $\textbf{transitive}$ if $(a,b)\in R$ and $(b,c) \in R$ implies $(a,c)\in R$

The $\textbf{equivalence class}$ of $a$ is the set of all elements that are in relation to $a$.

Notation: $[a]_R$

## Create a free account to view solutions

## Create a free account to view solutions

## Recommended textbook solutions

#### Discrete Mathematics and Its Applications

7th Edition•ISBN: 9780073383095 (1 more)Kenneth Rosen#### Discrete Mathematics and Its Applications

8th Edition•ISBN: 9781259676512Kenneth Rosen#### Discrete Mathematics with Applications

5th Edition•ISBN: 9781337694193 (4 more)Susanna S. Epp## More related questions

1/4

1/7