Quantitative Aspects of the Idempotent Theorem
summary
Proves a quantitative idempotent theorem: an integer‑valued (or ±1) function with small Fourier algebra norm m decomposes as a signed sum of few subgroup coset indicators — previous doubly‑exponential bounds drop to about exp(O(m^4)) many cosets. Key tools are additive‑energy arguments + Balog–Szemerédi–Gowers/Freiman input, a Chang/Rudin type structural lemma to find a subgroup of codimension O(m), and an L^p bootstrapping that forces ε to be exponentially small; the construction is effective and yields the stated bound.
AI-written summary · about
chapters (10)
- 0:00Introduction
- 3:15Group projections and decompositions
- 10:02Projection norms and quality
- 12:31Representations and decompositions
- 23:49Idempotent Theorems
- 34:17Decomposing functions with subgroups
- 41:14Decomposition challenges
- 45:34Quantitative continuity and subgroups
- 52:12Improving bounds and results
- 57:23Summary
