Vanishing sums of integral linear combinations of roots of unity

532 Views Asked by At

Let $\{ \xi^{i} \}_{i=1}^{n}$ be $n$-th roots of unity for some positive integer $n$. It is well known that if $n$ is a prime integer, there will be $n-1$ primitive $n$-th roots of unity which are linearly independent over $\mathbb{Q}$. In other words, the following relation is valid only when all the coefficients $a_i$s are zeros. $$\sum_{i=1}^{n-1}a_i\xi^i=0. $$ If $n$ is not a prime number, such linear independence can still be shown for the primitive $n$-th roots of unity (Edit: if and only if $n$ is square-free). Now my question is related to the linear independence of the sequential roots of unity.

To be precise, what is the maximum value of $k<n$, for which the roots $\xi, \xi^2, ...\xi^k$ are linearly independent. Where $n$ is a positive integer and not necessarily a prime number. And also is there a way to check the linear independence of roots of unity numerically using Python or any other programming language?. I am a physics graduate and encountered this problem while solving a physics-related question. Can someone please provide an intuitive answer with an explanation? Thanks in advance.

1

There are 1 best solutions below

4
On BEST ANSWER

For any algebraic number $\alpha$, the largest positive integer $d$ such that the $d$ successive powers $1,\alpha, \alpha^2, \ldots,\alpha^{d-1}$ are linearly independent over $\mathbf Q$ is the dimension of the field $\mathbf Q(\alpha)$ as a vector space over $\mathbf Q$ and this is also the degree of the minimal polynomial of $\alpha$ in $\mathbf Q[x]$. For nonzero $\alpha$, the numbers $\alpha, \alpha^2, \ldots, \alpha^d$ are linearly independent over $\mathbf Q$ if and only if $1, \alpha, \alpha^2, \ldots, \alpha^{d-1}$, so the largest such $d$ is the degree of the minimal polynomial of $\alpha$ in $\mathbf Q[x]$.

When $\alpha$ is a root of unity of exact order $n$, it is well-known that its minimal polynomial is the $n$th cyclotomic polynomial, which has degree $\varphi(n)$. When $n = p$ is prime, $\varphi(p) = p-1$. When $n$ is composite, $\varphi(n) < n-1$. You can find out more information by looking up cyclotomic fields and cyclotomic polynomials.

You wrote "If $n$ is not a prime number, such linear independence can still be shown for the primitive $n$-th roots of unity." That is incorrect. The set of primitive $n$th roots of unity is linearly independent over $\mathbf Q$ if and only if $n$ is squarefree. See here. For example, if $n = 4$ then the primitive 4th roots of unity are $i$ and $-i$, which are not linearly independent over $\mathbf Q$.