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

Prove or disprove: $\forall\rho,\sigma,\phi\subseteq A^2: \ \rho \subseteq \sigma \rightarrow \rho \circ \phi \subseteq \sigma \circ \phi$

Where $\rho,\sigma,\phi$ are relations on a finite set $A$ and $\circ$ denotes the relation composition. I was neither able to prove it, nor to come up with a counterexample.
ndrizza
  • 1,348
1
vote
0 answers

Book on theory of relations

Could someone recommend an introductory book on Theory of Relations for undergraduate level mathematician? Something gentle and intuitive.
marius
  • 11
1
vote
2 answers

Prove that transitive closure has at the most $n^2$ elements

Given a relation $R \subseteq A \times A$ with $n$ tuples, I am trying to prove that its transitive closure $R^+$ has at the most $n^2$ elements. My initial idea was to use the following definition of the transitive closure to identify an argument…
zepp133
  • 125
1
vote
2 answers

Equivalence relation $x^m=y^n$

Show that $R=\{(x,y) \in\mathbb{N}^2:\exists m,n \in \mathbb{N} \text{ s.t. } x^m=y^n\}$ is an equivalence relation or disprove otherwise Reflexivity and symmetricity were really easy to show but how do I show that it's transitive? Let…
1
vote
1 answer

Binary Relations - Reflexive, Symmetric, Transitive and anti symmetric

$R$ is defined on $P(N) − \{\varnothing\}$ by $ARB$ if and only if $A \cap B \ne \varnothing$ Identify if the relation is reflexive, symmetric, transitive and anti symmetric Finding it hard to work with this one. if $P(A)$ is $\{\}$ and $\{A\}$…
dave
  • 103
1
vote
2 answers

Determining whether a relation is transitive or not.

While trying to determine whether the following relations are transitive or not, I got stuck in between. The following are the two relations - Relation R in the set $\mathbb{N}$ of natural numbers defined as $$R = \{(x,y): y = x + 5 \…
1
vote
5 answers

If $R=\{(x,y): x\text{ is wife of } y\}$, then is $R$ transitive?

If $R=\{(x,y): x\text{ is wife of } y\}$, determine whether the relation $R$ is transitive or not. My Try: For Transitivity, If $(a,b) \in R$ and $(b,c)\in R\;,$ Then $(a,c)\in R.$. Here If $x$ is a wife of $y$, then $y$ is not a wife of $z$.…
juantheron
  • 53,015
1
vote
1 answer

Asymmetric Relation Confusion

$A = \{1, 2, 3, 4\}, R \subset A \times A$ Why is $\{(1,1),(2,2),(3,3)\}$ an asymmetric relation? $(a,b)$ where $a=b$ must come under symmetric relation.
George
  • 25
1
vote
1 answer

How can we get the approximate values $a,b,c$?

How can we get the approximate values $a,b,c$? The condition and relation are the followings : $0 < a,b,c < 1$ $a + b + c = 1$ $(1-a)^2 + b^2 + c^2 =1 $
EvanIK
  • 11
1
vote
1 answer

why this is transitive relation?

$\rho\subseteq \mathbb{N}\times \mathbb{N},\rho=\{(x,y):y=x+5,x<4\}$ is the relation, so $\rho=\{(1,6),(2,7),(3,8)\}$ in my book it is written that $\rho$ is an transitive relation, but why? I know the definition as if $(a,b)\in \rho,…
Myshkin
  • 35,974
  • 27
  • 154
  • 332
1
vote
0 answers

Can someone verify my work for finding the following relations?

I am working on this problem Let R be the relation on the set {1, 2, 3, 4, 5} containing the ordered pairs {(1,1), (1, 2), (1,3), (2,3), (2,4), (3,1), (3,4), (3,5), (4,2), (4,5), (5,1), (5,2), (5,4)} Find a.$R^2$ b.$R^5$ Here is my work so far,…
1
vote
1 answer

Why can't a relation have an infinitely long chain from a to b?

A relation $R$ has a "chain" that connects $a$ to $b$ if there exists some sort of $$(a, x_0),(x_0, x_1),\cdots,(x_{n-1}, x_n),(x_n,b)$$ made out of the elements in $R$. Why doesn't there exist a relation with an infinitely long chain? My first idea…
user137794
  • 2,469
1
vote
1 answer

Shortcut for determining equivalence relations?

Is there a short cut to determine the number of equivalence relations on the set $\{1,2,3,4\}$? I mean I could do that manually but for a larger set it becomes annoying. Is there a general way to partition it?
Mamba
  • 803
1
vote
1 answer

finding the equivalence class of modulo?

I would like to find the number of different equivalence classes for $\{(x,y)\mid x^2\equiv y^2$ mod $3 \}$ on $\mathbb{N}^2$. I would just set $x^2$ to $0$ or $1$ or $2$ or $3$. For example mod($0$,$3$)=$0$, mod($1$,$3$)=$1$,…
Jacky
  • 87
1
vote
1 answer

Why do we have to include the pairs $(b, b)$ and $(c, c)$ in the transitive closure?

The problem is: Find the reflexive, symmetric and the transitive closure of the following relation: $R = \{ (a, a), (a, b), (b, c), (c, b)\}$ on the set of elements $A = \{a, b, c\}$ Finding the reflexive and the symmetric closure for $R$ was…
user168764