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

Number of relations on 6 element set which are both symmetric and reflexive but not anti-symmetric.

I did this by imagining a Venn diagram. Number of relations which are Reflexive and Symmetric would be given by $2^{\binom{n}{2}}$ . Now, this also contains some Anti-symmetric relations. Number of relations which are Reflexive, Symmetric and…
1
vote
1 answer

$\rho$ antisym., irreflexive, $\rho ^t$ its transitive closure. Prove or disprove: $\rho ^t$ reflexive $\Rightarrow$ $\rho ^t$ symmetric

Let $\rho$ be an antisymmetric, irreflexive relation, and $\rho ^t$ its transitive closure. Prove or disprove: $\rho ^t$ is reflexive $\Rightarrow$ $\rho ^t$ is symmetric. I tried to prove that $\rho ^t$ is symmetric by proving that if $(x,y)\in…
mathbbandstuff
  • 657
  • 3
  • 15
1
vote
1 answer

Relation of divisibility {0,1,…,20} - Hasse diagram

I am trying to draw a Hasse diagram of divisibility but AFAIK it's not correct. I connected 4 with 8 , 12 and 20. 6 with 18 and 12, 5 with 15 and 10, 3 with 9, 6, 15 H 2 with 6, 4, 10 and 14. 1 with prime numbers Is this correct? Thanks. The rest…
Shelley
  • 483
  • 2
  • 7
1
vote
1 answer

Determine if a relation is transitive.

Decide if the following relation on X is transitive: X = Z, with relation a R b if −7 ≤ a − b ≤ 7 By adding −7 ≤ a − b ≤ 7 and −7 ≤ b − c ≤ 7 by parts, I found −14 ≤ a − c ≤ 14 , which gives a clue but is not enough since I need to prove (or…
user600210
1
vote
2 answers

If $xR_1y$ if $x^2 + y^2$ is divisible by $5$, is the relation transitive?

Been asked to prove if this is/isn't transitive. Not sure where to start on if it is transitive or not. Also by proving it is/isn't, do I simply need to give an example where it is/isn't true? Thanks!
AnoUser1
  • 169
  • 2
  • 9
1
vote
1 answer

Transitive vs Acyclic Relations

My question is that if a relation is transitive does it have to be acyclic? My first thought is yes, because if aRb, bRc, cRd then by transitivity aRc, bRd and applying transitivity once more implies aRd, thus R is acyclic because c cannot be…
Ravendi
  • 13
1
vote
1 answer

Help showing this is an equivalence relation

I need help with question as following: $X= \mathbb{Z}\times \mathbb{Z}$ I need to define the relation $R$ on $X$ as follows: $(X_1,X_2)R(Y_1,Y_2) \longleftrightarrow (X_1)^2+(X_2)^2=(Y_1)^2+(Y_2)^2$ Can you prove it using (X)R(Y) ?
akerman
  • 27
1
vote
1 answer

How many relations are anti-symmetric and symmetric?

It is easy to show that number of symmetric relations on a set $S$, with $~|S|=n~$ is $2^{\frac{n(n+1)}{2}}$ and (little bit tougher) that, number of anti-symmetric relations is $2^n3^{\binom{n}{2}}$( here it was asked). But, how many relations are…
user579462
1
vote
1 answer

Relation that is acyclic and complete but not transitive

I know this has been asked before, but the answer provided contradicted what I've been taught. I've been taught that it is possible for a relation to be acyclic and complete without being transitive. Is there a simple counter example that I am…
1
vote
1 answer

Relation and Function problems

Trying to solve these problems for a whole day, but just can't figure out where to start. let $\Sigma=\{a,b\}$ and $L = \{w \in\Sigma^*: 3\mid\text{length}(w)\}$ Define R ⊆ Σ * × Σ * as follows: (w, w' ) ∈ R if there is a v ∈ Σ * such that: either…
DSt_FTW
  • 41
1
vote
1 answer

Proving the antisymmetric property of the relation $R = \{(x, y) \in\Bbb R \mid x < y$ }

The relation is $R = \{(x, y) \in\Bbb R^2 \mid x < y \}$ How can I prove antysimetric property for the relation? Antisymmetric property states that IF $x R y$ and $y R x$, THEN $x = y$. The thing is, in this relation, the first part of the property…
tobi
  • 73
  • 10
1
vote
1 answer

Relational Notations for "must be" and "occasionally"

I have seen in some places; single relational symbols (particularly $\neq , \lt, \gt, \leqslant, \geqslant $) are being used for more than one sense; usually 2 sense, such as (1.) "exactly" or "always" and (2.) "Not necessarily", or "There may be…
user379641
1
vote
1 answer

Powers of a Relation.

Q. Let R be a binary relation on $A=\{a,b,c,d,e,f,g,h\}$ represented by the following two component digraph. Component 1 - cycle of length 3. Component 2 - cycle of length 5. Find the smallest integers $m \ and \ n$ such that $ m
user9014873
  • 131
  • 1
  • 2
  • 6
1
vote
2 answers

Finding all the relations of a given possible subsets.

I am studying relations and I know that if the Cartesian product $A \times B$ has $n$ elements then the number of relations are $2^n$. Now let us take a set $A$ and $B$ such that $A =\{1\}$ and $B = \{2\}$. Then the Cartesian product $A \times B$…
1
vote
1 answer

For acyclic binary relation $B$ on set $X$, there is a pair $(a,b)\in B$ s.t. $(b,c)\not\in B$ for all $c\in X$?

Is this true (I can't think of counter-example). Thus, How to prove this? (assume $X$ finite with cardinality $\geq 3$, and that $B$ contains at least 2 pairs) Intuitively, i believe the argument is just that there is some "end pair", $(a,b)$ in…