The dichotomy between structure and randomness, arithmetic progressions, and the primes
Terence Tao

TL;DR
This paper surveys the fundamental dichotomy between structure and randomness across various mathematical fields, highlighting its role in proving results like Szemerédi's theorem and the Green-Tao theorem on primes.
Contribution
It provides a comprehensive overview of how the structure-randomness dichotomy underpins key results in combinatorics, harmonic analysis, ergodic theory, and number theory.
Findings
The structure-randomness dichotomy is central to many proofs in combinatorics and number theory.
Green and Tao's theorem on primes relies heavily on this dichotomy rather than deep analytic number theory.
Various mathematical contexts exhibit similar themes despite their different frameworks.
Abstract
A famous theorem of Szemer\'edi asserts that all subsets of the integers with positive upper density will contain arbitrarily long arithmetic progressions. There are many different proofs of this deep theorem, but they are all based on a fundamental dichotomy between structure and randomness, which in turn leads (roughly speaking) to a decomposition of any object into a structured (low-complexity) component and a random (discorrelated) component. Important examples of these types of decompositions include the Furstenberg structure theorem and the Szemer\'edi regularity lemma. One recent application of this dichotomy is the result of Green and Tao establishing that the prime numbers contain arbitrarily long arithmetic progressions (despite having density zero in the integers). The power of this dichotomy is evidenced by the fact that the Green-Tao theorem requires surprisingly little…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Limits and Structures in Graph Theory · Graph Labeling and Dimension Problems
