Problem 5
Question
By de Moivre's theorem, $$ \omega=\cos \frac{2 \pi}{7}+i \sin \frac{2 \pi}{7} $$ is a complex seventh root of unity. Since $$ x^{7}-1=(x-1)\left(x^{6}+x^{5}+x^{4}+x^{3}+x^{2}+x+1\right) $$ \(\omega\) is a root of \(x^{6}+x^{5}+x^{4}+x^{3}+x^{2}+x+1\). Prove that \(2 \pi / 7\) is not a constructible angle.
Step-by-Step Solution
Verified Answer
The angle \( 2\pi/7 \) is not constructible because its cosine is a root of a polynomial of degree 6, not a power of 2.
1Step 1: Understanding Constructible Angles
An angle is constructible if it can be made with a compass and straightedge, which implies that its cosine is a root of a polynomial with degree a power of two, having coefficients in the field of rational numbers, \( \mathbb{Q} \). The roots of unity corresponding to these angles are solutions of cyclotomic polynomials.
2Step 2: Identify Degree of Polynomial
We know that \( \omega \) is a root of the polynomial \( x^6 + x^5 + x^4 + x^3 + x^2 + x + 1 = 0 \). This polynomial is derived from the factorization of \( x^7 - 1 \), where the degree is 6. If \( \omega \) was constructible, the minimal polynomial of \( \omega \) over \( \mathbb{Q} \) would need to have a degree which is a power of 2.
3Step 3: Confirm Polynomial Degree Contradiction
The polynomial \( x^6 + x^5 + x^4 + x^3 + x^2 + x + 1 \) is the minimal polynomial for \( \omega \) over \( \mathbb{Q} \) with degree 6. The number 6 is not a power of 2 (such as 1, 2, 4, 8), therefore, \( \omega \) is not a root of a polynomial of degree a power of 2 over \( \mathbb{Q} \).
4Step 4: Conclusion on Constructibility
Since the degree of the minimal polynomial for \( \omega \) is not a power of 2, the angle corresponding to \( 2\pi/7 \) cannot be constructed using the methods of compass and straightedge. Thus, \( \frac{2\pi}{7} \) is not a constructible angle.
Key Concepts
De Moivre's TheoremRoots of UnityCyclotomic PolynomialsCompass and Straightedge Construction
De Moivre's Theorem
De Moivre's theorem is a powerful tool in mathematics, especially when dealing with complex numbers and trigonometry. This theorem states that for any real number \( x \) and integer \( n \), the power of a complex number can be expressed in polar form:\[(\cos x + i \sin x)^n = \cos(nx) + i \sin(nx)\]This formula is particularly useful when computing powers of complex numbers written in trigonometric form, simplifying roots of unity, and establishing relationships between polynomials and trigonometric identities. It allows us to derive expressions for multiple angles, such as \( 2\pi/7 \) in polar coordinates.In the case of the exercise, applying de Moivre's theorem to \( \omega = \cos \frac{2 \pi}{7} + i \sin \frac{2 \pi}{7} \) helped establish \( \omega \) as a seventh root of unity. Using this theorem simplifies many problems involving cyclic and symmetric properties of roots.
Roots of Unity
Roots of unity are fundamental in understanding complex numbers and their representations in algebra. They are derived from solutions to the equation \( x^n = 1 \). These roots are complex numbers that, when raised to a certain power \( n \), result in 1. They are uniformly distributed on the unit circle in the complex plane:- There are \( n \) distinct \( n^{th} \) roots of unity.- Each root can be expressed in the form \( e^{\frac{2\pi i k}{n}} \) for \( k = 0, 1, 2, \, ..., n-1 \).In our problem, we encounter the seventh roots of unity, specifically \( \omega = \cos \frac{2\pi}{7} + i \sin \frac{2\pi}{7} \), one of the non-real and primitive roots. By analyzing these, we can construct polynomials such as the cyclotomic polynomials, which further help in determining constructible angles.
Cyclotomic Polynomials
Cyclotomic polynomials are special types of polynomials, and they play a key role in number theory and algebra. These polynomials are defined as the minimal polynomials over the rational numbers for primitive roots of unity. Specifically, the \( n^{th} \) cyclotomic polynomial \( \Phi_n(x) \) is given by the product:\[\Phi_n(x) = \prod (x - \zeta^k)\]where \( \zeta \) represents the primitive \( n^{th} \) roots of unity and the product runs over all such roots. The interesting feature of these polynomials is their degree, which equals \( \varphi(n) \), Euler's totient function, representing the count of integers up to \( n \) that are coprime with \( n \).In the problem scenario, \( x^6 + x^5 + x^4 + x^3 + x^2 + x + 1 \) is the cyclotomic polynomial derived from factoring \( x^7 - 1 \), minus \( x-1 \), confirming \( 2\pi/7 \) is linked to an impossible constructible scenario due to its polynomial's degree not being a power of 2.
Compass and Straightedge Construction
Compass and straightedge constructions are classical methods of creating geometric figures, commonly associated with ancient Greek mathematics. A critical aspect of these constructions is the ability to create lengths and angles that are solutions to certain linear and quadratic equations. In simple terms, an angle is deemed constructible if, its cosine value is a solution to a polynomial equation that has:- No roots larger than a power of 2.- Rational coefficients.The key principle is that any constructible number or ratio can be represented with a combination of square roots involving rational numbers. In the context of this problem, the minimal polynomial for \( \omega \) has a degree of 6, which is not a power of 2, hence \( \frac{2\pi}{7} \) is indeed non-constructible. This concept shows why certain angles can't be trisected or certain polygons (like heptagons) can't be perfectly constructed using just a compass and straightedge.
Other exercises in this chapter
Problem 3
A polygon is called constructible iff its vertices are constructible points. Prove the following: The regular polygon of nine sides is not constructible.
View solution Problem 4
An angle \(\alpha\) is called constructible iff there exist constructible points \(A, B\), and \(C\) such that \(\angle A B C=\alpha\). Prove the following : \(
View solution Problem 5
Prove that \(2 \pi / 5\) is a constructible angle.
View solution Problem 5
An angle \(\alpha\) is called constructible iff there exist constructible points \(A, B\), and \(C\) such that \(\angle A B C=\alpha\). Prove the following : If
View solution