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

$R$ is symmetric if and only if it is equal to its converse

Given a binary relation $R$ over set $A$ ,prove the following statement: $R$ is symmetric if and only if it is equal to its converse. $\implies$ $R$ symmetric iff $\forall a,b \in A$: $$(a,b) \in R \iff (b,a) \in R$$ But how to show that it is…
user801358
0
votes
2 answers

Smaller binary relation on the set $\mathbb Q$

Given two binary relations $R$ and $S$ over sets $A$ and $B$,then $R$ is said to be contained in $S$ if $$\forall a,b: (a,b) \in R \implies (a,b) \in S$$ Moreover $R$ is considered to be smaller than $S$ if $R$ is contained in $S$,but $S$ is not…
user801358
0
votes
1 answer

What is the formal way to represent the set of reflexive relation?

There may be many ways to do this. Are these three ways to represent reflexive relation using set builder notation? If not, the how to represent $$\{a | a \in A, (a, a) \in R\} -(1)$$ $$Or$$ $$\{\forall a | a \in A \rightarrow (a, a) \in R\}-…
Ubi.B
  • 340
0
votes
1 answer

Is a relation defined by an emptyset symmetric and transitive?

Is a relation defined by an emptyset symmetric and transitive? It is obviously not reflexive, but is it symmetric and transitive? My thinking is it is, as there is no example of it not being either. For example, there is no example of $aRb \not…
Paul J
  • 11
0
votes
1 answer

Quick question about antisymmetric relationship.

Here we go, It is a really yes or no question. If aRb is a|b then is this antisymmetric? a, b belongs to integers including 0*
0
votes
1 answer

How can I show that this is a partial order?

Let $S$ be an arbitrary amount and define the relation $R \subseteq \mathcal{P}(S) \times \mathcal{P}(S)$ so that $(A,B) \in R$ if and only if $A \supseteq B$. Here $\mathcal{P}(S)$ is a spelling for the power set to $S$. Show that…
Maren
  • 19
0
votes
1 answer

How does a transitive extension differ from a transitive closure?

Quoting an example from C.L Liu's Discrete Mathematics: Let R be a binary relation on A. The transitive extension of R (let's denote it as $R_1$) is a binary relation on A such that $R_1$ contains R. Doesn't that make $R_1$ the transitive closure to…
Shiv_90
  • 107
0
votes
1 answer

Find these relations on $\mathbb{N}$.

Give an example of a relation on $\mathbb{N}$ which is, reflexive, transitive but not symmetric transitive, symmetric but not reflexive reflexive, symmetric but not transitive anti-symmetric, transitive but not reflexive. I found relations for…
Nimantha
  • 376
0
votes
1 answer

How is it defined that $a_1 \times b_1 < a_2 \times b_1$ and that $a_1 \times b_3 < a_3 \times b_1$?

I am reading Topology by James Munkres and he defines the dictionary order relation as: Definition Suppose that $A$ and $B$ are both sets with order relations $<_A$ and $<_B$ respectively. Define an order $<$ on $A\times B$ by defining $$a_1…
0
votes
0 answers

Transitive Relationships

I am examining transitive relationships and understand the premise that if $x \rightarrow y \rightarrow z$, then the relation needs to contain $x \rightarrow z$ to be considered transitive. My questions was if I had the relation $A = {(1,2), (2,3),…
0
votes
1 answer

Why is the $<$ relation not antisymmetric?

I'm a bit confused. Consider the relation $<$ on $\mathbb N$. Then $<$ is per definition antisymmetric if $$a
ATW
  • 689
0
votes
0 answers

Discrete math: specific problem in relations

i have $A$=$\left \{1,2,3,4,5,6 \right \}$ $R= \left \{ (a,b)|a\in A, b\in P(A),a\in b \right \}$ and i want to answer about what properties does this relation has, my Dilemma is about transentive and symmetry Note: in my course antisimmetric…
0
votes
1 answer

How to determine the properties of a relationship if it is not written by extension?

For a given universe $U$ and a fixed subset $C$ of $U$, we define $R$ on $P(U)$ ("parts of $U$") as follows: for any $A,B⊆U$ we have ARB if and only if $A\cap C = B\cap C$ Considering that the definition of properties are: - Reflective: $\forall…
0
votes
1 answer

Problem discussed in Relation in Set Theory

I am reading a book Axioms and Set Theory - A first course in Set Theory by Robert Andr´e In the book an example if discussed regarding composition of two relations R and T For a set S S = {a,b,c,{a},{a,b},{{c}},∅,{∅}} The relations R and T on S are…
0
votes
1 answer

Type of Relation

"is the reciprocal of"...over the set of non-zero real numbers is: (a) Symmetric (b) Reflexive (c) Transitive (d) Equivalence I know that it is definitely symmetric, as, in (a, b), if a is the reciprocal of b, then obviously b is the reciprocal of…