PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: No information on entry rating
criterion for constructibility of regular polygon (Theorem)
Theorem   Let $ n$ be an integer with $ n \ge 3$. Then a regular $ n$-gon is constructible if and only if a primitive $ n$th root of unity is a constructible number.
Proof. First of all, note that a primitive $ n$th root of unity is a constructible number if and only if $ \displaystyle \cos\left(\frac{2\pi}{n}\right)+i\sin\left(\frac{2\pi}{n}\right)$ is a constructible number. See the entry on roots of unity for more details. Therefore, without loss of generality, only the constructibility of the number $ \displaystyle \cos\left(\frac{2\pi}{n}\right)+i\sin\left(\frac{2\pi}{n}\right)$ will be considered.

Sufficiency: If a regular $ n$-gon is constructible, then so is the angle whose vertex is the center of the polygon and whose rays pass through adjacent vertices of the polygon. The measure of this angle is $ \displaystyle \frac{2\pi}{n}$.

By the theorem on constructible angles, $ \displaystyle \sin\left(\frac{2\pi}{n}\right)$ and $ \displaystyle \cos\left(\frac{2\pi}{n}\right)$ are constructible numbers. Note that $ i$ is also a constructible number. Thus, $ \displaystyle \cos\left(\frac{2\pi}{n}\right)+i\sin\left(\frac{2\pi}{n}\right)$ is a constructible number.

Necessity: If $ \displaystyle \omega=\cos\left(\frac{2\pi}{n}\right)+i\sin\left(\frac{2\pi}{n}\right)$ is a constructible number, then so is $ \omega^m$ for any integer $ m$.

On the complex plane, for every integer $ m$ with $ 0\le m<n$, construct the point corresponding to $ \omega^m$. Use line segments to connect the points corresponding to $ \omega^m$ and $ \omega^{m+1}$ for every integer $ m$ with $ 0\le m<n$. (Note that $ \omega^0=1=\omega^n$.) This forms a regular $ n$-gon. $ \qedsymbol$



"criterion for constructibility of regular polygon" is owned by Wkbj79.
(view preamble)

View style:

See Also: regular polygon, root of unity, theorem on constructible angles

Log in to rate this entry.
(view current ratings)

Cross-references: line segments, point, complex plane, necessity, constructible numbers, theorem on constructible angles, adjacent vertices, pass through, rays, polygon, angle, sufficiency, number, without loss of generality, roots of unity, constructible number, integer
There are 2 references to this entry.

This is version 3 of criterion for constructibility of regular polygon, born on 2007-06-24, modified 2007-06-24.
Object id is 9660, canonical name is CriterionForConstructibilityOfRegularPolygon.
Accessed 558 times total.

Classification:
AMS MSC12D15 (Field theory and polynomials :: Real and complex fields :: Fields related with sums of squares )
 51M15 (Geometry :: Real and complex geometry :: Geometric constructions)

Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | prove | add result | add corollary | add example | add (any)