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

Transitive closure of binary relation

How would you make a transitive closure on something like this: Among all students in a classroom we have a binary relation $\mathcal R$. Student A is in relation with student B, formally (A,B) $\in$ $\mathcal R$ iff - "A sits in a row in front of…
Noturab
  • 497
2
votes
2 answers

Discrete Maths - Sets & Relations

I'm trying to get my assignment done and I'm finding it hard to understand Relations. The question says: Let $Q$ be the relation on the set $R$ of non-zero real numbers, where non-zero real numbers $x$ and $y$ satisfy $xQy$ if and only if $x^2/y^2$…
MosesA
  • 471
  • 4
  • 7
  • 20
2
votes
1 answer

If $R_1$ and $R_2$ are relations on A, must $R_1 \cup R_2$ be transitive?

I have a very elementary question to ask, so please do bare with me. My goal is to show by counterexample that if two sets, $R_1$ and $R_2$ are transitive, then $R_1 \cup R_2$ is not necessarily transitive. It is easy to concoct one counterexample…
2
votes
1 answer

Transitivity of a relation (unique)

Okay experts, i do know what the definition of a transitive relation is and how to judge if a relation is transitive or not.But i got across this one question which shouldnt be transitive but the answer in my book says it is .Can someone please tell…
Zlatan
  • 651
2
votes
1 answer

Does the definition for transitive relation require distinct values?

Transitive definition is $\forall x[(x,y)∈R \land (y,z)∈R \implies (x,z)∈ R]$. If $(a,b), (b,a) ∈ R$, then can I say that $(a,a) ∈ R$? Because based on the definition $x,y,z$ are not the same value. So, I am not sure whether $(a,a)$ can be a…
SinLok
  • 135
2
votes
2 answers

Determining the distinct equivalence classes of $3\vert 5a^2+b^2$

Given the equivalence relation R on $\mathbb{Z}$ by $aRb$ iff $3\vert 5a^2+b^2$ Determine the distinct equivalence classes of R $[0]=\left\{x \in \mathbb{Z}: xR0\right\}=\left\{x \in \mathbb{Z}:3|5x^2+0\right\}$ Would this only give…
HighSchool15
  • 2,061
  • 14
  • 35
2
votes
1 answer

Give an example of a partially ordered set

Give an example of a partially ordered set $(X,\le)$ satisfying $\forall x,y \in X, \ \exists z\in X$ such that $x\le z$ and $ y\le z$ and $\forall x\in X ,\ \exists y\in X$ such that $x\not\le y$ and $y\not\le x$. I understand I need to find a…
Alex
  • 649
2
votes
1 answer

Unclear about what the diagonal relation means?

I am reading through Skornjakov's Elements of Lattice Theory (1977), and am having trouble understanding what is meant by a diagonal relation. I am also unclear about how the diagonal differs from the identity. The book defines a diagonal and…
2
votes
1 answer

Is rounding over addition distributive?

I am trying to answer the question whether: Round(a + b + c) = Round(a) + Round(b) + Round(c) (Forgive me if "distributive" is the wrong term, been some time since my math days) Context: I have financial transactions data in which each amount is…
Michael
  • 123
2
votes
1 answer

Is the following relation a partial order?

Is the relation $R$ on $A=$ the set of all word of English, defined by $R=\{(x,y)\in A\times A: $ the first letter of the word $y$ occurs at least as late in the alphabet as the first letter of the word $x \}$ a partial order? I said no because…
2
votes
1 answer

What are ordered tuples?

I've been asked to explain the concepts of relations and I'm unable to find what Ordered Tuples are on the internet. Could the answer please be given in the most basic form as I'm not brilliant at Maths. Thanks in advance.
2
votes
1 answer

The binary relation $S=\phi$ on set $A=\{1,2,3\}$

I came across this question: The binary relation $S=\phi$ (empty set) on set $A=\{1,2,3\}$ is a) Neither reflexive nor symmetric b) Symmetric and reflexive c) Transitive and refelxive d) Transitive and symmetric Please tell me if my understanding is…
Siddharth Thevaril
  • 875
  • 4
  • 15
  • 27
2
votes
1 answer

Finding an Equivalence Relation from a Partition?

I've been looking around and found questions related to deriving partitions from equivalence relations; however I was wondering if there is a method to finding an equivalence relation from a given partition. For example the partition $\{\{1, ...,…
qwersjc
  • 145
2
votes
2 answers

The relation x=1

This one stumped me: Determine if the relations R on $\mathbb{R} $ are reflexive, symmetric, transitive, antisymmetric: $ (x,y) \in R$ iff $x=1$. It is reflexive since 1=1. It is symmetric since it is the case that for all $x=1, 1=1$ Is it…
Jabernet
  • 1,724
2
votes
1 answer

Discrete Math - Relations and Matrix Representations

Are these answers correct? Do we assume $p$ is created from $S$ twice? Binary relation $p$ on the set $S = \{a,b,c,d,e\}$ is defined as: $p = \{(a,c),(a,e),(b,a),(e,d)\}$.  What is the matrix representation of $p$? Is $p$ a reflexive relation?…