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

Determining number of different equivalence relations in a set with 4 elements

I have a set with 4 elements. Let A be $A=\{a,b,c,d\}$ How would I find number of different equivalence relations in this set? Should I use Bell's number theorem in which n would be 4? Should I solve this with the use of combinatorics? Note…
Satoshi
  • 35
0
votes
1 answer

Transitive relations on a set of n elements

How to find out the total number of transitive relations in a set of n elements? I am facing a problem in finding all the possible cases, is it not possible to find all cases? If not possible, why?
0
votes
4 answers

Bijection from set of equivalence classes to $\mathbb R$

In $\mathbb R[X]$, define an equivalence relation ~ by $P_1$~$P_2$ if $P_1-P_2$ is divisible by X. I have shown that $X$ is an equivalence relation. Let $\mathscr Q$ denote the set of equivalence classes of ~ in $\mathbb R[X]$. I now have to find…
user112495
  • 384
  • 4
  • 13
0
votes
1 answer

How to prove this proposition that has to do with elements and equivalence relations

Every element $z$ in $X$ is in exactly one equivalence class. Not sure how to prove this. I proved that every element $z$ in $X$ is in some equivalence class by using the definition of $[x]$. How would I prove that it is in exactly one equivalence…
0
votes
1 answer

Equinumerosity between equivalence classes set and power set

I´m currently working on the following problem: "Let $\xi$ = $\{ $ $\bot$ $\mid $$\bot$ is a equivalence relation over $\mathbb{N} $$\} $ Show that $\xi$ and $2^\mathbb{N} $ (power set) are equinumerous." Edit: After some research, I found that I…
0
votes
2 answers

Determine all equivalence classes of $xy>0$

Define the equivalence relation $R$ as follows: For $x,y\in\mathbb R$, $x$ is equivalent to $y$ if and only if $xy\geq 0$. Determine all of the equivalence classes of this equivalence relation.
0
votes
2 answers

Multiplication on $\mathbb{Z}_6$

How can I find all solutions to $[2]x=[4]$ in $\mathbb{Z}_6$? For example, is $[2]\times 8=[16]=[4]$? is this a right way to solve?
Wes
  • 497
0
votes
1 answer

Equivalence relations on S given no relation?

On my assignment, one of the questions ask to list all equivalence relations on S and count how many are of partial orders. Let S = {u, v, w}. List all equivalence relations on S. How many of these are also partial orders? Am I to assume the…
COMP232
  • 11
0
votes
1 answer

equivalence relation-showing that an operation is well-defined

Define $f: \mathbb{Z}_n \to \mathbb{Z}_n$ as $f([a]) = [a^2]$. Show that $f$ is a well-defined function. I am confused as to how I could show this.
0
votes
1 answer

Reflexive, symmetric, and transitive relations

On $A = \left \{1, 2, 3, 4 \right \}$ $\left \{(1,1), (2,1), (1,2)\right \}$ is NOT reflexive because there's no $(2,2)$ in the set. It is symmetric. However, it is NOT transitive. I'm confused as to why it is not transitive. I thought since $1 R…
Adrian
  • 1,976
0
votes
1 answer

Define a relation $\sim$ on $\mathbb{N}$ by $a\sim b$ if and only if $ab$ is a square

(a) Show that $\sim$ is an equivalence relation on $\mathbb{N}$. (b) Describe the equivalence classes [3], [9], and [99]. (c) If $a\sim b$, which attributes of $a \text{ and } b$ are equal? For (a) I have to show that $\sim$ is reflexive,…
0
votes
1 answer

Equivalence classes

I'm posting this question and answers to see if I am on the right track here, just want to be sure I understand or don't understand. Bellow I will list some equivalence relations over the set $ S= \{1,2,3,4\} $ the assignment is to find the…
0
votes
3 answers

Prove $a R b$ iff $a \equiv b \pmod 2$ and $a \equiv b \pmod 3$ is an equivalence relation

In the set $\mathbb{Z}$ we describe the relation: $a\mathrel{R}b \Leftrightarrow a\equiv b\pmod2 \text{ and } a\equiv b\pmod3$ Prove that $R$ is an equivalence relation. Describe $\overline{0}$ and how many different classes of equivalence…
Rrjrjtlokrthjji
  • 506
  • 3
  • 19
0
votes
1 answer

Describing the equivalence classes of (x,y)R(u,v) <=> y-v=x^2-u^2

The equivalence classes of the relation $(x,y)R(u,v) \leftrightarrow y - v = x^2 - u^2$ is supposed to look like parables with minimums on the y-axis. Can anyone see why this is?
Lukas K
  • 43
0
votes
2 answers

Prove operation on binary relation

There is a relation $\sim$ on $\mathbb{Z}\times\mathbb{Z}$ such that $(a,b)\sim(c,d)$ when $a+b=c+d$. Let $R={[(a,b)]:(a,b)\in\mathbb{Z}\times\mathbb{Z}}$ (i.e $R$ is the set of all equivalence classes of $\mathbb{Z}\times\mathbb{Z}$ under the…
Wes
  • 497