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

Why is $xy>0$ not an equivalence relation on the set $\mathbb{Z}$?

From what I understand, an equivalence relation is a relation which must be reflexive symmetric transitive The relation in question is: reflexive because the square of a number is always positive symmetric as $xy=yx$ transitive as if $xy>0$ and…
csmathhc
  • 330
0
votes
0 answers

Which set does $n\bmod 2\pi, n > 6$ generate?

Say I use the natural numbers to generate the following sequence/set: $$A = \{n\bmod 2\pi \mid n \in \mathbb{N}, n > 6\}$$ where I start above 6 to exclude the initial integers. Clearly this must have the same cardinality as $\mathbb{N}$, but while…
Seb
  • 101
0
votes
1 answer

Equivalence relations->Showing that a set is reflexive, symmetric and transitive

For each of the following sets A and binary relations ~, decide whether ~ defines an equivalence relation on $A$ a) Set $A=\mathbb{R}$ Relation: $x\sim y$ if $x=ay$ for some $a \in \mathbb{Q}$
0
votes
1 answer

How is this set symmetric and transitive?

Given a set {0,1,2}, is the relation below a equivalence relationship? {(0, 0),(1, 1),(2, 2)} It is self evident that this relation is reflexive, as it conforms this rule: ∀x ∈ A, x R x. Looking at the symmetric rule : R is symmetric if, and only…
sctts-lol
  • 189
0
votes
0 answers

Prove that $G =\{(l_1 ,l_2) :l_1\ \text{is parallel to}\ l_2\},$

Let $L$ be the set of all the straight lines in the plane. Let $G$ and $H$ be the following relations in $L$: $G =\{(l_1 ,l_2) :l_1\ \text{is parallel to}\ l_2\}$, My attempt: The symmetric property is true since if $ l_1 $ is parallel to $ l_2 $,…
James A.
  • 824
0
votes
1 answer

How many equivalence classes are there

$E={1,2,3,4,5,6,7,8}$ Defines the product set E × E the relation R: $(p, q) R (p_0, q_0) $if $ p-p_0$ even and $q-q_0 $divisible by 3 Question :How many equivalence classes are there My attempt : $p-p_0$is even…
user839911
0
votes
0 answers

Big Theta as an Equivalence Relation

Forgive me as this is a question inspired by my first computer science algorithms class. I am a math major so when I learned of the big-theta operation on the space of continuous functions I began to wonder what the space of equivalence classes…
0
votes
1 answer

Symmetric difference and equivalence relation

Let $P(\mathbb{N})$ denote the set of all subsets of $\mathbb{N}$. Define a relation $D$ on $P(\mathbb{N})$ as follows: $(A, B) \in D$ if the symmetric difference $A\Delta B := (A \cup B) \setminus (A \cap B)$ is finite. (That is: $A$ and $B$ only…
Benny
  • 141
0
votes
1 answer

Relation Equivalence of $R \subseteq \mathbb Z\times \mathbb Z$

Consider the relation $R \subseteq \Bbb Z \times \Bbb Z$ given as $$R = \{(x,y) \in \Bbb Z \times \Bbb Z \mid xy >0 \textrm{ or } x=y=0\}.$$ Prove that R is an equivalence and write down its equivalence classes. Can anybody tell me how do I…
0
votes
1 answer

proving a binary relation on $\mathbb{Z} × \mathbb{Z}$ is an equivalence relation.

Define a binary relation ∼ on $\mathbb{Z}×\mathbb{Z}$ by $(a, b) ∼ (c, d)$ if and only if $ad = bc$. Prove that ∼ is an equivalence relation. I'm trying to prove symmetric of this relation. Do I just show that $ab=bc$ and $bc=ab$ are equivalent by…
0
votes
1 answer

Difficulty understanding notations for equivalence classes

So, this is the question I need to answer, and I am having trouble understanding the notations used, especially this line: [a]i denotes the equivalence class of a under Ri(i = 1,2) Given an equivalence relation (in terms of ordered pairs), I know…
0
votes
0 answers

Define the addition of two rationals as a function

Consider an equivalence relation θ on some set B and a function: $:^2→ f : B 2 → B $. We want to lift f to the set of equivalence classes B/θ, i.e., we want to define a function $:(/θ)^2→(/θ) $ canonically in terms of $f$. For this to be meaningful,…
user838600
0
votes
2 answers

Proof of equivalence classes constituting a partition.

I am not able to understand how the conclusion $[a]$ is a subset of $[c]$ is arrived in this proof. Pls Help. Theorem Proof:
0
votes
1 answer

Proving an equivalence relation / Showing conditions are equivalent

Hi I have the follow questions that I'm not quite able to solve. Let X be a set, and let $\mathcal R$ be a relation on $X$ which is reflexive and transitive. We define a new relation $\mathcal Q$ on $X$ by declaring that $x$$\mathcal Q$$y$ ⇔…
23408924
  • 505
  • 3
  • 14
0
votes
1 answer

Showing a relation is an equivalence relation on $\mathbb {N}$ or $\mathbb {R}$

I have an exercise that consists of 2 parts that I don't really know how to prove. Consider the relation $\mathcal R$ on $\mathbb {N}$ defined as follows: for all $a, b$ ∈ $\mathbb {N}$, a$\mathcal R$b if there exist $m, n$ ∈ $\mathbb {N}$\{0} such…
23408924
  • 505
  • 3
  • 14