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

Checking for set transitivity

I am asked: Determine whether the relation X on the set Z is reflexive, symmetric, antisymmetric, and/or transitive, where $(a,b) ∈ X$ if and only if a = 1. Apparently, the set is antisymmetric and transitive. I understand how it is not reflexive or…
Johny
  • 115
0
votes
1 answer

Properties of relations (symmetry and anti-symmetry)

I have read few question posted mathmatics, yet I am still confused... so I do understand this is quiet frequently asked. If relation = {(1,1)} would this be anti-symmetric and symmetric? I do understand that symmetry means when (a,b) is in set…
Ben Han
  • 15
0
votes
1 answer

Is my understanding of the connections between anti-/a-/symmetry and reflexivity in relations correct?

A relation is symmetric if when aRb then bRa, antisymmetric if when aRb and bRa then a=b, and asymmetric if when aRb then not bRa. Does it follow that every antisymmetric relation R is also reflexive (Id is a subset of R), and that a relation both…
user379802
0
votes
1 answer

Strong or weak orders

We've got these relations and have to decide if the orders are strong, weak or nothing. I am very unsure how to check this and got to these conclusions: $\{⟨a,b⟩,⟨a,c⟩,⟨a,d⟩,⟨b,c⟩,⟨a,a⟩,⟨b,b⟩,⟨c,c⟩,⟨d,d⟩,⟨c,b⟩\}$ - nothing $\{⟨b,a⟩,⟨c,b⟩,⟨c,a⟩\}$ -…
0
votes
3 answers

how to find if this function is surjective(onto) or not?

f: [0, ∞) --> [0, ∞) f(x) = x/(1+x) i know this will be one-one since f'(x) is strictly positive and as for onto, someone told me that if i prove f(x) = y then this will be onto so i gave it a try: from f(x) i got x = y/(1-y) then i substituted…
0
votes
2 answers

Can I proove equality of x and y form this expression?

$x$ and $y$ are from $S=(0,1)$, $S \subset \mathbb{R}$. I'm trying to prove that a relation on that set defined as: $$x\rho y \Leftrightarrow \frac{x^2}{1-y^2} \ge \frac{y^2}{1-x^2}$$ is antisymetrical, but get an expression like this: $$x\rho y \:…
0
votes
2 answers

If a relation doesn't apply, is it considered true?

Consider a relation $R = \{(x,y) \in (\mathbb{N}\times\mathbb{N}): 2y\leq x \leq 3y\}$ Is this relation antisymmetric? I can't even find any $(x,y)$ such that $(x,y)\in R \land (y,x)\in R$ , (note -$0\notin \mathbb{N}$) or the relation $R = \{(x,y)…
blz
  • 615
0
votes
2 answers

Is a dividing relation on the natural numbers an symmetric/antisymmetric relation?

Let $R = \{(x,y) \in (\mathbb{N}\times\mathbb{N}): x \mid 2y\}$. I.e. $R$ is the set of all pairs $(x,y)$ of natural numbers (excluding $0$) such that $x$ divides $2y$. Is such a relation antisymmetric? Is such a relation symmetric? I can't even…
blz
  • 615
0
votes
1 answer

Is the following relation transitive?

R = {(a,a),(a,c),(a,d),(b,b),(b,a),(c,c),(c,b),(c,d),(d,e),(e,a)} I believe it is transitive however in the answer sheet I have it says it is not. I'm following the idea that if R(a,b) and R(b,c) then if R(a,c) it is transitive. I have tried this…
Nik F
  • 3
0
votes
1 answer

Which properties does this relation satisfy?

The relation is $(x_1,y_1)R(x_2,y_2)$ such that $(x_1 ≥ x_2) ∧ (y_1 ≥ y_2)$. I am asked to decide which properties satisfy (reflexivity, symmetry and transitivity ) but I cannot understand how the relation works here.
Paul
  • 3
0
votes
1 answer

Prove that $|p_1 - q_1| \leq p_2 - q_2$ relation is transitive for all points in $\mathbb{R}^2$

Given two points $p,q \in \mathbb{R}^2$, we say $p \preccurlyeq q$ if $|p_1 - q_1| \leq p_2 - q_2$. How do I show that this relation is transitive? By definition I have to show that if xRy and yRz then xRz $\forall x,y,z \in \mathbb{R}^2$.
0
votes
2 answers

Show cardinalities same. Trouble with 2 variables in exponent.

Let $A:=\{2^a\cdot3^b: a,b\in\mathbb{N}\}$. Show that $|\mathbb{N}\times \mathbb{N}|=|A|$. I need to show that the cardinality is the same for $\mathbb{N}\times \mathbb{N}$ and $A$ by showing that the function is bijective. I think I figured out…
0
votes
3 answers

Transitivity and symmetry does not imply reflexivity counterexample?

I am not understanding the following counterexample (found in a solutions manual) for a transitive and symmetric relation that is not reflexive. Consider set $A = \{1,2,3\}$. Then $R = \{(1, 3), (3, 1), (1, 1), (3, 3)\}$ is symmetric and transitive,…
TomD1
  • 93
0
votes
1 answer

two examples of relations with some conditions (transitive, irreflexive, asymmetric)

I need help with this two exmples, I have no idea. a example of a relation holds trichotomy and that it is not transitive. a example of a relation that is irreflexive and that it is not asymmetrical. R holds trichotomy if $x
Femonto
  • 39
0
votes
1 answer

R and S are equivalence relations on set A. Prove $R\cap S$ is an equivalence relation on A.

This is a textbook problem, and I'm trying to understand how it can be proved. I feel like I can come up with a counterexample, but assume I must be wrong somewhere in my understanding. For sake of counterexample, assume A = {1,2}, R={(1,1)},…