Self-dual polygon

In Euclidean geometry, a regular polygon is a polygon that is direct equiangular (all angles are equal in measure) and equilateral (all sides have the same length). Regular polygons may be either convex, star or skew. In the limit, a sequence of regular polygons with an increasing number of sides approximates a circle, if the perimeter or area is fixed, or a regular apeirogon (effectively a straight line), if the edge length is fixed.

General properties

''These properties apply to all regular polygons, whether convex or star.''

A regular ''n''-sided polygon has rotational symmetry of order ''n''.

All vertices of a regular polygon lie on a common circle (the circumscribed circle); i.e., they are concyclic points. That is, a regular polygon is a cyclic polygon.

Together with the property of equal-length sides, this implies that every regular polygon also has an inscribed circle or incircle that is tangent to every side at the midpoint. Thus a regular polygon is a tangential polygon.

A regular ''n''-sided polygon can be constructed with compass and straightedge if and only if the odd prime factors of ''n'' are distinct Fermat primes. See constructible polygon.

A regular ''n''-sided polygon can be constructed with origami if and only if $n = 2^ 3^ p_1 \cdots p_r$ for some $r \in \mathbb$, where each distinct $p_i$is a Pierpont prime.

Symmetry

The symmetry group of an ''n''-sided regular polygon is dihedral group D_''n'' (of order 2''n''): D₂, D₃, D₄, ... It consists of the rotations in C_''n'', together with reflection symmetry in ''n'' axes that pass through the center. If ''n'' is even then half of these axes pass through two opposite vertices, and the other half through the midpoint of opposite sides. If ''n'' is odd then all axes pass through a vertex and the midpoint of the opposite side.

Regular convex polygons

All regular simple polygons (a simple polygon is one that does not intersect itself anywhere) are convex. Those having the same number of sides are also similar.

An ''n''-sided convex regular polygon is denoted by its Schläfli symbol . For ''n'' < 3, we have two degenerate cases:
; Monogon : Degenerate in ordinary space. (Most authorities do not regard the monogon as a true polygon, partly because of this, and also because the formulae below do not work, and its structure is not that of any abstract polygon.)
; Digon ; a "double line segment": Degenerate in ordinary space. (Some authorities do not regard the digon as a true polygon because of this.)

In certain contexts all the polygons considered will be regular. In such circumstances it is customary to drop the prefix regular. For instance, all the faces of uniform polyhedra must be regular and the faces will be described simply as triangle, square, pentagon, etc.

Angles

For a regular convex ''n''-gon, each interior angle has a measure of:
: $\frac$ degrees;
: $\frac$ radians; or
: $\frac$ full turns,

and each exterior angle (i.e., supplementary to the interior angle) has a measure of $\tfrac$ degrees, with the sum of the exterior angles equal to 360 degrees or 2π radians or one full turn.

As ''n'' approaches infinity, the internal angle approaches 180 degrees. For a regular polygon with 10,000 sides (a myriagon) the internal angle is 179.964°. As the number of sides increase, the internal angle can come very close to 180°, and the shape of the polygon approaches that of a circle. However the polygon can never become a circle. The value of the internal angle can never become exactly equal to 180°, as the circumference would effectively become a straight line. For this reason, a circle is not a polygon with an infinite number of sides.

Diagonals

For ''n'' > 2, the number of diagonals is $\tfracn(n - 3)$; i.e., 0, 2, 5, 9, ..., for a triangle, square, pentagon, hexagon, ... . The diagonals divide the polygon into 1, 4, 11, 24, ... pieces .

For a regular ''n''-gon inscribed in a unit-radius circle, the product of the distances from a given vertex to all other vertices (including adjacent vertices and vertices connected by a diagonal) equals ''n''.

Points in the plane

For a regular simple ''n''-gon with circumradius ''R'' and distances ''d_i'' from an arbitrary point in the plane to the vertices, we have

:$\frac\sum_^n d_i^4 + 3R^4 = \left(\frac\sum_^n d_i^2 + R^2\right)^2.$

For higher powers of distances $d_i$ from an arbitrary point in the plane to the vertices of a regular $n$-gon, if

:$S^_=\frac 1n\sum_^n d_i^$,

then

:$S^_ = \left(S^_\right)^m + \sum_^\binom\binomR^\left(S^_ - R^2\right)^k\left(S^_\right)^$,

and

:$S^_ = \left(S^_\right)^m + \sum_^\frac\binom\binom \left(S^_ -\left(S^_\right)^2\right)^k\left(S^_\right)^$,

where $m$ is a positive integer less than $n$.

If $L$ is the distance from an arbitrary point in the plane to the centroid of a regular $n$-gon with circumradius $R$, then

:$\sum_^n d_i^=n\left(\left(R^2+L^2\right)^m+ \sum_^\binom\binomR^L^\left(R^2+L^2\right)^\right)$,
where $m$ = 1, 2, …, $n - 1$.

Interior points

For a regular ''n''-gon, the sum of the perpendicular distances from any interior point to the ''n'' sides is ''n'' times the apothemJohnson, Roger A., ''Advanced Euclidean Geometry'', Dover Publ., 2007 (orig. 1929). (the apothem being the distance from the center to any side). This is a generalization of Viviani's theorem for the ''n'' = 3 case.

Circumradius

The circumradius ''R'' from the center of a regular polygon to one of the vertices is related to the side length ''s'' or to the apothem ''a'' by
:$R = \frac = \frac \quad_,\quad a = \frac$

For constructible polygons, algebraic expressions for these relationships exist; see Bicentric polygon#Regular polygons.

The sum of the perpendiculars from a regular ''n''-gon's vertices to any line tangent to the circumcircle equals ''n'' times the circumradius.

The sum of the squared distances from the vertices of a regular ''n''-gon to any point on its circumcircle equals 2''nR''² where ''R'' is the circumradius.

The sum of the squared distances from the midpoints of the sides of a regular ''n''-gon to any point on the circumcircle is 2''nR''² − ''ns''², where ''s'' is the side length and ''R'' is the circumradius.

If $d_i$ are the distances from the vertices of a regular $n$-gon to any point on its circumcircle, then

:$3\left(\sum_^n d_i^2\right)^2 = 2n \sum_^n d_i^4$.

Dissections

Coxeter states that every zonogon (a 2''m''-gon whose opposite sides are parallel and of equal length) can be dissected into $\tbinom$ or parallelograms.
These tilings are contained as subsets of vertices, edges and faces in orthogonal projections ''m''-cubes.
In particular, this is true for any regular polygon with an even number of sides, in which case the parallelograms are all rhombi.
The list gives the number of solutions for smaller polygons.

Area

The area ''A'' of a convex regular ''n''-sided polygon having side ''s'', circumradius ''R'', apothem ''a'', and perimeter ''p'' is given by
:$A = \tfracnsa = \tfracpa = \tfracns^2\cot\left(\tfrac\right) = na^2\tan\left(\tfrac\right) = \tfracnR^2\sin\left(\tfrac\right)$

For regular polygons with side ''s'' = 1, circumradius ''R'' = 1, or apothem ''a'' = 1, this produces the following table: (Note that since $\cot x \rightarrow 1/x$ as $x \rightarrow 0$, the area when $s = 1$ tends to $n^2/4\pi$ as $n$ grows large.)

Of all ''n''-gons with a given perimeter, the one with the largest area is regular.

Constructible polygon

Some regular polygons are easy to construct with compass and straightedge; other regular polygons are not constructible at all.
The ancient Greek mathematicians knew how to construct a regular polygon with 3, 4, or 5 sides, and they knew how to construct a regular polygon with double the number of sides of a given regular polygon.Bold, Benjamin. ''Famous Problems of Geometry and How to Solve Them'', Dover Publications, 1982 (orig. 1969). This led to the question being posed: is it possible to construct ''all'' regular ''n''-gons with compass and straightedge? If not, which ''n''-gons are constructible and which are not?

Carl Friedrich Gauss proved the constructibility of the regular 17-gon in 1796. Five years later, he developed the theory of Gaussian periods in his ''Disquisitiones Arithmeticae''. This theory allowed him to formulate a sufficient condition for the constructibility of regular polygons:

: A regular ''n''-gon can be constructed with compass and straightedge if ''n'' is the product of a power of 2 and any number of distinct Fermat primes (including none).

(A Fermat prime is a prime number of the form $2^ + 1.$) Gauss stated without proof that this condition was also necessary, but never published his proof. A full proof of necessity was given by Pierre Wantzel in 1837. The result is known as the Gauss–Wantzel theorem.

Equivalently, a regular ''n''-gon is constructible if and only if the cosine of its common angle is a constructible number—that is, can be written in terms of the four basic arithmetic operations and the extraction of square roots.

Regular skew polygons

A ''regular skew polygon'' in 3-space can be seen as nonplanar paths zig-zagging between two parallel planes, defined as the side-edges of a uniform antiprism. All edges and internal angles are equal.

More generally ''regular skew polygons'' can be defined in ''n''-space. Examples include the Petrie polygons, polygonal paths of edges that divide a regular polytope into two halves, and seen as a regular polygon in orthogonal projection.

In the infinite limit ''regular skew polygons'' become skew apeirogons.

Regular star polygons

A non-convex regular polygon is a regular star polygon. The most common example is the pentagram, which has the same vertices as a pentagon, but connects alternating vertices.

For an ''n''-sided star polygon, the Schläfli symbol is modified to indicate the ''density'' or "starriness" ''m'' of the polygon, as . If ''m'' is 2, for example, then every second point is joined. If ''m'' is 3, then every third point is joined. The boundary of the polygon winds around the center ''m'' times.

The (non-degenerate) regular stars of up to 12 sides are:
*Pentagram –
*Heptagram – and
*Octagram –
*Enneagram – and
*Decagram –
*Hendecagram – , , and
*Dodecagram –

''m'' and ''n'' must be coprime, or the figure will degenerate.

The degenerate regular stars of up to 12 sides are:
*Tetragon –
*Hexagons – ,
*Octagons – ,
*Enneagon –
*Decagons – , , and
*Dodecagons – , , , and

Depending on the precise derivation of the Schläfli symbol, opinions differ as to the nature of the degenerate figure. For example, may be treated in either of two ways:
* For much of the 20th century (see for example ), we have commonly taken the /2 to indicate joining each vertex of a convex to its near neighbors two steps away, to obtain the regular compound of two triangles, or hexagram. Coxeter clarifies this regular compound with a notation for the compound , so the hexagram is represented as More compactly Coxeter also writes ''2'', like ''2'' for a hexagram as compound as alternations of regular even-sided polygons, with italics on the leading factor to differentiate it from the coinciding interpretation.Coxeter, The Densities of the Regular Polytopes II, 1932, p.53
* Many modern geometers, such as Grünbaum (2003), regard this as incorrect. They take the /2 to indicate moving two places around the at each step, obtaining a "double-wound" triangle that has two vertices superimposed at each corner point and two edges along each line segment. Not only does this fit in better with modern theories of abstract polytopes, but it also more closely copies the way in which Poinsot (1809) created his star polygons – by taking a single length of wire and bending it at successive points through the same angle until the figure closed.

Duality of regular polygons

All regular polygons are self-dual to congruency, and for odd ''n'' they are self-dual to identity.

In addition, the regular star figures (compounds), being composed of regular polygons, are also self-dual.

Regular polygons as faces of polyhedra

A uniform polyhedron has regular polygons as faces, such that for every two vertices there is an isometry mapping one into the other (just as there is for a regular polygon).

A quasiregular polyhedron is a uniform polyhedron which has just two kinds of face alternating around each vertex.

A regular polyhedron is a uniform polyhedron which has just one kind of face.

The remaining (non-uniform) convex polyhedra with regular faces are known as the Johnson solids.

A polyhedron having regular triangles as faces is called a deltahedron.

See also

*Euclidean tilings by convex regular polygons
*Platonic solid
*Apeirogon – An infinite-sided polygon can also be regular, .
*List of regular polytopes and compounds
*Equilateral polygon
*Carlyle circle

Notes

References

*Lee, Hwa Young; "Origami-Constructible Numbers".
*
*Grünbaum, B.; Are your polyhedra the same as my polyhedra?, ''Discrete and comput. geom: the Goodman-Pollack festschrift'', Ed. Aronov et al., Springer (2003), pp. 461–488.
* Poinsot, L.; Memoire sur les polygones et polyèdres. ''J. de l'École Polytechnique'' 9 (1810), pp. 16–48.

External links

*
Regular Polygon description
With interactive animation

With interactive animation

Three different formulae, with interactive animation
Renaissance artists' constructions of regular polygons
a
Convergence

{{DEFAULTSORT:Regular Polygon
Types of polygons