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

Is the relation $R = \emptyset$ reflexive, symmetric and transitive ? Why?

Can someone help me understand the properties of the relation $R = \emptyset$ ? It looks to me like it's not reflexive, since there is no element related to any element, so the elements are not related to themselves ! Right ? So, does it mean it's…
basratio
  • 303
13
votes
10 answers

I need a relation which is not reflexive, not symmetric, and not transitive

I need an example of a relation which is simultaneously not reflexive, not symmetric, and not transitive. Any accessible examples? Thanks in advance.
11
votes
1 answer

The relation "is strictly higher than" is considered antisymmetric?

I'm studying from Michael Carter's "Foundations" and in the answer key to exercise 1.15 he says that with regard to mountain peaks the relation "is strictly higher than" is antisymmetric. In other words, if $xRy$ and $yRx$ implies $x=y$ How can the…
10
votes
3 answers

Is the relation $R = \{(a,b),(a,c),(b,a),(b,c),(c,a),(c,b),(d,d)\}$ symmetric? I think it is but my professor claims it isn't.

Is the relation $R = \{(a,b),(a,c),(b,a),(b,c),(c,a),(c,b),(d,d)\}$ symmetric? My professor claims that if $(d,d)$ was not included, it would be symmetric, but the inclusion of $(d,d)$ ruins it because $d$ has to connect to another element of the…
SGifto73
  • 101
  • 4
10
votes
5 answers

Is there a relation which is neither symmetric nor antisymmetric?

I've proved that there are relations which are both symmetric and antisymmetric ($\forall a \forall b (aRb \rightarrow (a=b))$) and now I'm trying to prove that there are relations which are neither symmetric nor antisymmetric. I got stuck! Any…
user21530
9
votes
2 answers

If a relation is symmetric and transitive, will it be reflexive?

Possible Duplicate: Why isn't reflexivity redundant in the definition of equivalence relation? We had a heated discussion in class today and i still cant be sure if the professor was any good with the solution. The question is: If a relation is…
Kraken
  • 593
7
votes
4 answers

Atransitive relations?

A relation is transitive if $$x\ R\ y\ \text{and}\ y\ R\ z \implies x\ R\ z$$ for all $x,y,z.$ Are there any relations which are atransitive, or in other words, $$x\ R\ y\ \text{and}\ y\ R\ z \implies \neg (x\ R\ z)$$ for all $x,y,z?$ It doesn't…
Jbag1212
  • 1,435
7
votes
2 answers

Confusion between operation and relation: Clarification needed

I'm doing some old exams and found following question: Set $S={{1,2,3}}$ is given. Provide an example of binary operation in set S, binary relation in set S and a function $f:S\rightarrow R$. So, I'm thinking about $+_4$ as operation, but…
AndrejaKo
  • 1,059
7
votes
4 answers

What binary relation is neither symmetric, nor asymmetric nor antisymmetric?

I thought it was the relation $\varnothing$, but the answer in the textbook I am using does not mention this as a possible answer. I don't understand why it can't be the answer. Could anyone explain?
6
votes
3 answers

Mathematical definition of a relational database

I'm reading a very verbose textbook on database design, but I suspect that much of the book could be condensed into a few pages if the authors were not trying to avoid mathematical language. What is the mathematical definition of a relational…
littleO
  • 51,938
6
votes
1 answer

How to draw Hasse diagram

How would you draw a Hasse diagram of the divisibility relation? when A = {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15} Any help would be appreciated, thank you.
6
votes
2 answers

Calculate transitive closure of a relation

I am trying to understand how to calculate the transitive closure of a set and I have read several times the definition of the transitive closure but I still cannot understand some answers I see when doing questions. From my definition, the…
Nubcake
  • 426
  • 1
  • 6
  • 17
6
votes
7 answers

Branch of math studying relations

There are many branches of mathematics (analysis, algebra, group theory, logic, ...). Now, I'm interested in relations and their special kinds (like equivalence relation) and their properties. I'd like to find out more about them. Where should I…
xralf
  • 277
5
votes
1 answer

Proving isomorphisms from posets.

An isomorphism from a poset $(S_1,R_1)$ to a poset $(S_2,R_2)$ is a bijection $f: S_1 \rightarrow S_2$ such that, for all $x,y \in S_1$ $(x,y) \in R_1 \leftrightarrow (f(x), f(y)) \in R_2$ When such an isomorphism exists, we say that $(S_1,R_1)$ is…
usukidoll
  • 2,074
5
votes
0 answers

Prove that $(G\cap H)_x\subseteq G_x\cap H_x$ and $(G\cup H)_x=G_x\cup H_x$.

Definition: Let $A$ be a set and let $G$ be an equivalence relation in A. If $x ∈ A$, then the equivalence class of $x$ modulo $G$ is the set $G_x$ defined as follows: $$G_x=\{y\in A\mid (y,x)\in G\}=\{y\in A\mid y\sim _G x\}.$$ Let $G$ and $H$…
asd asd
  • 533
1
2 3
46 47