Give a relation, R, on the set of integers, such as R = {(1,2)(2,2) ... } is there a way to determine transitivity without going through each ordered pair (x,y)(y,z) to see if (x,z) is there?
2026-03-28 09:55:38.1774691738
Given a Relation (set of ordered pairs), prove transitivity without going through each pair?
345 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
No. you have to check for each pair of ordered pair. Sorry no shortcuts