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
vote
1 answer

if a relation is reflexive, symmetric, or transitive

А = {1, 2, 3, 4} p= {(1, 1), (2, 2), (3, 3), (4, 4), (1, 3), (3, 4)} I know what reflexive, symmetric, or transitive are, I just want answer with these examples. I think it should be transitive?
1
vote
3 answers

The Relation "Is Less Than" ($<$ ) Is Anti-Symmetric on $\mathbb{Z}$?

I would like someone to review my understand of why the relation "is less than" ($<$ ) is anti-symmetric on $\mathbb{Z}$. My reasoning is as follows: Anti-Symmetry says that, if $(a,b) \in R$ and $(b, a) \in R$, then $a = b$. In this case, we cannot…
The Pointer
  • 4,182
1
vote
0 answers

Partially ordered set proof

I'm trying to proof if the following Relations R ⊆ M×M total order or partially order are. $M = \{1,2,3\} , R = \{(x,y) : x|y\}$ $M = {\bf Z} , R = \{(x,y) : x\vert y\}$ $M = {\bf N}, R = \{(x,y): y ≤ x\}$ $M = {\bf Z} × {\bf Z}, R =…
Tiro
  • 49
1
vote
1 answer

Drawing a relation

I am doing a past paper, and one of the question is: Let $A = ${$cat, dog, mouse, bird$}, and let $R$ be the binary relation on $A$ given by: $R = ${($x, y$): $x$ and $y$ have no letter in common}. Draw $R$ I have a limited understanding of…
Shannon
  • 111
1
vote
1 answer

Is this relation really transitive?

$$A=\{(0,0),(0,1),(1,0),(1,1),(0,2),(2,0),(2,2)\}$$ Hi guys can somebody tell me why this relation is not transitive? I know that is reflexive and symmetric and also thought that is transitive but my Math-Script say no! Thanks in advance:)
Tiro
  • 49
1
vote
2 answers

Why is this relation not transitive?

Question: Let $A$ be $\{a,b,c\}$. Let the relation $R$ be $A \times A$ - $\{(a,a), (a,b), (b,b), (c,a)\}$ Which of the following statements about $R$ is true? a. $R$ is reflexive, is symmetric, and is transitive. b. $R$ is reflexive, is symmetric,…
1
vote
2 answers

Antisymmetric and irreflexive relation which is not asymmetric

Can anyone give me a counterexample for a relation $R\subset M\times M$ for the statement $$R\text{ antisymmetric} \wedge R\text{ not reflexive}\implies R\text{ asymmetric}$$
1
vote
1 answer

How to find partial orders satisfying some conditions

I am totally confused about the exercise I have and ask your help: I have to draw Hasse diagrams for all partial orders on the set $\{1,2,...,n\}$ which have the maximum element (such $m$ that $aRm$ for all $a$ in the set). And I am pretty confused…
1
vote
3 answers

Why is the composition of relations $R$ and $S$ written $S \circ R$ instead of $R \circ S$?

This is really basic (I'm new to this stuff), and doesn't even matter at all - But I'm just curious: From my book: If $R = (G,A,B)$ and $S = (H,B,C)$ the composition of $R$ and $S$ is known as $S \circ R = (H \circ G,A,C)$ First of all, if it…
Saturn
  • 7,191
1
vote
2 answers

Proof Properties of Relation - $R = \{ (a,b) \in \mathbb{R} \times \mathbb{R} : |a|=|b| \}$

Hello Mathematics Community, currently I am trying to prove that the Relation: $R = \{ (a,b) \in \mathbb{R} \times \mathbb{R} : |a|=|b| \}$ is reflexive, symmetric and transitive. I know the definitions but I don't know how to prove it…
M.Hisoka
  • 87
  • 4
1
vote
0 answers

How prove this statement?

A transitive and connected relation is a negative transitive? A negative transitive and asymmetric relation is transitive? Is this correct for 2? Assume that R be transitive and connected relation but is not a transitive (if $(a,b) \in R$ and…
linkho
  • 397
1
vote
1 answer

Given the matrix of this relation, why isn't the relation transitive?

$$A = \begin{pmatrix} 0 & 1 & 1 \\ 0 & 0 & 1 \\ 0 & 0 & 0 \end{pmatrix}.$$ and the set notation for the relation is $$R = \{(a,b),(a,c),(b,c)\}$$ Is there a fast way to show whether or not it's transitive? I thought it isn't transitive but my…
1
vote
2 answers

Equivalence Class of the relation {(0,0) (1,1) (2,2) (3,3)}

The above relation is equivalent for the set {0,1,2,3}. How would you find the equivalence class for this relation or any general relational set of pairs of integers?
user1766888
  • 623
  • 3
  • 12
  • 24
1
vote
0 answers

Can some rigorous sense of "meaningfulness" be introduced to characterize relations?

A little goofy, but this question occurred to me in the context of the following example. While answering a strictly-programming question at https://stackoverflow.com/questions/44482735/#44491340 I generated the following list of six numbers that…
1
vote
0 answers

Is my Hasse diagram for the poset relation correct?

${ (a,e), (b,f), (d,b), (d,g), (e,c), (c,b), (g,f), (e,g) }$ - The relation My confusion lies with $(c,b)$ would $c$ be above $b$ in the diagram? *Please ignore the highlighting The image below is of my drawing of the relation as a Hasse diagram.