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

Equivalence Relations OF sets

We define the relationship between the two sets $S_1≡S_2$ if and only if $|S_1|=|S_2|$. How to show that $≡$ is an equivalence relation ? sorry I'm from Iran and Basic my English is poor.
shiva
  • 1
0
votes
1 answer

Equivalence relation for which there are infinitely many equivalence classes.

On set $\mathbb{R}$ and the relation on it where $x\sim y$ if $x^{4}=y^{4}$. Then $\sim $ is equivalence relation for which there are infinitely many equivalence classes, one of which consists of a single element and, and the rest of two…
0
votes
1 answer

More clarification on an equivalence relation problem already answered

So this problem already has a solution: Problem with Equivalence Relations I'm good for the majority of it except for part c), I wasn't able to figure that out on my own or by looking at the explanation. Perhaps I still don't fully comprehend what…
D.C. the III
  • 5,619
0
votes
1 answer

Equivalence relations and classes

$T$ is defined on $\mathbb{N} \times \mathbb{N}$ by $(a,b)\mathrel{T}(c,d)$ if and only if $a \leq c$ and $b \leq d$. I know this is a partial order relation as it is Transitive, Anti Symmetric and Reflexive but I'm not sure if its total order…
Sunny
  • 1
0
votes
1 answer

explain transitive nature of the given set

A relation $R$ in the set of human beings in a town given by $$R = \{(x,y):x \text{ is wife of } y \}. $$ How is it transitive? Can you explain?
0
votes
1 answer

Equivalence relations between ordered pairs of natural numbers

I have been looking into equivalence relations and trying to figure out if certain relationships would be considered an equivalence relation. Lets using the following relation X between ordered pairs of natural numbers so that (a,b) is related to…
Yaz
  • 15
0
votes
1 answer

Having trouble proving transitivity

We have a universal set of lowercase alphabet letters, $U = \{a, b, ... , z\}$ . For sets $A,B \subseteq U$ we can define a relation, $A \sim B$ as long as the number of elements that are in either $A$ or $B$, but not both, is even. Prove that…
0
votes
3 answers

Finding the relation for the partitions { 2x } and { 2x + 1 }

I have to find an equivalence relation in the set of natural numbers which has the two partitions { 2x } and { 2x + 1 } My first thought was R = { (x,y) in N² : 2 | x + y } I assume that this is incorrect, because the set is N² and N. Then I…
xxsl
  • 99
-1
votes
4 answers

Is $x \sim y \Leftrightarrow x,y$ are even an Equivalence relation?

The following instruction defineds an Equivalence relation on the set of natural numbers. $x \sim y \Leftrightarrow x,y$ are even My idea: Reflexivity: $x \sim x \Leftrightarrow x,x$ is even Symmetry: $x \sim y \Leftrightarrow x,y$ are…
fear.xD
  • 1,530
  • 3
  • 15
  • 20
-1
votes
1 answer

Equivalence classes on $\,\Bbb R^2.$

I'm really confused about the equivalence class of the following relation: On $\,\Bbb R^2,\;xRy\;$ if $\;|x|=|y|\;$ where $\,|x|=\sqrt{x_1^2+x_2^2}\,.$
-1
votes
1 answer

Description of equivalence classes

This task is about equivalence classes. One has to describe the equivalence relations for the following equivalence relations: $ R1​={(a,b)∈R×R∣∣a∣=∣b∣} \\ R2​={(a,b)∈Z×Z∣∃z∈Z : a−b=z⋅p} \quad $ for a given constant $p \in \mathbb {N}$ Can someone…
-1
votes
1 answer

Define a relation $\sim$ on $\mathbb{R}$ by the rule $x \sim y$ if $x - y \in \mathbb{Q}$. List 5 elements of the equivalence class $[\pi]$

Part(a):List 5 elements of the equivalence class $[\pi]$ I have that $[\pi]=\{x\in \mathbb{R}\mid xR\pi\}=\{x\in \mathbb{R}\mid x-\pi\in\mathbb{Q}\}=\{\pi\}$. Not sure this is correct because there are not 5 elements listed. Also is it correct for…
Wng427
  • 301
-1
votes
2 answers

Show that ∼ is an equivalence relation for f ∼ g if f(x) = g(x) except at possibly finitely many points

Let S denote the set of functions f : R → R and define a relation ∼ on S by declaring f ∼ g if f(x) = g(x) except at possibly finitely many points (that is, the set of x where f(x) = g(x) is either empty or finite). Show that ∼ is an equivalence…
-1
votes
1 answer

Are these Equivalence Relations?

I am having some trouble determining if these are equivalence relations. Specifically, I am not sure if I am supposed to check for reflexiveness, symmetry and transitivity in the ordered pairs of the relation or every possible ordered pair in the…
-1
votes
1 answer

How do I find the equivalence classes of the relation $\mathcal{R} = \{(x, y) \in \mathbb{C} \mid x - y \in \mathbb{R}\}$?

I'm currently trying to solve the following tasks: 1) Prove that the relation $\mathcal{R} = \{(x, y) \in \mathbb{C} \mid x - y \in \mathbb{R}\}$ is an equivalence relation. 2) Find all equivalence classes of $\mathcal{R}$. I already solved the…
Gereon99
  • 103