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

Question About Transitivity for a Relation of Only Reflexive Elements (2-Tuples)

Let's say I have the relation $R = \{ (0,0), (1,1), (2,2), (3,3) \}$ defined on the set $X = \{ 0, 1, 2, 3 \}$. A relation is transitive if, whenever $(a, b) \in R$ and $(b, c) \in R$, $(a, c) \in R$. Since all of the elements of the relation are…
The Pointer
  • 4,182
0
votes
2 answers

Types of relations

Let A= {x is reals:x>0} and define a relation on A by x relation y If xy=0 for x,y in A . I was wondering if this is reflexive relation. So far I thought If x=1 and y= 0, then 1*0=0 and 0*1 is also =0. It can be reflexive not sure if I am doing…
CS1
  • 85
0
votes
1 answer

Can a relation be acyclic and complete but not transitive?

I have come to understand that transitivity is a stronger condition than acyclicity, and completeness and quasitransitivity together imply acyclicity. But is it true that acyclicity and completeness imply transitivity?
Bhavook
  • 1
  • 3
0
votes
4 answers

Basics of "Concept of relation" and "less than equal to"

Let R be a relation defined on set of natural numbers N such that x is related to y iff x is less than equal to y i.e xRy iff x $\le$ y .Now I can understand this relation is reflexive and transitive but not symmetric but I want to ask whether (5,6)…
0
votes
1 answer

Intersection of 2 anti-symmetric relation

Theorem: The Intersection of 2 anti-symmetric relation is anti-symmetric. Proof: Let $R_{1}, R_{2}$ be two anti-symmetric relations and $R_{3} = R_{1} \cap R_{2}$ Then $(x,y) \in R_{3} $ $(x,y) \in R_{1} \cap R_{2}$ $(x,y) \in R_{1} \wedge…
0
votes
2 answers

$R$ is a partial order on nonempty finite set $S$, does $S$ contain an element $b$ such that if $aRb$ implies $a = b$

I do not know how to start. I tried to use property of transitive and reflexive to get $bRa$, but i cannot connect those together. Any hint on how to prove this?
B.LIANG
  • 23
0
votes
1 answer

Relation power composition

At the bottom of the picture below you can see, that $R^2 = R \circ R$, you can also see, that $R^3$ = $R \circ R^2$. My question is, would $R^4$ be $R^2\circ R^2$ or $R\circ R^3$
user504783
0
votes
1 answer

Composition of two relations

Among all students in a classroom we have a binary relations $\mathcal {R,S}$. Student A is in relation with student B, formally (A,B) $\in$ $\mathcal R$, iff - "A sits in the same row as B and B is not to the left of A" Student A is in relation…
Noturab
  • 497
0
votes
1 answer

Relation composition

I have a very hard time understanding composition of relations. The following is a composition I am trying to understand, but I cannot figure out where the composite pairs and the power pairs comes from.
user504783
0
votes
1 answer

Is non-divisible element maximal or minimal

There is a set called X; X = { 2, 5, 15, 40, 120, 111, 140 } And I drew the divisibility hasse diagram of this set. I know 120 and 140 are maximals, 2 and 5 are minimals, minimum and maximum dont exist. But I am not sure about is 111 maximal or…
0
votes
1 answer

Relations on N+, that show specific properties.

Im struggling to understand whether the relation "is a permutation of" on N+
mary
  • 3
0
votes
1 answer

Quick and easy question about anti-symmetrical property of relations

I'm studying for final exams by doing past-years exams and comparing my answers to the solutions that are appended at the end of the document. There is a problem that asks to list all the properties of a relation R = {(a, b) : a/5 = b/5} a,b are…
pbl
  • 91
0
votes
2 answers

Transitive closure R={(a,b),(b,a),(b,c),(c,d),(c,e)}

Choose the transitive closure of the relation R={(a,b),(b,a),(b,c),(c,d),(c,e)} My answer was (a,c),(b,d),(a,d),(b,e),(a,e) But it was wrong. The correct answer was: R={(a,a),(a,b),(a,c),(a,d),(a,e),(b,a),(b,b),(b,c),(b,d),(b,e),(c,d),(c,e)} I…
user504783
0
votes
2 answers

composition/power of relation

Let $A$ be a finite set so: $|A|=j$ and $S$ a relation on $A$. Prove that there are $i,j\in \mathbb{N}$ that $i>j$ and $S^{i}=S^{j}$. I tried to prove it with the definition, but without any success.
kicklog
  • 183
0
votes
2 answers

How can I prove that if a relation is symmetric then its inverse is also symmetric?

Prove that if $R$ is symmetric, then $R^{-1}$ is symmetric, $R$ being a relation over $A$, and $\lnot(A = \varnothing)$. This came as an exercise in my book. I couldn't do anything - there is no (evident) explanation about how to prove things…
Saturn
  • 7,191