Chebotarev theorem on roots of unity
The Chebotarev theorem on roots of unity was originally a conjecture made by Ostrowski in the context of lacunary series.
Chebotarev was the first to prove it, in the 1930s. This proof involves tools from Galois theory and pleased Ostrowski, who made comments arguing that it "does meet the requirements of mathematical esthetics".[1] Several proofs have been proposed since,[2] and it has even been discovered independently by Dieudonné.[3]
Statement
Let [math]\displaystyle{ \Omega }[/math] be a matrix with entries [math]\displaystyle{ a_{ij} =\omega^{ij},1\leq i,j\leq n }[/math], where [math]\displaystyle{ \omega =e^{2\mathrm i\pi / n},n\in \mathbb{N} }[/math]. If [math]\displaystyle{ n }[/math] is prime then any minor of [math]\displaystyle{ \Omega }[/math] is non-zero.
Equivalently, all submatrices of a DFT matrix of prime length are invertible.
Applications
In signal processing,[4] the theorem was used by T. Tao to extend the uncertainty principle.[5]
Notes
References
- Stevenhagen, Peter; Lenstra, Hendrik W (1996). "Chebotarev and his density theorem". The Mathematical Intelligencer 18 (2): 26–37. doi:10.1007/BF03027290.
- Frenkel, PE (2003). "Simple proof of Chebotarev's theorem on roots of unity". arXiv:math/0312398.
- Terence Tao (2005), "An uncertainty principle for cyclic groups of prime order", Mathematical Research Letters 12 (1): 121–127, doi:10.4310/MRL.2005.v12.n1.a11
- Dieudonné, Jean (1970). "Une propriété des racines de l'unité". Collection of Articles Dedicated to Alberto González Domınguez on His Sixty-fifth Birthday.
- Candes, Emmanuel J; Romberg Justin K; Tao, Terence (2006). "Stable signal recovery from incomplete and inaccurate measurements". Communications on Pure and Applied Mathematics 59 (8): 1207–1223. doi:10.1002/cpa.20124. Bibcode: 2005math......3066C.
 |  |
