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

What is a geometric relation?

We will call a relation geometric if $∀x, y, z(xRy ∧ xRz → yRz)$ Prove that if a relation is geometric and reflexive, then it is also symmetric. I'm trying to solve this problem but I don't understand the question. I've heard of Reflexive,…
user849062
-1
votes
1 answer

Trying to define relationship between two numbers

I have 2 numbers 97 (F) and 415 (S) this is the key / legend. Given any number (S), commonly between 200 - 900, I am looking for "F". Where if (S) is above 415 "F" will be less than 97 and if (S) is below 415 "F" will be more than 97. The higher…
ThomasReggi
  • 109
  • 3
-1
votes
2 answers

Transitive relation.

I have read transitive relation, if $a\mathrel R b$ and $b\mathrel Rc$ then $a\mathrel Rc$. But suppose we have a set of first cousins. $$\mathrel R: \{(a,b),(a,c)\}$$ Where $a$, $b$ and $c$ are first cousins. Can anyone please help if the set…
-1
votes
2 answers

A relation on the set of real numbers which is only reflexive.

Can we construct a relation R on the set of real numbers such that it is only reflexive & neither symmetric nor transitive?
-1
votes
1 answer

What is the largest possible relation on set?

I know, that The smallest possible reflexive relation on a non-empty set is the diagonal ordered pairs of Cartesian product. The largest possible reflexive relation on a non-empty set is the entire Cartesian product. Likewise, The smallest possible…
Ubi.B
  • 340
-1
votes
1 answer

How to prove reflexivity, symmetry or antisymmetry and transitivity

Let $A = \lbrace 1, 2, 3, 4, 5, 6, 7 \rbrace$ Define the relation $R$ on $A$ by $xRy ⇔ xy ≥ 10$. Is the relation reflexive, symmetric, anti-symmetric or transitive?
-1
votes
1 answer

On the set $A=\{1,2,3,4,5\}$, type three such relations $a,b,c$ so that $a = a^{-1}, b = b^{-1}, c = c^{-1}$

On the set $A=\{1,2,3,4,5\}$, type three such relations $a,b,c$ so that $a = a^{-1}, b = b^{-1}, c = c^{-1}$. How do we write such relations on the set?
Taylor
  • 11
-1
votes
2 answers

Can somebody please give a proof to why this relation is transitive?

Relation I don't understand why this relation is transitive as for (1,1) there isn't for example a (1,2) ?
-1
votes
1 answer

Define the relation $R$ so that $xRy$ if and only if $x+4y$ is dividable with $5$

We define the relation R on the set $A=\{ -8,-7,-6,-5,-4,-3,-2,-1,0,1,2,3,4,5,6,7,8 \}.$ so that $xRy$ if and only if $x+4y$ is dividable with $5$. Ok so how should i define this $R$ with $x$ and $y$? Should I try with every element = $x$…
-1
votes
1 answer

When is a relation a function?

Can you explain the difference between a function and a relation and how a function is a subset of a relation, and when a relation is a function and when not? Also, what is the domain, co-domain and range of a function? All I’ve found on the…
Brenda
  • 21
  • 3
-1
votes
1 answer

Is {(1,1), (1,2),(1,3),(3,3)} transitive?

Is the relation R = {(1,1), (1,2),(1,3),(3,3)} transitive? The definition of transitive relation is; if (a,b) and (b,c), then (a,c). but there is no (b,c). Does it make R transitive?
-1
votes
1 answer

The relation x>5

Determine if the relation A = R and for x, y ∈ R is reflexive, symmetric, transitive, or antisymmetric: x ∼ y ⇔ x > 5. I think the relation is reflexive and not symmetric and not antisymmetric. Not too sure if it's transitive or not. How would you…
-1
votes
2 answers

Is the relation R = {$(a,a),(b,b)$} transitive without the element c?

We have a relation R = {$(a,a),(b,b)$}. Is this relation transitive? If that is true, then why is it transitive? According to definition a relation is transitive If (a,b) in R & (b,c) in R then (a,c) in R $\forall a,b,c \in R: a R b \land b R c…
MoveUK
  • 43
-1
votes
1 answer

relations problem :recurrence relation

need help with the following question: let $R$ be a binary relation. We will define a series of relations $R_1,R_2,R_3\dots$ so that: $R_0 = R$ $R_{i+1} = R_i\cup\{\langle x,y\rangle :\exists y(xR_iy\wedge yR_iz)\}$ we need to prove that…
blabla
  • 31
-1
votes
2 answers

An example where $R\circ R^{-1}=i_A$ but $R^{-1}\circ R\ne i_A$

I'm looking for an example where R is a relation from set $A$ to $A$ and $R\circ R^{-1}=i_A$ (the composite of $R$ and inverse $R$ is equal to identity relation) but $R^{-1}\circ R\ne i_A$ (the composite of inverse $R$ and $R$ is not equal to…