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

Binary Relations Counting

Are these answers correct? I'm having a little trouble with $d$. and $e$. Set $S$ has $n$ elements. ($a$) How many elements are there in $S \cdot S$? $n^2$ ($b$) How many binary relations are there on $S$? $2^{n^2}$ ($c$) How many binary relations…
0
votes
1 answer

Powers of relations problem

In a discrete mathematics course, I stumbled upon the following problem. I have an idea how to solve the problem based on the fact that the power of a relation repeats after 3 consecutive powers; that is $R^1=R^4, R^2=R^5, R^3=R^6$, and so on.…
0
votes
0 answers

Should I link these parts of the hasse diagram?

Where X divides by Y on the set A = {1,2,3,6,10,15,30} The answer I've been given in this example was: 30 / | \ 10 6 15 |\ 2 3 | …
0
votes
1 answer

How many distanct equivalence classes are picked out by this relation?

Let $x\text{R}y \iff x-y=2k \quad k \in \mathbb{Z}$ How many distinct equivalence classes are there for this relation? I want to say thre are as many equivalence classes as there are integers, but can't reason my way to that conclusion.
0
votes
1 answer

How would I convert this state-transition diagram into a regular expression ?

The state-transition diagram of a finite-state recogniser is as follows :
HS'
  • 41
0
votes
2 answers

Concrete explanation for how an equivalence relation is related to equivalence class and the notation employed

I'm fairly comfortable with the definition of what the three equivalence relations are. What I'm not comfortable and finding it above my head is how equivalence relation is closely related to equivalence class and the associated notation use to…
0
votes
1 answer

Equivalence Relations Reflexivity

Consider the relation on $\bf{R}$ defined by $n \simeq m$ if $(n-m)\in \bf{R}$ To say this is reflexive, I can say: Let $n\in \bf{R}$ and since $n-n = 0$ and $0 \in \bf{R}$ Then $n \simeq n$.
Bob
  • 11
0
votes
2 answers

Prove $(n,m)R(r,s) \equiv (n>r) \text{ or } (n=r \text{ and } m\geq s)$ is an order relation.

Prove $(n,m)R(r,s) \equiv (n>r)\text{ or } (n=r\text{ and } m\geq s)$ is an order relation. So I have to prove reflexivity, antysimmetry and transitivity. I could prove reflexivity but I'm having lots of trouble proving antysimmetry, I tried proving…
YoTengoUnLCD
  • 13,384
0
votes
1 answer

Equivalence Classes points on the plane

I'm confused about the topic of equivalence classes. $x=(a,b) , y=(c,d)$ are points on the plane. $xRy$ iff: 1) $a+b = c+d$ 2) $a^2-b = c^2-d$ 3) $a=c=5 , b=d=20$ 4) $a^4+b^4 = c^4+d^4$ For each one of these, what are the equivalence classes??
0
votes
1 answer

Relations equivalence

$f) x^2-5x+6=y^2-5y+6$ $g) x^2+y^2=1$ Decide whether or not it’s a reflexive, symmetric, transitive and equivalence relation. If R is an equivalence relation, describe the equivalence classes. I guess the first one is an equivalence. But I'm having…
0
votes
2 answers

How do I prove this? (Relations Proof)

So I can't seem to figure out how to prove this. Any help would be greatly appreciated. My professor said a contradiction would work but I don't see where I can make a contradiction. Show that {X $\subseteq \Re | X \neq \varnothing$ and $\forall _x…
ChemDude
  • 421
0
votes
2 answers

Transitivity of a relation

If a relation contains (a,b) and (a,c), in order for it to be transitive, is (b,c) required, or is (c,b) also required? In my mind, it should require both (b,c) and (c,b), but I'm not certain.
0
votes
0 answers

Is it possible to make $R = \{(1, 0), (0, 1) \}$ antisymmetric without removing elements?

I was wondering if I have the relation $R = \{(1, 0), (0, 1) \}$, is there any way I can make the relation antisymmetric without removing elements? I think not, because since the first part of the anti-symmetric implication is true, there is no way…
xxsl
  • 99
0
votes
1 answer

Solve the following recurrence by using telescoping

a(n)=2a(n-1) + 2n-1 a(0)=1 I tried below; a(n)-2a(n-1)=2n-1 from here I found P(n)=1, q(n)=2 r(n)=? according to below formula p(n)an()-q(n)a(n-1)=r(n) for n>=1 Since I can not find r(n) value, I can not solve it, any help appreciated. Thanks…
hacikho
  • 53
  • 7
0
votes
0 answers

What's the meaning 'filtering',and 'chain'

What's the meaning 'filtering' and 'chain'? It's about of partially ordered sets. And can you please give me any example? Definitions: A preordered set $(I, \leq)$ is directed if every finite subset $F$ of $I$ has an upper bound. A subset $J$ of…
Moh Jay
  • 13