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

Need help with determining relations from graphs.

First of all, I'm sorry for the terribly drawn image. So I need to state whether the relations A, B, C, and D are reflexive, symmetric, and/or transitive. BUT, the four of them can't have the same properties. So for A, I know that it is symmetric,…
NAA
  • 227
1
vote
2 answers

is f(x)=1/x reflexive/symmetric/transitive?

Determine whether this relationship is reflexive/symmetric/transitive. Im trying to think of it interms of the graph but i seem to be getting no where. Could someone explain how they would test these properties on the function.
loxi95
  • 25
1
vote
1 answer

Is relation between an even numbers and an odd number transitive?

Suppose I have (a,b) where a is even numbers and b is odd numbers. Is it transitive? I think it is because there is no instance where (a,b) and (b,c) but not (a,c).
1
vote
2 answers

Example of a relation that is reflexive, symmetric, antisymmetric but not transitive.

Please, can you help a beginner mathematician with the following problem? Is there a binary relation that is reflexive, symmetric, antisymmetric but not transitive? Definitions: Relation Let be two sets $A$,$B$ $\neq$$\emptyset$. A relation…
Oromion
  • 291
1
vote
3 answers

Prove the totality of a relation

So I've been redoing some relations problems and came across this one: Prove that the relation defined over $\mathbb{R}^2$ is a total order relation $$ (x_1, y_1) \rho (x_2, y_2) \iff x_1 < x_2 \lor (x_1 = x_2 \land y_1 \le y_2) $$ Assuming the…
1
vote
1 answer

On the equivalence classes of a relation (Myhill-Nerode theorem)

There is an exercise in Kozen's book on the equivalence classes of a relation: I need to describe the equivalence classes of the relation ☰PAREN, where PAREN is the set of balanced strings of parentheses [ ]. I thought I solved the exercise by…
1
vote
1 answer

Is this relation transitive when (x,y) and (x,z) exist but (y,z) does not?

I encountered a question in doing my exercise about relations: {1; 2; 3; 4; 5}. R = {(1; 1);(1; 2);(1; 4);(3; 3);(4; 2);(4; 4);(5; 3);(5; 5)} I need to answer whether the relation is transitive. My guess is YES, because for every ordered pair (x,y)∈…
ronzenith
  • 131
1
vote
2 answers

What is the number of equivalence classes formed by a merge

I have this question related to the number of equivalence classes of equivalence relations. If $R_1$ and $R_2$ are two equivalence relations on a set $A$ with number of equivalence classes of $R_1 = n_1$ and number of equivalence classes of $R_2=…
user34790
  • 4,192
1
vote
3 answers

properties of relations

I'm trying to do some chapter problems on equivalence relations. I'm stuck in the second section "properties of relations." Question: Let $A=\{a,b,c,d\}$. Give an example of a relation $R$ on $A$ that is neither reflexive, symmetric ,or…
1
vote
1 answer

Closure notation help

Example: Let <· be the relation on integers defined by x <· y if x + 1 = y. • The transitive closure of <· is <. • The reflexive and transitive closure of <· is ≤. What do the dots mean next to the greater than and less than symbols?
1
vote
1 answer

Can someone explain antisymmetric versus symmetric relation of sets?

If $$A = \{1,2,3,4\} $$ and $$R = \{(3,3), (4,4), (1,4)\}$$ This example is antisymmetric but not symmetric. However, the definition of Antisymmetric taken from Merriam-Webster is this: relating to or being a relation (as “is a subset of”)…
1
vote
2 answers

Where is the transistivity in this equivalence relation

The following set has been given: $A = \{1,2,3\}$, and the following relation on $A$ has been given: $S = \{(1,1),(2,1),(1,2),(2,2),(3,3)\}$. The answer says this is a valid equivalence relation. I can see how it is symmetric and reflexive, but I…
1
vote
0 answers

Let A be a set with $\lvert A \rvert$ = $4$. What is the max number of elements tht a relation R on A can contain so tht $R \cap R^{-1}$ = $\emptyset$

Let A be a set with $\lvert A \rvert$ = $4$. What is the maximum number of elements that a relation R on A can contain so that $R \cap R^{-1}$ = $\emptyset$? I am not sure at all how to start this and my instructor says that it does not require a…
Matt
  • 297
1
vote
1 answer

Are R,S and T equivalence relation or partial order relation?

Let $R$, $S$ and $T$ be binary relations defined as follows R is defined on $P(\mathbb{N})$ by $ARB$ if and only if $|A∩B| ≥ 2$ $S$ is defined on $Q$ by $x\mathbin{S}y$ if and only if $|x|=|y|$. (Note that |$q$| is defined to be the largest…
SAR
  • 297
1
vote
1 answer

What is a minimal relation?

I was reading this definition of transitive closure of a relation, where is written that the transitive closure is minimal: the transitive closure of a binary relation R on a set X is the transitive relation R+ on set X such that R+ contains R and…
danza
  • 1,205