English

An uncertainty principle for cyclic groups of prime order

Classical Analysis and ODEs 2007-05-23 v6 Number Theory

Abstract

Let GG be a finite abelian group, and let f:G\Cf: G \to \C be a complex function on GG. The uncertainty principle asserts that the support \supp(f):={xG:f(x)0}\supp(f) := \{x \in G: f(x) \neq 0\} is related to the support of the Fourier transform f^:G\C\hat f: G \to \C by the formula \supp(f)\supp(f^)G |\supp(f)| |\supp(\hat f)| \geq |G| where X|X| denotes the cardinality of XX. In this note we show that when GG is the cyclic group Z/pZ\Z/p\Z of prime order pp, then we may improve this to \supp(f)+\supp(f^)p+1 |\supp(f)| + |\supp(\hat f)| \geq p+1 and show that this is absolutely sharp. As one consequence, we see that a sparse polynomial in Z/pZ\Z/p\Z consisting of k+1k+1 monomials can have at most kk zeroes. Another consequence is a short proof of the well-known Cauchy-Davenport inequality.

Keywords

Cite

@article{arxiv.math/0308286,
  title  = {An uncertainty principle for cyclic groups of prime order},
  author = {Terence Tao},
  journal= {arXiv preprint arXiv:math/0308286},
  year   = {2007}
}

Comments

7 pages, no figures, submitted, Math Research Letters. More references added

R2 v1 2026-07-22T16:57:14.481Z