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

Showing equivalence relation.

On the set $\mathbb N\times \mathbb N$ define $(m,n)\sim(k,l)$ if $m+l=n+k$ Show that $\sim$ is equivalence relation on $\mathbb N\times \mathbb N$ Draw a sketch of $\mathbb N\times \mathbb N$ that shows several equivalence classes. My book does…
1
vote
0 answers

Prove the following $(R\cap S)^n=R^n \cap S^n$

I would like to prove the following without induction. $$(R\cap S)^n=R^n \cap S^n$$ We can start by take $(a,b)\in (R\cap S)^n$ its represent a path from $a$ to $b$ right? Any hints? Thanks.
Ofir Attia
  • 3,136
1
vote
2 answers

How to show that $|A/R|=|A|/n$.

Suppose $A$ is a finite set and $R$ is an equivalence relation on $A$. Suppose also there is some positive integer $n$ such that for every $x\in A |[x_R]|=n$. Prove that $A/R$ is finite and $|A/R|=|A|/n$. Proof: Suppose $X\subseteq A$, since for…
pkjag
  • 481
1
vote
2 answers

What kind of relation is this?

A person can remember himself at different points in the past. Each of 'himself' that he remembers at each point in the past can also remember a person in the past, and so on. So if we have a, b, c, d So c has a direct relation to d b has a…
Hal
  • 3,406
1
vote
1 answer

Relations $R^2, R^3, R^i and R^*$

Consider the relation on R on the reals where $xRy$ iff $xy=1$ I need to find $R^2, R^3, R^i $ and $R^*$ Ok, so I first started off with the following: $$xR^2z \equiv \exists y: xRy\land yRz \\ \equiv\exists y: xy=1 \land yz=1 \\ \equiv xy + yz…
Dimitri
  • 1,287
1
vote
1 answer

Relations and transitivity.

Let $R=\{ (a,b) : \ \mid a-b\mid \ \leq1\ \}$ on $\Bbb Z$ Well I know it's reflexive and symmetric and not anti-symmetric, although I don't see why it's not transitive. if $\mid a-b\mid \leq1 \ \land \mid b-c\mid \leq1 \rightarrow \mid a-c…
Dimitri
  • 1,287
1
vote
2 answers

Did I do this assignment right? Antisymmetric relation.

I need to prove or disprove, that R is antisymmetric. This is my set: $$ R=\{(1,1),(1,2), (1,4), (2,1), (2,2), (3,2), (3,3), (4,4)\} $$ I proved that it is not antisymmetric in the following manner: $$ \text{Definition of antisymmetric…
depecheSoul
  • 913
  • 7
  • 13
1
vote
2 answers

Transitive relations and Subsets

I have a question to prove: If relations R is transitive, than R^2 is transitive. In the answer the professor says that if R is transitive than: R^2 is a subset of R (I understand why, this is the definision) Therefore, R^2*R^2 is a subset of R^2.…
Alan
  • 2,791
1
vote
3 answers

Why is this relation reflexive?

$S$ is this set of all graduates from a university. $xRy$ means that student $x$ first attended the university at the same year student $y$ did. The answer key says $R$ is reflexive but isn't it possible that only one student entered the university…
Celeritas
  • 2,743
1
vote
1 answer

I need help with a transitive closure question

the question deals with relations $R$ is a binary relation defined on $A = \{0,1,2,3\}$. Let $R = \{(0,1), (0,2), (1,1), (1,3), (2,2), (3,0)\}$. Find $R^t$, the transitive closure of $R$. I have the answer but I can't seem to figure out how to get…
Joe Park
  • 11
  • 2
1
vote
2 answers

List the symmetric relations on the set {0,1}.

I think the answer should be this, but not sure. Can anyone help me? { }, {(0,0)}, {(0,1)}, {(1,0)}, {(1,1)}, {(0,0), (0,1)}, {(0,0), (1,0)}, {(0,1), (1,0)}, {(0,1), (1,1)}, {(1,0), (1,1)}, {(0,0), (0,1), (1,1)}, {(0,0), (1,0), (1,1)}, {(0,0),…
Mandy
  • 175
1
vote
1 answer

Prove that symmetric closure of R $h_{sym}(R) = R \cup R^T$

I have a question about proving statements of the form in which the given is the union of two sets. Well first of all let me just write how I tried to prove the statement: To show that $h_{sym}(R) = R \cup R^T$, you can show that $h_{sym}(R)…
eager2learn
  • 2,799
1
vote
1 answer

non-transitive, antisymmetric and reflexive binary relation on $\mathbb Z$

Does anybody know about a reflexive, antisymmetric, but not transitive relation on $\mathbb Z$? I really cant figure any out and I am having doubts that something like that exists.
1
vote
1 answer

Understanding syntax for defining a relation.

Let T = {1, 2, 3, 4} and A = T * T. We can define a relation R on A; (a,b)R(c,d) <=> (a/b)=(c/d) For example: (1,2)R(2,4) since (1/2)=(2/4) Does this mean that ((1,2),(2,4)) ∈ R or (1,2) ∈ R and (2,4) ∈ R
1
vote
1 answer

algebra, equivalence relation regarding associates

If f(x) ~ g(x) if and only if f and g are associates, prove this is an equivalence relation have tried to prove this both ways, struggling
Alice
  • 47
  • 1
  • 6