On the vector Gaussian CEO problem

A lower bound on each supporting line of the rate region of the vector Gaussian CEO problem is derived. The key technical ingredient is a new extremal inequality. It is shown that the lower bound coincides with the Berger-Tung upper bound in the high-resolution regime. The application of the new bounding technique to the vector Gaussian multiterminal source coding problem is also discussed.