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

Equivalence relation $f\sim g \iff f(n)=g(n)$

I have this equivalence relation defined on $\mathbb{N}$ and $f\sim g \iff f(n)=g(n)$ for some $n$. I was testing this relation for reflexivity, symmetry and transitivity: 1) It is reflective since $f(n)=f(n)$ 2) If $f(n)=g(n)$ then $g(n)=f(n)$, so…
user635953
-1
votes
1 answer

Please help me on how to properly answer this question on relations

Let the set $A = \{1,2,3,4,5\}.$ An equivalence relation $R$ is defined on the set $A$ such that following is the equivalence class $[1]=\{1,2\}, [3]=\{3,4\}, [5]=\{5\}.$ Enumerate the relation $R.$
Pranav
  • 1
-1
votes
1 answer

Equivalence relation - help needed with proving

let E be an Equivalence relation on A (non-empty group) is the next argument true or not, justify your answer: $\exists x~(\forall y~(xEy)\lor \exists y~\forall z~(zEx\lor zEy)) \to \forall x~\exists y~\exists z((x\neq y)\land (x\neq z)\land…
blabla
  • 31
-1
votes
2 answers

Equivalence relation question help with x+y

Need help with this question: Explain whether the relation $(x\sim y)=\left\{(x,y)∈N\times N\bigg|x+y\text{ is even}\right\}$ is transitive where N is the set of Natural numbers. I've tried to work this question out but the $+$ sign is confusing me,…
-1
votes
1 answer

Relations, Equivalence Relations, Partitions

Consider A=$\mathbb{Z}$. For each integer $n$, define $$B_n = \{{m\in \mathbb{Z}\ | \ (\exists q)(m=n+5q)}\}.$$ Prove that $\{{B_n}\}_{n\in\mathbb{Z}}$ is a partition of $\mathbb{Z}$. Identify the equivalence classes.
-1
votes
2 answers

Please elaborate on the concept of equivalence classes.

I think I know hwo to prove reflexive, symmetric, and transitive properties but please show me how to do equivalence classes or describe them. Let n ∈ N. Define relation Rn on Z by (x, y) ∈ Rn if and only if $x^2 − y^2$ is divisible by n. Prove that…
james black
  • 1,893
-1
votes
1 answer

Equivalence Relation Proof 123

I am currently in abstract mathematics. I am unclear on how to make a formal equivalence relation proof. I know I must prove reflexive, transitive, and symmetric, but I am not sure the formal set up or even how to for my specific example. I have to…
-1
votes
1 answer

Relations with partial order on a subset.

Let R be a relation on the set X. For some $Y \subset X $ (a proper subset of $X$), Let $R_Y $ be the relation on Y given by $(a,b) \in R_Y $ iff $ a,b \in Y $ and $ (a,b) \in R $ Prove that if R is a partial order on X then $R_Y $ is a partial…
Faust
  • 5,669
-1
votes
2 answers

equivalence relation proof for all positive integers

The relation $R$ is defined for all positive integers such that $(a,b) R (c,d) \longleftrightarrow a+d=b+c$. Show that $R$ is an equivalence relation.
-1
votes
1 answer

Equivalence class finding?

$c_1=a+ib$, $ $ $c_2 = x+iy$ $c_1 R c_2 <=> rec_1 = rec_2 $ $ $ Find all equivalence classes. I have no idea how to write them properly.
-1
votes
2 answers

Is this relation an equivalence?

I'm completely lost in discrete mathematics. I have to find out whether $$xRy \iff \exists z\in \mathbb N \;\;[z\mid y \iff z\mid x]$$ where $x,y \in \mathbb N$ is an equivalence. I know that relation must be reflexive, symmetric and transitive in…
Speedding
  • 357
-1
votes
4 answers

Does $ab = b^2 \implies a=b? $

My textbook says that the follow is not true: $ab = b^2 \implies a=b $ However, I cannot find a single case where its not true. What am I missing? Is it true or false? How do I go about proving these things?
-2
votes
1 answer

Is the relation $a^2 +b^2 =0$ transitive?

A relation on the real numbers is given by $a^2 +b^2 =0$. I know this is not reflexive, I believe it is symmetric(although there is only one solution) but I'm not sure whether it can be called transitive as the only solution is $a=b(=0)$.
-2
votes
2 answers

Define a relation $\mathbb{R}^2$ by $(a,b) \sim (c,d)$ iff $b−a = d−c$. Show that $\sim$ is an equivalence relation.

In order to be an equivalence relation, it has to be reflexive, symmetric, and transitive.
Misa
  • 9
-2
votes
1 answer

How to prove $R=\{(x,y)\mid x ,y\} $ is an equivalence relation?

$R=\{(x,y)\mid x,y\; \text{are 5 bit strings with equal numbers of zeros }\}$ Prove that $R$ is an equivalence relation. How much classes does it have?
1 2 3
23
24