Using the left-to-right convention for composition of relations, two equivalence relations have an equivalence-relation composite exactly when . Its inverse is . Commutation gives , proving transitivity. Every equivalence relation containing contains their two-step composite, so this is their least common extension.
// Destination: combinatorics.bigb
Articles by others on the same topic
There are currently no matching articles.