Sum Product Theorem

An example of a basic and powerful theorem in arithmetic combinatorics is the sum product theorem of Jean Bourgain, Nets Katz, and Terence Tao. It is an elementary but fundamental quantitative combinatorial fact about the way addition and multiplication work in finite sets of integers. Its generalizations have wide applications to algebra, number theory, theoretical computer science, and most recently to group theory.