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

Determining all distinct equivalence classes

Let A = {−6, −5, −4, −3, −2, −1, 0, 1, 2, 3, 4} and define a relation R on A as follows: For all m, n is in Z, $m R n ⇔ 3|(m^2 − n^2)$ It is a fact that R is an equivalence relation on A. Use set-roster notation to list the distinct equivalence…
Scott Adamson
  • 241
  • 1
  • 8
1
vote
1 answer

Equivalence relation classifying the slopes of the tangent lines to the curve?

We apply the Mean value theorem to a real analytic function $f$ (defined on $\mathbb R$) in the interval $(u,a)$ such that $f(u)=0$ and $f(a)\neq 0$ to find a $c\in(u,a)$ such that: the expression $f(a)/(a-u)$ is the slope of the chord of the graph…
DER
  • 3,011
1
vote
0 answers

Finding equivalence relation with x amount of pairs

Set X = {1, 2, ..., n} where n>200 Can I find relation R such that there are n-1 pairs? How about n, n+1, n+2, n+3 and n(n-1) pairs? If not, how would I prove that there can not exist equivalence relation R such that the number of pairs is one of…
George
  • 63
1
vote
1 answer

Determine and prove if the following are equivalence relations, partial ordering relations, or neither.

{$(a, b) | a∈Z^{+}, b∈Z^{+}, a = 3^{n}b, where n∈N$} (N is the set of natural numbers) {$(a, b) | a∈Z^{+}, b∈Z^{+}$, a >2b or b >2a} {$(a, b) | a∈Z^{+}, b∈Z^{+}$, a ≡ 0 (mod b) or b ≡ 0 (mod a)}
Terabyte
  • 101
  • 1
  • 1
  • 7
1
vote
2 answers

Prove union of equivalence classes is the whole set

Prove union of equivalence classes is the whole set: Given a set $X$ and let $∀x∈X$ , $\left[x\right]$ be the equivalence class of $x$ , then we want to show that $$\bigcup_{x∈X}\left[x\right]=X$$ or equivalently $$\bigcup_{\left[x\right]∈X/\sim…
user715522
1
vote
1 answer

Proving equivalence relations with binary operations

I am having trouble with this homework problem: Let $A$ be a set and $*$ be an associative binary operation on $A$ with the identity element $e$. Let $R$ be the relation on $A$ defined as follows: Let $a$ and $b$ exist in $A$. Then $aRb$ if there…
user69839
  • 113
  • 3
  • 9
1
vote
3 answers

How many different equivalent relations can you define on set of three elements?

Let X be a set of three elements ${a,b,c}$. 1.How many different relations can you define? The answer is 9, as $R\subset X \times X$ This is easy to see for me, I imagine it as a ~ a, a ~ b, ..., c ~ a, ... 2.How many different equivalent…
user620319
1
vote
1 answer

Lemma about equivalence classes

I need to prove the following lemma, let ~ be an equivalence relation on $X$, and let $\pi: X\rightarrow X/$~ be the quotient map. Let $f:X\rightarrow Y $ be an application. Then: $f(x)=f(y) \; \forall \;x $ ~ $y$ if and only if $\exists$ unique…
1
vote
1 answer

May I write something like "Define a relation $\sim$ on a set by $x\sim y\iff x-y\in M$"?

When stating the definition of quotient spaces, I wrote Let $X$ be a linear space and $M$ be a linear subspace of $X$. For $x,y\in X$, define a relation $\sim$ on $X$ by \begin{align*} x\sim y\iff x-y\in M. \end{align*} My professor circled the…
fangye
  • 11
1
vote
2 answers

Distinct equivalence classes and induced relations

I have a question regarding identifying the distinct equivalence classes of a relation in a specific problem. The problem reads Let B = {0,1,2,3,4} and let {0},{1,3,4},{2} be a partition of B that induces a relation Q. Find the distinct equivalence…
1
vote
1 answer

Given the relation $R={(1,2),(2,3)}$ on the set $A={1,2,3}$ the minimum number of ordered pairs required to make R an equivalence relation is

If we add (1,1), (2,2), (3,3), we get a reflexive relation If we add (2,1), (3,2) we get a symmetric relation If we add (1,3), we get a transitive relation. All together, we have added 6 ordered pairs, so the answer should be 6. However, the…
Aditya
  • 6,191
1
vote
1 answer

Composition of equivalence relations (and union)

As part of a proof I have to show that: For $ \phi, \psi $ equivalence relations ($\in Eq(A)$): $$ \phi \cup (\phi \circ \psi ) \cup (\phi \circ \psi \circ \phi )\cup (\phi \circ \psi \circ\phi \circ \psi ) \cup \ldots $$ Is also an equivalence…
M-S-R
  • 335
1
vote
1 answer

Number of Different Equivalence Classes?

In the question given below, determine the number of different equivalence classes. I think the answer is infinite as $\ b_1$ and $b_2\;$ can have either one 1's or two 1's or three 1's etc. I just want to clarify if this is right as some says the…
1
vote
1 answer

How to prove an equivalence relation on the unit square?

I saw the following example of an equivalence relation in a topology textbook: Let $X$ be the unit square. Define $\sim$ as follows: $(0,y)\sim(1,y)$ for all $y\in [0,1]$, and for any point $(x,y)\in X, (x,y)\sim(y,x).$ How would we show that this…
Beneschan
  • 1,083
  • 2
  • 9
  • 10
1
vote
1 answer

showing a relation on $\mathbb Z$ \ $0$ is an equivalence relation

We define a relation on $\mathbb Z \setminus {0}$ where a ~ b iff $0< ab$. How would you show this is an equivalence relation and describe the equivalence classes?