For reflexive, symmetric and transitive relations. Use it with the tag (relations).

learn more… | top users | synonyms

0
votes
1answer
15 views

Prove that this is an Equivalence Relation.

Then give information about the equivalence classes as specified for The relation $R$ on $ℝ$ given by $xRy$ iff $x-y∈ℚ$. Give the equivalence class of $0$; of $1$ ; $\sqrt{2}$. First In order to ...
0
votes
0answers
13 views

Induced operation and anticommutativity

Let $\odot$ and $\circledast$ be operations on X and Y. Let $f:X\to Y$ satisfy $f(r_x)=r_y,\ f(x\circledast y)=f(x)\odot f(y),\ x,y\in X$. Prove: $\ x\sim y:\Leftrightarrow f(x\circledast y)=r_y \...
2
votes
1answer
39 views

Describe the equivalence classes generated by T

Suppose $S = \{(x,y) \in \mathbb{R}^2\mid y = x + 1\text{ and } 0 < x < 2\}$. Question Describe the equivalence relation T on the real line that is the intersection of all equivalence ...
0
votes
1answer
25 views

Is $R$ an equivalence relation?

Let $X,Y$ be infinite sets. Define $F$ as $F=\{f:X\rightarrow Y\}$ . We define a binary relation $R$ on $F$: $fRg$ if there is no countable $S\subseteq X$ such that $\forall x\in S \ f(x)\neq g(x)$. ...
0
votes
1answer
87 views

Trying to prove Equivalency using Boolean Algebra

The question presented was to use boolean algebra to show that XY’Z + X’Y’Z’ + XY’Z’ + X’YZ’ ≡ XYZ’ + XY’Z + XY’Z’ + XYZ’ I've tried using various laws of Boolean algebra, but the answer that I ...
1
vote
1answer
30 views

Number of distinct equivalence classes of $\mathbb Z_n$ of the “ associate ” equivalence relation

Define an equivalence relation on $\mathbb Z_n$ as : For $a,b \in \mathbb Z_n $ , $a\sim b$ iff $\exists k \in U_n=\mathbb Z_n^{\times}$ such that $a=kb$ (i.e. $a,b$ are related if they are "...
2
votes
1answer
33 views

Prove that $R\cap S$ is symmetric, transitive, and anti-symmetric.

If you can confirm these are done correctly or offer another way to do so I would greatly appreciate it. Also how would you go about proving $R\cap S$ is reflexive? What assumption if any would be ...
1
vote
0answers
14 views

Word for equivalence preserving transformations of equations

I am searching for a mathematical term describing an algebraic manipulation of an equation which preserves equivalence. So while adding $2$ to both sides of an equation results in an equivalent ...
1
vote
0answers
41 views

Circles and generic implicit functions

I have some problems understanding circles. $x^2+y^2 = 1$ is a circle. It defines equivalence class where all (x,y) points belonging to the circle are in the same equivalence class. $(\cos a, \sin a)$...
0
votes
1answer
19 views

Proving $g(x) = E_x$.

I'm pretty new to mathematical proof and set theory and I'm having trouble proving this problem. I've started on it, but I don't know where to progress. Problem: Suppose that $f: A \rightarrow B$. ...
0
votes
2answers
54 views

Equivalence relations and commutative diagrams

Let $\sim$ and $\dot\sim$ be equivanlence relations on the sets X and Y respectively. Suppose $f \in Y^X$ is such that $x \sim y$ implies $f(x) \dot\sim f(y)$ for all $x,y \in X$. Prove that there is ...
0
votes
0answers
19 views

How can i prove this equivalence relation problem when R isn't defined?

Problem: Prove that if $R\subset A\times A$, and $R\circ R^{-1}\circ R=R$. Then $R^{-1}\circ R$ is a equivalence relation. in $D(R)$ I have nowhere to take the properties i need from... what do I do? ...
1
vote
1answer
22 views

How can i prove that if $x_0$ is a solution then $[x_0]$ is unique?

$4x\equiv10\pmod6$ I'm not sure what they asking when they say that the equivalence relation of a solution is unique. Also I was able to find the solution -5 with euclids algorithm, is there a more ...
6
votes
3answers
104 views

Quotient of a graph?

I want to understand quotient of a graph (also called quotient graph), my teacher says that the terms quotient of a graph and a modulo of a graph should be synonyms (even though modulo of a graph ...
3
votes
2answers
56 views

We Quotient an algebraic structure to generate equivalence classes?

Till now I visualized Quotient groups as a technique to generate equivalence classes whenever needed, as in $\mathbb{Z}/n\mathbb{Z}$. But now I have a feeling of doubt since I haven't seen a book that ...
1
vote
2answers
29 views

infinite equivalence classes

How would you prove that this relation $$(a,b)R(c,d)$$ if and only if $$a+d=b+c$$ has infinite equivalence classes if it is defined in a set with only non negative integers? I've already proved that ...
0
votes
0answers
22 views

Show that $E / \sim $ is an affine space over $V/U$

Let $E$ be an affine space over the vector space $V$, and let $U \subseteq V$ be a vector subspace. We define the equivalence relation $$P \sim Q := \exists v \in U \text{ such that } P = Q + v$$ on $...
0
votes
1answer
26 views

what is the complete set of representatives of an equivalence class?

I have been researching the topic, but I can't find anything that explains specifically and in detail what it is. I just find a bunch of exercises about the topic.
0
votes
1answer
21 views

Proof about set of representatives

Let $X = \left\{(m, n)\in \mathbb{Z}\times\mathbb{Z}, n \neq 0\right\}$. Define a relation $\sim$ on $X$ by $(k, l) \sim (m, n)$ if $kn = lm$. Prove that $\left\{(m, n)|m \in \mathbb{Z}, n \in \...
-1
votes
1answer
36 views

Proof the existence of a certain bilinear form on the vector space V/T

Let $\mathbf V$ be a vector space (over a field $\mathbf K$) together with a symmetric bilinear form <-,->, and let $\mathbf T $ $\subseteq$ $\mathbf V$ be the orthogonal complement (since I'm not ...
0
votes
0answers
17 views

Differentiating between equivalence relations and partitions

What is the purpose of defining equivalence relations and partitions separately when they are the same? Are they used for different purposes?
0
votes
1answer
44 views

Prove that $\mathbb{|Q|} = \mathbb{|Q \times Q|} $ [duplicate]

This question exists, but both cases have a specific answer for the OP's situation. I do not know how to prove that $\mathbb{Q}$ is countable. Questions I am referring to: Prove that $\mathbb{|Q| = |...
2
votes
1answer
40 views

An uncountable chain of equivalence relations

First, an example: We know that, for two real valued, Lebesgue-integrable functions, the relation "equals almost everywhere" is an equivalence relation. In particular, if $f_0$ is Lebesgue-integrable, ...
0
votes
1answer
26 views

Equivalence relations proof example?

Let $A$ = {$a,b,c$}. Give an example of a relation on $A$ that is anti-symmetric, reflexive on $A$ and symmetric. The first thing that one must do to proceed with this question is to first define ...
1
vote
1answer
22 views

Fewest number of possible ordered pairs in a relation

There are many different equivalence relation possible on the set $A = \{a, b, c, d\}.$ For example, here are just two different ones: (a) $E_1 = \{(a, a), (b, b), (c, c), (d, d), (a, c), (c, a), (b, ...
0
votes
3answers
20 views

Defining a relation to a set

I have a homework question that asks me to define a relation A2 on $Z$ which is an equivalence relation containing three equivalence classes. $$Z = \{a, b, c, d, e\}$$ I understand what equivalence ...
1
vote
0answers
17 views

Technical Language Usage: Verb for an Equivalence Relationship “Forgetting” an Attribute that is “Modded Away”

This question is one of English usage, but I'm sure only mathematicians can answer it for me. I want to say in a technical report that an attribute is "ignored" or "forgotten" by an equivalence ...
1
vote
1answer
26 views

Equivalence relation and class, Proof.

The relation $P$ on $ℝ$ is defined by $xPy$ iff $x^2=y^2.$ (a) Prove that the the relation $P$ is an equivalence relation. (b) Describe the equivalence class of $3$ and $0$. In order to ...
4
votes
4answers
483 views

Definition of smallest equivalence relation

I came across the term 'smallest equivalence relation' in the course of a proof I was working on. I have never thought about ordering relations. I googled the term and checked stackexchange and couldn'...
0
votes
2answers
96 views

Divisibility relation on nonnegative integers.

Definition: $a$ divides $b$ if $b = ak$ for some integer $k$. The book says that it is reflexive. But what about $0/0$ ? I am missing any point ? Is it not a paradox since for standard division ...
1
vote
2answers
10 views

Find total number of relations that are equivalence as well as partial order set

Find total number of relations that are equivalence as well as partial order set. Assume set contains total $n$ elements. My attempt: As equivalence relation has property reflexive, symmetric and ...
4
votes
1answer
20 views

Constructing bijection from set of equivalence classes to another set

Suppose $f:A \to B$ is surjective. Define a relation on $A$ by setting $x\sim y$ if $f(x) = f(y)$. It is clear that $\sim$ is an equivalence relation on $A$. Let $\mathcal{E}$ be the set of ...
3
votes
0answers
36 views

Restriction to equivalence relation is equivalence relation

Let $\mathcal{R}$ be relation on $A$ and $A_0 \subseteq A$. The $\mathbf{restriction}$ of $\mathcal{R}$ to $A_0$ is defined to be the relation $\mathcal{R} \cap (A_0 \times A_0) $. $\mathbf{...
3
votes
1answer
411 views

Show that the restriction of an equivalence relation is an equivalence relation.

Let $C$ be a relation on a set $A$. If $A_{0} \subset A$, define the restriction of $C$ to $A_{0}$ to be the relation $C \cap (A_{0} \times A_{0})$. Show that the restriction of an equivalence ...
0
votes
1answer
33 views

Equivalence relation and restriction

This is a HW question Suppose $B \subseteq A$ and $R_a$ is an equivalence relation on A. Let $R_b$ the restriction of $R_a$ to B; that is, $R_b = \{(a,b) \in R_a : a,b \in B\} $ Is $R_b$ an ...
0
votes
0answers
41 views

Relations on equivalence classes

To be short, I will abstract a bit from my particular problem. Let $S$ be a set and $\sim$ be an equivalence relation, defined on that set. Let $R \subseteq (S/\sim) \times (S/\sim)$ be a relation ...
1
vote
2answers
60 views

Prove that $[a]=[b]$ iff $a\sim b$.

If $[a]=[b]$ then $a$ is in $[b]$ and $b$ is in $[a]$. If $a \sim b$, then $[a]$ is a subset of $[b]$ and $[b]$ is a subset of $[a]$. Then using the equivalence properties and showing that there is a ...
0
votes
2answers
26 views

Prove that $aRb$ if $a = 2^kb$ is an equivalence relation.

Let $R$ be a relation on the set of integers given by $aRb$ if $a = 2^kb$, for some integer $k$. show that $R$ is an equivalence relation. I don't understand how it will be equivalence. Is it the ...
5
votes
3answers
6k views

Number of equivalence relations on a finite set

I need a hint for computing the number of ways in which all the equivalent classes on a set of $n$ elements can be realized. For example, if the set has 2 elements ${a,b}$, then there are 2 possible ...
0
votes
2answers
73 views

Elementary math proof

Let $\sigma$ : $\mathbb{Z}_{11} \to \mathbb{Z}_{11}$ be given by $\sigma([a]) = [5a + 3]$. Prove that $\sigma$ is bijective. Approach It has to be one to one and onto so It is one to one if $\sigma([...
0
votes
1answer
29 views

Transivity / Binary relation? [closed]

Discuss the Transitivity of Binary Relations $\mathcal{S} $ $a$ on $\Bbb R $ defined by $a (x, y)$ $\in \Bbb R^2 $--> $x \leq ay$ ( for some a $ \in \Bbb R$ ) I have this assignment about ...
0
votes
1answer
28 views

Let R be the relation on the set of ordered pairs of positive integers, Z+ × Z+, such that (a, b)R(c, d) if and only if ad = bc.

(For instance, (2, 4)R(6, 12) since 2·12 = 4·6.) Show that R is an equivalence relation. I was tasked to show that the sets is an equivalence relation if the three conditions Reflexive, symmetric and ...
2
votes
1answer
37 views

is this an equivalence relation? by Reflexive, Symmetric and Transitive.

i. {(a, b) : a and b have met} ii. {(a, b)} : a and b speak a common language i) Reflexive: yes Symmetric: yes Transitive: No, if a met b and b met a then a does not met c. ii) Reflexive: yes ...
1
vote
2answers
24 views

How to prove equivalence relation is disjoint?

I know how to prove when the equivalence are not disjoint, thus $[a]=[b]$. I see that the proof works for proving a equivalence relation is disjoint, but I don't get it. Can someone explain it to me? ...
0
votes
1answer
26 views

$X$ hausdorff and $ \big\{ (x, y) : x ∼ y \big\} ⊆ X × X$ is closed implies quotient map is open.

Let $∼$ be an equivalence relation on a topological space X. $\ Y = X/∼ $ equipped with the quotient topology. How to show that if X is Hausdorff and the set $ \big\{ (x, y) : x ∼ y \big\} ⊆ X × X$ ...
2
votes
3answers
62 views

How many equivalence relation can be defined on a set of $5$?

The question is how many equivalence relation can be defined on a set of $5$? I think this is asking how many different ways can we partition a set of $5$, right? So the answer is $1$ way: $$\{1\},\...
0
votes
3answers
24 views

Prove transitivity or not of some relation

I'm trying to prove if this equation is an equivalence relation or not. $R =\{(x,y) \in N\times N: \mbox{There exist }m,n \in N\mbox{ such that } x^m = y^n\}$ It's relatively easy to prove both ...
2
votes
1answer
27 views

Norms Equivalence over $\mathbb R^n$

Let $\|\cdot\|$ be any norm on $\mathbb R^n$. Prove that a sequence in $\mathbb R^n$ is Cauchy under the $\|\cdot\|_2$ norm if and only if the sequance is Cauchy under the $\|\cdot\|$. Prove that a ...
0
votes
1answer
27 views

Find the multiplicative inverses of each nonzero element of the field $Z/(5), Z/(11), Z/(17).$

For $Z/(5)$, I figured that $[4]$ is a class that has an inverse of its own since $4 \equiv -1 (mod 5)$. Is that correct? Then I tried figuring that $[2]$ is also an inverse of its own since $2 \equiv ...
3
votes
1answer
72 views

Prove that $R = \{((m,n),(p,q)):m + q = n + p\}$ is an equivalence relation on $\mathbb N_0$.

Define the relation $R$ on $\mathbb{N}_0$ by $$R = \{((m,n),(p,q)):m + q = n + p\}.$$ (a) Prove that $R$ is an equivalence relation. Now I need to prove it's reflexive, symmetric, and transitive!...