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

Listing the elements of an equivalence class

Say you have x = {1,2,3,4,5}, y ={2,5}, and c = {2,3} and the relation R: ARB iff AUY = BUY then asked to list all the equivalence classes of C I had put down [2] and [3], with [2] = {3}, but I'm not too sure if this correct
0
votes
1 answer

Prove equivalence relationship

How would I go about doing this? I assume proving it's reflexive, symmetrical and transitive Show that the relation $R = \{(x, y):3x − 5y \text{ is even }\}$ is an equivalence relationship.
user322290
0
votes
1 answer

Define a relation for "is contained in"

Here is my question (should help with my understanding of this new topic): Consider two words $x, y $ and say that the word $x$ is contained in the word $y$ if it only uses characters from $y$. Only the characters used in the word are relevant, not…
Rubicon
  • 616
0
votes
1 answer

Elements of a relation

So I proved this was a relation, but I'm having real trouble identifying the elements of the relation. I'm not quite sure what I am supposed to do. Are the elements of the relation [(0,3)] all of the solutions to 0 = 3c? Any help would be great. I'm…
k9b
  • 319
  • 1
  • 11
0
votes
0 answers

Relation and Cartesian Product

Let $A=\{-1,2,5,8\}$, $B=\{0,1,3,6,7\}$ and $R$ be the relation is one less than form $A$ to $B$. Then, 1) Find $R$ as a set of ordered pairs 2) Find domain and range of $R$. 3) Find $R^{-1}$ as a set of ordered pairs. 4) Find the domain and range…
0
votes
1 answer

Denotation of composite of relations

We denote the composite of relation R and relation S by $S \circ R$. Since the order matters, meaning composite of R and S is not composite of S and R. I am trying to understand why the denotation of composite of R and S puts S before R, which is…
peizhao
  • 103
0
votes
0 answers

Relations Question

I have some trouble understanding relatons. Below there is a question that I am working on. I believe that the a) part its correct but I have no idea how to do the b) and c) As part of a computer security system, you need to control which users have…
0
votes
1 answer

Extending relation to be transitive

I am lookign for an easy "algorithm" to extend relation (add some elements to it) to be transitive, say I use matrix representation of relation is there any trick that can help me to say if it is transitive or not?
lllook
  • 217
0
votes
3 answers

Is $a\sim b$ exactly when $a \times b$ is divisible by $3$ an equivalence relation?

Let $\sim$ be define so that $a\sim b$ exactly when $a \times b$ is divisible by $3$. Is this an equivalence relation? If not, which of the three properties (reflexive, symmetric, transitive) does not hold? Solution: We need to test each of the…
lucidgold
  • 1,054
0
votes
1 answer

$R_1=\{(x,y) \in R^2:-1 \le x \le 1,-3 \le y \le 2 \}$ graph

We have the following relation: $R_1=\{(x,y) \in R^2:-1 \le x \le 1,-3 \le y \le 2 \}$ Could anyone tell me how to make the graph for the above relation?
Legolas
  • 361
  • 1
  • 11
0
votes
1 answer

Prove or disprove that if a relation $R^2$ is transitive then $R$ is also transitive

Prove or disprove that if $R^2$ is transitive then $R$ is also transitive. I tried to prove $(R\circ R)^2\subseteq (R\circ R)\implies R^2\subseteq R$ this way $(R\circ R)\circ (R\circ R)\subseteq (R\circ R)\implies R^2\subseteq R$ $R\circ (R\circ…
lllook
  • 217
0
votes
1 answer

Trouble with understanding transitive, symmetric and antisymmetric properties

If $A = \{1,2,3\}$, $R$ an equivalence relation on $A$ if $R = \{(1,1), (2,2), (3,3)\}$? I'm having trouble understanding when a relation is symmetric, antisymmetric, or transitive. Does the symmetric property require that ordered pairs $(a,b)$ and…
London
  • 1
0
votes
2 answers

I need to prove that a relation is transitive.

I got $(x,y)R(u,v) \Leftrightarrow x + v = y + u$ I have to prove that this is a transitive relation. We did not do any examples how to do this at school so as far as I came was: $(x,y)R(a,b) \wedge (a,b)R(u,v) \Rightarrow (x,y)R(u,v)$ how do I go…
0
votes
1 answer

Partial ordering of natural numbers

How can I prove that the partial ordering of natural numbers has no least element? I genuinely have no idea how to do this. Q3c. This is not a homework/assignment task. It's a past exam paper which I am attempting to solve in preparation for my…
Azza
  • 55
0
votes
1 answer

How to prove that $(R; S;R)^n \subseteq (R; S)^n;R$ for all $n \geqslant 1$.

If $R; S$ be relations on a set $U$. Given $R$ is transitive. How to prove that $(R; S;R)^n \subseteq (R; S)^n;R$ for all $n \geqslant 1$.
TechJ
  • 295