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
1 answer

How do I say mathematically that a binary relation is reflexive?

[Symmetry is easy enough for me (assuming I'm even correct)... $$(\forall(a,b)\in\mathcal{R})[(b,a)\in\mathcal{R}]$$ but I don't know how to say it similarly for transitivity and reflexivity.. There's no single $a\in\mathcal{R}$, nor is there…
Mirrana
  • 9,009
0
votes
1 answer

$S = \{(x,y): x \text{ is a sibling of } y\}$. Why is this relation not transitive?

It seems to me that when we define "sibling" to mean a brother or a sister, if person a is a sibling of person b and person b is a sibling of person c, then person a is a sibling of person c.
0
votes
2 answers

Meaning of {(a, b) | x= ± b} ⊆ Z×Z and {(a, b) | x ≡ b (mod7)} ⊆ Z×Z

What elements would be in the given relations? If Z = all integers {(a, b) | a = ± b} ⊆ Z×Z for this relation I am thinking that the elements would be $$\cdots(-2,-2),(-1,-1),(0,0),(1,1),(2,2), (3,-3), (4,-4)\cdots$$ Just any number $(a,b)$ that…
Matthew
  • 13
0
votes
1 answer

Non-transitive relations defined on sets of cardinality 2

When thinking about transitive relations, I came up with this "theorem": All relations $\mathrm{R}: S\to S$ defined on $S = \left\{1, 2\right\}$ are transitive. But, I couldn't come up with a proof. So, can somebody help me and either prove the…
Truth-seek
  • 1,427
0
votes
1 answer

What is a relation $R$ called for which $\forall x,y,z: \neg (x R y \wedge y R z)$?

For a project, I am working with relations $R$ with the property: $\neg\exists x,y,z: x R y \wedge y R z$ Does this property have a name? If so, what is it?
0
votes
4 answers

Does the interpretation of " $\forall$ " differ in these contexts?

I have a set $A= \{1,2,3,4\}$, Reflexive Relation : If $(a,a) \in R \ \forall a \in A$ then it's a reflexive relation. Note : for all $a \in A$ This means, $R$ is a Reflexive Relation as long as it contains $(a,a)$ for all $a$ it doesn't matter…
William
  • 4,893
0
votes
3 answers

How is this case a reflexive relation?

My textbook says, if $R$ is a reflexive relation on set $A=\{1,2,3,4\}$ then $R = \{ (x,x) : \forall x \in A\}$ then it proceeds on with $2$ examples. $$R_1= \{ (1,1),(2,2),(3,3),(4,4) \}$$ Alrighty, this is fine and makes sense. Every $x\in A$…
William
  • 4,893
0
votes
1 answer

Properties of equality

Why is this relation transitive? $R = \{(x,y)\in\Bbb N^2\mid x + 4y = 10\}$
zion
  • 123
0
votes
1 answer

Antisymmetry relations

Let $R$ be the relation on $\mathbb{Z} \times \mathbb{Z}$ defined by $(w, x)R(y,z)$ if and only if $w + x \leq y + z$. Let $S$ be the relation on $\mathbb{Z} \times \mathbb{Z}$ defined by $(w, x)S(y,z)$ if and only if $w \leq y$ and $x \leq z$. (a)…
user557403
0
votes
1 answer

Is this relation R transitive?

There's a problem on my homework that asks if a "binary relation is transitive" and I'm really confused on how I should start this problem. Most examples of proving transitivity online are of sets, but this question asks about the relation $R:…
0
votes
1 answer

Is the below relation transitive?

Is the below relation transitive? The theorem says if (a,b) and (b,c) belong to a relation, then (a,c) also does. I am confused because (3,2) and (2,3) is like (a,b) with (b,a) and (3,3) like (a,a), and something is wrong here, or the relation or…
0
votes
0 answers

Naming a binary relation

I have a non-symmetric binary relation R over a set X from which I derive the symmetric relation $$ R'(x,y) : \Leftrightarrow R(x,y) \text{ or } R(y,x) $$ Is there a common name for this construction?
0
votes
1 answer

Right Hasse diagram for a partial order?

$A = \{(−7, 1), (−5, 1), (−3, 1), (−1, 1), (−7, 3), (−5, 3), (−3, 3), (−1, 3), (−7, 5), (−5, 5), (−3, 5), (−1, 5), (−7, 7), (−5, 7), (−3, 7), (−1, 7)\}$ I tried to plot it and got the following: I feel like it is incorrect due to the amount of…
Rick
  • 65
0
votes
2 answers

If $B$ is a set ordered (partially or fully) under $S$ then $S=S^2$?

If $B$ is a set ordered (partially or fully) under $S$ then $S=S^2$? Intuitively this seems right. We know according to the definition of ordered sets that $S$ is reflexive, antisymmetric and transitive. Let $S=I_B\cup R$ where $I_B$ is the…
Yos
  • 611
0
votes
1 answer

How to describe the given relation on A using set builder notation?

A = {0, 1, 2, 3, 4} S = { (0, 4), (1, 3), (2, 2), (3, 1), (4, 0) } S is a relation on set A. How do we describe this relation? Is the following description correct? S = {(x,y): x ∈ A, y ∈ A, x + y is even} And can we write x,y ∈ A at once or we…