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
2
votes
1 answer

How is "smallest" defined with regards to the partial order $\subset$?

If we define a partial order $\preceq _R$ on any set $A$ by $B\preceq_R C$ if and only if $B\subset C$ for subsets $B$ and $C$ of $A$. Then how would the term "smallest" be interpreted in this relation? I ask this, because when we define the…
Seeker
  • 3,594
2
votes
3 answers

Define a relation $\sim$ on $\Bbb R$ by $x\sim y\iff x-y\in\Bbb Z$. Show for any $x\in\Bbb{R}$, there is a unique $y\in [0,1)$ such that $x\sim y$.

b) Show that for any $x \in \mathbb{R}$, there is a unique $y \in [0,1)$ such that $x \sim y$. In part a), I've proven that $\sim$ is an equivalence relation. I'm stuck on how to put my thoughts into a proof for b. I've gotten that for any $x$, then…
2
votes
1 answer

Is the following relation reflexive, symmetric and transitive?

Consider the following relation in $\mathbb{R}$: $x \sim y \Leftrightarrow y^2 \leq 9-x^2$. Is this relation reflexive, symmetric and transitive? I know it's not reflexive because, for example, for $x=4$, $x \nsim x$. I think it's symmetric, but I'm…
elliecc
  • 21
2
votes
1 answer

Does there exist one relation is both reflexive, symmetric, transitive, antisymmetric?

Basically, we have 4 types of relations: reflexive, symmetric, antisymmetric, transtive. And then we separate 4 above types into 2 new definition: One relation is reflexive, symmetric, transitve called equivalent relation. One relation is…
VAKK_19
  • 17
2
votes
0 answers

Is x ∗ y ≥ 0 on the Integers a transitive relation?

So this textbook I'm working through is claiming that x ∗ y ≥ 0 on the Integers is a transitive relation, however this seems clearly wrong. Let x ~ y and y ~ z. If x < 0, y = 0, and z > 0, then clearly x ~ z is false, and would not be a part of the…
2
votes
1 answer

Basic relations theorem

I need to prove that If relations $\rho$, $\sigma$ are both reflexive and symmetric, and their composition $\rho\sigma$ is symmetric, then $\rho\sigma = \rho\vee\sigma$. It's obvious that $\rho\sigma$ includes all relations from both $\rho$ and…
Fyodor
  • 511
2
votes
1 answer

Does every element of a set need to exist in the relation for it to be reflexive?

I came across this following problem: Let $R$ be a reflexive relation on a finite set $A$ having $n$ elements and let there be $m$ ordered pairs in $R$, then: A) $m\ge n$ B) $m \le n$ C) $m=n$ D) None of these I initially started with taking a…
2
votes
1 answer

What is this binary relation called?

Let $\alpha$ be a binary relation over $X$, i.e., $\alpha\subseteq X^2$. What is that name for the binary relation $\beta_{\alpha}$ over $X$ defined by $a\mathrel{\beta_{\alpha}} b$ iff $a\mathrel{\alpha} b$ and $b\mathrel{\alpha} a$? For example,…
fundagain
  • 187
  • 8
2
votes
3 answers

Difference between unsymmetric and anti-symmetric relations?

I am finding difficulty in understanding the difference between asymmetric (non-symmetric) and anti-symmetric relations. Though I didn't quite find any mention of the word asymmetric in the reference book, our teacher had mentioned it while…
2
votes
2 answers

Number of Relations that satisfy a condition

This is a multiple choice question from my Text Book Let $A=\{1,2,3\}$. The no. of relations containing $(1,2)$ and $(1,3)$ which are reflexive and Symmetric but not transitive is (A) $1$ (B) $2$ (C) $3$ (D) $4$ My Approach: $A=\{1,2,3\}$ Relation…
2
votes
1 answer

Find a relation which is reflexive and symmetric but not transitive on integers

The question is stated as: Let $A$ be the set of integers, find a relation $R$ which is reflexive and symmetric in $A$ but not transitive in $A$. By definition we have that. $R$ is reflexive in $A$$ \Leftrightarrow (\forall x)(x \in A \Rightarrow…
2
votes
2 answers

checking Zorn's lemma on an example

I have difficulty with Zorn's lemma. Zorn's lemma. If $A$ is a partially ordered set such that every chain in $A$ has an upper bound, then $A$ contains a maximal element. Let's check it for the following example: $$ A=\left\{0,1, \ldots, 100…
Furdzik Zbignew
  • 326
  • 1
  • 13
2
votes
2 answers

How to visually check the transitivity of a (large) relation matrix by hand?

Let's say we're given a relatively large relation matrix like: $$\begin{pmatrix} 0&1&0&1 \\ 1&0&0&1 \\ 1&1&0&1 \\ 0&0&0&0 \end{pmatrix}$$ Matrices can be as large as 10x10 or higher but only 2D. Checking reflexivity is simply checking for the…
2
votes
1 answer

How can I find the domain of the intersection between two binary relations?

(Sorry for any spelling mistake, English isn't my mothertongue) Today at school we took a logic exam. One of the questions asked us to find the domain and range of the relations xRy and xSy, where R = y^2 + x^2 < 4 and S = x - 2 < y^2. Now, I know…
Augusto
  • 23
2
votes
1 answer

How to prove that a closure is well defined by intersection of sets?

I was told that if we want to prove a definition is well defined, usually what we should do is to prove the existence and uniqueness of the definition. For the question below, what we should do is to prove the intersection is nonempty, and if there…