Why transformation monoids are harder than permutation groups

For permutation groups (or transformation monoids), we don’t need to assume the associative law, since composition of functions is always associative. So a permtation group is a set of mappings satisfying the identity, inverse and closure axioms. This implies that … Continue reading →