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
1
vote
2 answers

What does exactly this syntax $S = R \cup i_{A}$ mean?

I am trying to understand what is a reflexive closure and, more or less, I understood the properties: Let $R$ be a relation on $A$. Then the reflexive closure of $R$ is the smallest set $S \in A \times A$, such that $R \subseteq S$ and $S$ is…
user168764
1
vote
1 answer

How can a matrix relation be both antisymmetric and symmetric? Explain this image to me.

Take a look at this picture: From what I am reading, antisymmetric means: $$∀ x ∀ y \,[ R ( x , y ) ∧ R ( y , x ) ⇒ x = y ]$$ However, $(2,1)$ and $(1,2)$, $X\ne Y$. I understand how this is symmetric but how is this antisymmetric? I got this from…
1
vote
3 answers

Prove a relation for a set

If $ R,S $ are relations on the set $ A $, where $ S $ is reflexive $ S \subseteq R $ Prove that: $ R $ is reflexive How do I begin? How could a relation be a subset of another relation ? thanks
FigureItOut
  • 1,835
1
vote
4 answers

Celsius to Fahrenheit Conversion

Consider the following question: "The maximum temperature of a day is 42 degrees celsius. The minimum temperature is 28 degrees celsius. What is the difference of these temperatures on the Fahrenheit scale?" When I calculate the answer in two…
1
vote
4 answers

Transitivity in set relations

According to my book: R = {(1,2), (2,3), (1,3), (2,1)} is not transitive because (1,1) and (2,2) are missing. I don't see why (1,1) & (2,2) would be relevant here since aRb and bRc => aRc has been fulfilled. According to my book #2: R = {(1,1),…
1
vote
3 answers

Proving various relations are partial orders

I am given these relations, in which I have to prove or disprove each and every one. a. The relation $\trianglelefteq$ defined on ℕ by a $\trianglelefteq$ b if a ≤ b² b. The relation $\preceq$ defined on ℤ by m $\preceq$ n if m ≤ n + 5. c. The…
JCMcRae
  • 843
1
vote
0 answers

Question About Set Relations?

Prove that $\text{Domain}(S\circ R) \subset \text{Domain}(R)$ where $ R $ is a relation from $ A $ to $ B $ and $ S $ is a relation from $ B$ to $ C $. My solution: I suppose that there is an element $a$ which is a an element of the domain of $S$…
0
votes
1 answer

Proof involving relations

$\def\Rng{\operatorname{Rng}}$ Let $R$ be a relation from $A$ to $B$. For $a \in A$, define the vertical section of $R$ at $a$ to be $R_a$ = $\{ y \in B: (a,y) \in R\}$. Prove that the union over $R_a$ where $a \in A = \Rng(R)$. I have work for it…
Wes
  • 101
  • 1
  • 3
  • 10
0
votes
3 answers

Example of Relation Help

Example of a relation that is reflexive, not symmetric, not transitive but anti-symmetric. I can't think of an example.
0
votes
2 answers

Find the number of binary relations.

Let $X$ = {$a,b,c,d,e$}. Let us call a binary relations $R$ on $X$ special if it satisfies all of the following conditions: (i) $R$ is reflexive, (ii) $R$ is symmetric and (iii) $R$ contains the pair ($a,b$). Find the number of special binary…
Q123
  • 251
0
votes
1 answer

Properties of a relation

$\cong\;=\{((x_1,y_1), (x_2,y_2))\in \mathbb R^2 ×\mathbb R^2 |x_1^2-x_2^2=3y_1^2-3y_2^2\}$ finitary relation meaning $(x_1,y_1) \cong (x_2,y_2)$ if $x_1^2-x_2^2=3y_1^2-3y_2^2$ Is this finitary relation reflexive, symmetric, antisymmetric,…
0
votes
1 answer

equivalence relations proof over the same set

I want to proof the following theorem: Let R be an equivalence relation on set A. Then {R[a]:a that belongs to A} is a partition of A. So long I have manage to proof that each a that belongs to A, it belong to the partition (by using reflexive…
Lila
  • 479
0
votes
4 answers

Recursive definition of the relation greater than on N X N

Give a recursive definition of the relation greater than on N X N using the successor operators s? I started this question throw this way: basis: (1,0) ∈ N x N could someone help me in recursive step? thanks
0
votes
1 answer

are these binary relations?

I have found the following examples of Binary Relations, but I am not pretty sure is the conclusion the author arrived is correct. X is a number of people x N y, implies that x lives next to y; for what I see this does not hold the transitive…
Lila
  • 479
0
votes
1 answer

$aRb$ iff $a=b(10)^k$ for some $k \in \mathbb{Z}$ [Prove Equivalence Relation]

The question: $R$ is a relation on $\mathbb{N}$ defined by $aRb$ iff $a=b(10)^k$ for some $k \in \mathbb{Z}$. Prove that $R$ is an Equivalence relation. The problem: I can define an equivalence relation (Sym,Ref,Trans) and can prove basic problems…