# Transitive closure of these relations on $\{1,2,3,4\}$?

Problem

How can I show transitive closure of these relations on $\{1,2,3,4\}$?

1. $\{(1,2), (2,1), (2,3), (3,4), (4,1)\}$

2. $\{(2,1), (2,3), (3,1), (3,4), (4,1), (4,3)\}$

3. $\{(1,2), (1,3), (1,4), (2,3), (2,4), (3,4)\}$

4. $\{(1,1),(1,4), (2,1), (2,3), (3,1), (3,2), (3,4), (4,2)\}$

Attempt

None. I don't understand what "show transitive closure" means.

• Do you understand what the transitive closure of a relation is? – Brian M. Scott Jul 31 '13 at 8:42
• Is it the definition of a transitive relation? $(x,y) \wedge (y,z) \Rightarrow (x,z)$? – user87509 Jul 31 '13 at 8:44
• A good way to do this on small sets is to draw the relation as a graph where the nodes are the elements and there is an arrow from $x$ to $y$ if $x$ is related to $y$. Then finding the transitive closure is a matter of drawing in those arrows you can get by following successive arrows. – Tobias Kildetoft Jul 31 '13 at 8:44
• No, it’s another relation related to the original one. The basic idea is that it’s formed by adding ordered pairs to the original relation until you get a transitive relation. There’s a little more to it than that, though: you have to add the minimum possible set of pairs that will do this. I’ll write up an answer that does the first one as an example. – Brian M. Scott Jul 31 '13 at 8:45
• I see that $Set_1$ is not transitive, as $\exists (1,2) \wedge \exists (2,3)$ but $\not\exists(3,2)$. – user87509 Jul 31 '13 at 8:46

Let $R=\{\langle 1,2\rangle,\langle 2,1\rangle,\langle 2,3\rangle,\langle 3,4\rangle,\langle 4,1\rangle\}$ on $\{1,2,3,4\}$. What failure of transitivity do we have here?

\begin{align*} &\langle 1,2\rangle,\langle 2,1\rangle\in R,\text{ but }\langle 1,1\rangle\notin R\\ &\langle 1,2\rangle,\langle 2,3\rangle\in R,\text{ but }\langle 1,3\rangle\notin R\\ &\langle 2,1\rangle,\langle 1,2\rangle\in R,\text{ but }\langle 2,2\rangle\notin R\\ &\langle 2,3\rangle,\langle 3,4\rangle\in R,\text{ but }\langle 2,4\rangle\notin R\\ &\langle 3,4\rangle,\langle 4,1\rangle\in R,\text{ but }\langle 3,1\rangle\notin R\\ &\langle 4,1\rangle,\langle 1,2\rangle\in R,\text{ but }\langle 4,2\rangle\notin R\\ \end{align*}

This means that in order to expand $R$ to a transitive relation, we must add at least the six ordered pairs $\langle 1,1\rangle,\langle 1,3\rangle,\langle 2,2\rangle,\langle 2,4\rangle,\langle 3,1\rangle$, and $\langle 4,2\rangle$. This gives us the relation

$$R\,'=\{\langle 1,1\rangle,\langle 1,2\rangle,\langle 1,3\rangle,\langle 2,1\rangle,\langle 2,2\rangle,\langle 2,3\rangle,\langle 2,4\rangle,\langle 3,1\rangle,\langle 3,4\rangle,\langle 4,1\rangle,\langle 4,2\rangle\}\;.$$

Are there any failures of transitivity here?

\begin{align*} &\langle 1,2\rangle,\langle 2,4\rangle\in R\,',\text{ but }\langle 1,4\rangle\notin R\,'\\ &\langle 1,3\rangle,\langle 3,4\rangle\in R\,',\text{ but }\langle 1,4\rangle\notin R\,'\\ &\langle 3,1\rangle,\langle 1,3\rangle\in R\,',\text{ but }\langle 3,3\rangle\notin R\,'\\ &\langle 3,1\rangle,\langle 1,2\rangle\in R\,',\text{ but }\langle 3,2\rangle\notin R\,'\\ &\langle 3,4\rangle,\langle 4,2\rangle\in R\,',\text{ but }\langle 3,2\rangle\notin R\,' \end{align*}

Thus, $R\,'$ isn’t yet transitive: we need to add at least the pairs $\langle 1,4\rangle,\langle 3,2\rangle$, and $\langle 3,3\rangle$ to $R\,'$ to have any hope of having a transitive relation. This gives us the relation

$$R''=\{\langle 1,1\rangle,\langle 1,2\rangle,\langle 1,3\rangle,\langle 1,4\rangle,\langle 2,1\rangle,\langle 2,2\rangle,\langle 2,3\rangle,\langle 2,4\rangle,\langle 3,1\rangle,\langle 3,2\rangle,\langle 3,3\rangle,\langle 3,4\rangle,\langle 4,1\rangle,\langle 4,2\rangle\}\;.$$

Note that in $R''$ the elements $1,2$, and $3$ of $A$ are all related to everything in $A$; only $4$ is not. And that gives us some failures of transitivity in $R''$:

\begin{align*} &\langle 4,1\rangle,\langle 1,3\rangle\in R'',\text{ but }\langle 4,2\rangle\notin R''\\ &\langle 4,1\rangle,\langle 1,4\rangle\in R'',\text{ but }\langle 4,4\rangle\notin R'' \end{align*}

There are some other failures, but in each case the missing pair is either $\langle 4,3\rangle$ or $\langle 4,4\rangle$. Thus, to make $R''$ transitive we must at least add these two pairs. Call the resulting relation $\overline{R}$. We can’t add any more pairs, because $\overline{R}=A\times A$: it already contains every possible ordered pair. And finally we do have a transitive relation.

Because at each stage I added only those ordered pairs that that I had actually shown to be necessary for transitivity, this $\overline{R}$ is the smallest transitive relation containing the original relation $R$; by definition it is the transitive closure of $R$. The problem asks you to find and write out the transitive closures of the other three relations as well.

There are much more efficient ways to find the transitive closure of a relation, but at this point it’s probably most instructive for you to do everything by hand, so to speak, as I did above.

• I haven't started reading your answer yet, but, Mr. Scott, thank you very much for all the detailed teaching and help you provide on this site. You are amazing! – user87509 Jul 31 '13 at 9:10
• @positiveimpact: You’re very welcome. And thank you. – Brian M. Scott Jul 31 '13 at 9:18
• Follow-up hint: In this case, we have $\langle 1,2\rangle,\langle 2,3\rangle,\langle 3,4\rangle,\langle 4,1\rangle\in R$, this already immplies $\overline{R}=A\times A$. (why?) – Tomas Jul 31 '13 at 10:29
• Regarding this set: $\{(2,1),(2,3),(3,1),(3,4),(4,1),(4,3)\}$ -- There are no paths that originate from 1. I think I obtained transitive closure at R^2 by adding the pairs $(2,4),(3,3),(4,4)$. Is my thought correct? Can I obtain transitive closure if there are paths from a to b, but no paths from b, in this case from every element in set $A$ to 1, yet no paths from 1 to another element in $A$? – user87509 Jul 31 '13 at 11:25
• @Tomas I'm not sure why! How does that imply $R^*$ is $A$ x $A$? And what do you mean by $A$ x $A$? Does this mean 4x4 =16, i.e., there are four nodes in set $A$, so there are 16 possible combinations of nodes? – user87509 Jul 31 '13 at 11:27
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.912563145160675, "perplexity": 715.7479686122085}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2019-43/segments/1570987833089.90/warc/CC-MAIN-20191023094558-20191023122058-00274.warc.gz"}