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

Proving that these two definitions of this equivalence relation are the same

Consider a powerset $P(X)$ of a set $X$. On $P(X)$, we define two equivalence relations. The first is defined as "$S+T$ is a finite set". (where $S$ and $T$ are subsets of $X$, and $+$ denotes symmetric difference). The second is defined as "there…
user107952
  • 20,508
0
votes
2 answers

Let $R$ be a relation on a set $A$. Define $T(R)=R\cup R^{-1} \cup \{(x,x)\mid x \in A \}$. Show that $T(R)$ is reflexive and symmetric.

Let $R$ be a relation on a set $A$. Define $T(R)=R\cup R^{-1} \cup \{(x,x)\mid x \in A \}$. Show that $T(R)$ is reflexive and symmetric. Let $\triangle = \{(x,x) \mid x\in A\}$ I only know that $R \cup \triangle$ is the reflexive closure and $R \cup…
lap lapan
  • 2,188
0
votes
1 answer

how to find maximal chain and antichain of a given partial order

I have a partially ordered set , and I'm asked to find the maximal chain and antichain of : $A=${$1,2,\dots,7$} with a relation $R$ s.t. $R=I_A \cup ${$(a,b)|a,b \in {1,2,\dots,5} \space and \space a < b $}$\cup${$(6,7)$}
AhmadJo
  • 19
0
votes
1 answer

Assymetric relation?

Hello I have a question about this task, if anyone had a similar problem it would help me. The task is: Is this relation asymmetric ? $(x,y)\rho(a,b)\rightarrow x+y=a+b$ Thanks in advance !
LogicNotFound
  • 465
  • 2
  • 6
0
votes
2 answers

How to prove that for any partial order R exists S partial order so that R is a subset of S. S not equals R.

How to prove that for any partial order $R$ on $A$ exists $S$ partial order on $A$ so that $R$ is a subset of $S$. $S \ne R.$ I have tried to create a new relation S which is A Union of R with a pair $(a,b)$ that $(a,b),(b,a)$ not belong to R.…
Daniel
  • 1
0
votes
0 answers

Relation with $sgn$

I have a problem with this task. If anyone had a similar problem it would help me. The task is: In the set $S\in[-\pi,\pi]$ a binary relation is defined ρ with $xρy⟺sgn(\sin(x-\pi))=sgn(\sin(y))$. Examine whether the relation is an equivalence…
LogicNotFound
  • 465
  • 2
  • 6
0
votes
1 answer

Function to get various numbers based on two inputs

I have some "centering" rules that involve a calculation using a count and index. Both count and index are between 1 and 5. The goal is to center a set of items around a given starting point ( in this case -12 ). The returned value is determined as…
JacobIRR
  • 147
0
votes
1 answer

Prove that it is impossible to define any non-trivial partial order on $Z_n$, which can be > compatible with addition operation on $Z_n$

I was given the following task to prove $Z_n = Z/R $ with operations of addition and multiplication. Prove that it is impossible to define any non-trivial partial order on $Z_n$, which can be compatible with addition operation on $Z_n$, i.e $a \le…
0
votes
1 answer

Show that operations of addition and multiplication on $Z$ are "agreed" with this equivalence relation.

I was given the following task to solve Let $n > 1$ be a natural number. Define on $Z$ the following relation: $x \equiv y$ mod $n$ if $x-y$ can be divided by $n$. Show that operations of addition and multiplication on $Z$ are "agreed" with…
0
votes
0 answers

Prove whether or not the relation is a partial order

How I would go about proving that the below is or isn't a partial order: consider the set $\ \mathbb{Z}\ $ of integers: $aRb \ $ if $\ b = ra \ $ for some positive integer $r$ It adheres to the anti-symmetric property as: $\ (a,b)\ and\ (b,a)\ \in R…
0
votes
0 answers

Relation of equivalence

I need help solving this task, if anyone had a similar problem it would help me. The task is : Show that the relation $\rho$ is introduced on the set $\mathbb{Z}$ in the following way $(x,y)\in\rho \iff $exists $k\in\mathbb{Z}$ such that it is…
LogicNotFound
  • 465
  • 2
  • 6
0
votes
1 answer

Which of the following relations are partially ordered relations and which are linearly ordered relations.

I was given the following task to do Which of the following relations are partially ordered relations and which are linearly ordered relations. $ (x, y) \preceq_1 (x', y') $ if both $x \le x'$ and $y \le y'$ are true. $ (x, y) \preceq_2 (x', y') $…
0
votes
1 answer

Given two relations R, S on a Set X (so that R, S ⊆ X . X) : Prove or disprove, If R and S is transitive, then so is R ∪ S

How would I go about solving this problem? Usually there is some set A, where you could deduce transitivity. But This is on the relation X times X
user820926
0
votes
1 answer

Intuition for proving that if $S \circ R \subseteq R \circ S$, then $R \circ S$ is transitive.

This is an exercise from Velleman's "How To Prove It". It has been asked on this site before and is fairly easy to prove mechanically, but I am confused about how to interpret it intuitively. Suppose $R$ and $S$ are transitive relations on $A$.…
Iyeeke
  • 962
0
votes
2 answers

Prove $\mathcal{R}:=\left\{\left(a,b\right)\mid a\le b\right\}$ is not symmetric

Given a homogeneous binary relation $\mathcal{R}$ over a set $A$,and is defied as: $$\mathcal{R}:=\left\{\left(a,b\right)\mid a\le b\right\}$$ Prove $\mathcal R$ is not symmetric. I don't understand why $\mathcal R$ is not symmetric,indeed it's…
user801358