Metric regularity, strong CHIP, and CHIP are distinct properties

Metric regularity, the strong conical hull intersection property (strong CHIP), and the conical hull intersection property (CHIP) are properties of a collection of finitely many closed convex intersecting sets in Euclidean space. It was shown recently that these properties are fundamental in several branches of convex optimization, including convex feasibility problems, error bounds, Fenchel duality, and constrained approximation. It was known that regularity implies strong CHIP, which in turn implies CHIP; moreover, the three properties always hold for \emph{subspaces}. The question whether or not converse implications are true for general convex sets was open. We show that --- even for \emph{convex cones} --- the converse implications need not hold by constructing counter-examples in $\R^4$.