The fundamental result of Li, Long, and Srinivasan [14] on approximations set systems has become a key tool across several communities such as learning theory, algorithms, computational geometry, combinatorics, data analysis. goal this paper is to give modular, self-contained, intuitive proof for finite systems. only ingredient we assume the standard Chernoff's concentration bound. This makes a...