Minimal polynomial of 2cos(2pi/n)

From testwiki
Jump to navigation Jump to search

Template:Short description In number theory, the real parts of the roots of unity are related to one-another by means of the minimal polynomial of 2cos⁡(2π/n). The roots of the minimal polynomial are twice the real part of the roots of unity, where the real part of a root of unity is just cos⁡(2kπ/n) with k coprime with n.

Formal definition

For an integer n≥1, the minimal polynomial Ψn(x) of 2cos⁡(2π/n) is the non-zero integer-coefficient monic polynomial of smallest degree for which Ψn(2cos⁡(2π/n))=0.

For every Template:Mvar, the polynomial Ψn(x) is monic, has integer coefficients, and is irreducible over the integers and the rational numbers. All its roots are real; they are the real numbers 2cos⁡(2kπ/n) with k coprime with n and either 1≤k≤n/2 or k=n=1. These roots are twice the real parts of the [[primitive root of unity|primitive Template:Mvarth roots of unity]]. The number of integers k relatively prime to n is given by Euler's totient function φ(n); it follows that the degree of Ψn(x) is 1 for n=1,2 and φ(n)/2 for n≥3.

The first two polynomials are Ψ1(x)=x−2 and Ψ2(x)=x+2.

The polynomials Ψn(x) are typical examples of irreducible polynomials whose roots are all real and which have a cyclic Galois group.

Examples

The first few polynomials Ψn(x) are

Ψ1(x)=x−2Ψ2(x)=x+2Ψ3(x)=x+1Ψ4(x)=xΨ5(x)=x2+x−1Ψ6(x)=x−1Ψ7(x)=x3+x2−2x−1Ψ8(x)=x2−2Ψ9(x)=x3−3x+1Ψ10(x)=x2−x−1Ψ11(x)=x5+x4−4x3−3x2+3x+1Ψ12(x)=x2−3Ψ13(x)=x6+x5−5x4−4x3+6x2+3x−1Ψ14(x)=x3−x2−2x+1Ψ15(x)=x4−x3−4x2+4x+1Ψ16(x)=x4−4x2+2Ψ17(x)=x8+x7−7x6−6x5+15x4+10x3−10x2−4x+1Ψ18(x)=x3−3x−1Ψ19(x)=x9+x8−8x7−7x6+21x5+15x4−20x3−10x2+5x+1Ψ20(x)=x4−5x2+5

Explicit form if n is odd

If n is an odd prime, the polynomial Ψn(x) can be written in terms of binomial coefficients following a "zigzag path" through Pascal's triangle:

Putting n=2m+1 and

χn(x):=(m0)xm+(m−10)xm−1−(m−11)xm−2−(m−21)xm−3+(m−22)xm−4+(m−32)xm−5−−++⋯=∑k=0m(−1)⌊k/2⌋(m−⌊(k+1)/2⌋⌊k/2⌋)xm−k=(mm)xm+(m−1m−1)xm−1−(m−1m−2)xm−2−(m−2m−3)xm−3+(m−2m−4)xm−4+(m−3m−5)xm−5−−++⋯=∑k=0m(−1)⌊(m−k)/2⌋(⌊(m+k)/2⌋k)xk,

then we have Ψp(x)=χp(x) for primes p.

If n is odd but not a prime, the same polynomial χn(x), as can be expected, is reducible and, corresponding to the structure of the cyclotomic polynomials Φd(x) reflected by the formula ∏d∣nΦd(x)=xn−1, turns out to be just the product of all Ψd(x) for the divisors d>1 of n, including n itself:

∏d∣nd>1Ψd(x)=χn(x).

This means that the Ψd(x) are exactly the irreducible factors of χn(x), which allows to easily obtain Ψd(x) for any odd d, knowing its degree 12φ(d). For example,

χ15(x)=x7+x6−6x5−5x4+10x3+6x2−4x−1=(x+1)(x2+x−1)(x4−x3−4x2+4x+1)=Ψ3(x)⋅Ψ5(x)⋅Ψ15(x).

Explicit form if n is even

From the below formula in terms of Chebyshev polynomials and the product formula for odd n above, we can derive for even n

∏d∣nd>1Ψd(x)=(χn+1(x)+χn−1(x)).

Independently of this, if n=2k is an even prime power, we have for k≥2 the recursion (see Template:OEIS2C)

Ψ2k+1(x)=(Ψ2k(x))2−2,

starting with Ψ4(x)=x.

Roots

The roots of Ψn(x) are given by 2cos⁡(2πkn),[1] where 1≤k<n2 and gcd⁡(k,n)=1. Since Ψn(x) is monic, we have

Ψn(x)=∏1≤k<n2gcd⁡(k,n)=1(x−2cos⁡(2πkn)).

Combining this result with the fact that the function cos⁡(x) is even, we find that 2cos⁡(2πkn) is an algebraic integer for any positive integer n and any integer k.

Relation to the cyclotomic polynomials

For a positive integer n, let ζn=exp⁡(2πin)=cos⁡(2πn)+sin⁡(2πn)i, a primitive n-th root of unity. Then the minimal polynomial of ζn is given by the n-th cyclotomic polynomial Φn(x). Since ζn−1=cos⁡(2πn)−sin⁡(2πn)i, the relation between 2cos⁡(2πn) and ζn is given by 2cos⁡(2πn)=ζn+ζn−1. This relation can be exhibited in the following identity proved by Lehmer, which holds for any non-zero complex number z:[2]

Ψn(z+z−1)=z−φ(n)2Φn(z)

Relation to Chebyshev polynomials

In 1993, Watkins and Zeitlin established the following relation between Ψn(x) and Chebyshev polynomials of the first kind.[1]

If n=2s+1 is odd, thenTemplate:Check source

∏d∣nΨd(2x)=2(Ts+1(x)−Ts(x)),

and if n=2s is even, then

∏d∣nΨd(2x)=2(Ts+1(x)−Ts−1(x)).

If n is a power of 2, we have moreover directly[3]

Ψ2k+1(2x)=2T2k−1(x).

Absolute value of the constant coefficient

The absolute value of the constant coefficient of Ψn(x) can be determined as follows:[4]

|Ψn(0)|={0if n=4,2if n=2k,k≥0,k≠2,pif n=4pk,k≥1,p>2 prime,1otherwise.

Generated algebraic number field

The algebraic number field Kn=ℚ(ζn+ζn−1) is the maximal real subfield of a cyclotomic field ℚ(ζn). If 𝒪Kn denotes the ring of integers of Kn, then 𝒪Kn=ℤ[ζn+ζn−1]. In other words, the set {1,ζn+ζn−1,…,(ζn+ζn−1)φ(n)2−1} is an integral basis of 𝒪Kn. In view of this, the discriminant of the algebraic number field Kn is equal to the discriminant of the polynomial Ψn(x), that is[5]

DKn={2(m−1)2m−2−1if n=2m,m>2,p(mpm−(m+1)pm−1−1)/2if n=pm or 2pm,p>2 prime,(∏i=1ω(n)piei−1/(pi−1))φ(n)2if ω(n)>1,k≠2pm.

References

Template:Reflist