Isolation lemma explained

In theoretical computer science, the term isolation lemma (or isolating lemma) refers to randomized algorithms that reduce the number of solutions to a problem to one, should a solution exist.This is achieved by constructing random constraints such that, with non-negligible probability, exactly one solution satisfies these additional constraints if the solution space is not empty.Isolation lemmas have important applications in computer science, such as the Valiant–Vazirani theorem and Toda's theorem in computational complexity theory.

The first isolation lemma was introduced by, albeit not under that name.Their isolation lemma chooses a random number of random hyperplanes, and has the property that, with non-negligible probability, the intersection of any fixed non-empty solution space with the chosen hyperplanes contains exactly one element. This suffices to show the Valiant–Vazirani theorem:there exists a randomized polynomial-time reduction from the satisfiability problem for Boolean formulas to the problem of detecting whether a Boolean formula has a unique solution. introduced an isolation lemma of a slightly different kind:Here every coordinate of the solution space gets assigned a random weight in a certain range of integers, and the property is that, with non-negligible probability, there is exactly one element in the solution space that has minimum weight. This can be used to obtain a randomized parallel algorithm for the maximum matching problem.

Stronger isolation lemmas have been introduced in the literature to fit different needs in various settings.For example, the isolation lemma of has similar guarantees as that of Mulmuley et al., but it uses fewer random bits.In the context of the exponential time hypothesis, prove an isolation lemma for k-CNF formulas.Noam Ta-Shma^[1] gives an isolation lemma with slightly stronger parameters, and gives non-trivial results even when the size of the weight domain is smaller than the number of variables.

The isolation lemma of Mulmuley, Vazirani, and Vazirani

Lemma. Let

n and N be positive integers, and let l F be an arbitrary nonempty family of subsets of the universe \{ 1 , ... ,n\} . Suppose each element x\in\{ 1 , ... ,n\} in the universe receives an integer weight w(x) , each of which is chosen independently and uniformly at random from \{ 1 , ... ,N\} . The weight of a set S in l F is defined asw(S) = \sum _{x} w(x).

Then, with probability at least

1- n/N , there is a unique set in l F that has the minimum weight among all sets of l F .It is remarkable that the lemma assumes nothing about the nature of the family l F : for instance l F may include all 2 ^{n-1} nonempty subsets. Since the weight of each set in l F is between 1 and nN on average there will be ( 2 ^{n-1)} / (nN) sets of each possible weight.Still, with high probability, there is a unique set that has minimum weight.

Mulmuley, Vazirani, and Vazirani's proof

Suppose we have fixed the weights of all elements except an element x. Then x has a threshold weight α, such that if the weight w(x) of x is greater than α, then it is not contained in any minimum-weight subset, and if

w(x) \le \alpha , then it is contained in some sets of minimum weight. Further, observe that if w(x) < \alpha , then every minimum-weight subset must contain x (since, when we decrease w(x) from α, sets that do not contain x do not decrease in weight, while those that contain x do). Thus, ambiguity about whether a minimum-weight subset contains x or not can happen only when the weight of x is exactly equal to its threshold; in this case we will call x "singular". Now, as the threshold of x was defined only in terms of the weights of the other elements, it is independent of w(x), and therefore, as w(x) is chosen uniformly from,\Pr[x issingular ] = \Pr[w(x) = \alpha] \le 1 /N

and the probability that some x is singular is at most n/N. As there is a unique minimum-weight subset iff no element is singular, the lemma follows.

Remark: The lemma holds with

\le (rather than =) since it is possible that some x has no threshold value (i.e., x will not be in any minimum-weight subset even if w(x) gets the minimum possible value, 1).

Joel Spencer's proof

This is a restatement version of the above proof, due to Joel Spencer (1995).

For any element x in the set, define

\alpha(x) = min _{S} w(S) - min _{S\inlF,} w(S\setminus\{x\}).

Observe that

\alpha(x) depends only on the weights of elements other than x, and not on w(x) itself. So whatever the value of \alpha(x) , as w(x) is chosen uniformly from, the probability that it is equal to \alpha(x) is at most 1/N. Thus the probability that w(x) = \alpha(x) for some x is at most n/N.

Now if there are two sets A and B in

l F with minimum weight, then, taking any x in A\B, we have\begin{align} \alpha(x) & = min _{S} w(S) - min _{S\inlF,} w(S\setminus\{x\}) \\ & = w(B) - (w(A) - w(x)) \\ & = w(x), \end{align}

and as we have seen, this event happens with probability at most n/N.

Examples/applications

• The original application was to minimum-weight (or maximum-weight) perfect matchings in a graph. Each edge is assigned a random weight in, and

l F is the set of perfect matchings, so that with probability at least 1/2, there exists a unique perfect matching. When each indeterminate x _{ij} in the Tutte matrix of the graph is replaced with 2 ^{w _{ij}} where w _{ij} is the random weight of the edge, we can show that the determinant of the matrix is nonzero, and further use this to find the matching.

• More generally, the paper also observed that any search problem of the form "Given a set system

(S, l F) , find a set in l F " could be reduced to a decision problem of the form "Is there a set in l F with total weight at most k?". For instance, it showed how to solve the following problem posed by Papadimitriou and Yannakakis, for which (as of the time the paper was written) no deterministic polynomial-time algorithm is known: given a graph and a subset of the edges marked as "red", find a perfect matching with exactly k red edges.

• The Valiant–Vazirani theorem, concerning unique solutions to NP-complete problems, has a simpler proof using the isolation lemma. This is proved by giving a randomized reduction from CLIQUE to UNIQUE-CLIQUE.
• use the proof of Valiant-Vazirani in their search-to-decision reduction for average-case complexity.
• Avi Wigderson used the isolation lemma in 1994 to give a randomized reduction from NL to UL, and thereby prove that NL/poly ⊆ ⊕L/poly. Reinhardt and Allender later used the isolation lemma again to prove that NL/poly = UL/poly.
• The book by Hemaspaandra and Ogihara has a chapter on the isolation technique, including generalizations.
• The isolation lemma has been proposed as the basis of a scheme for digital watermarking.
• There is ongoing work on derandomizing the isolation lemma in specific cases and on using it for identity testing.

References

• Springer-Verlag . 978-3-540-85362-6 . 276–289 . Arvind . V. . Mukhopadhyay . Partha . Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size . Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques . Boston, MA, USA . 2010-05-10 . 2008 . 0804.0957. 2008arXiv0804.0957A.
• IEEE Computer Society . 978-0-7695-3169-4 . 268–279 . Arvind . V. . Mukhopadhyay . Partha . Srinivasan . Srikanth . New Results on Noncommutative and Commutative Polynomial Identity Testing . Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity . 2010-05-10 . 2008 . 0801.0514. 2008arXiv0801.0514A.
• Ben-David . S. . Chor . B. . Benny Chor . Goldreich . O. . 10.1145/73007.73027 . On the theory of average case complexity . Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 . 204 . 1989 . 0897913078 .
• Calabro . C. . Impagliazzo . R. . Kabanets . V. . Paturi . R. . The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs . 10.1016/j.jcss.2007.06.015 . Journal of Computer and System Sciences . 74 . 3 . 386 . 2008 . free .
• Chari . S. . Rohatgi . P. . Srinivasan . A. . 10.1145/167088.167213 . Randomness-optimal unique element isolation, with applications to perfect matching and related problems . Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 . 458 . 1993 . 0897915917 . 1813/6129 . free .
• Book: 2002 . Chapter 4. The Isolation Technique . http://www.cs.rochester.edu/~lane/=companion/isolation.pdf . The complexity theory companion . Hemaspaandra . Lane A. . Ogihara . Mitsunori . Springer . 978-3-540-67419-1 . registration .
• ACM . 10.1145/378239.378566 . 1-58113-297-2 . 480–485 . Majumdar . Rupak . Wong . Jennifer L. . Watermarking of SAT using combinatorial isolation lemmas . Proceedings of the 38th annual Design Automation Conference . Las Vegas, Nevada, United States . 2001 . 10.1.1.16.9300 .
• 29 . 1118 . Reinhardt . K. . Allender . E. . [ftp://128.6.25.4/http/pub/allender/nlul.pdf Making Nondeterminism Unambiguous ]. SIAM Journal on Computing . 2000. 10.1137/S0097539798339041 . 4.
• Mulmuley . Ketan . Ketan Mulmuley. Vazirani . Umesh . Umesh Vazirani. Vazirani . Vijay . Vijay Vazirani. Matching is as easy as matrix inversion. Combinatorica. 7. 1. 105–113. 1987. 10.1007/BF02579206. 10.1.1.70.2247.
• Book: Jukna, Stasys . 2001 . Extremal combinatorics: with applications in computer science . Springer . 978-3-540-66313-3 . 147–150 .
• Valiant . L. . Vazirani . V.. 10.1016/0304-3975(86)90135-0 . NP is as easy as detecting unique solutions . Theoretical Computer Science . 47 . 85–93 . 1986 . free .
• Wigderson. Avi . Avi Wigderson . NL/poly ⊆ ⊕L/poly . 1994 . Proceedings of the 9th Structures in Complexity Conference . 59–62.

External links

• Favorite Theorems: Unique Witnesses by Lance Fortnow
• The Isolation Lemma and Beyond by Richard J. Lipton

Notes and References

1. Noam Ta-Shma (2015); A simple proof of the Isolation Lemma, in eccc