Tightness (semi-tightness) follows if C(•) is monotone increasing (respectively monotone non-decreasing) in AVG Co (•) when C o is monotone non-decreasing in operator length.
a metric assigning lower complexity to more factorizable permutations (by average operator length) is tight, i.e., it allows comparing permutations by the smallest complexity assigned to them within this framework.