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

Using transitive to prove symmetric

Consider a relation R on a set A. Prove R is symmetric if R is transitive and there exists a c in A such that for every x in A, xRc and cRx. Help!!
0
votes
1 answer

Find a function f : B → C such that h = f ∘ g

Find a function $f : B → C$ such that $h = f ∘ g$, or prove that such function do not exist A={1,2,3}, B={4,5,6}, C={7,8,9} $g : A → B$ $h : A → C $ $f : B → C$ $g(1)=5, g(2)=5, g(3)=6, h(1)=7, h(2)=8, h(3)=9$
Aloha
  • 1
0
votes
1 answer

Equivalence Relation

Let S be equivalence relation defined on $\{x : x ∈ \mathbb{R},\ 0 ≤ x ≤ 5\} $defined by $xSy$ if and only if $[x] = [y]$. What are the equivalence classes of $S$? Note: $[q]$ is defined to be the smallest integer greater than or equal to $q$. You…
0
votes
2 answers

Determining if a relationship x ~ y is symmetric

I am to determine which of these relationships are symmetric. The variables $x$ and $y$ represent integers. $x$ ~ $y$ iff $(x + y)$ is even $x$ ~ $y$ iff $(x - y)$ is even $x$ ~ $y$ iff $(x + 2y)$ is positive $x$ ~ $y$ iff $(x - y)$ is positive $x$…
0
votes
1 answer

Set Theory Relations: Reflexive and AntiSymmetric difference

I have a set put into matrics form, if { (a,a), (a,b), (a,c), (a,d), (b,a), (b,b), (b,c), (b,d), (c,a), (c,b), (c,c), (c,d), (d,a), (d,b), (d,c), (d,d) } And the 4 relations: Reflexive, Symmetric, AntiSymmetric, Transitive. Symmetric would be the…
LuxuryWaffles
  • 105
  • 1
  • 5
0
votes
1 answer

What is the process for determining transitivity of a relation set?

Given the relation on the set $\{1,2,3,4\}$ why is $\{(2,2),(2,3),(2,4),(3,2),(3,3),(3,4)\}$ considered to be transitive? As I go through it I can see that we have $(2,2)$ and $(2,3)$ so we'd need $(3,2)$ as well. But then I see $(3,3)$ and $(3,4)$…
0
votes
3 answers

Cartesian product of two sets

If I have a set $A = \{1,2,3,4\}$ why does the Cartesian product of $A \times A$ not include $(2,3) (2,1) (3,1) (3,2) (3,3) $ or $(4,1)(4,2)(4,3)(4,4)$ if its relation subset $R = \{(a,b) : a|b\}$.
user1766888
  • 623
  • 3
  • 12
  • 24
0
votes
1 answer

Relations and a graph

enter image description here Find at least one binary relation R on the set M of vertices of some subgraph of the graph ​ such that the ordered pair (c, d) belongs to this subgraph. (Define the relation R by defining it for all individual pairs…
0
votes
1 answer

Relation with empty sets

If you have two sets $A$ and $B$ where $A=B=\{\;\}$, then what would $A\times B$ be equal to? I know that $A\times B=\{(a,b)|a\text{ is an element of }A\text{ and }b\text{ is an element of }B\}$. I think I am getting confused as to the notation…
W. G.
  • 1,766
0
votes
2 answers

Enquiry on Transitivity of a relation

In transitive relation we know that if an element $a $ is related to $b $ and if $b$ is related to $c $ then $a $ is related to $c $. What I can't find any where is can $a $ be equal to $c $.??
0
votes
0 answers

Proofs for domains and ranges of relations

How do I prove/ find counterexamples for the following? Dom(R∩S)=Dom(R)∩Dom(S) Rng(R∩S)=Rng(R)∩Rng(S) Dom(R-S)=Dom(R)-Dom(S) Rng(R-S)=Rng(R)-Rng(S) I know how to prove Dom(R∪S)=Dom(R)∪Dom(S)and Dom(R∩S)=Dom(R)∩Dom(S), but am unsure with how to…
3.14Pie
  • 93
  • 1
  • 2
  • 7
0
votes
0 answers

Composition of Binary Relations

In Jech's Intro. to Set Theory Problem 2.3 f $R^{-1}[R[A]] \supseteq A \cap dom R $. Can I say that $R^{-1}[R] $ should be the identity relation and hence the above simplifies to $A \supseteq A \cap dom R$ which is true.
arrhhh
  • 27
0
votes
2 answers

How is this an equivalence relation?

From my textbook The smallest equivalence relation $R_1$ in the set {$1,2,3$} containing $(1,2)$ and $(2,1)$ is {$(1,1)(2,2)(3,3)(1,2)(2,1)$} Again, In mathematics, an equivalence relation is a binary relation that is at the same time a…
user237454
0
votes
2 answers

Pairwise disjoint sets in a relation

can someone let me know what this question means and how do i go about solving it? Let Z be the set of integers and R be the relation defined in Z such that aRb if a – b is divisible by 3. Then R partitions the set Z into how many pairwise disjoint…
Zlatan
  • 651
0
votes
0 answers

Relations on the set of natural numbers

I was working on a problem asking me whether on not the relation is symmetric, reflexive, or transitive? The defined relation R on N by aRb if a/b is an element of N. I found that it is reflexive. Not transitive and not symmetric. The counter…
Sunny22
  • 11
  • 3