Talk:Equivalence of Definitions of Transitive Closure (Relation Theory)/Intersection is Smallest/Proof 1
< Talk:Equivalence of Definitions of Transitive Closure (Relation Theory) | Intersection is Smallest
Jump to navigation
Jump to search
Propose deletion
I moved the good parts to Recursive Construction of Transitive Closure. --Dfeuer (talk) 21:13, 13 December 2012 (UTC)
- Why? This result is perfectly valid and works for theoretical applications. The construction is only needed for some proofs, certainly not for all. --Lord_Farin (talk) 22:04, 13 December 2012 (UTC)
- Never mind, it's because Proof 2 is the same. --Lord_Farin (talk) 22:04, 13 December 2012 (UTC)
- The more I think about it, the more I think I did it wrong, but I'm not sure how to do it right. --Dfeuer (talk) 22:16, 13 December 2012 (UTC)
- Your call to separate the construction was right. I think it will suffice to add a (one or two-line) proof based on that result for Transitive Closure Always Exists. Then, in the end, the information content has grown as a result of your actions. --Lord_Farin (talk) 22:19, 13 December 2012 (UTC)
- The more I think about it, the more I think I did it wrong, but I'm not sure how to do it right. --Dfeuer (talk) 22:16, 13 December 2012 (UTC)