We give a streamlined short proof of Newman's theorem in communication complexity by applying the classical and the approximate Carath\'eodory's theorems.

翻译：本文通过应用经典及近似卡拉西奥多里定理，为通信复杂性中的纽曼定理提供了一个简洁流畅的简短证明。