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
3 answers

Why $R = \{(1,2),(1,3)\}$ is transitive relation?

As I understand the definition of Transitive Relation, $R$ should have $(2,3)$ to make it a transitive relation. I do not understand why this case is still a transitive relation without $(2,3)$. Thanks in advance.
1
vote
1 answer

Is every relation that induces a partition an equivalence relation?

Let $R$ be a binary relation on a set $X$. I define a right $R$ subset of $X$ to be the set of elements that are $R$-related to some specific element $x$ in $X$. Let $P$ be the set of all right $R$ subsets of $X$. If $P$ is a partition, must $R$ be…
user107952
  • 20,508
1
vote
2 answers

Importance of the properties of relations

I get that relationships between things can be observed in our everyday life, but I fail to see how the properties of relations I have learnt in class can be applied to solving problems. Can someone give a few examples on how properties of relations…
IceTea
  • 153
  • 2
1
vote
1 answer

What is the reflexive closure of $\{(a,b)~|~ a\neq b\}$?

Let $R$ be a relation $\{(a,b)~|~ a\neq b\}$ on the set of integers. What is the reflexive closure of $R$? Please help me. Solving the details please. Thanks.
1
vote
2 answers

Is this relation, $xRy=\{(1,2),(2,3)\}$, transitive?

$xRy=\{(1,2),(2,3)\}$ I'm asking because I was reading on antisymmetry from this question Antisymmetric Relations I may very well just be confused, but the relation doesn't state that 1 does not correspond to 3 as well. At the same time though, I…
1
vote
0 answers

Relations. The properties of reflexivity and symmetry

I have problems understanding these properties. Let us consider the set A whose Cartesian product is equal to A x A. Let A = {1,2,3}. Then: The relationship with the reflexivity property should look like this: R = {(1,1), (2,2), (3,3)} - because for…
MaximPro
  • 133
1
vote
2 answers

Is there a function that makes the binary relation between a bounded set of bounded sequences and $\{0, 1, 2, \dots, 2^{64}\}$ injective?

Given the set $S$ of all possible sequences within bounds $[1, 31]$ with $n$ elements (where $n$ is constant and $ 1 < n < 32$) and a set $L \subset \{0, 1, 2, \dots, 2^{64}\}$ where $|L| = |S|$, does there exist a function $f$, so that the binary…
Timo
  • 125
1
vote
1 answer

What means smallest relation and what difference from simple relation

For example, I have a set of A = {1,2,3}. To express relations on the set A, we need the Cartesian product A x A. For example, I want to express a relation that is reflective and I will write R = {(1,1), (2,2), (3,3)} But I often heard that there is…
MaximPro
  • 133
1
vote
0 answers

Relation Composition and Set Equality

I am stuck on a relation composition problem from book [1]. The context is: Suppose $r \in \mathbb{R}^+$ and $s \in \mathbb{R}^+$. Let $D_r = \{(x, y) \in \mathbb{R}^2 \mid |x-y| < r\}$, and $D_s = \{(x, y) \in \mathbb{R}^2 \mid |x-y| < s\}$. The…
Cole A
  • 41
1
vote
3 answers

Proving $2x^2-3xy+y^2=0$ is transitive and anti-symmetric or symmetric and reflexive.

Let $R$ be the binary relation defined on $\mathbb{R}$ by $xRy$ iff $2x^2-3xy+y^2=0$ For reflexive we get $2x^2=2x^2\implies-x=x$ which means reflexive on $xRx$ $2x^2-3xy+y^2=0$ tried going for $2y^2-yz+z^2=0$ then adding them together but now I'm…
oma
  • 81
1
vote
2 answers

How to prove transitive relations

Let $R$ be a binary relation on $\mathbb{N}$ defined by $xRy$ if and only if $x − 2 ≤ y ≤ x + 2$ How do you find if it is a transitive relation when there is only $xRy$? Isn't transitivity the relation between 2 conditions, for example $xRy$, $yRz$…
Andrea
  • 45
1
vote
1 answer

Basics of Relations Help

I am working out of a textbook for self study past what will be covered in a class I am taking, and I am wondering if someone could explain a couple of questions to that I am just not grasping. The question asks; For each of the following relations,…
Chairman Meow
  • 796
  • 1
  • 8
  • 24
1
vote
2 answers

Is this relation reflexive if it "chains" to itself?

During studying I stumbled upon a thought regarding reflexive relations. I'm familiar that a relation is reflexive if for each element $x$ in a set $S$, $xRx$. (∀x ∈ S: xRx)? Such as something like this $<1,1>,<2,2>$. However is the following deemed…
1
vote
1 answer

Is the relation on the positive integers defined by $(x,y) \in R$ if $x = y^2$ only antisymmetric?

The question in my book says: Determine whether the relation defined on the set of positive integers is reflexive, symmetric, antisymmetric, transitive, and/or a partial order. $x = y^2 \rightarrow (x,y) \in R$ I thought it was antisymmetric, but…
Leonardo
  • 988
1
vote
1 answer

Does there exist any elements which I can add to a Relation such that the Relation remains Sym/Anti, Trans, and Reflexive?

Given some set $X$ and relation $R$ If $R = \{(x,x) | x \in X\}$ then we have a relation which is reflexive, transitive, symmetric, and anti-symmetric. Now can I add any elements to the relation which are members of X crossed with X, such that the…
Leonardo
  • 988