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

How is the relation only symmetric?

Question: If $A= \{a,b,c,d\} $, then the relation $R= \{(a,b),(b,a),(a,a)\} $ is … The relation should be both Symmetric and transitive, but the answer in my textbook is given to be only Symmetric. How? It should be transitive as he relation $R$…
0
votes
2 answers

Sketch a graph for a function which has domain $(0,4)$ and range $(-\infty , \infty)$

I tried questions like these by putting the values of range and domain in the linear function $ax+b$ type;they were closed intervals. Now I don't know how to proceed further. That approach is not working here. If anyone can suggest that would be…
Amrit
  • 17
  • 6
0
votes
1 answer

Prove that every antisymmetric relation is weakly antisymmetric

antisymmetric: if, for all x,y∈X, if xRy holds, then yRx does not weakly antisymmetric: if, for all x,y∈X, if xRy and yRx hold, then x=y
Johnny
  • 1
0
votes
0 answers

How to find the Antisymmetric Closure of a set?

This is an example exercise from my Algebra class: Find the antisymmetric closure of $$R=\{(1,2),(1,3),(2,2),(2,1)\}$$ on $$\{1,2,3\}$$ I don't see it explicitly defined in the lecture notes and I couldn't find much information about…
0
votes
1 answer

Examples of order relations

I am looking for some examples of order relations which are different from the quite usual ones like divisibility on $\mathbb{N}$, inclusion on a power set, "less than or equal to" ($\leq$) on $\mathbb{R}$ or lexicographic order on $\mathbb{N}$. Any…
muffin
  • 33
0
votes
1 answer

Verify that any two elements of $X$ are connected by the relation $\mathcal{R}\subset X^{2}$ iff $\mathcal{R}\cup\mathcal{R}' = X^{2}$.

The relation $\mathcal{R}'\subset Y\times X$ is called the transpose of the relation $\mathcal{R}\subset X\times Y$ if $(y\mathcal{R}'x)\Leftrightarrow (x\mathcal{R}y)$. Verify that any two elements of $X$ are connected (in some order) by the…
user505883
0
votes
1 answer

Questions about equivalence relations

Assume $S$ and $R$ are two relations from the set $A$ to the set $B$, then $R∪S$ is a relation from $A$ to $B$. prove: $Dom(R∪S)=Dom(R) ∪ Dom(S)$ $Im(R∪S)=Im(R) ∪ Im(S)$ for every $X⊆A$,$(R∪S)(X)=(R)(X) ∪ (S)(X)$ I tried using definition but I could…
user715522
0
votes
1 answer

R is the relation between a father and child. What is the composite of R and R?

$P$ is the set of all people. $$R=\{ ( x,y )\in P \times P \mid y \text{ is the father of x}\}$$ Then, from the definition of composite, $$R\circ R=\{ ( a,c ) \in P\times P\mid ( \exists b\in P ) ( ( a,b) \in R\wedge ( b,c )\in R ) \}$$ Which I…
Bool
  • 137
0
votes
1 answer

Question on Relation closures

Let R be a relation on N defined by (x, y) ∈ R iff there is a prime p such that y = px. Describe in words the reflexive, symmetric and transitive closures of R, denoted by r, s and t, respectively (a) Which of the following are true: r(s(R)) =…
0
votes
2 answers

relation $R$ on power set $P(A)$

I pretty confused about how to deal with this. how can I determine for a relation ($R$) on a power set whether it is reflective, symmetric, transitive. When $A$ is the final amount and $P(A)$ is the power set. Consider the relation $R$ of $P(A)…
Betis
  • 3
0
votes
1 answer

Proof of reflexive, symmetric and transitive when m | n

I'm trying to write proofs or counterexample using the definition of divides only for each operation (reflexive, symmetric or transitive) in the following: The relation V on Z+ for all m and n in Z+, mVn <-> m | n. I'm familiar with the set…
Val
  • 41
0
votes
0 answers

Relation that is partial order and equivalence?

Is there any relation on set of natural numbers that is partial order and equivalence? I don't think so because when relation is symetric it can't be also antisymetric. Am I right? Thanks.
lasto
  • 81
0
votes
1 answer

If X is the sister of Y and Y is the sister of Z then X need not be the sister of Z. How is this relation correct?

This is a statement from the Sets and Relations chapter of Discrete Mathematics. It is about the relation between the elements of a set, let say A. So, the relation R = 'is a sister of' where the following statement is defined to be true: "It is not…
iamsumitd
  • 23
  • 3
0
votes
0 answers

a product of two relations $R,T$ element of $A \times A$ is defined as? I don't understand?

$[RT = { (a, c) | \exists b \in A : (a, b) \in R \wedge (b, c) \in T }.]$ so i dont understand why a product of two relations is defined like that? product stands for * , so shouldnt it be a Cartesian product of two tuples? or do i understand the…
0
votes
3 answers

How do you prove the transitiveness of xRy if 2 divides x + y

The relation I have is xRy iff 2 | x + y on the set of positive integers (Z+) I intrinsically know that it is transitive, but I can't think of a way to mathematically prove it. Any thoughts?
Jon Doe
  • 31
  • 5