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

Find the least upper bound of S in $\mathbb{N}$?

"Define a relation on the set N of natural numbers by declaring that for all x, y ∈ N, $x \propto y \iff $(x = y) or (4x ≤ y). Let S = {2, 4, 6, 8, 10, 12} be a subset of $\mathbb{N}$ . (i) Find all maximal and minimal elements of S with respect to…
maths123
  • 541
0
votes
1 answer

How to construct a symmetric, transitive and reflexive relation

If R is a binary relation in a set X ≠∅ that is symmetric, transitive, then R is reflexive. This is false and I have to change the argument to make it true. How can I do this? Thanks!
0
votes
0 answers

What is a transitive relation on set S

MY answer: Given r,s,t$\in S$ a transitive relation on the set $S$ is when the elements $rRs$ and $sRt$ then $rRt$ i.e., $rRs\land sRt\rightarrow rRt$ Does my definition words correct?
Surdz
  • 627
0
votes
0 answers

Define symmetric relation R on set S

Answer: A symmetric relation R on S is that For all $x,y\in S$ such that $xRy$ implies $yRx$. meaning if the element x is related to y, then it is also true the other way around that element y is related to x of the set S. i.e. $xRy\rightarrow…
Surdz
  • 627
0
votes
1 answer

Can someone explain why is $R=\{(1,1), (1,2)\}$ transitive?

Using a digraph I understand transitive relation to be a loop, but $R=\{(1,1), (1,2)\}$ is not a loop. Thank you for your time!
0
votes
2 answers

What is the reflexive closure of the empty relation ∅ over a set A?

What is the reflexive closure of the empty relation ∅ over a set A? I understand that R is reflexive if A=∅, and isn't if A is nonempty. But what about the reflexive closure of R?
David
  • 3
0
votes
1 answer

Let A be the set of U. S. states. One example of a relation on A is $R = [(s,t) : s = t or s shares a border with t].

Let A be the set of U. S. states. One example of a relation on A is R = {(s,t) : s = t or s shares a border with t}. Notice that the domain of R is A, and the range of R is A. Give a different example of a nontrivial relation from A to A whose…
Matt
  • 297
0
votes
2 answers

How to tell if the relations R, S and T are reflexive, symmetric, anti-symmetric or and transitive?

Let $R$, $S$ and $T$ be binary relations defined as follows R is defined on $P(\mathbb{N})$ by $ARB$ if and only if $|A∪B| ≥ 2$ $S$ is defined on $Q$ by $xSy$ if and only if |$x$|=|$y$|. (Note that |$q$| is defined to be the largest integer less…
SAR
  • 297
0
votes
0 answers

Determine whether this relation is reflexive, symmetric, antisymmetric and/or transitive?

R is defined on $\mathbb{N} × \mathbb{N}$ by $(a, b)R(c, d)$ iff $a \leq c$ and $b \leq d$. I think it's reflexive and transitive. Not too sure about it being symmetric or antisymmetric. Any help would be appreciated!
rainbow
  • 33
0
votes
1 answer

What is the difference between total order relations and well order relations?

I know it has to be a partial order relation in order for it to be a well order relation or total order relation, but what are the differences between them.
SAR
  • 297
0
votes
1 answer

Confirming my understanding in determining if a relation is reflexive, symmetric, or transitive

I think I have a grasp on how to determine if a relation is reflexive, symmetric, or transitive. Just to make sure I understand it correctly, if I have the following relation: for $(a,b) \in \mathbb{N}$ we say that $(a,b) \in R$ if $a + b$ is…
medyns
  • 33
0
votes
2 answers

define a relation $R$ on $S$?

Let S be the set of humans. 1) Define a relation $R$ on $S$ that is reflexive, symmetric, and transitive but not antisymmetric 2) Define a relation $R$ on $S$ that is symmetric and antisymmetric Can someone help me understand how to start this?…
0
votes
1 answer

Why is $x \mid y$ over $\Bbb N$ a partial order but not total order?

I understand why $x \mid y$ is an example of a partial order relation over $\Bbb N$. But can someone explain why its not a total order relation? By definition a total order relation on a set $A$ is a relation $R$ that is a partial order relation and…
Mark
  • 137
0
votes
1 answer

Is following Relation from $X$ to $Y$ is a Relation or not?

$$X=\{1,2,3,4,5\} \text{ and } Y=\{1,3,5,7,9\}$$ $$R=\{(x,y)\mid y=2+x,x\in X, y\in Y\}$$ my textbook says it is a relation from $X$ to $Y$. But for $x=2$, $y=4$ but $4$ is not in $Y$. How is that possible?
T.Noor
  • 129
0
votes
2 answers

A property of reflexive transitive closure

Suppose $R$ is a binary relation on a set $S$. Let $R^+$ be the reflexive transitive closure of $R$. That is, $R^+$ is minimal relation which includes $R$ and is both transitive and reflexive. By minimal I mean that no proper subset of $R^+$ which…