The transitive closure of a relation connects to when a finite nonempty chain of -steps leads from to . Concatenation proves transitivity, and induction along a chain shows that any transitive relation containing contains . This concerns closure of a relation, rather than the transitive closure of a set under membership.
Articles by others on the same topic
There are currently no matching articles.