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

Representation of a relation R from A to B as a function

I am currently studying for my first exam as a maths student, and is stuck on the problem below. I understood the solution when I saw it, but I am not quite sure of how to explain it properly. If anyone might be able to explain the solution, feel…
0
votes
0 answers

Is relation $R={(1,2), (3,4), (5,6), (7,8), (9,10)}$ transitive if $A=\{1,2,3,4,5,6,7,8,9,10\}$ subset of naturals?

I know that at first this sounds like a stupid question but I'm not sure about its meaning. Transitivity states that whenever $(a,b) \in R$ and $(b,c) \in R$, then $(a,c) \in R$, where R is the relation. Take for example the elements $a=1, b=2$.…
0
votes
0 answers

Is the following binary relation transitive?: (x,y)R(u,v) iff x*y - u*v ≥ 1, where R represents at least as good as.

So, we have the binary relation defined by (x,y)R(u,v) iff xy - uv ≥ 1, where R represents at least as good as. What I already have is: For any (x,y), (u,v), (r,t) in X (the alternatives set), [(xy-uv≥1)^(uv-rt≥1)] -> (xy-rt≥1) I need to prove…
0
votes
1 answer

Checking if a relation on a set is reflexive, transitive, symmetric

I am trying to understand how one can check to see if a relation on a set satisfies the properties of reflexivity, transitivity and symmetry. To be more specific, I work with two examples in which I try to figure out whether these 3 properties hold.…
0
votes
2 answers

Proving $R^n$ is antisymmetric when R is antisymmetric

Needing to solve this problem in a past paper. Not even sure where to start. Let $R$ be a binary relation on some set S. Prove or disprove the following claim. "If $R$ is antisymmetric then $R^n$ is antisymmetric for every positive integer $n$".
Kom
  • 303
0
votes
1 answer

How to arrive at the conclusion of an implication using the hypothesis when proving R is an equivalence relation.

How do i prove that this is a equivalence relation I'm aware this may get removed as a dupe but I can't comment on that post since I'm below 50 reputation. I think the answer the post got just highlighted the thing I don't understand about relations…
0
votes
1 answer

Finding transitive closure

Answer the following, related to the relation $R$ on domain $D$, where $D = \{1,2,3,4,5\}$ and $R=\{(1,1), (2,2), (3,3), (4,4), (5,5), (4,3), (3,4), (5,4), (4,5), (5,2), (2,4)\}$: List the elements in the transitive closure of $R$. This is my…
0
votes
1 answer

For transitive relations, do a, b and c have to be unique?

Theorem: If a relation is symmetric and transitive then it is reflexive. Proof. Let R be a symmetric and transitive relation. Take elements x,y satisfying x R y. Then y R x (since R is symmetric), and so by the transitive law x R x. So R is…
kiwizor
  • 13
0
votes
1 answer

Relations: Completness implies reflexivity

I just wanted to check if this proof works, as I couldn't find anything online. Thanks! A relation is complete: $(_xR_y) \cup (_yR_x)\; \forall x,y \in X $ A relation is reflexive: $(_xR_x) \; \forall x \in X $ Proof by contradiction that…
CormJack
  • 422
0
votes
0 answers

How can the set A = {(a, b), (b, c), (a, c)} be proven to be transitive using the alternative definition?

I understand how this satisfies the definition typically used for ordered pairs. But how does this satisfy the requirement that every element $x$ in $A$ must be a subset of set $A$? I know that $A$ can also be written as $\{\{\{a\}, \{a, b\}\},…
0
votes
2 answers

How to identify if a relation is a function?

Consider the relation $R= \{(x, y) \mid x-y = 0 \} \subset \mathbb{R} \times \mathbb{R}$ on the set $\mathbb{R}$. Which of the following is/are true? $R$ is a transitive relation. $R$ is a function. $R$ is not an equivalence relation. $R$ is a…
Abbas
  • 437
0
votes
1 answer

Simple assignment relation is always Identity Relation?

I am learning Relations and I was confused by the fact that simple assignment relations The given relation $R= \{(x, y) | x-y = 0 \} \subset \mathbb{R} \times \mathbb{R}$ on set R. The ordered pairs generated are $R= \{... (-4/3, -4/3)..(-1,…
Ubi.B
  • 340
0
votes
1 answer

why does a relation have to be a subset of a cartesian product?

it seems that everything I read about relations stresses that they are a subset of a cartesian product. Sometimes, they will say that a cartesian product itself is a relation. This seems confusing to me. If a cartesian product can be considered to…
Mordechai
  • 103
0
votes
2 answers

What’s the difference between irreflexive and anti-reflexive and are the definitions for asymmetric and anti-symmetric similar?

Are these definitions correct? Irreflexive: A relation is irreflexive If For some a, a is not related to a Anti-reflexive: For all a, a Is not related to a. Are the definitions for asymmetric and anti-symmetric similar?
0
votes
0 answers

Can a partially ordered set contain an infinite cycle?

A partially ordered set is defined as a set with a relation that is symmetric, transitive, and anti-reflexive. The transitivity and anti-reflexivity rule out cycles. We can't have "a < b < c < ... < z < a", because "a < b < c" transitively implies…