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

is there a bijection for $f: \mathbb R \to \mathbb C$?

I imagine no since the dimensions do not match but they have the same cardinality $|\mathbb R |= |\mathbb C|$?
user29418
  • 1,087
2
votes
3 answers

Relations, cartesian product of sets and ordered pair

I don’t understand these terms. They came up in a math class the teacher rushed through. Can you illustrate these terms with examples? I’m not really looking for an in-depth understanding of these (I don’t have much background) but only…
Brenda
  • 21
  • 3
2
votes
1 answer

Word for something that cannot be calculated "back"?

Sorry if this is a duplicate / not something allowed in here, I do not use the math section often. I am looking for a word to describe something that cannot be calculated "backwards", once it is calculated "forwards". Maybe it is a relation of some…
Swiffy
  • 209
2
votes
1 answer

Relations and understanding anti-symmetry

The below picture is a problem involving relations from a review set. I have only seen problems with relations involving matrices and solving for the properties of reflexive, symmetric, and transitive. So determining if a relation is anti-symmetric…
Mr.Mips
  • 173
2
votes
2 answers

What are relations?

I understand that a function may be considered as a set of ordered pairs which relate the elements between two sets. I understand that a function is a subset of the cartesian product between the two sets and it can be defined by an equation like…
2
votes
1 answer

Partial Ordering

Defined the Divisor Poset for any positive integer n as follows: Elements: all of the positive divisors of n Relation: we say that a ⪯ b if a|b. For any positive integer n, we can define a two-player game on the divisor poset for n as…
Joker
  • 49
2
votes
1 answer

Why does a partially ordered set need to be reflexive?

I understand that why a partially ordered set needs to be antisymmetric and transitive. I just can't see the logic behind why it has to be reflexive?
William
  • 4,893
2
votes
2 answers

Let $\sim$ be a relation on $\mathbb{Z}^2$ given by $(x_1, x_2) \sim (y_1, y_2)$ exactly when $x_1 + y_2 = y_1 + x_2$

Let $\sim$ be a relation on $\mathbb{Z}^2$ given by $(x_1, x_2) \sim (y_1, y_2)$ exactly when $x_1 + y_2 = y_1 + x_2$. I need to show that $\sim$ is reflexive, symmetric, transitive, and not anti-symmetric. So, an equivalence relation. I'm not too…
2
votes
0 answers

Finding all preorders on a finite set

Let $r:A\to\mathbb{N}$ be a rank mapping, surjective on $\{1,..,k\}\subset \mathbb{N}$ The mapping $r$ defines a relation $\sigma$: $$x\sigma y\iff r(x)
2
votes
2 answers

Finding composition of relations specified in set builder form

Consider two relations on the set of real numbers $R_1=\{(a,b) \in R^2\,|\,a>b\}$ $R_2=\{(a,b) \in R^2 \,|\, a\geq b\}$ What is $R_2 \circ R_1 ?$ I know that $(a,b) \in R_2\circ R_1$ iff $(a,c) \in R_1$ and $(c,b) \in R_2$. This implies that $(a,b)…
2
votes
1 answer

Are mathematical relations intrinsically transitive?

Here's the question: Let there be a set A = {1,2,3}. Let relation R in set A be defined as R = {(1,2),(3,3)} My textbook says that the relation is neither reflexive nor symmetric but transitive. I was not quite sure of this so I rechecked the…
2
votes
3 answers

Proving that a relation is transitive

During one of my recent tests, I was given the following problem: "Let the relation $R$ be defined on all finite sets so that $ARB$ if and only if there exits a bijection from $A$ to $B$. Verify that $R$ is a transitive relation." I tried to go…
2
votes
1 answer

Operations and relations

To what extent do operations and relations overlap? Is there some more general structure that encompasses both of these things? Thanks
kf03kc0
  • 29
  • 1
2
votes
3 answers

How to verify if $aRb \leftrightarrow a - b \le 10$ is total?

Book exercise: $R$ is a relation over $\mathbb Z$. $aRb \leftrightarrow a - b \le 10$ Verify if it is reflexive, symmetric, transitive, antisymmtetic or total. I can tell it is reflexive, since $a-a = 0 \le 10$. It isn't symmetric, since…
Saturn
  • 7,191
2
votes
1 answer

Transitivity - $R=\{(a,b)\in \mathbb{R} \times \mathbb{R} : |a-b|<1\}$

Hello Mathematics Community, I have the relation: $$R=\{(a,b)\in \mathbb{R} \times \mathbb{R} : |a-b|<1\}.$$ Is it true that this relation is not transitive, because: Let $a=0, b=0$ and $c=0$: $$ |0-0| < 1 \Rightarrow |0-0|<1$$ is true. But if $a=b$…
M.Hisoka
  • 87
  • 4