Impossibility of Independence Amplification in Kolmogorov Complexity Theory

Abstract

The paper studies randomness extraction from sources with bounded independence and the issue of independence amplification of sources, using the framework of Kolmogorov complexity. The dependency of strings x and y is dep(x,y) =  max {C(x) − C(x |y), C(y) − C( y|x)}, where C(·) denotes the Kolmogorov complexity. It is shown that there exists a computable Kolmogorov extractor f such that, for any two n-bit strings with complexity s(n) and dependency α(n), it outputs a string of length s(n) with complexity s(n) − α(n) conditioned by any one of the input strings. It is proven that the above are the optimal parameters a Kolmogorov extractor can achieve. It is shown that independence amplification cannot be effectively realized. Specifically, if (after excluding a trivial case) there exist computable functions f ₁ and f ₂ such that dep(f ₁(x,y), f ₂(x,y)) ≤ β(n) for all n-bit strings x and y with dep(x,y) ≤ α(n), then β(n) ≥ α(n) − O(logn).