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

Equivalent sets. Are they interchangeable?

Freshman question, really, but the more I think about it, the more I doubt. Suppose that two sets belong to the same equivalence class. Are they in effect interchangeable? (I understand that there is no axiom of `interchangeability' in the…
Ben
  • 57
  • 6
0
votes
1 answer

Verify equivalence relation solution for $(a,b)R(c,d) \iff \frac{c}{a}=\frac{b}{d}, ac \neq 0$

Question Let $X$ be the set of all ordered pairs $(x,y)$ of real numbers such that $xy \neq 0$. Define a relation $R$ on $X$ as follows: $(a,b)R(c,d) \iff \frac{c}{a}=\frac{b}{d}, ac \neq 0$. Prove that $R$ is an equivalence relation on…
alortimor
  • 171
  • 7
0
votes
2 answers

Equivalence Relations Analysis

A relation R is defined on a set $ A:(a, b, c) as R: ((a, c), (b, b))$ then the relation R is ? A) transitive and antisymmetric B)transitive and symmetric C)symmetric and antisymmetric D)reflexive and transitive I couldn't relate this question…
wave
  • 11
0
votes
0 answers

How to find the equivalance class of an equivalance statement?

im fairly new to math and im trying to find all elements of equivalance class [-1] and [4/5] for the following equivalance relation For a, b, c, d ∈ Z with b, d ≠ 0: a/b R c/d ⇔ ad = bc. Ive deduced its an equivalent statement, being reflexive,…
0
votes
2 answers

List one of three properties of an equivalence relations

I have the following question and answers: Let $A = \{1,2,3,4\}$. Write down $R \subseteq A x A$ which has one of the three properties of an equivalence relation (3 cases). The official answers for the above are (taken from textbook): Case 1: Only…
SunnyBoiz
  • 275
0
votes
1 answer

Let $\sim$ be a relation on set $\mathbb{N}\times\mathbb{N}$ defined by $(x,y)\sim(z,w)$ if $xw=yz$. Prove that $\sim$ is an equivalence relation.

I start by saying, let $(x,y)\in\mathbb{N}\times\mathbb{N}$. Since $xy=xy$ we have $(x,y)\sim (x,y)$ and $\sim$ is reflexive. Let $(x,y),(z,w)\in\mathbb{N}\times\mathbb{N}$ and assume $(x,y)\sim(z,w)$. This means $xw=yz$. Since $yz=xw$, then we…
Wng427
  • 301
0
votes
0 answers

Define $R$ on the set $\mathbb{Q}^+$ by $p\ R\ q$ if $\dfrac{p}{q} = 2^m$ for some integer $m$. Find 3 elements of the equivalence class $[ 7 ]$

Part (a): Find 3 elements of the equivalence class $[ 7 ]$. Justify your answer. I have so far $[7]=\{p\in\mathbb{Q} \mid pR7\}$=$\{p\in\mathbb{Q}\mid\frac{p}{7}=2^m\}$. Part (b): Find 3 element of the equivalence class $\left[ \dfrac{3}{7}…
Wng427
  • 301
0
votes
1 answer

How can i show that $b-a = d-c$ is transitive?

Let R be a binary relation on the set of ordered pairs of integers such that $R={(a,b),(c,d))| b-a=d-c} $. Show that R is an equivalent relation. What I got so far is this, i'm not sure if its right, but I'm struggeling with showing that R is…
SonCOR
  • 19
0
votes
2 answers

Proving equivalence relation $a∼b \iff \left(a^2-b^2\right)\left(a^2b^2-1\right)=0$

I don't know how to go about proving symmetry. I have proven that the relation is reflexive. But I have no idea how to start with proving the symmetry of a given relation.
0
votes
1 answer

Discrete Math - Propositional Equivalence

Show that this propositional equivalence is true: ¬( ↔ ) ≡ (¬ ∧ ) ∨ ( ∧ ¬) My try out was to compare by truth table, but it is not that the exercice is asking. I need the resolution using arguments as "the morgan" and other simplifications as…
0
votes
1 answer

Let $H = \{2^m\ |\ m \in \mathbb{Z} \}$. Define a relation $\sim$ on the set $\mathbb{Q}^+$ by $p \sim q$ if $\dfrac{p}{q} \in H$.

For reflexive, I have: Let $p\in\mathbb{Q}$. Since $\frac{p}{p}$ is $\frac{2}{2}$ we can write this as $2^0 \in \mathbb{H}$. Since $0$ is an integer, then $pRp$, and $R$ is reflexive. For symmetric, I have: Let $p,q \in \mathbb{Q}$ and assume $pRq$.…
user774710
0
votes
2 answers

Listing all equivalence relations

I am unsure how to find the all the equivalence relations. I know that a relation is an equivalence relation if it is reflexive, symmetric, and transitive. However I'm still uncertain how to find them all.
wcr221
  • 1
0
votes
1 answer

Prove that the following relation is an equivlance relation.

Prove that the following relation is an equivalence relation and determine how many equivalence classes R partitions the set $Z^{+}$ into. R = {$(a,b) | a∈Z^{+} ∧ b∈Z^{+} ∧ 10 | (a^{2}- b^{2})$} Any help would be great. I would love an explanation,…
Terabyte
  • 101
  • 1
  • 1
  • 7
0
votes
1 answer

Equivalence relations on the set [3].

Consider the set $[3]$ and the equivalence relation defined by the graph: $$\{(1,1), (1,2), (2,1), (2,2), (3,3)\}.$$ I know this is an equivalence relation because it is symmetric, transitive, and reflexive. My professor says $1\sim 2$ since $\sim$…
Emily
  • 123
0
votes
0 answers

Let $f: X \to Y$ be a function. Prove f is injective if and only if each $\sim$ equivalence class has a unique element, where $\sim$ is $f(a)=f(b)$.

Here is my proof so far: (=>) Let $f: X \to Y$. If $f$ is injective, then $f(a) = f(b)$ implies $a = b$. So for $f(a) = f(b), a = b$. thus for the equivalence class $[a]$, $[a] = \lbrace b \in X \mid f(b) = f(a)\rbrace$. since $b = a$, $a$ is the…
Emily
  • 123