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

Prove there is only 3 non transitive relations on {a,b}

I know the 3 relations that aren't transitive $${A=\{(a,b) , (b,a)\}\\ B=\{(a,b) , (b,a) , (a,a)\}\\ C=\{(a,b) , (b,a) , (b,b)\}}$$ I can't use brute force as my proof and I'm stuck
1
vote
2 answers

$A = \{1; 2; 3; 4; 5; 6\}$ and define $aRb$ if a has remainder ≤ 1 when divided by b. Give the domain and range of $R$.

$A = \{1; 2; 3; 4; 5; 6\}$ and define $aR\mkern 1mub$ if $a$ has remainder ≤ 1 when divided by $b$. E.g. $4R\mkern 1mu3$ since $ \ 4/3 \ $ has a remainder of $1$, but not $2R\mkern 1mu5$ since $2/5$ has a remainder of $2$. Give the domain and range…
1
vote
0 answers

How to write piecewise relation

I have to write piecewise relation using set builder notation. $A$ and $B$ are non empty disjoint sets. And there are two bijections $f: A \to I_m $ and $g: B \to I_n$ where $m$ and $n$ are in $\mathbb{N}$. Here, $0 \in \mathbb{N}$. And we have…
user9026
  • 733
1
vote
1 answer

Why is $a \leq b$ ($a,b \in\mathbb{R}$) reflexive?

Definition of Reflexivity (Wikipedia): In mathematics, a binary relation R over a set X is reflexive if it relates every element of X to itself. ∀x ∈ X : x R x It can reflexive since it could be $a=b$ ($a,b\in\mathbb{R}$) But it could also be…
1
vote
2 answers

Functions and Relations 2

A relation R is defined on ordered pairs of integers as follows : $(x,y) R(u,v)$ if $xv.$ Then R is Neither a Partial Order nor an Equivalence relation A Partial Order but not a Total Order A Total Order An Equivalence relation
Gunjan
  • 89
  • 1
  • 4
1
vote
1 answer

How do I solve relations involving immediate predecessors?

Give the relation $R$ defined by: $(a,b) \in R$ if and only if a is an immediate predecessor of $b$ in $P$, where $P$ is the poset (partially ordered set) $$P = \{…
BigJamo
  • 13
1
vote
2 answers

A relation is asymmetric if and only if it's both antisymmetric and irreflexive

Prove A relation is asymmetric if and only if it's both antisymmetric and irreflexive Given a relation $\mathcal R$ on a set $A$ (a homogeneous binary relation),then: $\mathcal R$ is antisymmetric if : $$\forall a,b \in A:(a\mathcal R b \wedge b…
user801358
1
vote
1 answer

How to read symbolic representation of Empty relation?

While going through Relation I'm bit confuse on how to read the representation of empty relation. The ref. book I have, in that, it is represented following without proper parenthesis. $R = \emptyset \subset A \times A $ It should be read as $(R…
Ubi.B
  • 340
1
vote
1 answer

Is a relation that is purely reflexive also symmetric?

Is a relation that is pruely reflexive also symmetric? For example, say you have a relation defined as $R = \{(a,a),(b,b)\}$. This is purely reflexive, but is it also symmetric? The typical symmetric definition is $aRb \Leftrightarrow bRa$, which is…
Paul J
  • 11
1
vote
1 answer

Writing Euclid's proposition "Ratios which are the same with the same ratio are also the same with one another" in contemporary style

I need to write the Proposition 11 in Book 5 of Euclid's Elements according to contemporary style. It states that: Ratios which are the same with the same ratio are also the same with one another. The clue in book says that it is about…
user774037
1
vote
1 answer

Prove that this function is a order relation

Let M be a set and denote by $\mathbb{F}$ the set of all functions $f:M \rightarrow \mathbb{R}$, show that, $ f \leq g \Leftrightarrow \forall a \in M : f(a) \leq g(a) $ is a order relation for $(f,g) \in \mathbb{F} \times \mathbb{F}$ Is this a…
M-xyz1
  • 101
1
vote
1 answer

Is the following matrix that represents the relation on a set transitive in which would make it a partial order?

I understand that this is both reflexive and anti-symmetric. However, I don't think it's transitive. I understand that the classic rule is aRb, bRc, aRc. I can't seem to piece that together with this matrix. I've been asked to draw the Hasse…
1
vote
1 answer

Binary Relations and Total Orders

This question has two parts: 1) i) Given a relation $<$, define a relation $\leq$ by setting x $\leq$y if and only if x$<$y or x = y. Prove that if < satisfies transitivity and 'trichotomy' then $\leq$ is a total ordering. ii) Given a relation…
user70871
  • 149
1
vote
2 answers

Prove the relation 'x divides y' on the natural numbers is antisymmetric but not on the integers.

Here is my proof so far: Let x,y be in the Natural Numbers. Then, if x divides y and y divides x, there exist integers k, q such that y = kx and x = qy. So, y = kqy. Here is where I'm stuck. I know I am trying to get x=y in order to show the…
Emily
  • 123
1
vote
0 answers

Number of preorders on a set

Wikipedia states: There is a 1-to-1 correspondence between preorders and pairs (partition, partial order). I tried to calculate all preorder relations on a set with cardnilaity $n=2,3,4$ and I could not do that for the case $n=4$, also my strategy…
user715522