Loading AI tools
All submatrices of a discrete Fourier transform matrix of prime length are invertible From Wikipedia, the free encyclopedia
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]
Let be a matrix with entries , where . If is prime then any minor of is non-zero.
Equivalently, all submatrices of a DFT matrix of prime length are invertible.
In signal processing,[4] the theorem was used by T. Tao to extend the uncertainty principle.[5]
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.