Beck–Fiala theorem

Short description: Theorem about balanced coloring of set systems

In mathematics, the Beck–Fiala theorem is a major theorem in discrepancy theory due to József Beck and Tibor Fiala. Discrepancy is concerned with coloring elements of a ground set such that each set in a certain set system is as balanced as possible, i.e., has approximately the same number of elements of each color. The Beck–Fiala theorem is concerned with the case where each element doesn't appear many times across all sets. The theorem guarantees that if each element appears at most t times, then the elements can be colored so that the imbalance is at most 2t − 1.

Statement

Formally, given a universe

[math]\displaystyle{ [n] = \{1, \ldots , n\} }[/math]

and a collection of subsets

[math]\displaystyle{ S_1, S_2, \ldots, S_m \subseteq [n] }[/math]

such that for each [math]\displaystyle{ i \in [n] }[/math],

[math]\displaystyle{ \vert \{j; i \in S_j \} \vert \leq t, }[/math]

then one can find an assignment

[math]\displaystyle{ x : [n] \rightarrow \{-1,+1\} }[/math]

such that

[math]\displaystyle{ |x(S_j)| \leq 2t-1, \forall j \text{ where }x(S_j) := \sum_{i \in S_j} x_i. }[/math]

Proof sketch

The proof is based on a simple linear-algebraic argument. Start with [math]\displaystyle{ x_i = 0 }[/math] for all elements and call all variables active in the beginning.

Consider only sets with [math]\displaystyle{ \vert S_j \vert \gt t }[/math]. Since each element appears at most [math]\displaystyle{ t }[/math] times in a set, there are less than [math]\displaystyle{ n }[/math] such sets. Now, enforce linear constraints [math]\displaystyle{ \sum_{i \in S_j} x_i = 0 }[/math] for them. Since it is a non-trivial linear subspace of [math]\displaystyle{ \mathbf{R}^n }[/math] with fewer constraints than variables, there is a non-zero solution. Normalize this solution, and at least one of the values is either [math]\displaystyle{ +1,-1 }[/math]. Set this value and inactivate this variable. Now, ignore the sets with less than [math]\displaystyle{ t }[/math] active variables. And repeat the same procedure enforcing the linear constraints that the sum of active variables of each remaining set is still the same. By the same counting argument, there is a non-trivial solution, so one can take linear combinations of this with the original one until some element becomes [math]\displaystyle{ +1,-1 }[/math]. Repeat until all variables are set.

Once a set is ignored, the sum of the values of its variables is zero and there are at most [math]\displaystyle{ t }[/math] unset variables. The change in those can increase [math]\displaystyle{ |x(S_j)| }[/math] to at most [math]\displaystyle{ 2t-1 }[/math].

References

• József Beck and Tibor Fiala (1981). ""Integer-making" theorems". Discrete Applied Mathematics 3 (1): 1-8. doi:10.1016/0166-218X(81)90022-6. 
• Chazelle, Bernard (2000). The Discrepancy Method: Randomness and Complexity. New York: Cambridge University Press. ISBN 0-521-77093-9. https://archive.org/details/discrepancymetho0000chaz.