Roots of Unity raised to the k/2 power equals 1 or -1

Any kk-th root of unity with even kk raised to the k/2k/2 power will result in 1 or -1.

This should not be confused with the similar-looking concepts that ωk/21\omega^{k/2}\equiv-1 or that roots of unity ωi\omega^{i} and ωi+k/2\omega^{i+k/2} are additive inverses of each other.

Let’s use the primitive 8-th roots of unity as an example with generator (primitive 8-th root of unity) ω\omega:

  • (1)k/2=1(1)^{k/2}=1
  • (ω)k/21(\omega)^{k/2}\equiv-1
  • (ω2)k/2ω2k/2ωk1(\omega^2)^{k/2}\equiv\omega^{2k/2}\equiv\omega^k\equiv1
  • (ω3)k/2ω3k/2(ωk/2)3(1)31(\omega^3)^{k/2}\equiv\omega^{3k/2}\equiv(\omega^{k/2})^{3}\equiv(-1)^3\equiv-1
  • (ω4)k/2ω4k/2ω2k1(\omega^4)^{k/2}\equiv\omega^{4k/2}\equiv\omega^{2k}\equiv1
  • (ω5)k/2ω5k/2(ωk/2)5(1)51(\omega^5)^{k/2}\equiv\omega^{5k/2}\equiv(\omega^{k/2})^{5}\equiv(-1)^5\equiv-1
  • (ω6)k/2ω6k/2ω3k1(\omega^6)^{k/2}\equiv\omega^{6k/2}\equiv\omega^{3k}\equiv1
  • (ω7)k/2ω7k/2(ωk/2)7(1)71(\omega^7)^{k/2}\equiv\omega^{7k/2}\equiv(\omega^{k/2})^{7}\equiv(-1)^7\equiv-1

As an exercise for the reader, we recommend taking the 6-th roots of unity, raising each element to the 3rd power (k/2k/2) and seeing that the results are {1,1}\set{1,-1}.

Looking at the evaluations above, we see a pattern that the even powered roots of unity plugged into f(x)=xk/2f(x)=x^{k/2} evaluate to 1 and the odd-powered roots of unity plugged into f(x)=xk/2f(x)=x^{k/2} evaluate to -1. A proof of this is in the appendix. Meanwhile, let’s make the central claim of the chapter:

Any k-th root of unity raised to k/2k/2 where kk is even results in 1 or -1. Specifically, let ω\omega be the primitive kk-th root of unity and let the root of unity in question be ωs\omega^s. If ss is even, (ωs)k/2(\omega^s)^{k/2} will evaluate to 1 and if ss is odd, then (ωs)k/2(\omega^s)^{k/2} will evaluate to -1.

A side-effect of this claim is that terms in a polynomial with the power xk/2x^{k/2} can be evaluated almost for free if evaluated on a root of unity.

Suppose for example that we have a polynomial f(x)=x4f(x)=x^4 that we want to evaluate on 8 points. Now suppose we set the 8 points to be the 8-th roots of unity. Normally, we’d have to loop through {1,ω,...,ω7}\set{1, \omega,...,\omega^7} and evaluate f(x)f(x) on each point. However, we don’t need to actually exponentiate each point of evaluation — we just check if the power of the root of unity is even or odd!

In fact, we can shortcut the process entirely. Let’s treat {1,ω,...,ω7}\set{1, \omega,...,\omega^7} as an array with length 8. We can return 1 or -1 based on whether the array index is even or odd, and completely ignore the exponent. In other words, f(x)=x4f(x)=x^4 will evaluate to

[1,1,1,1,1,1,1,1][1,-1,1,-1,1,-1,1,-1]

If the polynomial has a coefficient other than one, for example f(x)=ax4f(x)=ax^4, the evaluation depends just on whether we are on an even or odd index:

[a,a,a,a,a,a,a,a][a,-a,a,-a,a,-a,a,-a]

But what about polynomials that aren’t of the form f(x)=xk/2f(x)=x^{k/2}? Polynomials can be factored to introduce as many xk/2x^{k/2} terms as possible. For example, consider the polynomial

f(x)=a0+a1x+a2x2+a3x3+a4x4+a5x5+a6x6+a7x7f(x)=a_0+a_1x+a_2x^2+a_3x^3+a_4x^4+a_5x^5+a_6x^6+a_7x^7

Only the term a4x4a_4x^4 is of the form xk/2x^{k/2}. However, suppose we factor the polynomial as follows:

f(x)=(a0+a4x4)+(a1x+a5x5)+(a2x2+a6x6)+(a3x3+a7x7)f(x)=(a_0+a_4x^4)+(a_1x+a_5x^5)+(a_2x^2+a_6x^6)+(a_3x^3+a_7x^7)
f(x)=(a0+a4x4)+x(a1+a5x4)+x2(a2+a6x4)+x3(a3+a7x4)f(x)=(a_0+a_4x^4)+x(a_1+a_5x^4)+x^2(a_2+a_6x^4)+x^3(a_3+a_7x^4)

This polynomial is much easier to evaluate since we know in advance when the x4x^4 terms will evaluate to 1 or -1.

However, we don’t yet have a nice trick to handle the lower powers of xx. This will be the subject of upcoming chapters.

Summary

Raising a kk-th root of unity ωs\omega^s to the k/2k/2 power results in 1 if ss is even and -1 if ss is odd. If we evaluate a polynomial on the kk-th roots of unity, the terms with power k/2k/2 can be automatically computed simply by knowing if the root of unity we are evaluating on is an even power or odd power. Therefore, it is desirable to factor the polynomial so that we maximize the amount of xk/2x^{k/2} terms.

Appendix — Proof that (ωs)k/2(\omega^s)^{k/2} is 1 if ss is even and -1 if ss is odd for even kk

ωs\omega^s and ωs+k/2\omega^{s+k/2} are additive inverses of each other. Since ω0=1\omega^0=1 and ω0+k/2=ωk/2\omega^{0+k/2}=\omega^{k/2}, ωk/2\omega^{k/2} must be the additive inverse of 11 and hence ωk/21\omega^{k/2}\equiv-1.

Now we take ωk/2\omega^{k/2} (which is -1) and raise it to ss

(ωk/2)s\left(\omega^{k/2}\right)^s

Note that (1)s(-1)^s can only be 1 or -1. Specifically, if ss is even, then (1)s=1(-1)^s=1 and if ss is odd, then (1)s=1(-1)^s=-1. Hence, if ss is even, the outcome of our expression is 1, and if ss is odd, then the outcome is -1.

Our expression can be rewritten as:

(ωk/2)s=(ω(k/2)s)=(ωs(k/2))=(ωs)k/2\left(\omega^{k/2}\right)^s=\left(\omega^{(k/2)s}\right)=\left(\omega^{s(k/2)}\right)=\left(\omega^s\right)^{k/2}

Since the algebraic identity of the expression has not changed, we can still say if ss is even, then (ωs)k/2=1(\omega^s)^{k/2}=1 and if ss is odd, (ωs)k/2=1(\omega^s)^{k/2}=-1.

Therefore, we have proved the original statement that (ωs)k/2=1(\omega^s)^{k/2}=1 when ss is even and (ωs)k/2=1(\omega^s)^{k/2}=-1 when ss is odd.

Ready to Get Started?Join Thousands of Users Today

Start your free trial now and experience the difference. No credit card required.

© 2025 Better-Start. All rights reserved.