Questions tagged [relations]

For questions concerning partial orders, equivalence relations, properties of relations (transitive, symmetric, etc), a composition of relations, or anything else concerning a relation on a set.

A relation $R$ on a set $X \times Y$ (sometimes also called a relation between $X$ and $Y$) is any subset of $X\times Y$. So a relation is any set of ordered pairs $(x,y)$ such that $x\in X$ and $y \in Y$. Often we write $x\mathrel R y$ instead of $(x,y)\in R$. Sometimes we say a relation is defined on a single set $X$, but this just means that we're letting the relation $R$ be a subset of $X \times X$.

Here are some examples of relations:

  • For a very abstract example of a relation, take $X = \{1,2,3\}$ and $Y = \{a,b,c,d\}$, and let $R = \{(1,b),(3,c),(3,d),(2,c),(2,d)\}$. This $R$ is a relation on $X \times Y$. Fun fact, there are $2^{12}$ distinct relations you could put on $X \times Y$.

  • A function $f\colon X\to Y$ can be defined as a relation on $X \times Y$. The pairs in $X \times Y$ that are members of the relation are the input-output pairs $(x, f(x))$.

  • A partial order is a relation that mimics the notion of one element being greater/less than the other. An example of a partial order is the relation $\leq$ on $\mathbf{Z} \times \mathbf{Z}$ where for two integers $n$ and $m$ we say $n \leq m$ if $n$ is less than or equal to $m$.

  • Given a set $X$, let $\mathcal{P}(X)$ denote the set of all subsets of $X$. We can define a partial order $\subseteq$ on $\mathcal{P}(X)$ by saying that for two susbsets $A$ and $B$ of $X$, $A \subseteq B$ if $A$ is a subset of $B$.

  • An equivalence relation is a relation that mimics the notion of two things being "equal". For example, on the set $\mathbf{Z}$ of integers let's 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.

4661 questions
-1
votes
2 answers

How is the relation $R=\{(1,1),(2,2),(3,3)\}$ on the set $A=\{1,2,3\}$ transitive?

A binary relation $R$ over a set $X$ is transitive if whenever an element $a$ is related to an element $b$ and $b$ is related to an element $c$ then $a$ is also related to $c$. If I consider any two ordered pairs there is no common element.So how…
Matix
  • 15
-1
votes
1 answer

Define $R$ to be a relation on integers such that $a\,R\,b$ if $|a-1| \leq |b-1|$. Is $R$ a partial order on $\mathbb{Z}$?

How can I even prove this to be true? Prove that $R$ is a partial order on integers.
B.LIANG
  • 23
-1
votes
3 answers

Why define the notion of a reflexive relation in terms of an external set?

Based on the articles I've read, given any binary relation $R\subseteq X\times X$ we say: $$R\text{ is reflexive }\iff\forall x\in X:xRx\iff (\forall a\in X\exists b\in X:aRb)\land (aRb\implies aRa\land bRb)$$ Why not define reflexive so…
-1
votes
2 answers

Let $\rho$ be the relation on $\mathbb{Z}\times\mathbb{Z}$ in which $(a,b)\rho(x,y) \iff a-b=x-y$. Prove it is an equivalence relation

So I'm stuck on this question (not really sure how to approach it), I understand what an equivalence relation is (reflexive, symmetric & transitive relation at the same time), but I'm not sure how to prove it. Would be appreciated if someone can…
-1
votes
1 answer

Is this relation total?

It's not clear to me why this relation is not total: $\{(x,y)|x=y\}$ The way I interpret this is, since x = y, it is always true that (x,y) or (y,x) is part of the relation. Doesn't this imply that the relation is total?
-1
votes
1 answer

Determining a relation involving a greater than and less than condition

Can anyone offer guidance on how to determine the following relation as being reflexive, symmetric or antisymmetric when the relation is given by $$ x \sim y \iff (x - y) > 0 \land (x - y) < 4. $$ I think it is not reflexive and antisymmetric. Any…
BoB
  • 21
-1
votes
1 answer

Compositions of Sets 2

Given set A = {a, b, c} relation R = {(a,b),(b,c),(c,a)} relation S = {(a,c),(c,a)} What is R o S?
-1
votes
2 answers

Defining Equivalence Relations on a Set

Given the sets, $A=\{0,1\}$ and $B=\{12,1,2\pi\}$, define (by listing the ordered pairs): $a$) A relation from $A$ to $B$ that is not a function. $b$) A relation from $A$ to $B$ that is a function. I was thinking for $b$ that since $A\times B$ is…
Reine
  • 37
-1
votes
1 answer

Proving pairs of natural numbers is partial order

I'm having trouble with this question, for question one, do I prove that the statement satisfies reflexivity, antisymmetry, and transivity? Would $m < m'$ satisfy reflexivity alone or do I have to include $n$ and $n'$? How would I prove…
-1
votes
2 answers

Find if the given relation equivalence?

Let $A=\{x \in \mathbb Z:1 \le x \le 7\}$ and $R= \{(a,b):\vert a-b\vert \text{ is multiple of 4}\}$ a relation defined on set $A$. Is $R$ an equivalence relation? What are all ordered pairs of $R$?
-2
votes
2 answers

Set Multiplication

The question starts with this: Given the following relation S on Z×Z where Z= {a, b, c, d, e}: S={(a, a),(b, b),(a, b),(b, a),(c, c),(d, d),(e, e),(c, e),(d, e),(e, c),(e, d)} Then it asks to see if it is an equivalence relation. I think I'm…
-2
votes
1 answer

Please correct me if the following Relations are wrong.

If $A=\{1,2,3,4\},~B=\{4,5\}$ and $C=\{5,6\}$ find: $A\times (B-C)$ $(A\times B)-(A\times C)$ $(A\times B)\cap (A\times C)$ My answers that I came up with…
-2
votes
1 answer

How to prove this result about the binary relation?

; defined as: $R_1;R_2 = \{(a,c) : \text{there is a,b with } (a,b) ∈ R_1 \text{ and } (b,c) ∈ R_2\}$ I am not sure the proper method to prove this question. I tried that Ri+1 = Ri = Ri∪(R;Ri) (R;Ri) ⊆Ri then I don't know what to do next. or…
FOREST
  • 107
-2
votes
1 answer

Equivalance Relations- ordered pairs

Let $A = \{a, b, c, d\}$ Find the number of equivalence relations on A having: (a) exactly 4 ordered pairs. (b) exactly 5 ordered pairs. (c) exactly 6 ordered pairs
-2
votes
1 answer

Is $y=-x$ an equivalence relation in $\mathbb{R} \times \mathbb{R}$?

Setting ₩Gamma $f = (x, f(x))$ which is in $(X*Y)$ s.t. $x$ is an element of $X$) and $f:= X to Y$ We know this is a graph, but how to show this is an equivalence relation Reflexive $f(x)=f(x)$ so $x$~$x$ And symmetric, transitive conditions must…
1 2 3
46
47