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

Finding the present property

For each relation, determine which of these properties are present: reflexivity, symmetry, antisymmetry, and transitivity: I know the definitions of each of the properties but unclear as to how to apply them to each relation. {(a,a), (a,b), (b,a),…
0
votes
1 answer

Is this relation transitive?

R: { (1,1), (1,3), (2,2), (3,1) } My answer is no. My logic is that If (3,1) is in the relation, and (1,3) is in the relation, that implies that (3,3) must also be in the relation. Just wanted to verify if this is correct.
0
votes
2 answers

Find a relation over $P(${$1,2,3$}$)$ such that $|R|=12$ and the transitive closure of $R$ is the proper subset relation

I'm having trouble finding relation $R$ over $P(${$1,2,3$}$)$ such that $|R|=12$ and the transitive closure of $R$ is $T$, the proper subset relation over $P(${$1,2,3$}$)$. My thoughts: a pair of subsets $(A,B)$ of {$1,2,3$} $\in$ $T$ if and only…
ruplop
  • 137
0
votes
2 answers

Find the transitive closure of {$(1,2),(2,3),(4,4),(5,4),(5,7)$}

I want to find the transitive closure of $R=${$(1,2),(2,3),(4,4),(5,4),(5,7)$}. I'm having trouble with transitive closure. We have that $(1,2)$ and $(2,3)$, so the transitive closure of $R$ is $R ∪ $ {$(1,3)$}. Is this right? Thanks.
ruplop
  • 137
0
votes
1 answer

Proving equivalence relations in special symbols

For a function $f: A\to B$, I have a relation $@$ on $A$ described by $(\forall x,y \in A)\quad x @ y \Leftrightarrow f(x) + f(y)$ Is there any way to show that $@$ is an equivalence relation?
0
votes
1 answer

Given a Relation (set of ordered pairs), prove transitivity without going through each pair?

Give a relation, R, on the set of integers, such as R = {(1,2)(2,2) ... } is there a way to determine transitivity without going through each ordered pair (x,y)(y,z) to see if (x,z) is there?
compguy24
  • 421
0
votes
1 answer

Relation $R$ on $V$ is given by $x+y$ is even

A relation $R$ on $V$ is given by $x+y$ is even. How can we show that if integers $x$ and $y$ are $R$-related then either $x$ and $y$ are both even or $x$ and $y$ are both odd? I've been looking through Google for information on how to answer…
jackdh
  • 161
  • 1
  • 10
0
votes
2 answers

Describing equivalence classes

The problem is : define relation equivalence on Z by $m=n$ in case $m^2=n^2$. a)Show that its an equivalence relation on Z. b)Describe the equivalence classes for = how many are there. For part a, I proved it to be true by showing that it's…
0
votes
1 answer

Understanding relations when it's about $\langle{x,x}\rangle$ instead of $\langle{x,y}\rangle$

I have difficult to understand relations when we talk about $\langle{x,x}\rangle$ instead of $\langle{x,y}\rangle$ .. it's hard for me to realize for example is the following relation is reflexive, irreflexive, symmetric, asymmetric, antisymmetric,…
basratio
  • 303
0
votes
3 answers

How can I prove that $(a,b) = (c,d) \land (c,d)=(e,f) \implies (a,b)=(e,f)$ is true

I am trying to prove this relation, but I just cant. I know it is true, but I can not prove it, because I dont know how. Can someone give me some pointers. $(a,b) = (c,d) \land (c,d)=(e,f) \implies (a,b)=(e,f)$ Thanks??? EDIT: This is the part of…
depecheSoul
  • 913
  • 7
  • 13
0
votes
1 answer

reflexive relations

Let $R_1, R_2$, relations such that: $R_1 \subseteq R_2$. If $R_1$ is reflexive then $R_2$ is also reflexive. I understood it's true, but I don't see why. if $R_1 \subseteq R_2$ there's $\left\langle {x,x} \right\rangle \in {R_2} \wedge…
AndrePoole
  • 3,271
0
votes
1 answer

Questions regarding composition and constant function

Suppose A is a non-empty set and f is a function on A. Suppose for all g(which is also a function on A), composition of functions f and g is f, then f is a constant function. I try to prove it but the attempt turned out to be futile. First I have…
0
votes
1 answer

Question on proving relations

State whether the following statement is true, and either prove it or provide a counter example: Every Relation R on {0,1} satisfies R∘R subset of R. This is a past paper question for an exam I have to sit tomorrow and I can't work out how to answer…
0
votes
2 answers

$X=\{1,2,\dots,10\},x\rho y\Leftrightarrow x\equiv y(mod\hspace{0.2cm}3)$

$X=\{1,2,\dots,10\},x\rho y\Leftrightarrow x\equiv y(mod\hspace{0.2cm}3)$ i.e $x,y$ have the same reminder when divided by $3$ ( it was actually written in the question). I need to find the number of elements in $\rho$ Clearly $\rho$ is a reflexive…
Myshkin
  • 35,974
  • 27
  • 154
  • 332
0
votes
2 answers

Points of a relation

I have the following relation: $M =${$ (x,y), x =$$ {1}\over{t+1}$, $y =$$ {5t + 8}\over{t + 1}$,$t\in\mathbb R$} The task is to sketch the points of M into a coordinate system! But my opinion is that this would mean that i would have to paint the…