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

Proving equivalence,partial order on a binary relation

Let $R$ be a relation on the set $\Bbb R$ of real numbers where real numbers $x,y$ satisfy $xRy$ if and only if $e^{x-y}$ is an integer. Is $R$ an equivalence relation on $\Bbb R$? Is it a partial order? I have proved it's reflexive let $x=1$.…
-2
votes
1 answer

Does S has to be transitive?

Let R,S be relations over A when R is a partially ordered set, S is a s symmetrical relation $R \subset S$. Does S has to be transitive? Thanks in advance!
user21312
  • 966
-2
votes
1 answer

Relations and functions

$$ g(x) = e^x-1, x\in\mathbb R\\ h(x) = \ln(\ln x),x>1\\ $$ By restricting the domain of $g$ to $(\alpha, \infty)$, where $\alpha \in \mathbb R$, find the smallest value of $\alpha$ in exact form such that the composite function $h\circ g$ exists.…
-2
votes
2 answers

Give me an example of a relation.

Give me an example of a relation which is: (i) Reflexive and Symmetric but not Transitive. (ii)Symmetric and Transitive but not Reflexive. I'm confused because I think a Ref. and Sym. relation must be Tra. and a Sym. and Tra. relation must be Ref.…
RE60K
  • 17,716
-3
votes
2 answers

Why isn't $\{(1,1),(1,2),(2,1)\}$ transitive relation?

As we knows that Transitive relation R is (a, b) € R and (b, c) € R implies (a, c) € R So we can suppose that let a be 1 and b be 2 and c be 1 Then, (a, b) € R means (1,2) € R and (b, c) € R means (2,1) € R implies (a, c) € R means (1,1) €…
5 Dots
  • 101
-3
votes
1 answer

Why does $<^{-1}$ not equal $>$?

Let us investigate the powers of $<$: ${<^1} = \{(0,1);(0,2);(0,3);...;(1;2);...\}$ ${<^2} = \{(0,2);(0,3);(0,4);...;(1;3);...\}$ ${<^3} = \{(0,3);(0,4);(0,5);...;(1;4);...\}$ ... ${<^N} = \{(0,N);(0,N+1);(0,N+2);...;(1;N+1);...\}$ ${<^0} =…
Xorter
  • 9
-3
votes
2 answers

Why is this relation $R=\{ (a,b), (b,c), (a,c) \}$ transitive?

I am confused here. For the set $\{ a, b, c\}$ how is the relation $\{(a, b), (b, c), (a, c)\}$ transitive ?
abhay
  • 1
-4
votes
1 answer

Cartesian Product and Relations

If a relation is defined between the first coordinate and the second coordinate of an ordered pair(aRb), then how come R = {(1,2),(5,6)} is a relation ? How can there be more than 1 ordered pair in a relation ?
Angie
  • 1
-4
votes
1 answer

Is the symmetric closure of a relation which is already transitive, itself transitive?

Let $R$ be a transitive relation. Is the symmetric closure of $R$ also transitive?
user107952
  • 20,508
-4
votes
1 answer

Relation Proof - Reflexive, Symmetric, Transitive

$A$ is the "absolute value" relation on $\Bbb R$: For all real numbers $x$ and $y$, $x A y\Leftarrow\Rightarrow |x| = |y|$. Determine whether the given relation is reflexive, symmetric, or transitive, or none of these. Justify your answer. I am…
bacon
  • 13
-6
votes
1 answer

Proving this relation is a function

I want to prove that this relation in $\Bbb R$ is a function. $$(x,y)\in\mu\iff|y|\le|x|\le1$$ I know that for a function that for every $x$ there is only $y$. I also know I can't disprove it, so how can I prove it is a function?
1 2 3
46
47