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

Completeness of Binary Relations

Completeness of binary relations often is defined as: The binary relation R of a set A is complete iff for any pair x,y ∈ A: xRy or yRx. My question is: what does one mean by „pair“? To me it seems like one does not mean „pair“ as defined in math…
0
votes
2 answers

Proving reflexivity, symmetry, and transitivity for the relation $\sim$ on $\Bbb{R}$ such that $x\sim y$ iff $x+y\in\Bbb{Q}$

I am going through past papers for my university exam, and a question in this format appears often: Define a relation $\sim$ on $\Bbb{R}$ by $x\sim y$ if and only if $x+y \in \Bbb{Q}$. Justify your answers to the following questions. Is this…
0
votes
1 answer

Relations Definition

according to wikipedia the definition of relation is a set ordered pairs that is subset to cartesian product. My question is ''Is this all about relations ?'' so it's just ordered pairs even if it doesn't carry any type of notion or relation between…
user1032736
0
votes
1 answer

Are Relations just ordered pairs?

The definition of a Relation is a set of ordered pairs So are Relations just sets of ordered pairs ? I mean if there is a set of ordered pairs that carries no definite relation between it's pairs [and I mean by definite relation, relations like…
Mans
  • 512
0
votes
1 answer

What is a Relation?

In discrete math we define the relation as a sets of pairs of numbers, I understand when we write (a,b) we mean that (a) and (b) are realted what I don't grasp at all why the realtion between two diffrent is a subset of all ordered pairs between…
user1050651
0
votes
1 answer

Construct transitive relation of ancestors from relation of parents in a family tree

For my thesis I'm trying to think of an intuitive example to illustrate properties of different relations. For a set of family members $S = \{\texttt{A1}, \texttt{A2}, \dots, \texttt{C3}\}$, I created the following family tree... ...and defined the…
0
votes
0 answers

Confusion about what a relation is

I am having trouble understanding what a relation actually is. The way I understand it is, if $A$ and $B$ are sets, then a relation from $A$ to $B$, $R$, is simply any subset of $A \times B$. This totally makes sense to me, all we are doing is…
Joeyboy
  • 341
  • 1
  • 10
0
votes
1 answer

What makes one relation stronger than another?

I'm trying to remember a shorthand for a binary relation on relations: Suppose relation $R_2$ contains every tuple that is in $R_1$, and at least one additional tuple. Do we say "$R_2$ is stronger than $R_1$," or is there some other term that…
0
votes
1 answer

What are reflexive relations?

I am having some confusing regarding reflexive relations. Let's take an example $$\{(a,b):a+2b\ \text{must be divisible by 3, a and b are natural numbers}\}$$ Some elements of the relation are $(1,1),(2,2),(3,3), \cdots$ where $a = b$ But there are…
0
votes
1 answer

Why is this statement Antisymmetric?

Question Let $S$ be a relation defined on $\mathcal{P}(\mathbb{N})$ by $XSY$ if and only if $X \subseteq Y$ and $|X| \equiv |Y|$(mod $2$). My method My thought process was that since Antisymmetry means that... If $XSY$ and $YSX$ if and only if $Y =…
Bryan Hii
  • 325
0
votes
0 answers

Set Theory and Relations, Less than relation

I'm teaching my self set theory id iv gotten to the point of relations. I understand a relation between two sets is any subset formed from the Cartesian product of thus sets. What I fail to see is how we actually define this relation. like if we…
0
votes
1 answer

Why are these sets reflexive, transitive, and/or symmetrical?

I. $\{(1,1),(2,2),(3,3),(4,4), (5, 5), (1,3), (3,4)\}$ is reflexive II. $\{(1,1), (2,2), (3,3), (4,4), (5,5)\}$ is reflexive, symmetrical, transitive Why the second set is symmetrical, when we don't have, for example, $(1, 2)$ and $(2, 1)$? Why the…
Georgi Peev
  • 103
  • 3
0
votes
1 answer

What is the largest transitive relation that is not the universal relation?

Let $A=\{1,2,3,\cdots, n\}$. Let $T$ denote a transitive relation on $A$ such that $T\neq A\times A$. What is the possibility for the maximum size for $T$? I considered the case $n=3$. I found that the largest such $T$ is given by…
0
votes
1 answer

POSET as a disjoint union of a well ordered set and a set with no least element

Let X be a POSET. Show that one can write X as a union of two disjoint sets A and B such that A is well ordered (with respect to the ordering in X) and B has no least element My approach Intuitively, we can draw a Hasse diagram. If X has a least…
xavitop
  • 41
0
votes
2 answers

Write down the Equivalence classes

Let $V = \{0,1,2\} \times \{0,1,2,3\}.$ We define an equivalence relation $R$ on $V$ by saying that $(a,b)R(c,d)$ if and only if $2a-b = 2c-d$. Write down the equivalence classes for $R.$ I do not get how to write the equivalence classes. The way I…
Bryan Hii
  • 325