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
3
votes
1 answer

Define a relation | on the set of natural numbers by aRb if a|b

So for the division relation (or divides relation, depending on how one says it), I have to show the following: a. Prove that | is a partial order on the set of Natural Numbers. b. Prove that | has no maximum element. c. Prove that | has a minimum…
JCMcRae
  • 843
2
votes
1 answer

Equivalence Class

Let $A:= \{1,2,3,\dots\}$ and $P := A \times A$. Now define a relation on $R$ on $P\,$ by $$(x,y)R(a,b) \iff x^y = a^b$$ 1) Determine the equivalence class $[(9,2)]$ of $(9,2)$ Note that I already verify it is indeed an equivalence relation. But…
jake
  • 21
2
votes
2 answers

What is the name of the Speed, Distance, Time relationship?

Really simply, I'd like to know if there is a name used to describe the speed, distance & time relationship. i.e. As this is basically the same relationship that applies to current, voltage and resitence in Ohms Law I'm sure there's another as…
Ross Drew
  • 123
2
votes
1 answer

Describing a partition for an equivalence relation?

Describe the partiton for the equivalence relation. For each $x,y\in \mathbb{R}$ xRy $\iff$ $x-y\in \mathbb{Z}$ Now I am not sure how to find a partition for this I guess one could have negative integers or positive integers I know a the set in a…
Fernando Martinez
  • 6,698
  • 19
  • 74
  • 108
2
votes
3 answers

Name for relationship where a is related to b iff a and b are in different subsets

Yesterday I was out running in the park, and like many others I always run in a counterclockwise direction around the central lake. There are also strange people who always run in a clockwise direction. I realized that all the runners I can…
2
votes
1 answer

Relations - Reflexive, Symmetric, Transitive

I have the following question and corresponding answers, but I cannot quite understand how it works. Can anyone describe to me in plain English the reason why these relations are reflexive, symmetric, or transitive. Determine which of the following…
2
votes
2 answers

Proving this relation is transitive

Let $r$ be a relation on $A \times A$ such that $(a,b) r (c,d) \iff ad = bc.$ How can I show that this relation is transitive, ie. $(a, b)r(c,d)$ and $(c,d)r(e, f) \implies (a,b)r(e,f)$? I tried to say that $(a,b) r (c,d)$ means that $c=ka$ and…
Paul Manta
  • 3,505
2
votes
1 answer

If $R=\{(n,k) \mid n,k\in \{1,2,3,4,5,6\}, n \mid k\}$ is a relation. What does the notation $n \mid k$ mean?

Let $R=\{(n,k) \mid n,k\in \{1,2,3,4,5,6\}, n \mid k\}$ be a relation. What does the notation $n \mid k$ mean? I haven't seen this before, does this mean that $n$ is divisble by $k$?
eager2learn
  • 2,799
2
votes
2 answers

listing elements of equivalence class

For $m,n$ in $N$ define $m$ equivalent $n$ if $m^2-n^2$ is multiple of $3$ a) show that this is an equivalence relation b) list elements in equivalence class [0] c) list elements in equivalence class [1] d)do you think there are any more equivalence…
2
votes
2 answers

prove if x ≡ y (mod m) then GCD(x, m) = GCD(y, m)

By definition $x=km+y$ for some $k \in \mathbb{Z}$. Let $d=gcd(x,m)$. By definition $d|x$ which implies that $d|km+y$. Since $d$ also devides $m$ we note that $d|y$. now suppose there is some larger $d'$ such that $d'|y$ and $d'|m.$ however since…
2
votes
1 answer

Proving a relation is asymmetrical

Can someone please help? I am trying to answer the following: Consider the relation $T$ on $\mathbb{Z}$ given by $$xTy \Longleftrightarrow x + 1 \le y;$$ Is $xTy$ asymmetric? $xTy \Rightarrow x\neg Ty$ $xTy \Leftrightarrow x+1 \le y$ $x\neg…
Gunnar
  • 133
2
votes
1 answer

How to prove $R$ is an antisymmetric relation if and only if $R\circ R^{-1}\subseteq\Delta_X$?

$R$ is antisymmetric relation if and only if $R\circ R^{-1}\subseteq\Delta_X$ $\leftarrow$ assume $R\circ R^{-1}\subseteq\Delta_X$. let $(x,y)\in R $ and $(y,x)\in R\rightarrow (y,x)\in R^{-1}$, so $(x,y)\in R\circ R^{-1}$ therefore $(x,y)…
lyme
  • 1,351
  • 1
  • 13
  • 30
2
votes
1 answer

Prove the relation to be a Linear Order.

Let (a, b),(x, y) ∈ R × R and define ≺ as follows: (a, b) ≺ (c, d) iff a < c or a = c and b < d: Define (a, b) ≼ (c, d) if and only if (a, b) = (c, d) or (a, b) ≺ (c, d). Show that ≼ is a linear order on R × R. I know that I must prove the relation is…
2
votes
3 answers

$(a,b)R(x,y) \iff ay=bx$ is an equivalence on $\Bbb Z \times (\Bbb Z\setminus\{0\})$

Define a relation $R$ on $\mathbb{Z}\times(\mathbb{Z}\setminus\{0\})$ by $(a,b)R(x,y)\iff ay=bx.$ $a)$ Prove that $R$ is an equivalence relation. $b)$ Describe the equivalence classes corresponding to $R$. I know that an equivalence relation…
2
votes
1 answer

Can you get infinitely many relations from alternately applying symmetric and transitive closure?

Does there exist a set $S$ and a binary relation $R$ on $S$ such that the sequence $$\DeclareMathOperator{\sym}{sym} \DeclareMathOperator{\tr}{tr} R,\ \sym(R),\ \tr(\sym(R)),\ \sym(\tr(\sym(R))),\ \tr(\sym(\tr(\sym(R)))),\ \ldots $$ (where sym means…
user107952
  • 20,508