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

Let S = {1, 2, 3, 4}. How many equivalence relation are there and describe them?

Question Let $S = \{1, 2, 3, 4\}$. How many equivalence relation are there and describe them? I know that 1~2 and 2~3. I also know that there are 2 equivalence relation but how do I prove that and describe them properly.
0
votes
1 answer

Calculating the quotient set numbers on the relation $(a,b)R(c,d)\iff a+d=b+c$

Let $A = \{0,...,10\}$ and $R$ be a binary relation on $A\times A$ defined by $(a, b) R (c, d)$ if and only if $a + d = b + c$ How many equivalence classes are there in the quotient set $A^2/R$? Any assistance will be appreciated. Thanks.
Tverous
  • 51
0
votes
0 answers

Partition of $E \times E$ ond equivalence relations

I'ts know that given a partition of $E$ we can construct an equivalence relation on $E$. (a subset of $E^2$) My question: if we had a partition of $E^2$ how do we define an equivalence relation on $E$. (a subset of $E^4$)
TWJ
  • 11
0
votes
2 answers

Find the equivalence class on a equivalence relation

$m R n \iff \exists k \in \Bbb Z\ :\ m^2 - n^2 = 2k$ Determine the equivalence class of $5$ Determine quotient set $\Bbb Z/R$ How do I do this?
0
votes
2 answers

Equivalence relation $a\sim b$ $ \iff a-b\in\mathbb{Z}$

I have this equivalence relation defined on $\mathbb{Q}$ and $a\sim b$ $ \iff a-b\in\mathbb{Z}$ I know this is an equivalence relation and have proven so already. But how can I prove that for rational numbers $a,b,c$ we have $a\sim b$ $ \iff…
user635953
0
votes
1 answer

help with equivalence relations

I am having trouble understanding the concepts of reflexivity, symmetric, and transitivity For the set of all real numbers, are the following two statements an equivalence relation: x + y is an integer and x-y is an irrational number and whether…
0
votes
1 answer

An equivalence relation that implies another.

I have two equivalence relations $A$ and $B$. If $xAy \implies xBy$, how can I show that $A$ has no fewer equivalence classes than $B$? I'm imagining partitioning a plane with boundaries, and how $A$ has to respect all the same boundaries as $B$,…
0
votes
1 answer

Equivalence relation on N .(proof)

Let $n,m \in \mathbb N$. Let further $k \in \mathbb N_0$ be such that $km \leq n <(k+ 1)m$. We define the modulo operation $n \pmod{m}$ to be $n \pmod{m}:=n−km$. Now define for a fixed $m \in \mathbb N$ define $l \sim j$ if $l \pmod{m}=j…
0
votes
1 answer

Rigorous Proof of Infinite Number of Equivalence Classes

Let X $=\mathbb{R}$ Let $x \sim y \leftrightarrow x - y \in \mathbb{Z}$. It is intuitively obvious why this would have an inifinite number of equivalence classes. Is there a rigorous way of proving this?
0
votes
2 answers

Show that the values of F are the equivalence classes of the equivalence relation

I have the relation $aRb \iff f(a)=f(b)$ where $f: X \to Y$ which I know is an equivalence relation. For $y \in f(X)$, define $F(y)=f^{-1}(\{y\})$. How can I show that the values of F are the equivalence class of the first relation?
user635953
0
votes
1 answer

Equivalence Relation saturating a subset

Following this question, can someone help me understand (even better with some basic visualization) the meaning of "saturation" when it comes to partition and its counterpart (equivalence relation)? Does saturation mean that there is a union of…
0
votes
1 answer

Problem understanding a question (picked from **Set Theory and Matrices** by I.Kaplansky)

Suppose that a set X is expressed as a union of disjoint subsets. For $j, \, k \in X$ define $j \sim k$ that $j$ and $k$ lie in the same subset. Prove equivalency. How do I start? My attempt: I would write $X=\bigcup_{i}A_i$ [where $A_j \neq A_k$]…
user615771
0
votes
1 answer

Find classes of relation equivalence

$S=\{3n+1:n∈N\} = \{1,4,7,10,...\}$ and relation is defined as: $(x,y) ∈ ρ \text{ def }⇔ 4|(x + 3y)$ I need to prove that relation is relation of equivalence (that means that it is reflexive, symmetric and transitive.) I know how to do that, and…
Haus
  • 61
0
votes
0 answers

equivalence relation with binary and decimal numbers

I am learning about relations and I was hoping to find out if my attempt for my question looks right. Let b(n) equal the value of the highest bit set to 1 in the binary representation of the positive integer n. (For example, b(27)=16 because in 27=…
0
votes
1 answer

Equivalence relation - reflexity

I need to prove that relation is an equivalence relation. Equivalence relation means it satisfies reflexity, symmetry, and transitivity. If I was given an set of numbers S=(-1,1) and for example for -(1/2) relation is not reflexive, but for 1/2 it…
Haus
  • 61