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

Mapping relations

Which of the following relations $f\colon \mathbb{Q} \to \mathbb{Q} \!\,$ define a mapping? In each case, supply a reason why $f$ is or is not a mapping. So my understanding is that a mapping is a special relation is which an element $a$ in the…
Math Major
  • 2,234
0
votes
1 answer

Problem of understanding transitive relations

I would like to understand the transitive property in relations...I just cant get it in my brain. I mean the definition is crystal clear. However I still struggle. For example: Given the set $A=\{0,1,2\}$ the…
Mamba
  • 803
0
votes
2 answers

How many one-to-one relations $A\rightarrow{A}$ are possible for a set $A$?

I have a set A of unique elements, I want to know how many one-to-one relations on itself are possible?
0
votes
1 answer

Is {(1, 1), (2, 2)} symmetric and/or antisymmetric?

For relation $$\left\{(1, 1),(2, 2)\right\}$$ decide whether it is symmetric, whether it is antisymmetric, and whether it is transitive?
0
votes
1 answer

Let S be the transitive closure of R. Describe the relation S

If $R$ is described as follows $R = \{ (p, q) \in P\times P | \mbox{ The person } p \mbox{ is a parent of the person } q\}$, and $P$ is the set of people. I describe $S$ as the follows $S = \{(p, q) \in P\times P | p \mbox{ is ancestor of } q\}$ Is…
user168764
0
votes
1 answer

if $R_1$ and $R_2$ are symmetric and transitive, then $R_1 \cup R_2$ is still symmetric and transitive.

This is an exercise of the assignment we have: Suppose $R_1$ and $R_2$ are relations on A. Prove (with a formal proof) or confute (with a counterexample) that if $R_1$ and $R_2$ are symmetric and transitive, then $R_1$ $\cup$ $R_2$ is still…
user168764
0
votes
1 answer

Proving equivalence relation and classes

I was wondering how I could prove aRb if and only if 5 | (a + 4b) , on the set of all integers I'm used to proving for sets of numbers so I have no idea how to start out for this... Equivalence relation I know means reflexive, symmetric and…
0
votes
1 answer

Prove the relation {(1, 1),(2, 2),(3, 3),(4, 4),(3, 2),(2, 1),(3, 1),(4, 1)} on the set S = {1, 2, 3, 4} is a partial ordering.

I know that to prove something is a partial order, the relation ≤ has to be reflexive, transitive, and anti-symmetric. So, given this relation {(1, 1),(2, 2),(3, 3),(4, 4),(3, 2),(2, 1),(3, 1),(4, 1)} on the set S = {1, 2, 3, 4}: For reflexivity,…
JCMcRae
  • 843
0
votes
1 answer

Understanding relations: Are these examples correct?

The task is to find examples for the following relations on the set of (and prove its correctness) : 1: antisymmetric and transitiv 2: antisymmetric and not transitiv (intransitiv) 3: not antisymmetric and transitiv 4: not antisymmetric and not…
jamafu
  • 1
-1
votes
1 answer

condition for transitivity

In transitive relations, $aRb$ and $bRc$ implies $aRc$. But what if there are no $bRc$, can we say that the relation is transitive? For example, are relations $R\subseteq V\times V$, corresponding to graphs like this one,…
-1
votes
1 answer

Showing a counter example $(A\times B)\times C=A\times (B\times C)$

Showing a counter example $(A\times B)\times C=A\times (B\times C)$ I think $A=\{1\}$ $B=\{2\}=C$ Would work but I am not sure...
Fernando Martinez
  • 6,698
  • 19
  • 74
  • 108
-1
votes
1 answer

if a set B has a least upper bound of an on an ordered relation <(a) then will it have least upper bound on an ordered relation <(b)

given a set B ordered by a relation <(a) has a least upper bound property, does B have an least upper bound property if it is ordered by another ordered relation <(b).
-1
votes
0 answers

Prove or disprove: Let $E,F \in \mathcal{I}$. If $\text{row}(E) \subseteq \text{row}(F)$ and $\text{col}(E) \subseteq \text{col}(F)$ then $EF=FE=E$

In the statement above, $\mathcal{I} \ $ is the set of idempotent binary relations on a finite set, $\text{row}(X)$ denotes the row space of the relation $X$, $\text{col}(X)$ denotes the column space of $X$, and $XY$ denotes composition of the…
-1
votes
1 answer

Regarding enumeration of various kinds of relations on a set

The Online Encyclopedia of Integer Sequences (OEIS, popularly known as Sloane, databases more than $320000$ integer sequences. Among these are the sequences counting transitive relations $t(n)$ and partial orders $p(n)$ on a set with $n$ elements.…
-1
votes
1 answer

Directly proportional to which?

This might be a simple question, but the exact wording of this statement is important. If I know that the relationship between two variables is this: $$\gamma \propto \frac{1}{\sqrt{k}}$$ Is the appropriate way to write that in a sentence: 'y is…