Questions tagged [equivalence-relations]

For questions about relations that are reflexive, symmetric, and transitive. These are relations that model a sense of "equality" between elements of a set. Consider also using the (relation) tag.

An equivalence relation is a particular kind of relation that models a notion of "equality" between elements of a set. A relation $R$ on a set $X$ will be an equivalence relation if it satisfies the following properties:

  • Reflexive – For each $a \in X$, we have $a \mathrel{R} a$.
  • Symmetric – For any $a,b \in X$, $a \mathrel{R} b$ if and only if $b \mathrel{R} a$
  • Transitive – For any $a,b,c \in X$, if $a \mathrel{R} b$ and $b \mathrel{R} c$, then $a \mathrel{R} c$.

Commonly the symbols $\equiv$ or $\cong$ or $\simeq$ or $=$ are used for equivalence relations instead of the letter $R$. Here are some examples of equivalence relations:

  • On the set $\mathbf{Z}$ of integers define the relation $\equiv_{37}$ on $\mathbf{Z}\times \mathbf{Z}$ by saying $a\equiv_{37} b$ if both $a$ and $b$ give the same remainder when divided by $37$. If $a \equiv_{37} b$ we say that $a$ and $b$ are congruent modulo $37$.

  • Let $T$ be the set of all triangles in the plane. An example of an equivalence relation on $T$ is the relation of two triangles being congruent.

3120 questions
0
votes
2 answers

defining a relation on the set of reals. proving that it is an equivalence relation and compelling description

Define a relation $\sim$ on the set $\textbf{R}$ of the real numbers by setting $a\sim b \iff b-a \in \textbf{Z}$. Prove that this is an equivalence relation, and find a compelling description for $\textbf{R}/\sim$. Do the same for the relation…
0
votes
1 answer

how to show the equivalence relation

Consider the relation ∼ on $\mathbb{R}\times \mathbb{R}$ defined as follows for all $(x, y),(a, b) ∈\mathbb{R}\times \mathbb{R}$. $(x, y) \sim (a, b)$ if and only if $x − a = y − b$. Show that $∼$ is an equivalence relation and describe…
0
votes
1 answer

number of equivalence relations of unions of sets

Let $A=\{1,2,3,4,5,6,7,8\}$. $S=\{(1,1),(2,2),(3,3),(4,4),(5,5),(6,6),(7,7),(8,8)\}$. $T=\{(1,2),(2,1),(5,4),(4,5),(6,2),(6,5))\}$. How many equivalence relations R on A exist such that R$\subseteq$S$\cup$T? I got 5, but the answer is 4. These are…
Lilo
  • 417
0
votes
1 answer

How is a relation between elements inside a set an equivalence relation?

From Rosen's Discrete Mathematics and Its Applications, 3ed, chapter 9 p. 612: How can they tell $R$ is an equivalence relation right off the bat?
J. Doe
  • 405
0
votes
1 answer

is Every arbitrary identity relation also an equivalence relation?

From definition of an equivalence relation it easily can be proved that an equality relation denoted "$=$" is indeed an equivalence relation, it means that every two arbitrary elements on a set $X$ with respect to $=$ are related to each other if…
user715522
0
votes
1 answer

Theorem related to canonical projection

Given a set $X$ and an equivalence relation $\sim$ on $X$, define quotient mapping $\pi:X \to X/\sim$, it's known the canonical projection is surjective and this fact follows from definition of equivalence class and the symmetric property of…
user715522
0
votes
1 answer

Generating equivalence relations

Let $\sim$ be the equivalence relation generated by a relation $x\sim y$ on a non empty set X. Show that the equivalence relation always exists. Note that I think I am supposed to show that the smallest equivalence relation which contains the set …
user643073
0
votes
0 answers

Prove equality is the finest equivalence relation relation and Trivial relation is the coarsest relation

How it can be shown that: The equality equivalence relation is the finest equivalence relation relation. Since the equality relation denoted $R$ is an equivalence relation hence it should be a subset from the Cartesian product of two same sets…
user715522
0
votes
0 answers

examples of morphisms

Given two sets $X$ and $Y$ and two equivalence relations $\sim_X$ and $\sim_Y$ defined on $X$,$Y$ respectively, then a function (a binary relation which is functional and is left-total) is called morphism if two equivalent arguments $x$ and $y$ on…
user715522
0
votes
2 answers

How do you show that $R$ is an equivalence relation and enumerate one bit string from each of the different equivalence classes of $R$?

If $A$ is the set of all bit strings of length $12$. Let $R$ be the relation define on $A$ where two bit strings are related if the first $2$ bits, the $4^{\text{th}}$ bit and the $7^{\text{th}}$ bit are the same.
Manuel
  • 335
0
votes
3 answers

Finding the equivalence classes if $\left\{ (x,y)\,:\,x\equiv y\mod5\right\}$

I have the following relation $R\subseteq\mathbb{N}\times\mathbb{N}$: $$R=\left\{ (x,y)\,:\,x\equiv y\mod5\right\} $$ I have proved that $R$ is a equivalence relation. I would like to find the equivalence classes. As I understand the classes are…
vesii
  • 1,979
0
votes
1 answer

Describe its equivalence classes of $x-y\in\mathbb{Z}$

For $x,y\in\mathbb{R}$ define x ~ y to mean that $x-y\in\mathbb{Z}$. Prove that ~ is an equivalence relation on $\mathbb{R}$. Describe its equivalence classes. I've successfully proved x ~ y relation is reflexive, symmetric and transitive. What I'm…
user620319
0
votes
1 answer

Bijective correspondance of $[\pi]_R$ with Z, R being defined by aRb <=> a-b $\in$ Z

I was wondering if you could help me with this question? "Consider the following relation on $\mathbb{R}$, the set of real numbers: aRb $\iff_{def}$ a - b $\in \mathbb{Z}$ (a) Prove that this is an equivalence relation (done) (b) Prove that the…
0
votes
1 answer

Equivalence Relations and Mappings

I have come across this statement in a book of Mathematical Physics. A map $\phi\colon X \to Y$ defines an equivalence relation R on the domain X by aRb if and only if ф(a)=ф(b). How to proceed with the properties of the equivalence relation and…
Derhham
  • 11
  • 1
0
votes
2 answers

For set {a, b, c}, find equivalence relations

Why can't {(a,a)} be an equivalence relation for the set {a,b,c}? {(a,a)} is reflexive, symmetric, and transitive.
kgui
  • 145