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
3
votes
3 answers

Subset Relation: Is the subset relation a partial order?

I read in a Wikipedia entry (subset in german http://de.wikipedia.org/wiki/Teilmenge): "Every set is a subset of itself" But for example, if A is a set of all sets, with maximum 5 Elements, than A isn`t a Subset of itself. so the subset-relation…
Suslik
  • 173
3
votes
2 answers

Is every left-unique relation right-uniqe?

Lets say we have a relation A x B. As far as I unterstood, in a right-unique relation, for every element from A, there is at least one element in B. But there might be elements in B which do not have a "partner" in A. My understanding of left-unique…
Mirco
  • 167
3
votes
1 answer

A question about equivalence classes

Theorem: Let $P$ be a partition of a set $S$, and let $a$ and $b$ be $\in S$. Define the relation $R$ on $S$ as follows: $aRb$ iff there exists an $X \in P$ such that $a \in X$ and $b \in X$. Then $R$ is an equivalence relation on $S$. Furthermore,…
El-P
  • 33
  • 2
3
votes
2 answers

Anti-symmetric relations

I'm having issues wrapping my head around anti-symmetric examples in specific contexts. I understand that if BOTH $a$, $b$ belong to $\mathbb{R}$ then $a = b$ and if $a \ne b$ then they aren't anti-symmetric. The context I'm having issues with is…
jn025
  • 989
3
votes
1 answer

Whether $>, <, =, \ge, \le$ is reflexive, symmetric and transitive

For each of the following relations defined on the positive integers: $>, <, =, ≥, ≤$ How do I justify the relation is reflexive, symmetric, or transitive? I only know that $=$ is reflexive because $<1,1><2,2><3,3><4,4><5,5>$ where $N=N$ but they…
3
votes
4 answers

The equivalence relation $(z_1, n_1)\sim(z_2, n_2) :\Leftrightarrow z_1 \cdot n_2 = z_2 \cdot n_1$

Given the relation $(z_1, n_1)\sim(z_2, n_2) :\Leftrightarrow z_1 \cdot n_2 = z_2 \cdot n_1$ on the set $\mathbb Z \times \mathbb N$. a) Prove that $\sim$ is an equivalence relation. Here is how I've proven it, could someone check if it's…
Clash
  • 1,401
3
votes
1 answer

Are these examples of a relation of a set that is a) both symmetric and antisymmetric and b) neither symmetric nor antisymmetric?

I was told to give an example of one of each of these kinds, and this is what I came up with: (these are both relations on the set of all positive integers) R = { (a,b) | a = b} is an example of a relation of a set that is both symmetric and…
FrostyStraw
  • 1,045
3
votes
3 answers

Reduction Transitive Relation Problem

I have this problem on my homework, it's my last one left but I'm having trouble with it. Any help would be appreciated.
Bobcat88
  • 163
  • 1
  • 6
3
votes
2 answers

Give an example of relation $R$ and $S$ on $A$ such that $R$ and $S$ are nonempty, and $R \circ S$ and $S \circ R$ are empty

Let $A = \left \{a, b, c, d\right \}$, give an example of relation $R$ and $S$ on $A$ such that $R$ and $S$ are nonempty, and $R \circ S$ and $S \circ R$ are empty I'm thinking of ways that a set could be empty, and the only thing I can think of is…
Adrian
  • 1,976
3
votes
3 answers

How to solve recurrence relation: f(n) = f(n-1) + 2(n-1) when f(1) = 1?

I am just learning about recurrence relations, and this is an absolute beginner's question. I understand what's going on in the formula, but I have no clue how to write it's solution? This probably takes no time at all to answer, but thought some…
eluong
  • 131
3
votes
1 answer

Transitive closure of a reflexive antisymmetric relation

Prove that the transitive closure $S$ of a reflexive antisymmetric relation $R$ is a partial order.
Doug
  • 31
3
votes
1 answer

Showing $(a,b) \sim (c,d) \implies (a+e,b+f)\sim(c+e,d+f)$

I have this equivalence relation (this one is proven already): $(a,b) R (c,d) ⇔ a + d = b + c$ and now I need to show that for $(a,b),(c,d),(e,f) ∈ ℕ x ℕ$: $(a,b)R(c,d) ⇒ (a+e,b+f)R(c+e,d+f)$ What I did: $a+d = b+c$ add f:$⇒ a+d+f = b+c+f$ add e:$⇒…
3
votes
2 answers

3 examples of relations that satisfy exactly two of the following: symmetry, reflexivity, and transitivity

Could anyone give me three concrete mathematical relations $R$ on $\mathbb{Z}$ that satisfy exactly two of the following, no two of which satisfy the same two axioms: 1) Axiom of reflexivity ($\forall a\in \mathbb{Z}, (a,a)\in R$) 2) Symmetric axiom…
user706791
3
votes
2 answers

Proving $\cos^2x+\sin^2y=1$ is reflexive, symmetric, transitive.

I want to make sure that I got the hang of the following relations. For reflexivity, if $x=y,\cos^2x+\sin^2y=\cos^2x+\sin^2x=1 \implies xRx$, then it is reflexive. For symmetry, $xRy\implies\cos^2x+\sin^2y=1$ and $yRx\implies\cos^2 y+\sin^2x=1…
oma
  • 81
3
votes
1 answer

Function on equivalence relation

Let $f:X \to Y$ be a surjective function from a set $X$ onto a set $Y$. Let $R$ be the subset of $X \times X$ consisting of those pairs $(x,x')$ such that $f(x) =f(x')$. Prove that $R$ is an equivalence relation. Let $\pi : X \to X/R$ be the…
Visitor
  • 63
1 2
3
46 47