In mathematics, computer science, physics or any other field that has the concept of commutative operations (or operators), is there a verb to describe the action of taking a sequence AB of two non-commuting operations A and B and modifying each operation so that the inverted sequence B'A' of the modified operations A' and B' has the same effect as AB (i.e. AB = B'A')? Obviously this only makes sense under the constraint that some property of the operations be preserved under the modification, thereby excluding the trivial modification of setting A' = B and B' = A.
I've seen at least one program library refer to this as "commuting" A and B, but I'm not sure if that's correct, given that the usual meaning of "to commute" in this context (cf. Wikipedia article linked above) is that operations can be swapped without making any modifications, e.g. one would say "A and B commute" if AB = BA. On the other hand, perhaps it actually makes perfect sense from that perspective: "If A and B don't commute [on their own], we have to commute them [ourselves, doing something in addition to merely swapping them] if we want to change their order".
I'm just wondering if this is commonly accepted usage for "to commute" or not and whether there are any better expressions if not.
AND
. But math is characterized by economizing on operations while multiplying their arguments. Language, on the other hand, multiplies operations and functions that can apply to the comparatively less numerous things/objects/topics that we can identify. So Abelianism pops up here and there (marry is a commutative verb), but it's not normally conserved.