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

Finding relation between elements

I have seen the following type of problems in reasoning tests: If $A \le B = C > F < G = L$ , then which of the following is true? a. $A < G$ and $A >F$ b. $C >F$ c. $G =B$ [Answers are given by me just as examples.] Can anybody explain a nice…
Dinesh
  • 105
1
vote
3 answers

Is the relation $(a,A)R(b,B)\iff A\cup[0;b]=B\cup[0;a]$ transitive?

Let $R$ be a relation on $\mathbb{N}\times\text{power set}(\mathbb{N})$, defined as $$(a,A)R(b,B)\iff A\cup[0;b]=B\cup[0;a]$$ Is $R$ transitive? As the notation $[0,x]$ caused confusion in one of the answers, let me clarify that this means all real…
SAQ
  • 367
1
vote
1 answer

relations - examples and counterexamples

The question is to find an example of a set $S$ and three relations $R_1$, $R_2$, and $R_3$ on it, such that $R_1$ is reflexive but not transitive, $R_2$ is transitive but not symmetric and $R_3$ is symmetric but not reflexive. This is what I have…
1
vote
0 answers

How can I formally express that a relation is monotonic?

This is my first question on math stackexchange, so please be gentle. I have different relations and need to check if they are monotonic. For instance: $$R = \{ (0,0),(0,1),(1,1) \} $$ Is it formally correct to write the monotonicity criterion…
1
vote
1 answer

Are $m$-transitive relations also $n$-transitive for $n \geq m$?

Let $R$ be a binary relation on a set $A$, let $n$ be a positive integer, and let $x_1,...,x_{n+2}$ be a list of $n+2$ distinct variables. I define $R$ to be $n$-transitive if for all $x_1,...,x_{n+2}$ in $A$, $(R(x_1,x_2) \land ... \land…
user107952
  • 20,508
1
vote
1 answer

Definition of well defined operation

At https://proofwiki.org/wiki/Definition:Well-Defined/Operation , a well-defined operation is defined as: $$x, x' \in [x]_{\mathcal R}, y, y' \in [y]_{\mathcal R} \implies x \circ y = x' \circ y'$$ shouldn't this be written as: $$x, x' \in…
vkubicki
  • 1,874
  • 12
  • 27
1
vote
0 answers

Composition of congruence relations modulo n

I have the following exercise: In set $X$, let $\mathrel{R_1}$ be the congruence relation modulo 2, and let $\mathrel{R_2}$ be the relation of congruence modulo 3. Determine $\mathrel{R_1}\circ\mathrel{R_2}$. And i think that in my solution I did…
1
vote
0 answers

Set Theory: with an introduction to Real point sets

In the book Set Theory: with an introduction to real point sets (problem 15 on page 9) The problem states: If $\mathcal{R}$ is a relation, then $\mathcal{R}$ is a relation on some set $A$. How can I prove this? (In particular, how would one…
1
vote
1 answer

How can less-than-or-equal be "reflexive"?

I just don't get how anything can be in relation to itself in any other way than being equivalent (being "the same"). How can some x be smaller/less than x? Intuitively, this makes no sense to me because if it were smaller it would not be in…
1
vote
1 answer

Is equality a necessary condition for anti-symmetric relation

There are two questions S is the set of all people and R is the relation on set S such that $(a, b) \in R$, where $a$ and $b$ are people if $a$ is taller than $b$ According to the solution, this relation is anti-symmetric, which makes sense at…
Aditya
  • 6,191
1
vote
1 answer

Given the relation find if it is transitive

Given $S = \{1,2,3,4,5\}$ Relation $R=\{(x,y)|x-y=0\}\subset S\mathbb x S$ Create the set $M = S\mathbb x S$ $M = \{\\ (1, 1), (1, 2), (1, 3), (1, 4), (1, 5), \\ (2, 1), (2, 2), (2, 3), (2, 4), (2, 5), \\ (3, 1), (3, 2), (3, 3), (3, 4), (3, 5),…
Abbas
  • 437
1
vote
0 answers

Is the empty relation invertible?

$A$ is a nonempty set. The empty relation $\emptyset$ is a relation on $A$. Is the relation $R=\emptyset$ invertible in $(R(A),\circ)$? I think no because there is no $S\in R(A)$ such that $\emptyset\circ S = I$, the identity relation. If $A$ is an…
Annai
  • 63
1
vote
2 answers

If $X = \{1,2,3,4,5\}$ and $Y = \{1,3,5,7,9\}$, determine which of the following sets represent a relation?

Question: If $X = \{1,2,3,4,5\}$ and $Y = \{1,3,5,7,9\}$, determine which of the following sets represent a relation? Options: A) $R_1=\{(x,y):y=x+2,x\in X,y\in Y\}$; B) $R_2=\{(1,1),(1,2),(3,3),(4,3),(5,5)\}$; C)…
1
vote
1 answer

Problem understanding domain of circular relation

I came across an exercise in a book which introduces the circular relation as: $C$ is a relation from $R \to R$ such that $(x,y) \in C$ means $x^2+y^2 = 1$. It then says that the domain of $C$ is $R$. However, as I understand things, the domain…
ankush981
  • 2,033
1
vote
1 answer

Proof Transitivity of given Relation which is not reflective or symmetric

I have to proove that following relation is transitive: $\sim \ :=\ \{ (n,0) \ |\ n \in \mathbb{N}\setminus \{0\} \} \subseteq \mathbb{N} \times \mathbb{N}$ For me it is not transitive, because $n\sim0$, but $0$ is not in relation to some number…
swag
  • 21