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
2
votes
0 answers

Given the relation show its well defined and an equivalence relation.

Definition: The set of integers $\mathbb{Z}$ is defined via the set $\mathbb{N} \times \mathbb{N}$ where we specify the ordered pairs $(a,b)$ and $(c,d)$ are equivalent iff $a+b=c+d$ where addition and multiplication is defined as…
HighSchool15
  • 2,061
  • 14
  • 35
2
votes
1 answer

On the set $\mathbb{R}^2$, define $(x,y) R (a,b)$ if and only if $x^2-y =a^2-b$. Show that $R$ is an equivalence relation.

On the set $\mathbb{R}^2$, define $(x,y) R (a,b)$ if and only if $x^2-y =a^2-b$. Show that $R$ is an equivalence relation. 1) $\forall (x,y)\in\mathbb{R^2}$ , we have $(x,y) R (x,y)$ since $x^2-y = x^2-y$, which shows that $R$ is reflexive 2) If…
B. David
  • 643
2
votes
2 answers

Mathematical Proofs, Equivalence Relation Question

I'm new so this will be my first question! The question is this: Define a Relation R on $\mathbb Z$ (integer set) as follows: $ (x, y) \in R $ iff $x = |y|$. Is $R$ symmetric, reflexive, and transitive? My work: $xRx$ -> $x = |x|$ but $x \in \mathbb…
user433562
2
votes
2 answers

Determining relation equivalences with a divisor?

Having trouble determining relation equivalences when there's a divisor involved. Here's an example question I'm trying to work out (where ~ is an equivalence relation). When $X = \Bbb Z$, and a ~ b, there is an integer $p ≥ 4$ such that $p^2 | (a -…
C. Zel
  • 23
2
votes
1 answer

Distinct equivalence class question.

Can you help me understand this. Please look at the diagram below. According to the book, the distinct equivalence classes are... The three distinct equivalence classes are $\{0, 3\}$, $\{1\}$, and $\{2\}$. These form a partition of $\{0, 1, 2,…
Sanone
  • 61
2
votes
1 answer

is this an equivalence relation? by Reflexive, Symmetric and Transitive.

i. {(a, b) : a and b have met} ii. {(a, b)} : a and b speak a common language i) Reflexive: yes Symmetric: yes Transitive: No, if a met b and b met a then a does not met c. ii) Reflexive: yes Symmetric: yes Transitive: No, if a speak…
Surdz
  • 627
2
votes
3 answers

What are the equivalence classes for the relation "congruence modulo 5?"

I'm still a little mixed up on equivalence classes, so I'm trying to make some connections. I need to be specific of how many there are and what is in each. Here's what I have: Let $\mathscr R$ be the relation "congruence modulo $5$" on a set $A$,…
Dewick47
  • 697
2
votes
3 answers

Set question, relations, equivalence classes

Let S be the set of all bit strings (a sequence of 1s and 0s) of length 3 or more. Let R be a relation on S of all pairs (x, y) where x and y are in S if x and y have the same first two bits. Is R is an equivalence relation? If so, how many…
2
votes
1 answer

How to show the existence of a binary chain

Suppose A, B are finite binary chains that hold AB = BA (* is the concatenation operator). How can I show there exists a binary chain C such that A, B are of the form CCC...C?
2
votes
1 answer

Equivalence classes, not sure how to approach

While I understand equivalence classes, I can't seem to grasp this problem. This is what I am working with: Let’s define a relation ∼ on $\Bbb R^2$ by $(x, y) ∼ (p, q)$ if and only if $(x, y) = (λp, λq)$ for some positive real number $λ$ Now define…
2
votes
1 answer

Proving $S$ is the unique smallest relation on $A$ containing $R$

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 \mathbb{N}$ there are elements $x_1,x_2,\ldots,x_n \in A$ satisfying $xRx_1, x_1Rx_2, x_2Rx_3,…
St Vincent
  • 3,070
2
votes
1 answer

Prove that $R = \{((m,n),(p,q)):m + q = n + p\}$ is an equivalence relation on $\mathbb N_0$.

Define the relation $R$ on $\mathbb{N}_0$ by $$R = \{((m,n),(p,q)):m + q = n + p\}.$$ (a) Prove that $R$ is an equivalence relation. Now I need to prove it's reflexive, symmetric, and transitive! Proving $\simeq$ is reflexive. To Prove: $(\forall…
k9b
  • 319
  • 1
  • 11
1
vote
2 answers

Prove that $\mathbb{Q} \times \mathbb{Q}$ is countable.

Knowing that $\mathbb{Q}$ is countable, I must prove that $\mathbb{Q} \times \mathbb{Q}$ is countable. Teacher's proof: For each $a \in \mathbb{Q}$, let $A_a = \{(a,q) : q \in \mathbb{Q}\}$ so that $A_a \sim \mathbb{Q}$. So each $A_a$ is countable,…
1
vote
1 answer

Verify Equivalence Relations

Find an example of three relations $R_{1}$, $R_{2}$, and $R_{3}$ on the set $S=\{1,2,3,4,5\}$ such that $R_{1}$ is reflexive but not transitive, $R_{2}$ is transitive but neither symmetric nor reflexive, and $R_{3}$ is…
Lynnie
  • 475
  • 2
  • 6
  • 14
1
vote
1 answer

Proving Equivalence Relations and Quotient Sets

Prove that the relation ∼ on $Z×Z$ given by $(a, b) ∼ (c, d)$ if $a+d = b+c$ is an equivalence relation. Give the quotient set $Z × Z/$ ∼.