We have found no simple necessary and sufficient condition on (K, ⊗) that guarantees a globally consistent set of choices to exist.
we have given a useful nec-essary condition (greedy factorization), and we now give a useful sufficient condition.