This talk will highlight the role of geometry in proving information complexity lower bounds. We illustrate this paradigm by considering some classical problems in communication complexity with applications to data stream and sketching lower bounds.