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
1
vote
1 answer

Finding the unique representative that lies on the unit circle in an equivalence class of a given equivalence relation.

I am doing an exercise from a number theory textbook for practice and not sure how to approach this problem. Let $S:=(\Bbb R \times \Bbb R)\setminus{(0,0)}$. For $(x,y),(x',y') \in S$ let $(x,y)~\sim (x',y')$ if and only if there exists a real…
1
vote
0 answers

Symmetric property of an equivalence relation states that if $a$~$b$ then

Symmetric property of an equivalence relation states that if $a$~$b$ then $b$~$a$; Transitive property states that if $a$~$b$ and $b$~$c$ then $a$~$c$. What is wrong with the following proof that symmetric and transitive property imply reflexive…
Arthur
  • 2,614
1
vote
1 answer

Struggling with explanation of transitive closure

I'm reading a book about structures on collections, chapter equivalence relations, and I try to get through the explanation of transitive closure. They use the following example: $A$ is a collection of people. In $A$ the relation $R$ is defined by…
1
vote
0 answers

Feedback on Equivalence Relations Proof from the Book of Proof

I wanted to get some feedback on a proof on equivalence relations in the Book of Proof. Suppose R is a reflexive and symmetric relation on a finite set A. Define a relation S on A by declaring xSy if and only if for some $n \in N$ there are elements…
kvarad
  • 49
1
vote
0 answers

equivalence classes of a language via myhill nerode

My task is to find equivalence classes for different languages based on Myhill-Nerode. I'm having a hard time finding these equivalence classes; for example, the language $L = {b^∗a^n | n ≡ 0 mod 5}$ with alphabet {a,b}. My first solution would…
1
vote
1 answer

About Quotient Space and Equivalence Classes

The following are the details of the problem: Let $M = \{m,a,t,h,f,u,n\}$ and $N = \{h,u,m,a,n\}$. For any $A,B \subseteq M$, $A \sim B \iff A \cap N = B \cap N$ where $\sim$ is an equivalence relation. The question asks to enumerate unique elements…
1
vote
1 answer

Let $A,B$ sets and $\text{~},\text{^}$ equivalence relations in $A$ and $B$ respectively.

Let $A,B$ sets and $\text{~}, \text{^}$ equivalence relations in $A$ and $B$ respectively. Let $f:A\rightarrow B$ a function. Find a condition that must be met for the function $$g:(A/_\text{~})\rightarrow (B/_\text{^})$$ defined by…
rcoder
  • 4,545
1
vote
3 answers

Understanding Equivalence and Relations

Can someone please explain these answers? I have reviewed the slides and read about properties of equality but I still don't understand how to apply it to these sets. For each the following relations on the set of integers list all that apply…
1
vote
1 answer

Finding the equivalence classes of the given equivalence relation on $\Bbb Q$.

Let $R$ be a relation on $\Bbb Q$ defined by \begin{equation*} aRb \iff a^3 + b^2 + a^2 b = b^3 + a^2 + ab^2, \end{equation*} for all $a,b \in \Bbb Q$. I've shown that this relation $R$ is a equivalence relation. But, I got confused to determine the…
lap lapan
  • 2,188
1
vote
0 answers

Is Equivalence relation an abstraction of a usual equality?

I'm studying group theory and I came across many equivalence relations.The one which fascinated me the most was isomorphic relation. Now my doubt is,is equivalence relation an abstraction of our usual sense of equality?Like see even in case of…
user925841
1
vote
2 answers

easy homework: Equivalence classes, how do they look?

Let's say that I got a set = { Arnold, Harrison } and I want to display the equivalence class of [ Harrison ] The actual condition for the relation doesn't matter in this case so let's just say that {Arnold} is the only relation to Harrison.…
Deragon
  • 25
1
vote
2 answers

Why is this not a equivalence relation in the $\mathbb{Z}$ set?

The relation $xRy$ on the set $\mathbb{Z}$ if $x + y$ is divisible by $3$. $xRx = x + x = 2x$. In order to $2x$ be divisible by $3$, $x$ itself need to be divisible by $3$, it is not a problem is it? $xRy = yRx$ $xRy = yRz = xRz$ I think the last…
1
vote
1 answer

Equivalence classes of $x^{2}\equiv y^{2} (\operatorname{mod} 4)$

Question: Let $S\subseteq \mathbb{Z}\times\mathbb{Z}$ be the equivalnce relation $$ x^{2}\equiv y^{2} (\operatorname{mod}4) $$ Find all the equivalence classes of $S$ on $\mathbb{Z}$. My Answer: Let $z\in\mathbb{Z}$. The euivalence class of $S$ on…
1
vote
1 answer

Prove equivalence between [-4,0) and (0,12)

I need to prove that $[-4,0)\sim(0,12)$ using the Cantor-Bernstein theorem and also by constructing a bijection. From what I understood, in order to prove it with the Cantor theorem, I need to construct an injection between the two. From looking at…
1
vote
1 answer

Equivalence Relations lists

Let $X$ be a non-empty set and $n\in\mathbb N$. Then $X^n$ is the Cartesian product of $n$ copies of $X$. A relation can be defined on $X^n$ by $(a_1,a_2,\dots,a_n) \sim (b_1,b_2,\dots,b_n)$ if and only if every $x\in X$ appears the same the number…