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

equivalence relations proof of symmetry

I'm trying to prove $a\sim b \text{ if } a^2-b^2\geq0$. All examples I have been given have not included inequalities. For reflexive we can take $a^2-a^2\geq0$ for $x\in \mathbb{Z}$. What procedure do we use to see if it's symmetric?
whitelined
  • 267
  • 3
  • 9
0
votes
0 answers

Is an element that is returning to itself Transitive?

Lets say you have a graph and x goes to y, y goes to itself and then y goes back to x. Can you call this a transitive relation? My answer: yes it is transitive because x R y, y R y and y R x but what confuses me is that I learned transitivity as…
37NPN
  • 1
0
votes
2 answers

Discrete Mathematics - Partial Order Equivalence Relations

Let S be a set of positive integers and define a relation ρ on S as follows: ∀a, b ∈ S, aρb if and only if a ≤ b and a and b have the same number of positive divisors. Let S = Z+. Prove that (S, ρ) is a partial order.
0
votes
1 answer

How would I convert percentages into hours, on tasks spent on an 8 hour work day?

How would I convert percentages into an 8 hour day? for example if I worked 17% of my 8 hour work day on one task and 14% of my 8 hour work day on another task how would I convert these into hours or minutes spent on each task? I have multiple…
0
votes
2 answers

How to show that [v] = v + U?

There is given vector space $V$ through a field $K$ and $ U ⊂ V $ is a vector subspace. There is the follwing mapping defined: $\phi : V/U \to V/U$. As we know $V/U = \{ [v] \mid v \in V \}$ with $[v] = \{ w \in V \mid v - w \in U \}$. I could…
0
votes
2 answers

Relations question - need clarification to understand better

Please see the question which shows you two questions and two answers. Are the 2 answers contradicting each other? Can someone clarify please. Question 1 Answer says "DOES NOT IMPLY THAT ALL X and Y...." but Question 4 answers says "IMPLIES FOR ALL…
Sanone
  • 61
0
votes
0 answers

Mod multiplication is well-defined

Let $p\geq 2$ be a natural number. Define $\equiv_p$ on $\mathbb{Z}$ by declaring $x\equiv_p$ if and only if there exists $k\in\mathbb{Z}$ such that $x-y=pk.$ For equivalence classes $[a]$ and $[b]$ define their product to be: $$[a].[b]=[a.b]$$…
KelKel23
  • 169
0
votes
2 answers

Empty closure of relation

I have the following relation symbolized as $\sim$, defined on $\mathbb{Z}\times\mathbb{Z}$: $$x\sim y \iff |x-y|=1$$ I would like to know how the transitive-reflexive closure looks like in this case, because this relation isn't transitive or…
0
votes
1 answer

Equivalence class/Equivalence relation question.

Let R be an equivalence relation on set A, and let a,b$\in$A. If b$\in$[a] then [b]$\subseteq$[a]. I need help proving this. Thank you in advance.
0
votes
1 answer

Finding Equivalence Classes Help

I am having some trouble with this question. I am not sure what to do at this point since the instructor said to ignore the reference to example 2. Below is the questions as they are on the worksheet: (Ignore the reference to Example 2 as it does…
Gabriel_W
  • 115
0
votes
3 answers

Showing that ~ is an equivalence relation

When defined on the set $N_1=\{1,2,3,\cdots\}$ of positive integers a relation $\sim$ such that two positive integers $x$ and $y$ satisfy $x\sim y$ if and only if $x/y=2^k$ for some integer $k$, show that $\sim$ is an equivalence relation. How do I…
0
votes
1 answer

Proving equivalence relations involving determinants of two vectors

I was told to prove that the following is an equivalence relation: The relation R on the set $U = \{(x_1, x_2) \in \mathbb R^2 \mid x_2 \ne 0\}$ is given by $$\forall\,(x_1,x_2), (y_1,y_2) \in U, \quad (x_1,x_2)\,R\,(y_1,y_2)…
0
votes
1 answer

Equivalence class in equivalence relation

Let $A=\{1,2,3,4,...,9\}$ and $R$ be a relation in $A \times A$ defined by $(a,b)R(c,d)$. If $a+d=b+c$ for $(a,b),(c,d)$ in $A \times A$. Prove that $R$ is an equivalence relation and also obtain the equivalent class $(2,5)$. I have proved it to be…
user383014
  • 1,110
0
votes
1 answer

equivalence class of an inequiality

For the equivalence relation R={(x,y):x,y belong to the set of real numbers & |x-y|<4} how would you determine the equivalence class? I'm particularly confused as to how one would do so for an inequality function involving an absolute value. Thank…
cos90
  • 33
0
votes
4 answers

Why is the following relation transitive, but not reflexive?

In a practice paper for an exam there is the following relation: $$ E = \{(1,1),(2,2),(3,3),(4,4)\}\ \text{ on the set }V = \{1,2,3,4,5\} $$ It would appear that because $(5,5)$ is not in $E$, that it would not be a reflexive relation. What is…