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

What are the usual definitions of minimality and maximality with respect to an arbitrary relation?

Let $\mathcal R$ be a relation on $S$ and let $T \subseteq S$. It seems there are two notions floating around of an $\mathcal R$-minimal element of $T$: $x$ is an $\mathcal R$-minimal element of $T$ iff $\forall y \in T: (y \mathrel{\mathcal R} x…
dfeuer
  • 9,069
5
votes
1 answer

Amount of transitive relations on a finite set

In counting the amount of relations on finite sets, we can quite easily count the amount of reflexive and symmetric relations on a finite set. We just consider (in accordance with the definition of a relation on a set as a subset of the cartesian…
user50407
5
votes
3 answers

Can Relations have a Domain and Codomain?

Does it make sense to talk about the domain and codomain of a relation? For example if the relation, $R$ $$x^2+y^2=r^2$$ only takes values $(x,y)\in\mathbb{R}^2$ its domain would be $\mathbb{R}^2$ and codomain the set of possible $r^2$s. So…
Jacob
  • 119
5
votes
1 answer

How to determine an ordering relation?

I would like to determine an ordering relation: We are given a linear order on $\mathbb{N}$ $\leq'$ for all $m,n$ such that $ n\leq' m$ $\iff$ (n is odd and m is even) or ($n$$\leq$$m$ and $m-n$ is even) where $\leq$ corresponds to the usual…
Mamba
  • 803
5
votes
2 answers

Symmetry and transitivity for the union of two equivalence relations

Let $R \subseteq A \times A$ and $S \subseteq A \times A$ be two arbitary equivalence relations. Prove or disprove that $R \cup S$ is an equivalence relation. Reflexivity: Let $(x,x) \in R$ or $(x,x) \in S \rightarrow (x,x) \in R \cup S$ Now I still…
user3001
  • 153
4
votes
3 answers

Showing $ x-y\in\mathbb{Q}$ is an equivalence relation?

How would one show the the following is an equivalence relation. The relation R on the real numbers given by xRy iff number $ x-y\in\mathbb{Q}$. This is what I did. Reflexive Let $x \in \mathbb{R}$ and $y\in \mathbb{R}$ then $x-y \in \mathbb{Q}$ is…
Fernando Martinez
  • 6,698
  • 19
  • 74
  • 108
4
votes
3 answers

What exactly do "relations on a set" mean?

I have a question that says "How many relations are there on a set with n elements?" so if I have the set A = {a, b} and I wanna find how many relations there are, I thought I would just do R = { (a,b), (a, a), (b, a), (b,b) } because it's a…
FrostyStraw
  • 1,045
4
votes
2 answers

Is any relation that is reflexive also symmetric and also transitive?

For an example relation $R$ on $\{1,2\}$ of $\{(1,1), (2,2)\}$. This relation is reflexive, but is it also symmetric and transitive? It appears to be symmetric because $(1,1)$ is present as is $(1,1)$, and $(2,2)$ is present as is $(2,2)$, in other…
Tinker
  • 173
4
votes
4 answers

Prove $\sim$ is an equivalence relation: $x \sim y$ if and only if $y = 3^kx$, where $k$ is a real number

The relation $\sim$ is defined on $\mathbb{Z}^+$ (all positive integers). We say $x\sim y$ if and only if $y=3^kx$ for some real number $k$. I need to prove that $\sim$ is an equivalence relation. To prove an equivalence relation we must certify…
meiryo
  • 875
4
votes
2 answers

number of reflexive relations

I don't understand Why the number of reflexive relations is $2^{n^2-n}$ instead of $2^n$ I thought reflexive relations are elements in form of (a,a). So I understand that there are $2^{n^2}$ Relations in total. But the reflexive ones should only be…
4
votes
1 answer

I don't know why this relation is NOT antisymmetric

Given the relation $$\mathcal{R}=\{(1,1), (1,2), (2,2), (2,3), (3,3), (3,1)\}$$ the problem is to determine whether this relation is reflexive/symmetric/antisymmetric/transitive or not. I understand why this relation is reflexive, and also why it is…
4
votes
1 answer

Checking if a Relation is Transitive

I have $$R = \{(1,1),(1,2),(1,3),(1,4),(2,2),(2,3),(3,4),(4,1),(3,1),(2,1),(4,4),(4,2),(3,2),(4,3)\}$$ Is this relation transitive? I think since $(2,1), (1,4) \in R$ to be transitive $(2,4) \in R$ since $(2,4) \notin R$, $R$ is not transitive.
techno
  • 639
4
votes
1 answer

Which relations are partial orders

I have come across the following question on a practice test: Which of the following relations defined on $X = \{1, 2, 3\}$ are partial orders? $(1) \; \{(1, 1),(2, 2),(3, 3)\}$ $(2) \; \{(1, 2),(2, 1),(2, 2),(3, 3)\}$ $(3) \; \{(1, 1),(2, 1),(2,…
Huss
  • 303
  • 1
  • 6
4
votes
1 answer

Equivalence relation: showing that an operation is well-defined

Let $r \in \mathbb{N}$. Observe the equivalence relation $\sim \subseteq \mathbb{Z} \times \mathbb{Z}$ defined as $x \sim y :\Leftrightarrow (\exists k \in \mathbb{Z})(y=x+kr)$. Show that an operation $'+'$ on $\mathbb{Z}/\sim$ given by $[x]_\sim +…
Greg S
  • 165
4
votes
1 answer

Why is x=1 not reflexive? (or determining the properties of reflexive relations)

I have a question that I got wrong in my homework and I am having trouble understanding. It says "Determine whether the relation R on the set of all real numbers is reflexive, sym- metric, antisymmetric, and/or transitive, where (x, y) ∈ R if and…
1
2
3
46 47