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

Properties of $(m, n) ∈ R \iff m > n$

Given the following relation, which properties does it fulfill? Is my reasoning correct or am I missing something? $(m, n) ∈ R \iff m > n$ 1.) reflexivity no, $1 > 1$ (trivially false) 2.) symmetry no, since $x > y\not\rightarrow y > x$, since $2 >…
0
votes
1 answer

Does the range of a one-one function need necessarily to be equal to its co-domain?

I came across a question which says- "If a set A contains 7 elements and the set B contains 8 elements, then number of one to one mappings from A to B is:" The answer is given zero The explanation for the answer says that since n(A) is not equal to…
0
votes
1 answer

Prove: Given that $R,S$ are equivalence relations then if $R \circ S$ is transitive then $R \circ S \subseteq S \circ R$.

In another post entitled: "Proof that composition of equivalence relations $R$ and $S$ is transitive if and only if $R \circ S = S \circ R$" the following proof is given for the forward direction. Assume $R\circ S$ is transitive. Let $(a,c) \in R…
0
votes
1 answer

Can a relation be non reflexive, non symmetric, non antisymmetric and not transitive?

Lets say I have {a,b,c,d} I though of (a,b)(b,c) - but this is antisymmetric, right? Then I though of (a,b)(b,a)(b,c) but this time is transitive Finally I tried with (a,b)(b,c)(c,d) but again, is this antisymmetric?
0
votes
1 answer

Let $A = \{1, 2, \ldots , n\}$ and R be the set of all equivalence relations on $A$.

Let $A = \{1, 2, \ldots , n\}$ and R be the set of all equivalence relations on $A$. Let $∼$ be the relation of equivalence over the set R, defined by: $R ∼ S \iff |A/R| = |A/S|$. Find $|R/∼|$. The smallest inclusion-wise equivalence relation over…
SAQ
  • 367
0
votes
1 answer

Determine whether a relation is symmetric

Let $R$ be a relation on $\mathbb{N}\times \text{power set}(\mathbb{N})$, defined as $$(a,A)R(b,B)\iff A\setminus B\subseteq\{a,b\}$$ Determine which of the properties reflexivity, symmetry, antisymmetry, and transitivity the relation $R$ possesses.…
SAQ
  • 367
0
votes
0 answers

$\equiv$ is an equivalence relation on $P(\mathbb{N})$

$\equiv$ is an equivalence relation on $P(\mathbb{N})$ ($P(A)$ denotes the power set of the set $A$) defined as $$A\equiv B \iff A,B\subseteq \mathbb{N} \land (\forall X\subseteq\mathbb{N})[A\cup X=\mathbb{N}\iff B\cup X=\mathbb{N}]$$ Is…
SAQ
  • 367
0
votes
0 answers

Find the number of all relations which are both both symmetric and antisymmetric.

Let $A=\{1,2,\ldots,n\},n\ge1$. Find the number of all relations $R\subseteq A\times A$ which are both both symmetric and antisymmetric. Okay, so a relation is symmetric if $(\forall a\forall b)(aRb\Rightarrow bRa)$ and a relation is antisymmetric…
SAQ
  • 367
0
votes
0 answers

Can an equivalence relation contain the null set?

An arbitrary partition $F$, for some equivalence relation $R$, importantly does not contain any set $X$ such that $X = \emptyset$. However, is it possible for a constituent equivalence class, $[x]_R$ to contain the null set? I don't mean this in the…
idk
  • 125
0
votes
2 answers

Abstract Algebra topic: Equivalence relations

If R1 is reflective and not transitive, R2 is transitive but not symmetric and R3 is symmetric but not reflexive. We need to find an example of a set S and the three relations R1 R2 R3.
0
votes
0 answers

Relation That is Symmetric and Anti-symmetric but neither reflexive nor transitive

Let $Q = \{A,B,C\}$. I argue that a relation on A that is symmetric and Anti-symmetric but neither reflexive nor transitive is the relation $R$ such that $R =\{\}$. This I think is correct because both symmetry and anti-symmetry are "if...then"…
0
votes
0 answers

Distance between relations

Assume I have two binary relations $R_{1}$ and $R_{2}$ on a set $S$, i.e., two subsets of $S \times S$. I want to compare these two relations in terms of similarity. Is there any distance metric that I can apply? The two relations are both complete,…
Florian
  • 331
0
votes
0 answers

Give examples of such a non-empty transitive and non-transitive relations $r$ in the set $\mathbb N$

Provide an example of a non-empty transitive relation $r$ on the set $\mathbb N$ such that the relation $r^{\exists}$ defined in the set $\mathcal{P}$($\mathbb N$) by the condition: $$\langle X, Y \rangle \in r^{\exists} \iff \exists x \exists y (x…
user1238511
0
votes
1 answer

A relation $R$ is defined on a set of real numbers $R$ as $R=\{(x,y):xy \text{ is irrational number}\}$. Check whether R is transitive.

In the book they solve it by taking examples. Let x be this,y that,z and y those and they just put in condition. But all values do not give same result. I took $x$, $y$, $z$ as $\sqrt 3$, $\sqrt 2$ and $4$. Let $(x,y),\ (y,z) \in R$, $xy\in R$ and…
0
votes
0 answers

Prove that $R=\{(M_1,M_2)\in P(N)\times P(N)|M_1\cap M_2=S\}$, for a fixed $S\in P(N)$, with $S\neq N$, $S\neq\varnothing$ is transitive

It is not so clear to me whether this relation is transitive. I have two ideas, one - relation transitive, other - non-transitive. I have so proved that you are transitive: Let $M_1RM_2 \iff M_1 \cap M_2 = S$, $M_2RM_3 \iff M_2 \cap M_3 = S$, for…