The authors first recall the existence of a second equilibrium in addition to independence to reduce the information conveyed from the margins to the joined distribution: the so-called indeterminacy. They break down a drawing under indeterminacy into a mixture of three independent couplings. Leveraging on this decomposition they emphasis it is the best construction to reduce couple matchings, meaning, the expected number of equal couples drawn in a row. Besides they notice the Janson Vegelius coefficient is nothing but a deviation to indeterminacy and demonstrate it tends to $0$ when the number of modalities increases. Eventually, they notice that the indeterminacy appears in two problems (Guessing and Task Partitioning) where couple matchings reduction is a key objective.